On computing a conditional edge-connectivity of a graph
Information Processing Letters
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
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On deriving the upper bound of α-lifetime for large sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Extremal Properties of Three-Dimensional Sensor Networks with Applications
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
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
Deploying sensor networks with guaranteed capacity and fault tolerance
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
Maintaining differentiated coverage in heterogeneous sensor networks
EURASIP Journal on Wireless Communications and Networking
Self Distributed Query Region Covering in Sensor Networks
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
On the upper bound of α-lifetime for large sensor networks
ACM Transactions on Sensor Networks (TOSN)
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Coverage by randomly deployed wireless sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On computing conditional fault-tolerance measures for k-covered wireless sensor networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Reliable density estimates for coverage and connectivity in thin strips of finite length
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
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
Clustering-based minimum energy wireless m-connected k-covered sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Reliable networks with unreliable sensors
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Fast track article: Reliable networks with unreliable sensors
Pervasive and Mobile Computing
Agent-based decentralised coordination for sensor networks using the max-sum algorithm
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
Connectivity, primarily a graph-theoretic concept, helps define the fault tolerance of wireless sensor networks (WSNs) in the sense that it enables the sensors to communicate with each other so their sensed data can reach the sink. On the other hand, sensing coverage, an intrinsic architectural feature of WSNs plays an important role in meeting application-specific requirements, for example, to reliably extract relevant data about a sensed field. Sensing coverage and network connectivity are not quite orthogonal concepts. In fact, it has been proven that connectivity strongly depends on coverage and hence considerable attention has been paid to establish tighter connection between them although only loose lower bound on network connectivity of WSNs is known. In this article, we investigate connectivity based on the degree of sensing coverage by studying k-covered WSNs, where every location in the field is simultaneously covered (or sensed) by at least k sensors (property known as k-coverage, where k is the degree of coverage). We observe that to derive network connectivity of k-covered WSNs, it is necessary to compute the sensor spatial density required to guarantee k-coverage. More precisely, we propose to use a model, called the Reuleaux Triangle, to characterize k-coverage with the help of Helly's Theorem and the analysis of the intersection of sensing disks of k sensors. Using a deterministic approach, we show that the sensor spatial density to guarantee k-coverage of a convex field is proportional to k and inversely proportional to the sensing range of the sensors. We also prove that network connectivity of k-covered WSNs is higher than their sensing coverage k. Furthermore, we propose a new measure of fault tolerance for k-covered WSNs, called conditional fault tolerance, based on the concepts of conditional connectivity and forbidden faulty sensor set that includes all the neighbors of a given sensor. We prove that k-covered WSNs can sustain a large number of sensor failures provided that the faulty sensor set does not include a forbidden faulty sensor set.