Wireless Ad hoc network covering method based on covering contribution

Abstract

The invention discloses a wireless Ad hoc network covering method based on covering contribution. The wireless Ad hoc network covering method comprises the steps that: firstly, initialized states of all nodes are uncovered nodes; all the nodes update covered degrees and covering contribution, and update respective covering state according to the covering contribution; and a covering node is converted into a covered node under the condition that a covering node with higher covering contribution exists in the neighborhood, a non-covering node is covered into a covering node under the condition that the covering contribution of the non-covering node is higher than that of all neighbor nodes, states of the covered nodes are modified into uncovered nodes if a covering node does not exist in the neighborhood of the covered nodes, states of the uncovered nodes are modified into covered nodes if a covering node exists in the neighborhood of the uncovered nodes, the uncovered nodes conform to a non-highest covering contribution node competition condition, and states of the uncovered nodes are modified into covered nodes after a plurality of cycles; and all the nodes periodically broadcast and receive HELLO messages in a one-hop range to establish a neighbourship. The wireless Ad hoc network covering method based on covering contribution can achieve rapid convergence and is high in reliability.

Description

technical field [0001] The invention belongs to the field of coverage monitoring of wireless ad hoc networks, in particular to a coverage method based on coverage contribution applied to wireless ad hoc networks. Background technique [0002] In wireless ad hoc networks, it is often necessary to monitor and collect network node data. Due to the limitations of network node energy and bandwidth, it is not suitable to use all nodes in the network for monitoring and collection. Therefore, in order to realize the monitoring and collection of node data of the entire network, it is often necessary to select several nodes in the network for network coverage. And because the self-organizing network cannot be managed in a centralized manner, each node can only select the coverage node through distributed coordination. [0003] In the selection process of coverage nodes, insufficient number of coverage nodes will lead to monitoring instability or even monitoring hole areas, and too m...

AI Technical Summary

Problems solved by technology

And because the self-organizing network cannot be managed in a centralized manner, only the distributed coordination of each node can select the coverage node

[0003] In the selection process of coverage nodes, insufficient number of coverage nodes will lead to monitoring instability and even monitoring hole areas, and too many coverage nodes will lead to increased network load and data redundancy; at the same time, due to the instability of wireless transmission , which is greatly affected by the distance between the sending and receiving parties. If the distribution of coverage nodes is unreasonable, the reliability of data transmission will be reduced, and the quality of monitoring will be reduced.

In addition, in fast-moving wireless ad hoc networks, such as vehicular ad hoc networks, rapid changes in network topology will cause the distribution of overlay nodes to quickly change from reasonable to unreasonable

Images