Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Spatial averages of coverage characteristics in large CDMA networks
Wireless Networks
Dynamic Power Management in Wireless Sensor Networks
IEEE Design & Test
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Energy concerns in wireless networks
IEEE Wireless Communications
Towards optimal sleep scheduling in sensor networks for rare-event detection
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Virtual patrol: a new power conservation design for surveillance using sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Critical node lifetimes in random networks via the Chen-Stein method
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Analysis of Spatially and Temporally Overlapping Events with Application to Image Sequences
IEEE Transactions on Pattern Analysis and Machine Intelligence
TECA: a topology and energy control algorithm for wireless sensor networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
An evolving power saving model for monitoring sensor networks using cellular automata
Proceedings of the 43rd annual Southeast regional conference - Volume 2
Studying endocytosis in space and time by means of temporal Boolean models
Pattern Recognition
Coverage breach problems in bandwidth-constrained sensor networks
ACM Transactions on Sensor Networks (TOSN)
Fluid models for large-scale wireless sensor networks
Performance Evaluation
Distributed energy management algorithm for large-scale wireless sensor networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Delay and capacity in energy efficient sensor networks
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
Exploring in-situ sensing irregularity in wireless sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links
Proceedings of the 5th international conference on Embedded networked sensor systems
On the latency for information dissemination in mobile wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
On the critical phase transition time of wireless multi-hop networks with random failures
Proceedings of the 14th ACM international conference on Mobile computing and networking
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
IEEE/ACM Transactions on Networking (TON)
Information dissemination in large-scale wireless networks with unreliable links
Proceedings of the 4th Annual International Conference on Wireless Internet
Energy Efficient DNA-Based Scheduling Scheme for Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
On the coverage process of a moving point target in a non-uniform dynamic sensor field
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Graph theoretic models and tools for the analysis of dynamic wireless multihop networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Bounds on the information propagation delay in interference-limited ALOHA networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
A connectivity based partition approach for node scheduling in sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Sleeping schedule-aware minimum latency broadcast in wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
An energy-efficient integrated mac and routing protocol for wireless sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed estimation of channel gains in wireless sensor networks
IEEE Transactions on Signal Processing
Characterizing the spread of correlated failures in large wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A model framework for greedy routing in a sensor network with a stochastic power scheme
ACM Transactions on Sensor Networks (TOSN)
Resilience to degree-dependent and cascading node failures in random geometric networks
IEEE Transactions on Information Theory
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Transition phase of connectivity for wireless networks with growing process
International Journal of Ad Hoc and Ubiquitous Computing
Contention-based geographic forwarding in asynchronous duty-cycled wireless sensor networks
International Journal of Communication Systems
On the cascading spectrum contention problem in self-coexistence of cognitive radio networks
Proceedings of the 1st ACM workshop on Cognitive radio architectures for broadband
| Hi-index | 0.06 |
We consider a wireless sensor network, where nodes switch between an active (on) and a sleeping (off) mode, to save energy. The basic assumptions are that the on/off schedules are completely uncoordinated and that the sensors are distributed according to a Poisson process and their connectivity ranges are larger or equal to their sensing ranges. Moreover, the durations of active and sleeping periods are such that the number of active nodes at any particular time is so low that the network is always disconnected.Is it possible to use such a network for time-critical monitoring of an area? Such a scenario requires indeed to have bounds on the latency, which is the delay elapsed between the time at which an incoming event is sensed by some node of the network and the time at which this information is retrieved by the data collecting sink. A positive answer is provided to this question under some simplifying assumptions discussed in the paper. More precisely, we prove that the messages sent by a sensing node reach the sink with a fixed asymptotic speed, which does not depend on the random location of the nodes, but only on the network parameters (node density, connectivity range, duration of active and sleeping periods). The results are obtained rigorously by using an extension of first passage percolation theory.