Beacon-Based Algorithms for Geometric Routing

  • Michael Biro
  • Justin Iwerks
  • Irina Kostitsyna
  • Joseph S. B. Mitchell
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8037)

Abstract

We consider beacons, an analog of geographical greedy routing, motivated by sensor network applications. A beacon b is a point object that can be activated to create a ‘magnetic pull’ towards itself everywhere in a polygonal domain P. We explore the properties of beacons and their effect on points in polygons, as well as demonstrate polynomial-time algorithms to compute a variety of structures defined by the action of beacons on P. We establish a polynomial-time algorithm for routing from a point s to a point t using a discrete set of candidate beacons, as well as a 2-approximation and a PTAS for routing between beacons placed without restriction in P.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6), 609–616 (2001)MATHCrossRefGoogle Scholar
  2. 2.
    Karp, B., Kung, H.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243–254. ACM (2000)Google Scholar
  3. 3.
    Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.: Beacon-based routing and coverage. In: 21st Fall Workshop on Computational Geometry (2011)Google Scholar
  4. 4.
    Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.: Beacon-based structures in polygonal domains. In: CG:YRF 2012, Abstracts of the 1st Computational Geometry: Young Researchers Forum (2012)Google Scholar
  5. 5.
    Iwerks, J.: Combinatorics and complexity in geometric visibility problems. Dissertation, Stony Brook University (2012)Google Scholar
  6. 6.
    Biro, M.: Beacon-based routing and guarding. Dissertation, Stony Brook University (2013)Google Scholar
  7. 7.
    Fang, Q., Gao, J., Guibas, L., de Silva, V., Zhang, L.: GLIDER: Gradient landmark-based distributed routing for sensor networks. In: Proceedings of the IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2005, vol. 1, pp. 339–350. IEEE (2005)Google Scholar
  8. 8.
    Fonseca, R., Ratnasamy, S., Zhao, J., Ee, C., Culler, D., Shenker, S., Stoica, I.: Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In: Proceedings of the 2nd Conference on Symposium on Networked Systems Design & Implementation, vol. 2, pp. 329–342. USENIX Association (2005)Google Scholar
  9. 9.
    Nguyen, A., Milosavljevic, N., Fang, Q., Gao, J., Guibas, L.: Landmark selection and greedy landmark-descent routing for sensor networks. In: 26th IEEE International Conference on Computer Communications, INFOCOM 2007, pp. 661–669. IEEE (2007)Google Scholar
  10. 10.
    Chazelle, B.: Triangulating a simple polygon in linear time. Discrete & Computational Geometry 6(1), 485–524 (1991)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Bar-Yehuda, R., Chazelle, B.: Triangulating disjoint jordan chains. International Journal of Computational Geometry and Applications 4(4), 475–481 (1994)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Fournier, A., Montuno, D.Y.: Triangulating simple polygons and equivalent problems. ACM Transactions on Graphics (TOG) 3(2), 153–174 (1984)MATHCrossRefGoogle Scholar
  13. 13.
    Mouawad, N.: Minimal obscuring sets. Master’s thesis, McGill University (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Michael Biro
    • 1
  • Justin Iwerks
    • 1
  • Irina Kostitsyna
    • 1
  • Joseph S. B. Mitchell
    • 1
  1. 1.Stony Brook UniversityUSA

Personalised recommendations