Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics

ALGOSENSORS 2010: Algorithms for Sensor Systems pp 31–33Cite as

Brief Announcement: Hierarchical Neighbor Graphs: A Sparse Connected Structure for Euclidean Point Sets

  • Conference paper

  • 424 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6451))

Abstract

In this paper we introduce a new randomized method for constructing a bounded degree connected structure on points in Euclidean space: p-hierarchical neighbor graphs. The structure has a flavor of hierarchical clustering and requires only local knowledge and minimal computation at each node to be formed and repaired. Hence it is a suitable interconnection model for an ad hoc wireless network. Our structure has expected constant degree, diameter logarithmic in the size of the set and good spanner-like properties in a probabilistic sense.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Bagchi, A., Buchsbaum, A., Goodrich, M.T.: Biased skip lists. Algorithmica 42(1), 31–48 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bagchi, A., Madan, A., Premi, A.: Hierarchical neighbor graphs: An energy-efficient bounded degree connected structure for wireless sensor networks (July 2009), arXiv:0903.0742v3 [cs.NI]

    Google Scholar 

  3. Bagchi, A., Madan, A., Premi, A.: Hierarchical neighbor graphs: A fully distributed topology for data collection in wireless sensor networks (2010), http://www.cse.iitd.ernet.in/~bagchi

  4. Ballister, P., Bollobás, B., Sarkar, A., Walters, M.: Connectivity of random k-nearest-neighbour graphs. Adv. Appl. Prob (SGSA) 37, 1–24 (2005)

    MathSciNet  MATH  Google Scholar 

  5. Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Commun. ACM 33(6), 668–676 (1990)

    Article  Google Scholar 

  6. Xue, F., Kumar, P.R.: The number of neighbors needed for the connectivity of wireless networks. Wirel. Netw. 10, 169–181 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology, New Delhi, 110016, India

    Amitabha Bagchi, Adit Madan & Achal Premi

Authors
  1. Amitabha Bagchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adit Madan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Achal Premi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Christian Scheideler, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Christian Scheideler

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bagchi, A., Madan, A., Premi, A. (2010). Brief Announcement: Hierarchical Neighbor Graphs: A Sparse Connected Structure for Euclidean Point Sets. In: Scheideler, C. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2010. Lecture Notes in Computer Science, vol 6451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16988-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16988-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16987-8

  • Online ISBN: 978-3-642-16988-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation