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

Routing decision method based on node moving trajectory in delay-tolerant network

A technology of moving trajectory and decision-making method, applied in the field of computer network, can solve the problems of designing routing decision-making method, lack of theoretical analysis of moving trajectory, etc.

Active Publication Date: 2015-03-25
HEFEI UNIV OF TECH
View PDF3 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the current research work mainly focuses on the characteristics of node movement patterns, and lacks the use of theoretical analysis of movement trajectories to design routing decision-making methods.

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
  • Routing decision method based on node moving trajectory in delay-tolerant network
  • Routing decision method based on node moving trajectory in delay-tolerant network
  • Routing decision method based on node moving trajectory in delay-tolerant network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0067] A routing decision method based on node movement trajectory in a delay-tolerant network, comprising the following steps:

[0068] (1) Establish a network model, divide the network into several communities, and obtain the community distribution of nodes according to the proportion of the cumulative residence time of nodes in each community;

[0069] (a), assuming that the network is divided into M-1 communities C with non-overlapping geographical locations 1 ,C 2 ,...,C M-1 , define a virtual community C 0 Indicates that the node leaves the network state and obtains a community set C={C 0 ,C 1 ,...,C M-1};

[0070] (b) Assuming that there are a total of N nodes in the network, they can move freely within the community set C, and it does not take time to switch between adjacent communities;

[0071] (c), if and only if node u is in community C i The proportion of the residence time to its cumulative time in all communities is not less than β 1 , node u (1≤u≤N) be...

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 a routing decision method based on the node moving trajectory in a delay-tolerant network. Firstly, steady-state distribution of nodes in cells is obtained through a semi-Markov model, and the concept of node moving trajectory heat degree is put forward. Secondly, future position distribution of the nodes is predicted through the semi-Markov model, and the concept of moving trajectory similarity degree between the nodes is put forward. Thirdly, the routing decision method based on the node moving trajectory is put forward, and nodes with a high moving trajectory heat degree or nodes with a low moving trajectory similarity degree with data packet carriers are selected as relay nodes to participate in data propagation. Finally, performance evaluation is carried out on the routing method on the basis of real node moving trajectory data; as is shown in an experiment result, compared with a spray and wait routing method and a social-group-based routing method which are popular recently, the routing method is better in overall performance, and meanwhile compared with a classical epidemic routing method, the routing method can obviously lower network overhead and almost achieve the same maximum data packet transmission rate and minimum transmission delay as the classical epidemic routing method.

Description

technical field [0001] The invention belongs to the technical field of computer networks, and in particular relates to a routing decision method based on node moving tracks in a delay-tolerant network. Background technique [0002] Delay Tolerant Networks (DTNs) transmit data through communication opportunities formed by close contact of mobile wireless terminal nodes. With the development of smart phones and wireless network technologies (WIFI, 3G, Bluetooth, etc.) in recent years, delay-tolerant networks have become a hot spot in the field of wireless networks. Because it does not require infrastructure support, it can be conveniently used in fields such as interstellar networks, wireless vehicle networks, and ecological environment monitoring networks, and provides strong theoretical and technical support for this purpose, promoting the intelligentization, ubiquity, and The development of integration is considered to be a key technology to realize "everywhere network", w...

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): H04L12/705H04L45/18
Inventor 王青山王琦夏茂晋汪丽芳郭豪
Owner HEFEI UNIV OF TECH
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