Skip to main content

Advertisement

SpringerLink
Log in

Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper, we present three schemes to solve minimum total energy broadcasting problem in wireless ad hoc networks based on an efficient IP (integer programming) subproblem technique. Due to its NP-hardness, many heuristics have been studied. However, the heuristics in the literature suffer from coarse performance ratio. It is important to have knowledge of the optimal solution structure in order to develop more efficient heuristics and algorithms. We present one IP formulation and two iterative algorithms which make use of relaxed IP's to solve subproblems. The computational results show that our approaches outperform other techniques in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Cagalj M, Hubaux JP, 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. Mathematics of Operations Research 4: 233–235

    MATH  MathSciNet  Google Scholar 

  • Das AK, Marks RJ, El-Sharkawi M, Arabshahi P, Gray A (2003) Minimum power broadcast trees for wireless networks: Integer programming formulations. In: Proceedings of INFOCOM

  • Diot C, Dabbous W, Crowcroft J (1997) A survey of combinatorial optimization problems in multicast routing. IEEE Journal on Selected Areas in Communications 15: 277–290

    Article  Google Scholar 

  • Garey MR, Johnson DS (1979) computers and intractibility: A guide to the theory of NP-completeness W. H. Freeman, San Francisco

    Google Scholar 

  • Miller LB, Tucker AW, Zemlin RA (1960) Integer programming formulations of traveling salesman problems. Journal for the Association for Computing Machinery 7:326–329

    MathSciNet  Google Scholar 

  • Min M, Pardalos PM (2005) OMEGa: An optimistic most energy gain method for minimum energy broadcasting in wireless ad hoc Networks. Submitted for publication

  • Min M, Pardalos PM (2005) Total energy optimal multicasting in wireless ad hoc networks, Submitted for publication

  • Montemanni R, Gambardella LM (2004) Minimum power symmetric connectivity problem in wireless networks: A new approach. In: Proceedings of IEEE International Conference on Mobile and Wireless Communication Networks

  • Oliveira CAS, Pardalos PM (2005) A survey of combinatorial optimization problems in multicast routing. Computers & Operations Research 23:1953–1981

    Google Scholar 

  • Papadimitriou I, Georgiadis L (2004) Energy-aware broadcast trees in wireless networks. Mobile Networks and Applications 9:567–581

    Article  Google Scholar 

  • Tseng Y-C, Ni S-Y, Chen Y-S, Sheu J-P (2002) The broadcast storm problem in a mobile ad hoc network. Wireless Networks 8:153–167

    Article  Google Scholar 

  • Wan P-J, Calinescu G, Li X-Y, Frieder O (2002) Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks 8:607–617

    Google Scholar 

  • Wan P-J, Calinescu G, Yi C-W (2004) Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Transactions on Networking 12:507–514

    Google Scholar 

  • Wieselthier JE, Nguyen GD, Ephremides A (2002) Energy-efficient broadcast and multicast trees in wireless networks. Mobile Networks and Applications 7:481–492

    Article  Google Scholar 

  • Yuan D (2005) Computing optimal or near-optimal trees for minimum-energy broadcasting in wireless networks. In: Proceedings of International symposyum on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, pp. 323–331

  • ILOG CPLEX 9.0. http://www.ilog.com/products/cplex/

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611, USA

    Manki Min, Oleg Prokopyev & Panos M. Pardalos

Authors
  1. Manki Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oleg Prokopyev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manki Min.

Additional information

Research is partially supported by NSF and Air Force grants.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Min, M., Prokopyev, O. & Pardalos, P.M. Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks. J Comb Optim 11, 59–69 (2006). https://doi.org/10.1007/s10878-006-5977-8

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-006-5977-8

Keywords

Search

Navigation