Discrete optimization models for cooperative communication in ad hoc networks

Authors:
Carlos A. S. Oliveira
Affiliations:
School of Industrial Engineering and Management, Oklahoma State University, Stillwater, OK
Venue:
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Year:
2006

Citing 5
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network.

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Graph-Based Mobility Model for Mobile Ad Hoc Network Simulation

SS '02 Proceedings of the 35th Annual Simulation Symposium
Routing in Ad Hoc Networks of Mobile Hosts

WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
Securing ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ad hoc networks have recently been used as a communications medium on tasks that require high levels of communication and coordination. We study the problem of determining an optimal route for a group of wireless units, such that the total connection time among nodes in the resulting mobile ad hoc network is maximized, subject to a limit on the traveled distance. This problem, called the cooperative communication problem in mobile ad hoc networks (CCPM), is modeled using combinatorial optimization and mathematical programming techniques. Applications occur on the coordination of rescue groups, geographical exploration and recognition, unmanned air vehicles (UAVs), and mission coordination. The problem is shown to be NP-hard, and a dynamic programming algorithm is proposed for the problem. Mathematical programming models are presented and computational experiments performed.