Relay node deployment method in time delay limited wireless sensor network

Abstract

The invention relates to the technology of wireless network, in particular to a relay node deployment method in a time delay limited wireless sensor network. The method comprises two steps of coverageand communication; the main objective of the coverage step is to cover all the sensor nodes with relay nodes as few as possible under the condition of time delay constraint, and the main objective ofthe communication step is to construct network connectivity with the relay nodes as few as possible under the condition of time delay constraint, wherein the coverage comprises three steps of feasible deployment position grouping, grouping selection and feasible position selection; and the communication comprises three steps of feasibility inspection, connectivity construction and relay pruning.According to the method, the requirements of the time delay limited wireless sensor network for time delay and deployment cost are fully considered; a relay node deployment method based on set coverage in a time delay limited double-layer wireless sensor network is provided; and the network connectivity is constructed by deploying the relay nodes as few as possible on the premise that the networktime delay requirement is met.

Description

technical field [0001] The invention relates to wireless sensor network technology, in particular to a relay node deployment method in a delay-limited two-layer wireless sensor network. Background technique [0002] A typical wireless sensor network consists of distributed sensor nodes and one or more sink nodes. Sensor nodes are responsible for sensing specific information, and sink nodes are responsible for collecting data sent by sensor nodes. Due to the limited power supply capability and antenna height, the communication radius of sensor nodes is very limited. Therefore, additional nodes need to be deployed to build network connectivity, and these nodes play the role of relays and are only responsible for forwarding received information. Considering the deployment cost, it is natural to deploy as few relay nodes as possible to build connectivity, which is the so-called relay node deployment problem. In the past ten years, a large number of related works on relay node...

AI Technical Summary

Problems solved by technology

However, these algorithms can only save overhead by deleting nodes on the original spanning tree. This defect makes the algorithm miss relay nodes that are not on the original spanning tree and can save a lot of overhead, resulting in local optimum

Some scholars have proposed an algorithm based on the branch-cut method, but this algorithm requires that a given relay deployment problem must meet the condition that "the deletion of any node cannot make the deployment problem unsolvable", and its time complexity increases exponentially. Therefore, it is not suitable for large-scale deployment

Images