Skip to main content

Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs

  • Conference paper
Algorithms and Data Structures (WADS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5664))

Included in the following conference series:

Abstract

In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can assign each vertex of an n–vertex UDG G a compact O(log2 n)-bit label such that, given the label of a source vertex and the label of a destination, it is possible to compute efficiently, based solely on these two labels, a neighbor of the source vertex that heads in the direction of the destination. We prove that this routing labeling scheme has a constant hop route-stretch (= hop delay), i.e., for each two vertices x and y of G, it produces a routing path with h(x,y) hops (edges) such that h(x,y) ≤ 3·d G (x,y) + 12, where d G (x,y) is the hop distance between x and y in G. To the best of our knowledge, this is the first compact routing scheme for UDGs which not only guaranties delivery but has a low hop delay and polylog label size. Furthermore, our routing labeling scheme has a constant length route-stretch.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. of Algorithms 52, 134–151 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alzoubi, K., Li, X.-Y., Wang, Y., Wan, P.-J., Frieder, O.: Geometric spanners for wireless ad hoc networks. IEEE Trans. on Par. and Distr. Syst. 14, 408–421 (2003)

    Article  Google Scholar 

  3. Clark, B.N., Colbourn, C.J.: Unit Disk Graphs. Discrete Math. 86, 165–177 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: 3rd Internat. workshop on discr. algor. and methods for mobile computing and communications, pp. 48–55. ACM Press, New York (1999)

    Google Scholar 

  5. Dragan, F.F., Yan, C., Corneil, D.G.: Collective Tree Spanners and Routing in AT-free Related Graphs. J. of Graph Algor. and Applic. 10(2), 97–122 (2006)

    MathSciNet  MATH  Google Scholar 

  6. Dragan, F.F., Yan, C., Lomonosov, I.: Collective tree spanners of graphs. SIAM J. Discrete Math. 20, 241–260 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fonseca, R., Ratnasamy, S., Zhao, J., Ee, C.T., Culler, D., Shenker, S., Stoica, I.: Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In: 2nd USENIX/ACM Symp. on Netw. Syst. Design and Implement (NSDI 2005) (2005)

    Google Scholar 

  8. Fürer, M., Kasiviswanathan, S.P.: Spanners for geometric intersection graphs. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 312–324. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Fraigniaud, P., Gavoille, C.: Routing in Trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757–772. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: 2nd ACM international symposium on mobile ad hoc networking & computing, Long Beach, CA, USA, October 04-05 (2001)

    Google Scholar 

  11. Gao, J., Zhang, L.: Well-separated pair decomposition for the unit-disk graph metric and its applications. In: STOC 2003, pp. 483–492 (2003)

    Google Scholar 

  12. Giordano, S., Stojmenovic, I.: Position based routing algorithms for ad hoc networks: A taxonomy. In: Ad Hoc Wireless Networking, pp. 103–136. Kluwer, Dordrecht (2004)

    Chapter  Google Scholar 

  13. Gupta, A., Kumar, A., Rastogi, R.: Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). In: FOCS 2001, pp. 148–157 (2001)

    Google Scholar 

  14. Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th ACM/IEEE MobiCom, pp. 243–254. ACM Press, New York (2000)

    Google Scholar 

  15. Kleinberg, R.: Geographic routing using hyperbolic space. In: INFOCOM 2007, pp. 1902–1909 (2007)

    Google Scholar 

  16. Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: PODC 2003, pp. 63–72. ACM Press, New York (2003)

    Google Scholar 

  17. Li, X.-Y.: Ad Hoc Wireless Networking. In: Li, X.-Y. (ed.) Applications of Computational Geomety in Wireless Ad Hoc Networks, Kluwer, Dordrecht (2003)

    Google Scholar 

  18. Li, X.-Y., Wang, Y.: Geometrical Spanner for Wireless Ad Hoc Networks. In: Handbook of Approx. Algorithms and Metaheuristics. Chapman&Hall/Crc, Boca Raton (2006)

    Google Scholar 

  19. Lipton, R.J., Tarjan, R.E.: A Separator Theorem for Planar Graphs. SIAM Journal on Applied Mathematics 36, 177–189 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  20. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Math. Appl. SIAM, Philadelphia (2000)

    Book  MATH  Google Scholar 

  21. Rao, A., Papadimitriou, C., Shenker, S., Stoica, I.: Geographical routing without location information. In: MobiCom 2003, pp. 96–108 (2003)

    Google Scholar 

  22. Thorup, M.: Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. In: FOCS, pp. 242–251 (2001)

    Google Scholar 

  23. Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA 2001, pp. 1–10 (2001)

    Google Scholar 

  24. Yan, C.: Approximating Distances in Complicated Graphs by Distances in Simple Graphs With Applications. PhD Dissertation, Kent State University (2007), http://www.ohiolink.edu/etd/send-pdf.cgi/Yan%20Chenyu.pdf?kent1184639623

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yan, C., Xiang, Y., Dragan, F.F. (2009). Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. In: Dehne, F., Gavrilova, M., Sack, JR., Tóth , C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03367-4_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03367-4_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03366-7

  • Online ISBN: 978-3-642-03367-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics