Computing optimal or near-optimal trees for minimum-energy broadcasting in wireless networks

Proceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

Volumn 2005, Issue , 2005, Pages 323-331

  Yuan, Di ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; ENERGY UTILIZATION; MATHEMATICAL PROGRAMMING; OPTIMIZATION; TREES (MATHEMATICS);

BROADCAST INCREMENTAL POWER (BIP); INTEGER PROGRAMMING FORMULATION; MINIMUM-ENERGY BROADCASTING; OPTIMAL TREES;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 32944456447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIOPT.2005.16     Document Type: Conference Paper

References (23)

1. K. Altinkemer, F. S. Salmon, and P. Bellur. Solving the minimum energy broadcasting problem in ad hoc wireless networks by integer programming. In Proceedings of the Second Workshop on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt '04), pages 48-54, 2004.
2. J. Slum, M. Ding, A. Thaeler, and X. Cheng. Connected dominating set in sensor networks. In D.-Z. Du and P. Pardalos, editors, Handbook of Combinatorial Optimization, pages 329-369. Kluwer Academic Publishers, 2004.
3. M. Čagalj and J.-P. Hubaux. Energy-efficient broadcasting in all-wireless networks. Mobile Networks and Applications (MONET). In press.
4. M. Čagalj, J.-P. Hubaux, and C. Enz. Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In Proceedings of the 8th Annual International Conference on Mobile Computing and Networking (MobiCom '02), pages 172-182, 2002.
5. J. Cartigny, D. Simplot, and I. Stojmenovic. Localized minimum-energy broadcasting in ad-hoc networks. In Proceedings of IEEE INFOCOM '03, pages 2210-2217, 2003.
6. A. K. Das, R. J. Marks, M. El-Sharkawi, P. Arabshahi, and A. Gray. Minimum power broadcast trees for wireless networks: Integer programming formulations. In Proceedings of IEEE INFOCOM '03, pages 1001-1110, 2003.
7. A. K. Das, R. J. Marks, M. El-Sharkawi, P. Arabshahi, and A. Gray. A cluster-merge algorithm for solving the minimum power broadcast problem in large scale wireless networks. In Proceedings of IEEE MILCOM '03, pages 416-421, 2003.
8. A. K. Das, R. J. Marks, M. El-Sharkawi, P. Arabshahi, and A. Gray. r-Shrink: A heuristic for improving minimum power broadcast trees in wireless networks. In Proceedings of IEEE GLOBECOM '03, pages 523-527, 2003.
9. A. K. Das, R. J. Marks, M. El-Sharkawi, P. Arabshahi, and A. Gray. e-Merge: A heuristic for improving minimum power broadcast trees in wireless networks. Technical report, Department of Electrical Engineering, University of Washington, WA, 2003.
10. A. K. Das, M. El-Sharkawi, Robert J. Marks, P. Arabshahi, and A. Gray. Maximization of time-to-first-failure for multicasting in wireless networks : Optimal solution. In Proceedings of IEEE MILCOM '04, 2004.
11. A. K. Das, M. El-Sharkawi, Robert J. Marks, P. Arabshahi, and A. Gray. Minimum hop multicasting in broadcast wireless networks with omni-directional antennas. In Proceedings of IEEE MILCOM '04, 2004.
12. Ö. Eǧecioǧlu and T. F. Gonzalez. Minimum-energy broadcast in simple graphs with limited node power. In Proceedings of IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS) '01, pages 334-338, 2001.
13. L. Gouveia. Using hop-indexed models for constrained spanning and steiner tree models. In B. Sanso and P. Soriano, editors, Telecommunications Network Planning, pages 21-32. Kluwer Academic Publishers, 1999.
14. Hog CPLEX 7.0, user's manual. ILOG, August 2000.
15. W. Liang. Constructing minimum-energy broadcast trees in wireless ad hoc networks. In Proceedings of the Third ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc '02), pages 112-122, 2002.
16. F. Li and I. Nikolaidis. On minimum-energy broadcasting in all-wireless networks. In Proceedings of the 26th Annual. Conference on Local Computer Networks (LCN '01), pages 193-202, 2001.
17. R. J. Marks, A. K. Das, M. El-Sharkawi, P. Arabshahi, and A. Gray. Minimum power broadcast trees for wireless networks: Optimizing using the viability lemma. In Proceedings of the NASA Earth Science Technology Conference, pages 273-276, 2002.
18. R. Montemanni, L. M. Gambardella, and A. K. Das. The minimum power broadcast problem in wireless networks: A simulated annealing approach. Technical report, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, Manno, Switzerland, 2004.
19. I. Papadimitriou and L. Georgiadis. Minimum-energy broadcasting in wireless networks using a single broadcast tree. In Proceedings of the Second Workshop on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt '04), pages 38-47, 2004.
20. P.-J. Wan, G. Cǎlinescu, X.-Y. Li, and O. Frieder. Minimumenergy broadcast routing in static ad hoc wireless networks. In Proceedings of IEEE INFOCOM '01, pages 1162-1171, 2001.
21. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proceedings of IEEE INFOCOM '00, pages 585-594, 2000.
22. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. Algorithms for energy-efficient multicasting in static ad hoc wireless networks. Mobile Networks and Applications (MONET), 6:251-263, 2001.
23. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. Distributed algorithms for energy-efficient broadcasting in ad hoc networks. In Proceedings of IEEE MILCOM '02, pages 820-825, 2002.