Distributed spanners with bounded degree for wireless ad hoc networks

International Journal of Foundations of Computer Science

Volumn 14, Issue 2, 2003, Pages 183-200

  Wang, Yu ^a   Li, Xiang Yang ^a   Frieder, Ophir ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Optimization; Power Consumption; Spanner; Topology Control; Wireless Ad Hoc Networks

Indexed keywords

EID: 84892761575     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001674     Document Type: Article

References (20)

1. ARYA, S., DAS, G., MOUNT, D., SALOWE, J., AND SMID, M. Euclidean spanners: short, thin, and lanky. In Proc. 27th ACM STOC (1995), pp. 489-498.
2. BOSE, P., DEVROYE, L., EVANS, W., AND KIRKPATRICK, D. On the spanning ratio of gabriel graphs and beta-skeletons. In Proceedings of the Latin American Theoretical Infocomatics (LATIN) (2002).
3. BOSE, P., MORIN, P., STOJMENOVIC, I., AND URRUTIA, J. Routing with guaranteed delivery in ad hoc wireless networks. ACM/Kluwer Wireless Networks 7, 6 (2001), 609-616. 3rd int. Workshop on Discrete Algorithms and methods for mobile computing and communications, 1999, 48-55.
4. EPPSTEIN, D. Beta-skeletons have unbounded dilation. Tech. Rep. ICS-TR-96-15, University of California, Irvine, 1996.
5. GABOW, H. N., BENTLY, J. L., AND TARJAN, R. E. Scaling and related techniques for geometry problems. In ACM Symposium on Theory of Computing (1984), pp. 135-143.
6. GRUNEWALD, M., LUKOVSZKI, T., SCHINDELHAUER, C., AND VOLBERT, K. Distributed maintenance of resource efficient wireless network topologies, 2002. Submitted for publication.
7. HUNT III, H. B., MARATHE, M. V., RADHAKRISHNAN, V., RAVI, S. S., ROSENKRANTZ, D. J., AND STEARNS, R. NC-approximation schemes for NP-and PSPACE -hard problems for geometric graphs. J. Algorithms 26, 2 (1999), 238-274.
8. JAROMCZYK, J., AND TOUSSAINT, G. Relative neighborhood graphs and their relatives. Proceedings of IEEE 80, 9 (1992), 1502-1517.
9. KARP, B., AND KUNG, H. Gpsr: Greedy perimeter stateless routing for wireless networks. In Proc. of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom) (2000).
10. KATAJAINEN, J. The region approach for computing relative neighborhood graphs in the lp metric. Computing 40 (1988), 147-161.
11. KLEINROCK, L., AND SILVESTER, J. Optimum transmission radii for packet radio networks or why six is a magic number. In Proceedings of the IEEE National Telecommunications Conference (1978), pp. 431-435.
12. Li, L., HALPERN, J. Y., BAHL, P., WANG, Y.-M., AND WATTENHOFER, R. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In ACM Symposium on Principle of Distributed Computing (PODC) (2001).
13. Li, X.-Y., STOJMENOVIC, I., AND WANG, Y. Partial delaunay triangulation and degree limited localized bluetooth multihop scatternet formation, 2002. Submitted for publication. The short version appeared at AdHocNow, 2002.
14. Li, X.-Y., WAN, P.-J., AND WANG, Y. Power efficient and sparse spanner for wireless ad hoc networks. In IEEE Int. Conf. on Computer Communications and Networks (ICCCN01) (2001), pp. 564-567.
15. Li, X.-Y., WAN, P.-J., WANG, Y., AND FRIEDER, O. Sparse power efficient topology for wireless networks. In IEEE Hawaii Int. Conf. on System Sciences (HICSS) (2002).
16. LUKOVSZKI, T. New Results on Geometric Spanners and Their Applications. PhD thesis, University of Paderborn, 1999.
17. SEDDIGH, M., GONZALEZ, J. S., AND STOJMENOVIC, I. Rng and internal node based broadcasting algorithms in wireless one-to-one networks. ACM Mobile Computing and Communications Review 5, 2 (2001).
18. STOJMENOVIC, I. Dominating set based bluetooth scatternet formation with localized maintenance. In Proc. of Workshop on Advances in Parallel and Distributed Computational Models, at IEEE Int. Parallel and Distributed Processing Symposium (2002).
19. WATTENHOFER, R., LI, L., BAHL, P., AND WANG, Y.-M. Distributed topology control for wireless multihop ad-hoc networks. In IEEE INFOCOM'01 (2001).
20. YAO, A. C.-C. On constructing minimum spanning trees in k-dimensional spaces and related problems. SI AM J. Computing 11 (1982), 721-736.