A Brownian Motion-Based Route Discovery Method for Ad Hoc Networks

Abstract

The invention discloses an Ad hoc network routing discovery method based on Brownian motion, aiming at reducing the routing overhead of the network with the idea of ​​combining historical record orientation and probability forwarding. By establishing a Brownian motion-based mobile network model, the algorithm discovers and summarizes the distribution law of the intermediate nodes that have met the target node; designs the calculation formula of the forwarding probability of the intermediate node according to the distribution law and the network environment; determines whether the intermediate node is based on the forwarding probability. Participate in forwarding, thereby establishing a route from the source node to the target node. The routing algorithm of the present invention reduces the density of intermediate nodes participating in forwarding on the basis of directed broadcasting, and is simple and low in consumption.

Description

technical field [0001] The invention relates to a route discovery method in the field of wireless network communication, in particular to a Brownian motion-based Ad hoc network route discovery method. Background technique [0002] The mobile Ad hoc network is composed of mobile nodes equipped with wireless transceivers. The network does not require any infrastructure. Each node is both a host and a router, and can be quickly networked and communicated at any time and any place. Therefore, mobile Adhoc networks are widely used in many fields, such as military battlefields, commercial applications, and personal communications. [0003] Because the topology of the Ad hoc network has the characteristic of dynamic change, the design of the routing protocol becomes one of the key technologies urgently needed to be studied in the mobile Ad hoc network. The routing protocol of Ad hoc network is divided into two parts: table-driven routing protocol and on-demand routing protocol. C...

AI Technical Summary

Problems solved by technology

The probabilistic forwarding algorithm greatly reduces the routing overhead of the network, but the route discovery process is not directional

In 2003, scholars such as Henri (Dubios-Ferriere H, Grossglauser M, Vetterli M.Age matters: efficient route discovery in mobile ad hoc networks using encounter ages[C] / / Proceedings of the 4th ACM international symposium on Mobile ad hoc networking&computing.ACM ,2003:257-266.) proposed the FRESH protocol, taking the meeting time as a clue, and realizing the simulated positioning of the target node by finding an intermediate node closer to the meeting time of the target node, which solved the problem of using external auxiliary equipment, the experimental results It is shown that this protocol is simple and effective and reduces the routing overhead, but there are still unnecessary forwarding in the local area

[0006] The existing Ad hoc network-related historical records and probabilistic forwarding routing algorithms have reduced the routing overhead to varying degrees, but few algorithms pay attention to the distribution of intermediate nodes that have encountered the target node. Therefore, in order to further reduce the network routing overhead, fully Mining the distribution information of the intermediate nodes that have met the target node becomes the starting point of the present invention

Images