Infrastructure-Establishment from Scratch in Wireless Sensor Networks

  • Stefan Funke
  • Nikola Milosavljevic
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3560)


We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (a subgraph of the unit-disk graph) infrastructure in wireless sensor networks. More concretely, our proposed scheme constructs a subgraph of the unit-disk graph which is connected, planar and has power stretch factor of 1 (the well-known Gabriel graph intersected with the unit disk-graph) and – most importantly – deals explicitly with the problem of interference between nearby stations. Due to our interleaved approach of constructing low- and high-level infrastructure simultaneously, this results in considerable improvements in running time when applied in dense wireless networks.

To substantiate the advantages of our approach, we introduce a novel distribution model inspired by actual sensing applications and analyze our new approach in that framework.


Wireless Sensor Network Time Slot Transmission Range Node Distribution Communication Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: 5th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2004)Google Scholar
  2. 2.
    Cheng, X., Huang, X., Li, D., Du, D.-Z.: Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks (to appear)Google Scholar
  3. 3.
    Clark, B., Colbourn, C., Johnson, D.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Systematic Zoology 18, 259–278 (1969)CrossRefGoogle Scholar
  5. 5.
    Gandhi, R., Parthasarathy, S.: Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks. CS-TR-4559, UM Computer Science DepartmentGoogle Scholar
  6. 6.
    Kuhn, F., Moscibroda, T., Wattenhofer, R.: Initializing Newly Deployed Ad Hoc and Sensor Networks. In: 10th Ann. Int. Conf. on Mobile Computing and Networking (MOBICOM), Philadelphia, USA (September 2004)Google Scholar
  7. 7.
    Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., Grünewald, M.: Congestion, Dilation, and Energy in Radio Networks. Theory of Computing Systems 37(3) (2004)Google Scholar
  8. 8.
    Moscibroda, T., Wattenhofer, R.: Efficient Computation of Maximal Independent Sets in Unstructured Multi-Hop Radio Networks. In: 1st IEEE Int. Conf. on Mobile Ad-hoc and Sensor Systems (MASS), Fort Lauderdale, USA (October 2004)Google Scholar
  9. 9.
    Li, X.-Y., Song, W.-Z., Wang, Y.: Localized Topology Control for Heterogenous Wireless Ad Hoc Networks. In: 1st IEEE Int. Conf. on Mobile Ad hoc and Sensor Systems, MASS (2004)Google Scholar
  10. 10.
    Li, X.-Y., Wan, P.-J., Yu, W., Frieder, O.: Sparse power efficient topology for wireless networks. In: IEEE Hawaiian Int. Conf. on System Sciences, HICSS (2002)Google Scholar
  11. 11.
    Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5(2), 81–94 (1999)CrossRefGoogle Scholar
  12. 12.
    Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. Wireless Networks 3(1), 71–82 (1997)CrossRefGoogle Scholar
  13. 13.
    Sen, A., Melesinska, E.: On approximation algorithms for radio network scheduling. In: Proc. 35th Allerton Conf. on Communication, Control, Computing, pp. 573–582 (1997)Google Scholar
  14. 14.
    Wan, P.J., Alzoubi, K., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless ad hoc networks. In: Proc. of INFOCOM 2002 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Stefan Funke
    • 1
  • Nikola Milosavljevic
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordU.S.A

Personalised recommendations