Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Hypercube Network Fault Tolerance: A Probabilistic Approach
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Worst and Best-Case Coverage in Sensor Networks
IEEE Transactions on Mobile Computing
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Robustness and performance analysis of a dynamic sensor network scheduling algorithm
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Coverage, connectivity, and fault tolerance measures of wireless sensor networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.00 |
Traditional connectivity is a graph-theoretic concept that has been widely used as a measure of the fault tolerance in wireless sensor networks. The classical connectivity, however, assumes that any subset of nodes can potentially fail at the same time, including the entire neighbor set of any node. In this paper, we propose a new measure of fault tolerance, called conditional fault-tolerance, for a class of wireless sensor networks, named k-covered wireless sensor networks (kcwsn), using the concept of forbidden faulty set. Our forbidden faulty set analysis of conditional fault-tolerance prohibits having a simultaneous failure of all the neighbors of any node. We characterize kcwsn with either homogeneous or non-homogeneous sensors based on the assumptions of random uniform distribution of the sensors and circular model of their transmission and sensing ranges. In particular, we compute the minimum node degree of kcwsn. We also prove that in general, the relationship between transmission and sensing ranges (R≥2r) does not always imply network connectivity even if sensing coverage is guaranteed. Moreover, we propose two conditional fault-tolerance measures for kcwsn: one based on the concept of conditional connectivity, the other using a new concept that is called conditional coverage. Our results prove that kcwsn can sustain a large number of sensor failures provided that the faulty set does not include the forbidden faulty set.