research-article

Bootstrapping a hop-optimal network in the weak sensor model

Authors:

Martin Farach-Colton,

Rohan J. Fernandes,

Miguel A. MosteiroAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 5, Issue 4

Article No.: 37, Pages 1 - 30

https://doi.org/10.1145/1597036.1597040

Published: 06 November 2009 Publication History

Abstract

Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research thus has three parts: One must model the restrictions on sensor nodes; one must prove that the connectivity graph of the sensors has a subgraph that would make a good network; and one must give a distributed protocol for finding such a network subgraph that can be implemented on sensor nodes.

Although many particular restrictions on sensor nodes are implicit or explicit in many papers, there remain many inconsistencies and ambiguities from paper to paper. The lack of a clear model means that solutions to the network bootstrapping problem in both the theory and systems literature all violate constraints on sensor nodes. For example, random geometric graph results on sensor networks predict the existence of subgraphs on the connectivity graph with good route-stretch, but these results do not address the degree of such a graph, and sensor networks must have constant degree. Furthermore, proposed protocols for actually finding such graphs require that nodes have too much memory, whereas others assume the existence of a contention-resolution mechanism.

We present a formal Weak Sensor model that summarizes the literature on sensor node restrictions, taking the most restrictive choices when possible. We show that sensor connectivity graphs have low-degree subgraphs with good hop-stretch, as required by the Weak Sensor model. Finally, we give a Weak Sensor model-compatible protocol for finding such graphs. Ours is the first network initialization algorithm that is implementable on sensor nodes.

References

[1]

Aiello, W., Chung-Graham, F., and Lu, L. 2002. Random Evolution of Massive Graphs. Kluwer Academic Publishers, Dordrecht, 97--122.

Digital Library

[2]

Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., and Cyirci, E. 2002. Wireless sensor networks: A survey. Comput. Netw. 38, 4, 393--422.

Digital Library

[3]

Alzoubi, K. M. 2003. Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks. In Proceedings of the 8th IEEE International Symposium on Computers and Communications. 209.

Digital Library

[4]

Appel, M. J., and Russo, R. P. 1997a. The maximum vertex degree of a graph on uniform points in {0, 1}^d. Adv. Appl. Probability 29, 567--581.

[5]

Appel, M. J., and Russo, R. P. 1997b. The minimum vertex degree of a graph on uniform points in {0, 1}^d. Adv. Appl. Probability 29, 582--594.

[6]

Bar-Yehuda, R., Goldreich, O., and Itai, A. 1992. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 104--126.

Digital Library

[7]

Barrière, L., Fraigniaud, P., Narayanan, L., and Opatrny, J. 2003. Dynamic construction of bluetooth scatternets of fixed degree and low diameter. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 781--790.

Digital Library

[8]

Blough, D. M., Leoncini, M., Resta, G., and Santi, P. 2003. The k-neigh protocol for symmetric topology control in ad hoc networks. In Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing.

Digital Library

[9]

Bray, J., and Sturman, C. 2001. Bluetooth: Connect Without Cables. Prentice Hall.

Digital Library

[10]

Das, G., and Narasimhan, G. 1997. A fast algorithm for constructing sparse Euclidean spanners. Int. J. Comput. Geom. Appl. 7, 297--315.

[11]

Erdös, P., and Renyi, A. 1959. On random graphs--i. Publicationes Matematicae 6, 290--297.

[12]

Farach-Colton, M., Fernandes, R. J., and Mosteiro, M. A. 2005. Bootstrapping a hop-optimal network in the weak sensor model. In Proceedings of the 13th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 3669. Springer-Verlag, Berlin, 827--838.

Digital Library

[13]

Farach-Colton, M., and Mosteiro, M. A. 2007. Initializing sensor networks of non-uniform density in the weak sensor model. In Proceedings of 10th International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 4619. Springer-Verlag, Berlin, 565--576.

Digital Library

[14]

Fejes-Tóth, L. 1940. Über einen geometrischen satz. Mathematische Zeitschrift 46, 1, 83--85.

[15]

Ferraguto, F., Mambrini, G., Panconesi, A., and Petrioli, C. 2004. A new approach to device discovery and scatternet formation in bluetooth networks. In Proceedings of the 18th International Parallel and Distributed Processing Symposium.

