skip to main content
10.1145/1236360.1236416acmconferencesArticle/Chapter ViewAbstractPublication PagescpsweekConference Proceedingsconference-collections
Article

Communicating via fireflies: geographic routing on duty-cycled sensors

Published: 25 April 2007 Publication History

Abstract

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.

References

[1]
ABRAMS, Z., GOEL, A., AND PLOTKIN, S. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In ACM/IEEE IPSN (2004).
[2]
BISWAS, S., AND MORRIS, R. Opportunistic routing in multi-hop wireless networks. In ACM SIGCOMM (2005).
[3]
CAO, Q., ABDELZAHER, T., HE, T., AND STANKOVIC, J. Towards optimal sleep scheduling in sensor networks for rare-event detection. In ACM/IEEE IPSN (2004).
[4]
CHEN, B., JAMIESON, K., BALAKRISHNAN, H., AND MORRIS, R. Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. In ACM MobiCom (2001).
[5]
CHOUDHURY, R. R., AND VAIDYA, N. H. MAC-layer anycasting in ad hoc networks. ACM SIGCOMM CCR 34, 75--80 (2004).
[6]
DEMIRBAS, M., AND FERHATOSMANOGLU, H. Peer-to-peer spatial queries in sensor networks. In IEEE P2P (2003).
[7]
DUTTA, P., GRIMMER, M., ARORA, A., BIBYK, S., AND CULLER, D. Design of a wireless sensor network platform for detecting rare, random, and ephemeral events. In ACM/IEEE IPSN (2005).
[8]
FAN HSIN, C., AND LIU, M. Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms. In ACM/IEEE IPSN (2004).
[9]
GAREY, M. R., AND JOHNSON, D. S. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
[10]
HEKMAT, R., AND MIEGHEM, P. V. Degree distribution and hopcount in wireless ad-hoc networks. In IEEE ICON (2003).
[11]
KARP, B., AND KUNG, H. T. GPSR: Greedy perimeter stateless routing for wireless networks. In ACM MobiCom (2000).
[12]
KIM, Y.-J., GOVINDAN, R., KARP, B., AND SHENKER, S. Geographic routing made practical. In Usenix NSDI (2005).
[13]
KIM, Y.-J., GOVINDAN, R., KARP, B., AND SHENKER, S. Lazy cross-link removal for geographic routing. In ACM SenSys (2006).
[14]
LEONG, B., LISKOV, B., AND MORRIS, R. Geographic routing without planarization. In Usenix NSDI (2006).
[15]
LI, X., KIM, Y. J., GOVINDAN, R., AND HONG, W. Multi-dimensional range queries in sensor networks. In ACM SenSys (2003).
[16]
LI, X.-Y., WAN, P.-J., WANG, Y., AND YI, C.-W. Fault tolerant deployment and topology control in wireless networks. In ACM MobiHoc (2003).
[17]
MITZENMACHER, M., AND UPFAL, E. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
[18]
NATH, S., AND GIBBONS, P. B. Communicating via fireflies: Geographic routing on duty-cycled sensors. Tech. Rep. MSR-TR-2007-21, Microsoft Research, 2007.
[19]
PENROSE, M. D. On k-connectivity for a geometric random graph. Wiley Random Structures and Algorithms 15, 2 (1999), 145--164.
[20]
SHENKER, S., RATNASAMY, S., KARP, B., GOVINDAN, R., AND ESTRIN, D. Data-centric storage in sensornets. In ACM HotNets (2002).
[21]
STOJMENOVIC, I., SEDDIGH, M., AND ZUNIC, J. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. on Parallel and Distributed Systems 13, 1 (2002), 14--25.
[22]
SUN, F., AND SHAYMAN, M. On the average pairwise connectivity of wireless multihop networks. In IEEE Globecom (2005).
[23]
TAKAGI, H., AND KLEINROCK, L. Optimal transmission ranges for randomly distributed packet radio networks. IEEE Trans. on Communication 32, 3 (1984), 246--257.
[24]
TIAN, D., AND GEORGANAS, N. D. A coverage-preserving node scheduling scheme for large wireless sensor networks. In ACM WSNA (2002).
[25]
TOUSSAINT, G. T. The relative neighbourhood graph of a finite planar set. Pattern Recognition 12 (1980), 261--268.
[26]
WANG, X., XING, G., ZHANG, Y., LU, C., PLESS, R., AND GILL, C. Integrated coverage and connectivity configuration in wireless sensor networks. In ACM SenSys (2003).
[27]
XU, Y., HEIDEMANN, J., AND ESTRIN, D. Geography-informed energy conservation for ad hoc routing. In ACM MobiCom (2001).
[28]
ZHAO, J., AND GOVINDAN, R. Understanding packet delivery performance in dense wireless sensor networks. In ACM SenSys (2003).
[29]
ZORZI, M., AND RAO, R. R. Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Energy and latency performance. IEEE Trans. on Mobile Computing 2, 4 (2003), 349--365.

