Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
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
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Continuum percolation with steps in the square or the disc
Random Structures & Algorithms
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Robust network connectivity: when it's the big picture that matters
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On random points in the unit disk
Random Structures & Algorithms
Coverage by randomly deployed wireless sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Analysis of target detection performance for wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Asymptotic connectivity in wireless ad hoc networks using directional antennas
IEEE/ACM Transactions on Networking (TON)
Optimal movement of mobile sensors for barrier coverage of a planar region
Theoretical Computer Science
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors
ACM Transactions on Sensor Networks (TOSN)
Accumulation point model for barrier coverage
INSS'09 Proceedings of the 6th international conference on Networked sensing systems
Multi-round sensor deployment for guaranteed barrier Coverage
INFOCOM'10 Proceedings of the 29th conference on Information communications
Results on finite wireless networks on a line
IEEE Transactions on Communications
On minimizing the sum ofensor movements for barrier coverage of a line segment
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
A study on the weak barrier coverage problem in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Optimal sensor networks for area monitoring using rotating and beam sensors
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Distributed algorithms for barrier coverage using relocatable sensors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Barrier coverage with line-based deployed mobile sensors
Ad Hoc Networks
Results on finite wireless sensor networks: Connectivity and coverage
ACM Transactions on Sensor Networks (TOSN)
Mobility increases the surface coverage of distributed sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Deriving the critical density (which is equivalent to deriving the critical radius or power) to achieve coverage and/or connectivity for random deployments is a fundamental problem in the area of wireless networks. The probabilistic conditions normally derived, however, have limited appeal among practitioners because they areoften asymptotic, i.e., they only make high probability guarantees in the limit of large system sizes. Such conditions are not very useful in practice since deployment regions are always finite. Another major limitation of most existing work on coverage and connectivity is their focus on thick deployment regions (such as a square or a disk). There is no existing work (including traditional percolation theory) that derives critical densities for thin strips (or annuli). In this paper, we address both of these shortcomings by introducing new techniques for deriving reliable density estimates for finite regions (including thin strips). We apply our techniques to solve the open problem of deriving reliable density estimates for achieving barrier coverage and connectivity in thin strips, where sensors are deployed as a barrier to detect moving objects and phenomena. We use simulations to show that our estimates are accurate even for small deployment regions. Our techniques bridge the gap between theory and practice in the area of coverage and connectivity, since the results can now be readily used in real-life deployments.