IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v16y2008i1d10.1007_s10878-007-9100-6.html
   My bibliography  Save this article

OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks

Author

Listed:
  • Manki Min

    (South Dakota State University,)

  • Panos M. Pardalos

    (University of Florida)

Abstract

In wireless ad hoc networks where every device runs on its own battery, the energy consumption is critical to lengthen the network lifetime. The communication among devices in the network can be categorized as unicasting and multicasting (including broadcasting). For the case of unicasting, computing the energy optimal path between the two communicating nodes is polynomially solvable by computing the shortest path. But for the case of multicasting, shortest path or minimum spanning tree does not guarantee an energy optimal communication. In this paper, we present our novel approach, Optimistic Most Energy Gain (OMEGa) method, for the minimum energy multicasting in wireless ad hoc networks. OMEGa aims at maximum utilization of Wireless Multicast Advantage (WMA), which essentially means covering more nodes by using larger energy. Both theoretical and experimental analysis shows OMEGa method performs very well.

Suggested Citation

  • Manki Min & Panos M. Pardalos, 2008. "OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks," Journal of Combinatorial Optimization, Springer, vol. 16(1), pages 81-95, July.
    • Handle: RePEc:spr:jcomop:v:16:y:2008:i:1:d:10.1007_s10878-007-9100-6
    DOI: 10.1007/s10878-007-9100-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-007-9100-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-007-9100-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:16:y:2008:i:1:d:10.1007_s10878-007-9100-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.