A wireless ad hoc network routing search method and system

Abstract

The present invention relates to a wireless ad-hoc network routing search method and system thereof, comprising broadcasting RREQ from a source node to an adjacent node; when the adjacent node is a target node, updating the minimum remaining energy and average remaining energy, and sending RREP to the source node; Otherwise, when the forwarding time is less than the first threshold, the neighbor node is used as the routing path node, the minimum remaining energy and the average remaining energy are updated, and the routing hop count is increased by 1, and the RREQ is forwarded to its neighboring nodes. After the source node receives the RREP, it updates the routing table. When the difference of the average residual energy in each routing path is less than the second threshold, the routing path with the smallest routing hops is selected as the optimal routing path; otherwise, the maximum average energy The routing path where the remaining energy is located is regarded as the optimal routing path. By comprehensively considering the distance from the source node to the destination node, the remaining energy of the nodes and the average remaining energy, the energy consumption of each node is balanced, the network partition is avoided, and the average survival time of the nodes is improved.

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