Cited By

View all
  • (2021)On Distributed Node Sleep Scheduling Optimization Method Based on Time Switching of SWIPT2021 International Wireless Communications and Mobile Computing (IWCMC)10.1109/IWCMC51323.2021.9498750(376-381)Online publication date: 28-Jun-2021
  • (2020)Energy Management in a Multi-Source Energy Harvesting IoT SystemJournal of Information Technology Research10.4018/JITR.202004010313:2(42-59)Online publication date: 1-Apr-2020
  • (2020)Energy Efficient Opportunistic Routing with Sleep Scheduling in Wireless Sensor NetworksWireless Personal Communications10.1007/s11277-020-07100-zOnline publication date: 27-Jan-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networks
April 2007
592 pages
ISBN:9781595936387
DOI:10.1145/1236360
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 April 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. geographic routing
  2. sleep-scheduling algorithm

Qualifiers

  • Article

Conference

IPSN07
Sponsor:

Acceptance Rates

Overall Acceptance Rate 143 of 593 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2021)On Distributed Node Sleep Scheduling Optimization Method Based on Time Switching of SWIPT2021 International Wireless Communications and Mobile Computing (IWCMC)10.1109/IWCMC51323.2021.9498750(376-381)Online publication date: 28-Jun-2021
  • (2020)Energy Management in a Multi-Source Energy Harvesting IoT SystemJournal of Information Technology Research10.4018/JITR.202004010313:2(42-59)Online publication date: 1-Apr-2020
  • (2020)Energy Efficient Opportunistic Routing with Sleep Scheduling in Wireless Sensor NetworksWireless Personal Communications10.1007/s11277-020-07100-zOnline publication date: 27-Jan-2020
  • (2017)Dynamic transmission power switch for fast data collection in duty-cycled sensor networksInternational Journal of Ad Hoc and Ubiquitous Computing10.1504/IJAHUC.2017.08251724:3(173-182)Online publication date: 1-Jan-2017
  • (2017)Prolonging global connectivity in group-based industrial wireless sensor networksProceedings of the 16th ACM/IEEE International Conference on Information Processing in Sensor Networks10.1145/3055031.3055071(325-326)Online publication date: 18-Apr-2017
  • (2017)Sleep scheduling in wireless powered industrial wireless sensor networksProceedings of the 16th ACM/IEEE International Conference on Information Processing in Sensor Networks10.1145/3055031.3055059(301-302)Online publication date: 18-Apr-2017
  • (2017)Sleep Scheduling in Industrial Wireless Sensor Networks for Toxic Gas MonitoringIEEE Wireless Communications10.1109/MWC.2017.1600072WC24:4(106-112)Online publication date: Aug-2017
  • (2017)Releasing Network Isolation Problem in Group-Based Industrial Wireless Sensor NetworksIEEE Systems Journal10.1109/JSYST.2015.247527611:3(1340-1350)Online publication date: Sep-2017
  • (2017)Energy-utilization aware sleep scheduling in green WSNs for sustainable throughputIECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society10.1109/IECON.2017.8216814(4724-4727)Online publication date: Oct-2017
  • (2017)Sleep scheduling for critical nodes in group-based industrial wireless sensor networks2017 IEEE International Conference on Communications Workshops (ICC Workshops)10.1109/ICCW.2017.7962739(694-698)Online publication date: May-2017
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media