Cooperative routing method for large-scale wireless distribution network

Abstract

The invention discloses a cooperative routing method for a large-scale wireless distribution network, which relates to a routing protocol of an ad hoc network. The process comprises the following steps that: in a cluster-based wireless ad hoc network, an active routing table is maintained within a cluster, a plurality of remote friend nodes are maintained outside the cluster, and the clusters in which the friend nodes are and the cluster are friend clusters; during service transmission, a route is searched in a intra-cluster routing table and a route cache table, a packet is sent to a the friend node for query if the route is not found, and the query process adopts a cooperative transmission mode; the friend node receiving the query information immediately feeds a routing to a target node back to a home node if the friend node has the routing to the target node; if the query depth is not reached, the friend node continues to select other friends for inquiring the route; and after the route is found, service information is transmitted in a cooperative transmission mode. The method improves the problem of high cost of large-scale network routing by introducing clustering and a small world phenomenon, obviously enhances network performance by using cooperative transmission to optimize routing and reduce transmission delay, and applies to large-scale distribution networks.

Description

technical field [0001] The invention relates to the technical field of wireless communication, in particular to a collaborative routing method, which can be used in large-scale wireless distributed networks. Background technique [0002] In the wireless ad hoc network, to solve the routing problem, there are usually several strategies such as active, passive and geographic location information-assisted routing. However, when the scale of the network increases, the exchange of routing information or the method of broadcast addressing will quickly exhaust network resources. [0003] Zone Routing Protocol ZRP is an ad hoc routing protocol that uses both active and passive routing strategies. All nodes in the network have a virtual area centered on themselves, and the number of nodes in the area is related to the set area radius, so the area overlap of ZRP is very high. This is also the difference between ZRP and explicit group routing. A priori routing algorithm is used in t...

AI Technical Summary

Problems solved by technology

[0009] (1) Since the small-world phenomenon is only an ideal abstraction after all, it is suitable for relational networks, but in spatial networks, due to the lack of support for long connections, one hop to a friend node may become a path of many hops in a large-scale network, resulting in Poor latency performance

[0010] (2) Since there is no broadcast and whole network topology, only suboptimal paths can be obtained. When the network scale increases, it is easy to cause problems such as path wrapping and redundancy, and there are too many nodes on the path, and the probability of routing failure increases. The robustness is relatively low. Difference

[0011] (3) When the number of nodes in the network increases, the number of passing friend nodes and the delay of query must be limited, and the search probability of the destination node will decrease at this time

Images