On the complexity and distributed construction of energy-efficient broadcast trees in wireless ad hoc networks

IEEE Transactions on Wireless Communications

Volumn 4, Issue 5, 2005, Pages 2136-2147

  Ahluwalia, Ashwinder S ^b,c   Modiano, Eytan H ^a,b,d  

^a IEEE   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c ORACLE CORPORATION   (United States)

^d USA   (United States)

Author keywords

Broadcast; Complexity; Energy efficiency; Wireless networks

Indexed keywords

BROADCAST; COMPLEXITY; WIRELESS NETWORKS;

ALGORITHMS; BROADCASTING; ENERGY EFFICIENCY; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 28444480719     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2005.853824     Document Type: Article

References (18)

1. E. Royer and C. K. Toh, "A review of current routing protocols for ad hoc wireless networks," IEEE Pers. Commun., vol. 6, no. 2, pp. 46-55, Apr. 1999.
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
3. _, "The rectilinear Steiner problem is NP-complete," SIAM J. Appl. Math., vol. 32, no. 4, pp. 826-834, Jun. 1977.
4. R. Tamassia and I. G. Tollis, "Planar grid embedding in linear time," IEEE Trans. Circuits Syst., vol. 36, no. 9, pp. 1230-1234, Sep. 1989.
5. B. N. Clark, C. J. Colbourn, and D. S. Johnson, "Unit disk graphs," Discrete Math., vol. 86, no. 1-3, pp. 165-177, 1990.
6. W. T. Chen and N. F. Huang, "The strongly connecting problem on multihop packet radio networks," IEEE Trans. Commun., vol. 37, no. 3, pp. 293-295, Oct. 1989.
7. P. A. Humblet, "A distributed algorithm for minimum weight directed spanning trees," IEEE Trans. Commun., vol. 31, no. 6, pp. 756-762, Jun. 1983.
8. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proc. IEEE Conf. Computer Communications (INFOCOM), Tel Aviv, Israel, Mar. 2000, pp. 585-594.
9. B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," in Proc. Int. Conf. Communications (ICC), Montreal, QC, Canada, 1997, pp. 376-380.
10. B. Daneshrad, Variable Rate Low Power FHSS Baseband Processor. [Online]. Available: http://www.ee.ucla.edu/~babak/thss/thss.html
11. M. B. Pursley, H. B. Russell, and J. S. Wysocarski, "Energy- efficient transmission and routing protocols for wireless multiple-hop networks and spread-spectrum radios," in AFCEA/IEEE EuroComm Conf., Munich, Germany, May 17-19, 2000, pp. 1-5.
12. N. Jindal and A. Goldsmith, "Capacity and optimal power allocation for fading broadcast channels with minimum rates," in IEEE Global Telecom-munications (GLOBECOM), San Antonio, TX, 2001, pp. 1292-1296.
13. S. Kandukuri and S. Boyd, "Optimal power control in interference limited fading wireless channels with outage probability specifications," IEEE J. Sel. Areas Commun., Wirel. Commun. Series, vol. 1, no. 1, pp. 46-55, 2001.
14. K. Leung, "Integrated link adaptation and power control for wireless IP networks," in Proc. IEEE Vehicular Technology Conf. (VTC), Tokyo, Japan, May 2000, pp. 2086-2092.
15. P.-J. Wan, G. Calinescu, X.-Y. Li, and O. Frieder, "Minimum-energy broadcast routing in static ad hoc wireless networks," in Proc. IEEE Conf. Computer Communications (INFOCOM), Anchorage, AK, 2001, vol. 2, pp. 1162-1171.
16. V. Rodoplu and T. H. Meng, "Minimum energy mobile wireless networks," IEEE J. Sel. Areas Commun., vol. 17, no. 8, pp. 1333-1344, Aug. 1999.
17. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1991.
18. P. Krishna, N. H. Vaidya, M. Chatterjee, and D. K. Pradhan, "A cluster-based approach for routing in dynamic networks," in Proc. ACM SIG-COMM Comput. Commun. Rev., 1997, vol. 27, pp. 49-64.