Constructing minimum-energy broadcast trees in wireless ad hoc networks

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2002, Pages 112-122

  Liang, Weifa ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Ad hoc networks; Approximate algorithm; Broadcast and multicast algorithm; Energy consumption optimization; Power awareness; Wireless network

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; ELECTRIC POWER SUPPLIES TO APPARATUS; GRAPH THEORY; MULTICASTING; OPTIMIZATION; PERFORMANCE; ROUTERS; THEOREM PROVING;

MINIMUM-ENERGY BROADCAST TREE PROBLEM; MINIMUM-ENERGY MULTICAST TREE PROBLEM; POWER AWARENESS; WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0242443803     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513800.513815     Document Type: Conference Paper

References (19)

1. D. J. Baker and A. Ephremides. The architectural organization of a mobile radio network via distributed algorithm. IEEE Trans. Commun, Vol. COM-29, pp. 56-73, 1981.
2. J-H Chang and L. Tassiulas. Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks. IFIP-TC6/European Commission Int'l Conf., Lecture Notes in Computer Science, Vol. 1815, pp. 702-713, Springer, 2000.
3. I. Chlamtac and A. Farago. A new approach to the design and analysis of peer-to-peer mobile networks. Wireless Networks, Vol. 5, pp. 149-156, 1999.
4. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, Vol. 4(3), pp. 233-235, 1979.
5. M. Charikar, C. Chekuri, T-Y Cheung, Z. Dai, A. Goel, S. Guha and M. Li. Approximation algorithms for directed Steiner problems. J. Algorithms, Vol. 33(1): pp. 73-91, 1999.
6. C.-C Chiang, M. Gerla, and L Zhang. Forwarding group multicast protocol(FGMP) for multihop, mobile wireless networks. Cluster Computing, Vol. 1, pp. 187-196, 1998.
7. A. Ephremides, J. E. Wieselthier, and D. J. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proceedings of the IEEE, Vol. 75, pp. 56-58, 1987.
8. A. Farago, I. Chlamtac, and S. Bassagni. Virtual path network topology optimization using random graphs. Proc. of INFOCOM'99, pp. 491-496, 1999.
9. J.J. Garcia-Luna-Aceves and E.L. Madruga. A Multicast routing protocol for ad-hoc networks. Proc. of INFOCOM'99, New York, 1999.
10. S. Khanna and K. Kumaran. On wireless spectrum estimation and generalized graph coloring. Proc. of INFOCOM'98, pp. 1273-1283, 1998.
11. S.-J. Lee. Routing and Multicast Strategies in Wireless Mobile Networks. Dept. of Computer Sci., UCLA, Los Angeles, 2000.
12. M. Nagy and S. Singh. Multicast scheduling algorithms in mobile networks. Cluster Computing, Vol. 1, pp. 177-185, 1998.
13. K. Makki, N. Pissinou, and O. Frieder. Efficient solutions to multicast routing in communication networks. Mobile Networks and Applications, Vol. 1, pp. 221-232, 1996.
14. C. Perkins and E. M. Royer. Ad Hoc on Demand Distance Vector (AODV) routing. Internet Draft, http://www.ietf.org/internet-drafts/draft-ietf-manet-aodv-01.txt, Aug., 1998.
15. R. Ramanathan and R. Rosales-Hain. Topology control of multihop wireless networks using transmit power adjustment. Proc. of INFOCOM'00, 2000.
16. T. S. Rappaport. Wireless Communications, Principles and Practice. Prentice-Hall, 1996.
17. V. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. Proc. of ICC'98, Vol. 3, pp. 1633-1639, 1998.
18. S. Singh, M. Woo, and C.S. Raghavendra. Power-aware routing in mobile ad hoc networks. Proc. of MOBICOM'98, pp. 181-190, 1998.
19. J.E. Wieselthier, G. D Nguyen and A. Ephremides. On construction of energy-efficient broadcast and multicast trees in wireless networks. Proc. of INFOCOM'00, 2000.