Abstract
In this paper, we present our novel algorithm, SOR (Shrinking Overlapped Range), for the minimum energy multicasting in wireless ad hoc networks. The heuristics in the literature have not considered changing the intermediate tree structure and this may result in worse performance even after local improvements at the end. In SOR, we extensively change the intermediate tree structure to maintain tighter structure in terms of energy consumption. We do so by shrinking the overlapped transmission range following the idea of WMA (wireless multicast advantage) property and by allowing the selection of internal transmissions which further changes the tree structure. Both theoretical analysis and experimental results show SOR outperforms other heuristics in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ambühl C (2005) An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of the 32nd international colloquium on automata, languages and programming (ICALP 2005), LNCS 3580. Springer, pp 1139–1150
Cagalj M, Hubaux J-P, Enz C (2002) Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proceedings of the international conference on mobile computing and networking, pp 172–182
Cheng MX, Sun J, Min M, Du D-Z (2003) Energy-efficient broadcast and multicast routing in ad hoc wireless networks. In: Proceedings of the IEEE international conference on performance, computing, and communications conference, pp 87–94
Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4:233–235
Diot C, Dabbous W, Crowcroft J (1997) A survey of combinatorial optimization problems in multicast routing. IEEE J Selected Areas in Communications 15:277–290
Garey MR, Johnson DS (1979) Computers and intractibility: a guide to the theory of NP-completeness (W. H. Freeman, San Francisco)
Min M, Pardalos PM (2006) OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks. In submission
Min M, Pardalos PM (2006) Shrinking overlapped range for multicasting in wireless ad hoc networks. accepted by INFORMS Telecomm Conf
Min M, Chinchuluun A (2006) Optimization in wireless networks. In: Resende MGC, Pardalos PM (eds) Handbook of Optim Telecommun. Springer Science + Buisiness Media, New York, pp 891–915
Oliveira CAS, Pardalos PM (2005) A survey of combinatorial optimization problems in multicast routing. Comp Oper Res 23:1953–1981
Papadimitriou I, Georgiadis L (2004) Energy-aware broadcast trees in wireless networks. Mobile Netw Appl 9:567–581
Tseng Y-C, Ni S-Y, Chen Y-S, Sheu J-P (2002) The broadcast storm problem in a mobile ad hoc network. Wireless Netw 8:153–167
Wan P-J, Calinescu G, Li X-Y, Frieder O (2002) Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Netw 8:607–617
Wan P-J, Calinescu G, Yi C-W (2004) Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans Netw 12:507–514
Wieselthier JE, Nguyen GD, Ephremides A (2002) Energy-efficient broadcast and multicast trees in wireless networks. Mobile Netw Appl 7:481–492
CYGWIN.http://www.cygwin.com/
Author information
Authors and Affiliations
Corresponding author
Additional information
Research is partially supported by NSF and Air Force grants.
Rights and permissions
About this article
Cite this article
Min, M., Pardalos, P.M. Total energy optimal multicasting in wireless ad hoc networks. J Comb Optim 13, 365–378 (2007). https://doi.org/10.1007/s10878-006-9033-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-9033-5