Local construction of planar spanners in unit disk graphs with irregular transmission ranges

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3887 LNCS, Issue , 2006, Pages 286-297

  Chávez, Edgar ^a   Dobrev, Stefan ^b   Kranakis, Evangelos ^c   Opatrny, Jaroslav ^d   Stacho, Ladislav ^e   Urrutia, Jorge ^f  

^a UNIVERSIDAD MICHOACANA DE SAN NICOLÁS DE HIDALGO   (Mexico)

^b UNIVERSITY OF OTTAWA   (Canada)

^c CARLETON UNIVERSITY   (Canada)

^d Dept of Electrical and Computer Engineering   (Canada)

^e SIMON FRASER UNIVERSITY   (Canada)

^f UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ELECTROMAGNETIC WAVE TRANSMISSION; INTEGER PROGRAMMING; PARAMETER ESTIMATION; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

EUCLIDEAN LENGTHS; EUCLIDEAN SPANNING TREE; PLANAR SPANNERS; UNIT DISK GRAPH;

GRAPH THEORY;

EID: 33745612445     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_29     Document Type: Conference Paper

References (20)

1. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: Short, thin, and lanky. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 489-498, Las Vegas, Nevada, 29 May-1 June 1995.
2. S. Arya and M. Smid. Efficient construction of a bounded degree spanner with low weight. Algorithmica, 17:33-54, 1997.
3. L. Barrière, P. Fraigniaud, L. Narayanan, and J. Opatrny. Robust position-based routing in wireless ad-hoc networks with irregular transmission ranges. Wireless Communications and Mobile Computing Journal, 2003.
4. P. Bose, J. Gudmundsson, and M. Smid. Constructing plane spanners of bounded degree and low weight. Algorithmica, to appear.
5. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7:609-616, 2001.
6. G. Das and G. N. J. Salowe. A new way to weigh malnourished euclidean graphs. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisco, California, January 22-24, 1995), pages 215-222, Philadelphia, PA, 1995. ACM SIGACT, SIAM, Society for Industrial and Applied Mathematics.
7. P. Doyle and J. Snell. Random Walks and Electric Networks. The Carus Mathematical Monographs. The Mathematical Association of America, 1984.
8. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. Elsevier, 2000.
9. K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systemic Zoology, 18:259-278, 1972.
10. H. H. III, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns. Nc-approximation schemes for np- and pspace-hard problems for geometric graphs. J. Algorithms, 26(2):238n-274, 1998.
11. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proc. of 11th Canadian Conference on Computational Geometry, pages 51-54, August 1999.
12. J. B. Kruskal, Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7:48-50, 1956.
13. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric ad-hoc routing: of theory and practice. In Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC 2003), July 13-16, 2003, Boston, Massachusetts, USA. ACM, pages 63-72. ACM Press, 2003.
14. F. Kuhn, R. Wattenhofer, and A. Zollinger. Asymptotically optimal geometric mobile ad-hoc routing. In Proceedings of 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M), pages 24n-33. ACM Press, 2002.
15. X.-Y. Li, G. Calinescu, and P.-J. Wan. Distributed construction of planar spanner and routing for ad hoc wireless networks. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-02), pages 1268-1277, Piscataway, NJ, USA, June 23-27 2002.
16. X.-Y. Li and Y. Wang. Efficient construction of low weight bounded degree planar spanner. In COCOON: Annual International Conference on Computing and Combinatorics, 2003.
17. X.-Y. Li, Y. Wang, and W.-Z. Song. Applications of k-local mst for topology control and broadcasting in wireless ad hoc networks. In Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-04), Piscataway, NJ, USA, Mar. 7-11 2004.
18. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing, 30(3):978-989, June 2001.
19. G. T. Toussaint. The relative neighborhood graph of a finite set. Pattern Recognition, 12:261-268, 1980.
20. Y. Wang and X.-Y. Li. Localized construction of bounded degree and planar spanner for wireless ad hoc networks. In DialM: Proceedings of the Discrete Algorithms and Methods for Mobile Computing & Communications, 2003.