Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Opportunistic network routing method based on spectral clustering community division

A technology of community partitioning and spectral clustering algorithm, applied in the field of opportunistic network routing based on spectral clustering community partitioning, can solve the problem of not taking into account the impact of node changes and community, and achieve the effect of improving the success rate of message transmission and reducing network load.

Inactive Publication Date: 2017-08-18
XIANGTAN UNIV
View PDF4 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Literature "A Message Transmission Algorithm Based on Community Opportunity Network" (Niu Jianwei, Zhou Xing, Liu Yan, et al. A Message Transmission Algorithm Based on Community Opportunity Network [J]. Computer Research and Development, 2009, 46(12): 2068-2075.) The message transmission process is divided into two stages: the intra-community and the inter-community. The "multi-copy + control" method is adopted in the community, and the nodes with a large degree of sociality are used to transmit messages between the communities. However, this method adopts a static community The division method does not take into account the impact of node changes on the community

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Opportunistic network routing method based on spectral clustering community division
  • Opportunistic network routing method based on spectral clustering community division
  • Opportunistic network routing method based on spectral clustering community division

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] The experimental site implemented this time is map simulation, the scene range is 4500x3400 (m^2), all nodes carry Bluetooth devices for data transmission, the simulation time is 12h, the number of nodes is 160, the communication range of nodes is 10m, and the node's own cache is 15M. The node speed is 6.5m / s, and the number of clusters is set to be 4. The flow chart of the technical solution of the present invention is as follows figure 1 shown.

[0049] 1) Set the number of community divisions k, community vector C, n mobile nodes {1,2,...,n}, set timer RT and contact sequence N(T) for each node, when the simulation starts, n nodes move randomly on the map;

[0050] The representation of the contact sequence N(t) is as follows:

[0051] N ij (T)={(on l ,off l ),l=1,2,...,N}

[0052] N ij (T) represents the contact record sequence of nodes i and j in the time period [0, T], where the two-tuple (on l ,off l ) represent the start and end time of the first contac...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an opportunistic network routing method based on spectral clustering community division. The method comprises the following steps of setting the number of network node communities, division classes and the number of nodes and starting carrying out random movement by all nodes; after simulation is carried out for certain period of time, carrying out community division on the nodes in the network through utilization of a spectral clustering algorithm according to contact times and contact duration among the nodes; calculating community reachable probability centrality of a target node, intra-community node reachable probability centrality and a message copy control utility value according to community division results; carrying out movement and encounter by the nodes, and determining whether messages are forwarded or deleted according to the reachable probability centrality and the copy control utility; and periodically updating the community reachable probability centrality, the intra-community node reachable probability centrality and the message copy control utility value. According to the method, through adoption of the spectral clustering algorithm, the community division effect is good, the message transmission is clearly improved, and the network cost is reduced.

Description

technical field [0001] The invention relates to a chance network routing method based on spectral clustering community division. Background technique [0002] In an opportunistic network, the movement of nodes has a great impact on the communication between nodes, intermittent interruptions often occur, the network topology is unstable, and the dynamic changes are large, so the research on opportunistic networks is often based on the movement of nodes The opportunity to meet in the network is used to complete the data transmission, and a "storage-carry-forward" routing transmission strategy is adopted. This kind of network has a certain social nature. Nodes often gather together or appear in some places with high frequency according to social relationships, forming various community structures. The communities formed here can generally determine the real or logical community boundaries. The activities of nodes inside the community are relatively frequent, the chances of mee...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04W40/02H04W40/20H04L12/721H04L12/24H04W24/06
CPCH04L41/142H04L41/145H04L45/14H04W24/06H04W40/026H04W40/20
Inventor 杨万春王宁彭艳芬
Owner XIANGTAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com