Sparse power efficient topology for wireless networks

Proceedings of the Annual Hawaii International Conference on System Sciences

Volumn 2002-January, Issue , 2002, Pages 3839-3848

  Li, Xiang Yang ^a   Wan, Peng Jun ^a   Wang, Yu ^a   Frieder, O ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Broadcasting; Energy consumption; Mobile ad hoc networks; Multicast communication; Network topology; Protocols; Routing; Scalability; Unicast; Wireless networks

Indexed keywords

BROADCASTING; ENERGY UTILIZATION; MOBILE AD HOC NETWORKS; NETWORK PROTOCOLS; POWER MANAGEMENT (TELECOMMUNICATION); SCALABILITY; TELECOMMUNICATION NETWORKS; TOPOLOGY; WIRELESS NETWORKS;

MULTICAST COMMUNICATION; NETWORK TOPOLOGY; POWER EFFICIENT; PROXIMITY GRAPHS; ROUTING; STRETCH FACTOR; UNICAST; UNIT DISK GRAPHS;

WIRELESS AD HOC NETWORKS;

EID: 84948650802     PISSN: 15301605     EISSN: None     Source Type: Journal    
DOI: 10.1109/HICSS.2002.994518     Document Type: Article

References (17)

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. ARYA, S., AND SMID, M. Efficient construction of a bounded degree spanner with low weight. In Proc. 2nd Annu. European Sympos. Algorithms (ESA), volume 855 of Lecture Notes in Computer Science (1994), pp. 48-59.
3. BOSE, P., DEVROYE, L., EVANS, W., AND KIRKPATRICK, D. On the spanning ratio of Gabriel graphs and β-skeletons. Submitted to SIAM Journal on Discrete Mathematics, 2001.
4. BOSE, P., MORIN, P., STOJMENOVIC, I., URRUTIA, J. Routing with guaranteed delivery in ad hoc wireless networks. 3rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (1999).
5. DATTA S., STOJMENOVIC, I., WU, J. Internal node and shortcut based routing with guaranteed delivery in wireless networks, Cluster Computing, to appear.
6. 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.
7. p metric. Computing 40 (1988), 147-161.
8. KEIL, J. M., AND GUTWIN, C. A. Classes of graphs which approximate the complete euclidean graph. Discrete Computational Geometry 7 (1992).
9. LI, X.-Y., AND WAN, P.-J. Constructing minimum energy mobile wireless networks. In ACM MobiHoc, 2001.
10. LI, X.-Y., WAN, P.-J., AND WANG, Y. Power efficient and sparse spanner for wireless ad hoc networks. in IEEE IC3N, 2001.
11. RODOPLU, V., AND MENG, T. H. Minimum energy mobile wireless networks. In Proceedings of the 1998 IEEE International Conference on Communications, ICC'98 (1998), vol. 3.
12. M. SEDDIGH, J. SOLANO AND I. STOJMENOVIC RNG and internal node based broadcasting algorithms for wireless one-to-one networks, ACM Mobile Computing and Communications Review, Vol. 5, No. 2, 2001, to appear.
13. STOJMENOVIC I., DATTA, S., Power and cost aware localized routing with guaranteed delivery in wireless networks, manuscript, 2001.
14. STOJMENOVIC, I., LIN, X. Power-aware localized routing in wireless networks. In IEEE Int. Parallel and Distributed Processing Symp. (2000).
15. WAN, P.-J., CALINESCU, G., LI, X.-Y., AND FRIEDER, O. Minimum-energy broadcast routing in static ad hoc wireless networks. In IEEE Infocom (2001).
16. WATTENHOFER, R., LI, L., BAHL, P., AND WANG, Y.-M. Distributed topology control for wireless multihop ad-hoc networks. In IEEE INFOCOM'01 (2001).
17. YAO, A. C.-C. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Computing 11 (1982), 721-736.