Design & analysis of fault tolerant digital systems
Design & analysis of fault tolerant digital systems
Research challenges in wireless networks of biomedical sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Voronoi diagram and convex hull based geocasting and routing in wireless networks
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Coverage Issue in Sensor Networks with Adjustable Ranges
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Efficient Deployment Algorithms for Ensuring Coverage and Connectivity ofWireless Sensor Networks
WICON '05 Proceedings of the First International Conference on Wireless Internet
Voronoi diagram and convex hull based geocasting and routing in wireless networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
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
International Journal of Sensor Networks
International Journal of Sensor Networks
Hi-index | 0.00 |
We study the coverage problem for sensor networks from the fault tolerance and reliability point of view. Fault tolerance is a critical issue for sensors deployed in places where they are not easily replaceable, repairable and rechargeable. Failure of one node should not incapacitate the entire network. We propose three 1-fault tolerant topologies, namely square, hexagonal and improved 8-node. We show how to extend these to k-fault tolerant schemes and calculate reliabilities using Markov models. The proposed models are compared to one another, as well as with the minimal coverage model of Zhang and Hou. The minimum coverage model is the most unreliable among the models, whereas the improved 8-node model is the most reliable except at the very beginning of the system, where the square model is more reliable. To our knowledge, this is the first paper which studies a pattern from the perspective of reliability.