[16]

Goel, A., Krishnamachari, B., and Rai, S. 2004. Sharp thresholds for monotone properties in random geometric graphs. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing.

Digital Library

[17]

Gudmundsson, J., Levcopoulos, C., and Narasimhan, G. 2002. Fast greedy algorithms for constructing sparse geometric spanners. SIAM J. Comput. 31, 1479--1500.

Digital Library

[18]

Gupta, P., and Kumar, P. R. 1998. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and applications: A Volume in Honor of W. H. Fleming. Birkhauser, Boston, 547--566.

[19]

Karl, H., and Willig, A. 2003. A short survey of wireless networks. Tech. rep. TKN-03-018, Technical University Berlin.

[20]

Kleinberg, J., Kumar, S. R., Raghavan, P., Rajagopalan, S., and Tomkins, A. 1999. The Web as a graph: Measurements, models and methods. In Annual Conference on Computing and Combinatorics.

Digital Library

[21]

Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., and Srinivasan, A. 2004. End-to-End packet-scheduling in wireless ad-hoc networks. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms.

Digital Library

[22]

Law, C., and Siu, K. Y. 2001. A Bluetooth scatternet formation algorithm. In Proceedings of the IEEE Symposium on Ad Hoc Wireless Networks.

[23]

Li, X.-Y. 2004. Topology Control in Wireless Ad Hoc Networks. Wiley-IEEE Press, Chapter 6, 175--199.

[24]

Miller, B., and Bisdikian, C. 2000. Bluetooth Revealed: The Insider's Guide to an Open Specification for Global Wireless Communication. Prentice Hall.

Digital Library

[25]

Moscibroda, T. and Wattenhofer, R. 2005. Maximal independent sets in radio networks. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing.

Digital Library

[26]

Motwani, R. and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press.

Digital Library

[27]

Muthukrishnan, S., and Pandurangan, G. 2005. The bin-covering technique for thresholding random geometric graph properties. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms.

Digital Library

[28]

Nakano, K., and Olariu, S. 2000. Energy-Efficient initialization protocols for radio networks with no collision detection. In International Conference on Parallel Processing.

Digital Library

[29]

Parthasarathy, S., and Gandhi, R. 2004. Fast distributed well connected dominating sets for ad hoc networks. Tech. rep. CS-TR-4559, Computer Science Department, University of Maryland.

[30]

Penrose, M. 2003. Random Geometric Graphs. Oxford University Press.

[31]

Penrose, M. D. 1999. On k-connectivity for a geometric random graph. Random Struct. Algor. 15, 2, 145--164.

Digital Library

[32]

Ponduru, V. A. S., and Bharathidasan, A. 2003. Sensor networks: An overview. Tech. rep., University of California, Davis.

[33]

Rentala, P., Musunuri, R., Saxena, U., and Gandham, S. 2001. Survey on sensor networks. http://citeseer.ist.psu.edu/479874.html.

[34]

Roberts, L. G. 1975. Aloha packet system with and without slots and capture. Comput. Comm. Rev. 5, 2, 28--42.

Digital Library

[35]

Salonidis, T., Bhagwat, P., Tassiulas, L., and LaMaire, R. 2001. Distributed topology construction of bluetooth personal area networks. In Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).

[36]

Sohrabi, K., Gao, J., Ailawadhi, V., and Pottie, G. J. 2000. Protocols for self-organization of a wireless sensor network. IEEE Personal Comm., 7, 5, 16--27.

[37]

Song, W., Wang, Y., Li, X., and Frieder, O. 2004. Localized algorithms for energy efficient topology in wireless ad hoc networks. In Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing.

Digital Library

[38]

Tilak, S., Abu-Ghazaleh, N., and Heinzelman, W. 2002. A taxonomy of wireless micro-sensor network problems. Mobile Comput. Comm. Rev. 6, 2.

Digital Library

[39]

Wang, Z., Thomas, R. J., and Haas, Z. 2002. Bluenet - A new scatternet formation algorithm. In Hawaii International Conference on System Sciences (HICSS).

[40]

Younis, O., Krunz, M., and Ramasubramanian, S. 2006. Node clustering in wireless sensor networks: Recent developments and deployment challenges. IEEE Netw. Mag. 20, 3, 20--25.

