On k-connectivity for a geometric random graph
Random Structures & Algorithms
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Peer-to-Peer Spatial Queries in Sensor Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
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
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
MAC-layer anycasting in ad hoc networks
ACM SIGCOMM Computer Communication Review
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Proceedings of the 3rd international symposium on Information processing in sensor networks
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer 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
Design of a wireless sensor network platform for detecting rare, random, and ephemeral events
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Lazy cross-link removal for geographic routing
Proceedings of the 4th international conference on Embedded networked sensor systems
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Geographic routing without planarization
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
IEEE Transactions on Mobile Computing
Di-GAFR: Directed Greedy Adaptive Face-Based Routing
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Forwarding via checkpoints: Geographic routing on always-on sensors
Journal of Parallel and Distributed Computing
eShare: a capacitor-driven energy storage and sharing network for long-term operation
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
Impact of mobile sink for wireless sensor network
Proceedings of the 49th Annual Southeast Regional Conference
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
A self-optimizing mobile network: Auto-tuning the network with firefly-synchronized agents
Information Sciences: an International Journal
Review: A survey on coverage and connectivity issues in wireless sensor networks
Journal of Network and Computer Applications
Achieving long-term operation with a capacitor-driven energy storage and sharing network
ACM Transactions on Sensor Networks (TOSN)
ACM Transactions on Sensor Networks (TOSN)
Comparing different overlay topologies and metrics in pulse-coupled multi-agent systems
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Contention-based geographic forwarding in asynchronous duty-cycled wireless sensor networks
International Journal of Communication Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
An energy-efficient clustered distributed coding for large-scale wireless sensor networks
The Journal of Supercomputing
| Hi-index | 0.00 |
Geographic routing is a useful and scalable point-to-point communication primitive for wireless sensor networks. However, previous work on geographic routing makes the unrealistic assumption that all the nodes in the network are awake during routing. This overlooks the common deployment scenario where sensor nodes are duty-cycled to save energy. In this paper we investigate several important aspects of geographic routing over duty-cycled nodes. First, we extend existing geographic routing algorithms to handle the highly dynamic networks resulting from duty-cycling. Second, we provide the first formal analysis of the performance of geographic routing on duty-cycled nodes. Third, we use this analysis to develop an efficient decentralized sleep scheduling algorithm for reducing the number of awake nodes while maintaining both network coverage and a (tunable) target routing latency. Finally, we evaluate via simulation the performance of our approach versus running existing geographic routing algorithms on sensors duty-cycled according to previous sleep scheduling algorithms. Our results show, perhaps surprisingly, that a network of duty-cycled nodes can have slightly better routing performance than a static network that uses comparable energy. Our results further show that, compared to previous algorithms, our sleep scheduling algorithm significantly improves routing latency and network lifetime.