Wireless ad hoc network reactive route method based on probability

Abstract

The invention relates to a wireless ad hoc network reactive route method based on probability, belonging to the field of wireless networking protocols. A wireless ad hoc network has the following conditions: each node is configured with a wireless antenna with isotropy and has mobility; the two nodes are communicated directly when in mutual wireless communication range; and the node does not know the position information per se. The route method comprises a finding method and a route maintaining method. The route method is characterized in that a route re-finding method comprises the steps of: participating in path recovery by only an intermediate node being apart a certain distance (within K hop) from an old path, wherein the node on the old path participates in by the probability of 1; and participating in forwarding a route request message by other nodes in the range by the probability of p*. For communication conversation with longer durability time, the method can effectively lower the communication cost.

Description

technical field

[0001] The invention belongs to the field of wireless network routing protocols. In particular, it relates to a method for establishing a path between a source and Shinjuku in a wireless multi-hop network. Background technique

[0002] Wireless ad hoc networks are widely used in many fields. In a wireless ad hoc network, a wireless node is both a terminal and a routing node—responsible for forwarding data for other communication pairs. Typically wireless nodes are battery powered and have limited communication range. The wireless ad hoc network has strong dynamics, time-varying wireless environment, and transmission loss characteristics, so it is of great significance to design a method for establishing a wireless ad hoc network path.

[0003] There are two types of wireless ad hoc network routing protocols: proactive and reactive. Proactive routing protocols need to maintain communication paths between all nodes in the network at all times, regardless...