Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1288107.1288136acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
Article

Distributed energy management algorithm for large-scale wireless sensor networks

Published: 09 September 2007 Publication History

Abstract

In battery-constrained wireless sensor networks, it is important to employ effective energy management while maintaining some level of network connectivity. Viewing this problem from a percolation-based connectivity perspective, we propose a fully distributed energy management algorithm for large-scale wireless sensor networks. This algorithm allows each sensor to probabilistically schedule its own activity based on its node degree. This mechanism is modelled by a degree-dependent dynamic site percolation process on random geometric graphs. We specify the conditions under which the resulting network is guaranteed to be percolated at all the time. We further study the delay performance of the proposed energy management algorithm by modelling the problem as a degree-dependent first passage percolation process on random geometric graphs.

References

[1]
E. Shih, P. Bahl, and M. J. Sinclair, "Wake on wireless: An event driven energy saving strategy for battery operated devices," in Proc. ACM MobiCom'02, 2002.
[2]
G. Lu, N. Sadagopan, B. Krishanamachari, and A. Goel, "Delay eficient sleep scheduling in wireless sensor networks," in Proc. IEEE INFOCOM'05, 2005.
[3]
W. Ye, J. Heidemann, and D. Estrin, "An ennergy-efficient mac protocol for wireless sensor networks," ACM/IEEE Trans. on Networking, vol. 12, pp. 493--506, 2004.
[4]
R. Zheng, C. Ho, and L. Sha, "Asynchronous wakeup for ad hoc networks," in Proc. ACM MobiHoc'03, 2003.
[5]
G. Grimmett, Percolation. New York: Springer, second ed., 1999.
[6]
R. Meester and R. Roy, Continuum Percolation. New York: Cambridge University Press, 1996.
[7]
M. Penrose, Random Geometric Graphs. New York: Oxford, University Press, 2003.
[8]
P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, pp. 547--566, 1998.
[9]
L. Booth, J. Bruck, M. Franceschetti, and R. Meester, "Covering algorithms, continuum percolation and the geometry of wireless networks," Annals of Applied Probability, vol. 13, pp. 722--741, May 2003.
[10]
M. Franceschetti, L. Booth, M. Cook, J. Bruck, and R. Meester, "Continuum percolation with unreliable and spread out connections," Journal of Statistical Physics, vol. 118, pp. 721--734, Feb. 2005.
[11]
O. Dousse, P. Mannersalo, and P. Thiran, "Latency of wireless sensor networks with uncoordinated power saving mechniasm," in Proc. ACM MobiHoc'04, pp. 109--120, 2004.
[12]
O. Dousse, M. Franceschetti, and P. Thiran, "Information theoretic bounds on the throughput scaling of wireless relay networks," in Proc. IEEE INFOCOM'05, Mar. 2005.
[13]
O. Dousse, F. Baccelli, and P. Thiran, "Impact of interferences on connectivity in ad hoc networks," IEEE Trans. Network., vol. 13, pp. 425--436, April 2005.
[14]
O. Dousse, M. Franceschetti, N. Macris, R. Meester, and P. Thiran, "Percolation in the signal to interference ratio graph," Journal of Applied Probability, vol. 43, no. 552--562, 2006.
[15]
T. Liggett, "An improved subadditive ergodic theorem," Annals of Prob., vol. 13, pp. 1279--1285, 1985.
[16]
J. Quintanilla, S. Torquato, and R. M. Ziff, "Efficient measurement of the percoaltion threshold for fully penetrable discs," Physics A, vol. 86, pp. 399--407, 2000.
[17]
P. Hall, "On continuum percolation," Annals of Prob., vol. 13, pp. 1250--1266, 1985.
[18]
Z. Kong and E. M. Yeh, "Analytical lower bounds on the critical density in continuum percolation," in Proc. of the Workshop on Spatial Stochastic Models in Wireless Networks (SpaSWiN), April 2007.
[19]
Z. Kong and E. M. Yeh, "Characterization of the critical density for percolation in random geometric graphs." to appear in Proc. of 2007 IEEE International Symposium on Information Theory, June 2007.
[20]
P. B. Godfrey and D. Ratajczak, "Naps: Scalable, robust topology managemen in wireless ad hoc networks," in Proc. ACM IPSN'04, April 2004.
[21]
O. Häggström, Y. Peres, and J. E. Steif, "Dynamic percolation," Ann. IHP Prob. et. Stat., vol. 33, pp. 497--528, 1997.
[22]
H. Kesten, "Percolation theory and first passage percolation," Annals of Prob., vol. 15, pp. 1231--1271, 1987.
[23]
M. Deijfen, "Asymptotic shape in a continuum growth model," Adv. in Applied Prob., vol. 35, pp. 303--318, 2003.
[24]
R. Durret, Probability: Theory and Examples. Duxbury Press, 2nd ed., 1996.

