Mobility modeling in wireless networks: categorization, smooth movement, and border effects
ACM SIGMOBILE Mobile Computing and Communications Review
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies
IEEE Transactions on Mobile Computing
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Stochastic properties of the random waypoint mobility model
Wireless Networks
Stationary distributions of random walk mobility models for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Distance based decision fusion in a distributed wireless sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Design and analysis of an MST-based topology control algorithm
IEEE Transactions on Wireless Communications
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
RETRACTED: Impacts of sensor node distributions on coverage in sensor networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Along with energy conservation, it has been a critical issue tomaintain a desired degree of coverage in Wireless Sensor Networks(WSNs). In this paper, we consider more realistic WSN environmentswhere the sensor nodes are moving around, which can disappear dueto wear-out failures. By enhancing a variant of random waypointmodel (Li et al., 2005), we propose Mobility Resilient CoverageControl (MRCC) to assure K-coverage in the presence of mobility.Our basic goals are (1) to elaborate the probability of breakingK-coverage with moving-in and moving-out probabilities and (2) toissue wake-up calls to sleeping sensors to meet user requirement ofK-coverage even in the presence of mobility. Furthermore, to showthe impact of wear-out failures on the coverage achieved, we adopta lognormal distribution to depict the conditional probability offailures and observe the influence of reduced number of activenodes on coverage. Our experiments with Network Survivability– Double Link Failure show that MRCC achieves better coverageby 1.4% with 22% fewer active sensors than that of the existingCoverage Configuration Protocol (CCP). By taking reliability ofnodes into account, the performance drop with respect to coverageis 3.7% (for coverage 1) while the reduction in the number ofsensor nodes is 18.19% when compared with pure MRCC. Comparing CCPand MRCC with reliability, we observe a 3.4% reduction in coveragefor the average probabilistic case and 5.78% for the individualprobabilistic case, while achieving a 12.82% and 28.2% reduction innumber of nodes, respectively.