Beacon-Based Algorithms for Geometric Routing
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.
Unable to display preview. Download preview PDF.
- 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.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.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.Iwerks, J.: Combinatorics and complexity in geometric visibility problems. Dissertation, Stony Brook University (2012)Google Scholar
- 6.Biro, M.: Beacon-based routing and guarding. Dissertation, Stony Brook University (2013)Google Scholar
- 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.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.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
- 13.Mouawad, N.: Minimal obscuring sets. Master’s thesis, McGill University (1990)Google Scholar