IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-48271-0_17.html
   My bibliography  Save this book chapter

A One-Pass Heuristic for Cooperative Communication in Mobile Ad Hoc Networks

In: Cooperative Systems

Author

Listed:
  • Clayton W. Commander

    (Munitions Directorate
    University of Florida)

  • Carlos A. S. Oliveira

    (School of Industrial Engineering and Management Oklahoma State University)

  • Panos M. Pardalos

    (University of Florida)

  • Mauricio G. C. Resende

    (Internet and Network Systems Research Center AT&T Labs Research)

Abstract

Summary Ad hoc networks have been used in the last few years to provide communications means among agents that need to accomplish common goals. Due to the importance of communication for the success of such missions, we study the problem of maximizing communication among a set of agents. As a practical tool to solve such problems, we introduce a one-pass randomized algorithm that maximizes the total communication, as measured by the proposed objective function. Agents in this problem are routed along the edges of a graph, connecting their individual starting nodes to their respective destination nodes. This problem, known as the Cooperative Communication Problem in Mobile Ad Hoc Networks, is known to be NP-hard. We present a new heuristic and motivate the need for more advanced methods for the solution of this problem. In particular, we describe 1) a construction algorithm and 2) a local improvement method for maximizing communication. Computational results for the proposed approach are provided, showing that instances of realistic size can be efficiently solved by the algorithm.

Suggested Citation

  • Clayton W. Commander & Carlos A. S. Oliveira & Panos M. Pardalos & Mauricio G. C. Resende, 2007. "A One-Pass Heuristic for Cooperative Communication in Mobile Ad Hoc Networks," Lecture Notes in Economics and Mathematical Systems, in: Don Grundel & Robert Murphey & Panos Pardalos & Oleg Prokopyev (ed.), Cooperative Systems, pages 285-296, Springer.
    • Handle: RePEc:spr:lnechp:978-3-540-48271-0_17
    DOI: 10.1007/978-3-540-48271-0_17
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:lnechp:978-3-540-48271-0_17. 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.