|
It is very important for wireless sensor networks to keep information transmission all the time. Because sensor nodes are powered by batteries, the network is easy to fail. Therefore, it is necessary to place relay nodes with high energy in the network to enable the network to transmit information. In practice, due to geographical location or other factors, not every location is suitable for placing relay nodes. In order to make the network more stable, the network should meet the requirements of multi-connectivity and multi-coverage as much as possible. Therefore, it is necessary to study the placement of relay nodes with position constraints that meet the k-coverage and S-connectivity. In this paper, the problem of relay node placement in a two-layer large scale wireless sensor network with position limitation is studied. Based on the convex hull algorithm, a relay node placement algorithm is proposed to meet K coverage and S connectivity, the algorithm complexity of O(n²) and approximate ratio of 1.5 are obtained.
|
