Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Efficient clipping of arbitrary polygons
ACM Transactions on Graphics (TOG)
Bidding Protocols for Deploying Mobile Sensors
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
Mobility enables numerous functionalities in wireless sensor networks (WSN's) including coverage optimization, network self-healing and adaptive resource management. In this paper, a novel wireless array-based sensor relocation (WA-SR) algorithm is proposed based on the cooperative sensing model, WA-CSM, presented in [4]. The WA-CSM model improves the network sensing coverage by utilizing closely located sensors upon deployment to form wireless arrays (WA's). A Local Detection Diagram (LDD) is introduced as an important tool for local coverage hole detection. To increase the coverage, WA's relocate the redundant nodes located within their coverage to suitable positions, while other sensors autonomously determine their own moving strategies. The proposed algorithm runs iteratively and in a distributed fashion. It terminates naturally when the optimum coverage is achieved within the maximum moving distance allowed. As enhancements to the WA-SR algorithm, self-detection and sensor movement-validation schemes are also proposed in this work. The effectiveness of the proposed approach is examined under various scenarios and supported by computer simulation studies.