Beacon-Based Algorithms for Geometric Routing-Reference-Cited by-同舟云学术

Beacon-Based Algorithms for Geometric Routing

Published:2013 Issue: Volume: Page:158-169
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Biro Michael,Iwerks Justin,Kostitsyna Irina,Mitchell Joseph S. B.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-40104-6_14

Reference13 articles.

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)

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)

3. Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.: Beacon-based routing and coverage. In: 21st Fall Workshop on Computational Geometry (2011)

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)

5. Iwerks, J.: Combinatorics and complexity in geometric visibility problems. Dissertation, Stony Brook University (2012)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons;Lecture Notes in Computer Science;2023-12-09

2. On Landmark Distances in Polygons;Computer Graphics Forum;2021-08

3. Attraction-convexity and normal visibility;Computational Geometry;2021-06

4. Negative Instance for the Edge Patrolling Beacon Problem;Discrete and Computational Geometry, Graphs, and Games;2021

5. Combinatorics of beacon-based routing in three dimensions;Computational Geometry;2020-12