Digital Library

[41]

Zaruba, G. V., Basagni, S., and Chlamtac, I. 2001. Bluetrees - Scatternet formation to enable Bluetooth-based ad hoc networks. In Proceedings of the IEEE International Conference on Communications.

Cited By

Wen RMcCoy HTench DTagliavini GBender MConway AFarach-Colton MJohnson RPandey P(2024)Adaptive Quotient FiltersProceedings of the ACM on Management of Data10.1145/36771282:4(1-28)Online publication date: 30-Sep-2024
https://dl.acm.org/doi/10.1145/3677128
Pandey PFarach-Colton MDayan NZhang HBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Beyond Bloom: A Tutorial on Future Feature-Rich FiltersCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654681(636-644)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654681
Pandey PConway ADurie JBender MFarach-Colton MJohnson RLi GLi ZIdreos SSrivastava D(2021)Vector Quotient FiltersProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452841(1386-1399)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3452841
Show More Cited By

Index Terms

Bootstrapping a hop-optimal network in the weak sensor model

Recommendations

Bootstrapping a hop-optimal network in the weak sensor model
ESA'05: Proceedings of the 13th annual European conference on Algorithms

Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research thus has three parts: one must model the restrictions on sensor nodes; one ...
The coverage problem in a wireless sensor network

One of the fundamental issues in sensor networks is the coverage problem, which reflects howwell a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether ...
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network

Wireless sensor networks have attracted a lot of attention recently. Such environments may consist of many inexpensive nodes, each capable of collecting, storing, and processing environmental information, and communicating with neighboring nodes through ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 5, Issue 4

October 2009

281 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/1597036

Issue’s Table of Contents

Copyright © 2009 ACM.

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 November 2009

Accepted: 01 February 2008

Revised: 01 January 2008

Received: 01 December 2006

Published in TALG Volume 5, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
284
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wen RMcCoy HTench DTagliavini GBender MConway AFarach-Colton MJohnson RPandey P(2024)Adaptive Quotient FiltersProceedings of the ACM on Management of Data10.1145/36771282:4(1-28)Online publication date: 30-Sep-2024
https://dl.acm.org/doi/10.1145/3677128
Pandey PFarach-Colton MDayan NZhang HBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Beyond Bloom: A Tutorial on Future Feature-Rich FiltersCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654681(636-644)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654681
Pandey PConway ADurie JBender MFarach-Colton MJohnson RLi GLi ZIdreos SSrivastava D(2021)Vector Quotient FiltersProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452841(1386-1399)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3452841
Bender MChristensen JConway AFarach-Colton MJohnson RTsai MChan T(2019)Optimal ball recyclingProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310590(2527-2546)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310590
Bender MFarach-Colton MGoswami MJohnson RMcCauley SSingh S(2018)Bloom Filters, Adaptivity, and the Dictionary Problem2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2018.00026(182-193)Online publication date: Oct-2018
https://doi.org/10.1109/FOCS.2018.00026
Farach-Colton MMosteiro M(2015)Initializing Sensor Networks of Non-uniform Density in the Weak Sensor ModelAlgorithmica10.1007/s00453-014-9905-573:1(87-114)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1007/s00453-014-9905-5
Farach-Colton MFernández Anta AMosteiro M(2013)Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)Theoretical Computer Science10.1016/j.tcs.2012.11.030472(60-80)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1016/j.tcs.2012.11.030
FernáNdez Anta AMosteiro MThraves C(2013)An early-stopping protocol for computing aggregate functions in Sensor NetworksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2012.09.01373:2(111-121)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1016/j.jpdc.2012.09.013
Fernández Anta AMosteiro MThraves C(2012)Deterministic recurrent communication in restricted Sensor NetworksTheoretical Computer Science10.1016/j.tcs.2011.10.018418(37-47)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1016/j.tcs.2011.10.018
Anta AMosteiro MThraves C(2010)Deterministic recurrent communication and synchronization in restricted sensor networksProceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities10.5555/1927083.1927089(62-73)Online publication date: 5-Jul-2010
https://dl.acm.org/doi/10.5555/1927083.1927089
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents