Ad hoc network route discovery method based on Brownian motion

Abstract

The invention discloses an Ad hoc network route discovery method based on Brownian motion, and the Ad hoc network route discovery method based on Brownian motion aims to reduce the routing overhead of a network with the help of the thought of combining history record orientation and probability forwarding. According to the method, a mobile network model based on Brownian motion is built, and the distribution rule of intermediate nodes which have met a targeted node is found and summarized; a calculation formula of probability of intermediate node forwarding is designed according to the distribution rule and the network environment; whether the intermediate nodes participate in forwarding or not is determined according to the forwarding probability, and routing between a source node and the targeted node is built. Based on the directional broadcasting, the routing algorithm reduces the density of the intermediate nodes which participate in forwarding, and is simple and low in consumption.

Description

technical field [0001] The invention relates to a route discovery method in the field of wireless communication networks, 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 Ad hoc 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. ...

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 (Dubois-Ferriere H, Grossglauser M, Vetterli M.Age matters: efficient route discovery in mobile ad hoc networks using encounter ages[C] / / Proceedings of the4th 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

Images