Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
The capacity of wireless networks
IEEE Transactions on Information Theory
Sharp thresholds For monotone properties in random geometric graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge
IEEE Transactions on Dependable and Secure Computing
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Asymptotic analysis of multistage cooperative broadcast in wireless networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Stochastic event capture using mobile sensors subject to a quality metric
Proceedings of the 12th annual international conference on Mobile computing and networking
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network
ACM Transactions on Sensor Networks (TOSN)
Mobility Limited Flip-Based Sensor Networks Deployment
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Wireless Communications
Area coverage based domain division in wireless sensor network
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Clustering-based minimum energy wireless m-connected k-covered sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
On the connectivity of key-distribution strategies in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Irregular sensing range detection model for coverage based protocols in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Constructing underwater sensor based barriers using distributed auctions
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Reliable networks with unreliable sensors
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Sensor allocation in diverse environments
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Sensor allocation in diverse environments
Wireless Networks
Design of wireless sensor networks for mobile target detection
IEEE/ACM Transactions on Networking (TON)
A key-distribution mechanism for wireless sensor networks using Zig-Zag product
International Journal of Ad Hoc and Ubiquitous Computing
Fast track article: Reliable networks with unreliable sensors
Pervasive and Mobile Computing
Adaptive k-coverage contour evaluation and deployment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Partial sensing coverage with connectivity in lattice wireless sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
We consider an unreliable wireless sensor grid network with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity of the network. We first show that the necessary and sufficient conditions for the random grid network to cover the unit square region as well as ensure that the active nodes are connected are of the form p(n)r^2(n)~log(n)/n, where r(n) is the transmission radius of each node and p(n) is the probability that a node is ''active'' (not failed). This result indicates that, when n is large, even if each node is highly unreliable and the transmission power is small, we can still maintain connectivity with coverage. We also show that the diameter of the random grid (i.e., the maximum number of hops required to travel from any active node to another) is of the order n/log(n). Finally, we derive a sufficient condition for connectivity of the active nodes (without necessarily having coverage). If the node success probability p(n) is small enough, we show that connectivity does not imply coverage.