Greedy algorithm and optimization method for query message propagation in GEAR protocol

Abstract

The invention discloses a greedy algorithm and an optimization method for query message propagation in GEAR protocol. Specifically, a sum domain is added in a node neighbor list to record the number of neighbor nodes with smaller estimated cost than the node; if the values of the sum domains of neighbor nodes of some node which are smaller than the estimated cost of the node are zero, the node is incorporated in a blacklist domain added to query messages; of the neighbor nodes of which the values of sum domains are not zero and which are not incorporated in a blacklist, the node with the smallest cost is selected as next hop node; nodes in the event area seeks for the neighbor node with the smallest estimated cost as the only parent node, and the parent node records the neighbor node as a child node; when query messages propagate in the event area, all the child nodes of the current node are selected as next hop node for a path. The invention is helpful for avoiding cavity nodes in one-hop node, and in addition the arrangement of the child node and the only parent node reduces energy consumption for transferring query messages in the event area.

Description

technical field [0001] The invention relates to a wireless sensor network routing protocol, in particular to a routing hole problem and a query message propagation problem caused by a greedy algorithm in a geographic location routing protocol GEAR, and belongs to the technical field of wireless sensor network communication. Background technique [0002] The routing protocol is responsible for forwarding data packets from the source node to the destination node through the network. The routing protocol based on geographical location information uses the location information of the node as the basis for routing selection. energy consumption. [0003] The goal of the routing protocol based on geographic location information is to wake up the sensor nodes closest to the tracking target in applications such as target tracking to obtain more accurate location information about the target. [0004] The process of sending query messages to all nodes in the event area by the GEAR ge...

AI Technical Summary

Problems solved by technology

After nearly ten years of development, a large number of research results have emerged. Aiming at the problem of routing holes, the improved method of changing the cost of its own nodes and feeding back to neighboring nodes is proposed to avoid routing holes. However, this method cannot be solved in the first When the query message is transmitted at one time, the transmission path can effectively avoid the hole node, which also causes a waste of energy consumption. Some theoretically analyze the existence probability of the routing hole in the case of regular deployment and random deployment, but its improvement method is in Only valid when the number of neighbor nodes is greater than 10

(1. Zhang Yao, Jia Zhenhong. An Improved GEAR Algorithm for Solving Routing Hole Problems [J]. Computer Engineering, 2008, 34(12): 94-96. 2. Jiang Yang, Sun Liulin, Yuan Min, etc. A Solution to GEAR A New Solution to the Routing Hole Problem[J]. Sensors and Microsystems, 2011, 30 (4): 44-47. 3. Tian Le, Xie Dongliang, Ren Biao, Zhang Lei, etc. Routing in the Greedy Forwarding Method for Wireless Sensor Networks Hollow problem [J]. Journal of Electronics and Information Technology, 2007, 29(12): 2996-3000.) For the query message propagation problem, in addition to the flooding propagation method, the current proposed method also selects clusters by dividing the network into regions The head node transmits the query message through the cluster head node. This method requires the network to elect the cluster head node, which increases the network overhead.

Images