Communication Models for a Cooperative Network of Autonomous Agents

Ashwin Arulselvan (), Clayton W. Commander (), Michael J. Hirsch () and Panos M. Pardalos ()
Additional contact information
Ashwin Arulselvan: University of Florida
Clayton W. Commander: Munitions Directorate
Michael J. Hirsch: Raytheon Inc
Panos M. Pardalos: University of Florida

A chapter in Optimization and Logistics Challenges in the Enterprise, 2009, pp 411-431 from Springer

Abstract: Summary We consider the problem of maximizing the total connectivity for a set of wireless agents in a mobile ad hoc network. That is, given a set of wireless units each having a start point and a destination point, our goal is to determine a set of routes for the units which maximizes the overall connection time between them. Known as the cooperative communication problem in mobile ad hoc networks (ccpm), this problem has several military applications including coordination of rescue groups, path planning for unmanned air vehicles, and geographical exploration and target recognition. The CCPM is NP-hard; therefore heuristic development has been the major focus of research. In this work, we survey the CCPM examining first some early combinatorial formulations and solution techniques. Then we introduce new continuous formulations and compare the results of several case studies. By removing the underlying graph structure, we are able to create a more realistic model of the problem as supported by the numerical evidence.

Keywords: Local Search; Path Planning; Mixed Integer Linear Program; Greedy Randomize Adaptive Search Procedure; Cooperative Communication (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-88617-6_15

Ordering information: This item can be ordered from
http://www.springer.com/9780387886176

DOI: 10.1007/978-0-387-88617-6_15

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().