Wireless ad hoc network route searching method and system thereof

Abstract

The invention relates to a wireless ad hoc network route searching method and a system thereof. The method comprises the steps that a source node broadcasts RREQ to a neighboring node; if the neighboring node is a target node, the minimum remaining energy and the average remaining energy are updated, and RREP is sent to the source node; otherwise, if the forwarding time is less than a first threshold, the neighboring node is used as a route path node, and the minimum remaining energy and the average remaining energy are updated; the route hop count is added with 1, and the RREQ is forwarded tothe neighboring node; after the source node receives the RREP, a routing table is updated; if the difference of the average remaining energy in each route path is less than a second threshold, a route path with the smallest number of route hops is selected as the optimal route path; otherwise, a route path with the maximum average remaining energy is selected as the optimal route path. By comprehensively considering the distance from the source node to the destination node, the remaining energy of each node and the average remaining energy, the energy consumption of each node is balanced. Network partition is avoided, which improves the average lifetime of nodes.

Description

technical field [0001] The invention relates to the field of power consumption optimization of wireless ad hoc networks, in particular to a route search method and system for wireless ad hoc networks. Background technique [0002] Wireless ad hoc network (referred to as "AD hoc" network) is a multi-hop, centerless, self-organizing wireless network, also known as multi-hop network (Multi-hop Network), infrastructureless network (Infrastructureless Network) or Self-organizing Network (Self-organizing Network). There is no fixed infrastructure in the AD hoc network, each node is mobile, and can dynamically maintain contact with other nodes in any way; in this network, due to the limited range of terminal wireless coverage, Two user terminals that cannot communicate directly can use other nodes to forward packets. That is to say, each node in the AD hoc network is also a router, and they can complete the functions of discovery and maintaining routes to other nodes. [0003] Th...

AI Technical Summary

Problems solved by technology

[0004] However, the existing AODV uses the method of minimum hops when selecting the routing path from the source node to the destination node. This method can save the overall energy of the network when the transmission power of each node in the entire network is constant, but it is also It will attract more traffic, causing the energy consumption of nodes on a certain path to be too fast. Once the battery of a key node is exhausted, the network that relies on this key node as an intermediate node will not be able to communicate, which may cause network partition. Even lead to the entire wireless ad hoc network can not work normally

Images