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

  • Amitabha Bagchi
  • Adit Madan
  • Achal Premi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bagchi, A., Buchsbaum, A., Goodrich, M.T.: Biased skip lists. Algorithmica 42(1), 31–48 (2005)MathSciNetCrossRefMATHGoogle Scholar
  2. 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. 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. 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)MathSciNetMATHGoogle Scholar
  5. 5.
    Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Commun. ACM 33(6), 668–676 (1990)CrossRefGoogle Scholar
  6. 6.
    Xue, F., Kumar, P.R.: The number of neighbors needed for the connectivity of wireless networks. Wirel. Netw. 10, 169–181 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Amitabha Bagchi
    • 1
  • Adit Madan
    • 1
  • Achal Premi
    • 1
  1. 1.Indian Institute of TechnologyNew DelhiIndia

Personalised recommendations