Cited By

View all
  • (2016)The Impact of Network Size and Mobility on Information Delivery in Cognitive Radio NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2015.239842015:1(217-231)Online publication date: 1-Jan-2016
  • (2015)Impact of Correlated Failures on Wireless Sensor Network ReliabilityHandbook of Sensor Networking10.1201/b18001-19(219-234)Online publication date: 14-Jan-2015
  • (2015)Connectivity and Transmission Delay in Large-Scale Cognitive Radio Ad Hoc Networks With Unreliable Secondary LinksIEEE Transactions on Wireless Communications10.1109/TWC.2015.246381614:12(7016-7029)Online publication date: 1-Dec-2015
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
September 2007
276 pages
ISBN:9781595936844
DOI:10.1145/1288107
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: 09 September 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dependent dynamic percolation
  2. first passage percolation
  3. subadditive ergodic theorem

Qualifiers

  • Article

Conference

MobiCom/MobiHoc '07
Sponsor:

Acceptance Rates

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2016)The Impact of Network Size and Mobility on Information Delivery in Cognitive Radio NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2015.239842015:1(217-231)Online publication date: 1-Jan-2016
  • (2015)Impact of Correlated Failures on Wireless Sensor Network ReliabilityHandbook of Sensor Networking10.1201/b18001-19(219-234)Online publication date: 14-Jan-2015
  • (2015)Connectivity and Transmission Delay in Large-Scale Cognitive Radio Ad Hoc Networks With Unreliable Secondary LinksIEEE Transactions on Wireless Communications10.1109/TWC.2015.246381614:12(7016-7029)Online publication date: 1-Dec-2015
  • (2015)On Topology and Resilience of Large-Scale Cognitive Radio Networks Under Generic FailuresIEEE Transactions on Wireless Communications10.1109/TWC.2015.240491914:6(3390-3401)Online publication date: Jun-2015
  • (2015)Toward a Practical Energy Conservation Mechanism With Assistance of Resourceful MulesIEEE Internet of Things Journal10.1109/JIOT.2014.23710562:2(145-158)Online publication date: Apr-2015
  • (2015)Temperature MAC plug-in for large scale WSN2015 IEEE International Conference on Communications (ICC)10.1109/ICC.2015.7249342(6389-6394)Online publication date: Jun-2015
  • (2013)On the cascading spectrum contention problem in self-coexistence of cognitive radio networksProceedings of the 1st ACM workshop on Cognitive radio architectures for broadband10.1145/2508478.2508479(3-12)Online publication date: 4-Oct-2013
  • (2013)Understanding Blackholes in large-scale Cognitive Radio Networks under generic failures2013 Proceedings IEEE INFOCOM10.1109/INFCOM.2013.6566859(728-736)Online publication date: Apr-2013
  • (2013)Understanding topology dynamics in large-scale Cognitive Radio Networks under generic failures2013 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2013.6831231(1161-1166)Online publication date: Dec-2013
  • (2013)A survey on Green communications using Adaptive Link RateCluster Computing10.1007/s10586-012-0225-816:3(575-589)Online publication date: 1-Sep-2013
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media