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

Routing method for greedy geographical routing protocol tangent switching hole processing

A geographical routing and hollowing technology, applied in the field of communication, can solve the problem of reducing the number of routing hops, achieve the effect of reducing control overhead and improving the success rate of transmission

Active Publication Date: 2016-09-07
JIANGXI UNIV OF SCI & TECH
View PDF3 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In addition, after the detection packet is forwarded by this algorithm, the landmark linked list obtains the complete landmark from the source node to the destination node, and the data packet is sequentially forwarded to the destination node according to the landmark path using a greedy algorithm. The data packet can be transmitted in the fully connected graph, greatly However, in the case of sparse nodes, greedy forwarding between signposts may not always be possible. At this time, the edge recovery mode is still required.

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 method for greedy geographical routing protocol tangent switching hole processing
  • Routing method for greedy geographical routing protocol tangent switching hole processing
  • Routing method for greedy geographical routing protocol tangent switching hole processing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0061] The routing method of the greedy geographical routing protocol for tangent switching hole processing is shown in Figure 5. A network topology map with 500 nodes is randomly generated, and the communication radius is 50. The GG algorithm is used to planarize the network topology map so that there is no gap between nodes. crossed sides. Let the source node ID be 209, and the destination node ID be 472 (coordinates x4=709, y4=617), in this scenario, the specific implementation steps of node 209 running routing protocol with reference to Figure 4, described as follows:

[0062] 1) Construct a Hello packet and broadcast it, and the target node will periodically broadcast its location information to the entire network. All nodes in the wireless sensor network use their own node identification numbers and location information to construct Hello packets, and periodically broadcast Hello packets to their one-hop neighbors. The nodes that receive the Hello packets store the packe...

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 method for greedy geographical routing protocol tangent switching hole processing, and mainly solves the problems that a greedy geographical routing protocol adopts an edge recovery algorithm when meeting a routing hole and routing has blindness. The realization scheme is that if the greedy geographical routing protocol meets the routing hole when searching a target node, the left hand and right hand rules are simultaneously used when entering an edge recovery mode, three conditions of tangent judgment are added from the second hole node, a greedy forwarding mode is recovered if the conditions are met, and routing hops under the left and right hand rules are compared and the optimal path for data forwarding is selected. The routing hops are reduced in comparison with the greedy geographical routing protocol, and control overhead is reduced in comparison with a self-adaptive hole processing algorithm based on road sign distributed iterative extraction and elimination so that the routing method can be used for a mobile wireless sensor network.

Description

technical field [0001] The invention belongs to the technical field of communication, and mainly relates to a routing method of a mobile ad hoc network and a mobile wireless sensor network, which can be used for routing decisions of a mobile vehicle network and a sensor network for wild animal tracking. Background technique [0002] Wireless sensor networks are widely used in military, environmental monitoring and forecasting, health care, smart home and other fields. It is a data-centric network. The computing power, storage capacity, communication capacity and energy carried by sensor nodes are very limited. Designing an efficient routing protocol to send data to the destination is an important research direction for wireless sensor networks. [0003] With the miniaturization of positioning devices and the maturity of other positioning algorithms, wireless sensor network nodes can easily obtain the geographic location information of themselves, neighbor nodes and destinati...

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
IPC IPC(8): H04W40/20
CPCH04W40/20
Inventor 温卫巫光福王俊岭王振东
Owner JIANGXI UNIV OF SCI & 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