Mobile - Wireless Communications White Papers
A One-Pass Heuristic for Cooperative Communication in Mobile Ad Hoc Networks
Overview Ad hoc networks are used to provide communications means among agents that need to accomplish common goals. Due to the importance of communication for the success of such missions, this paper studies the problem of maximizing communication among a set of agents. As a practical tool to solve such problems, the paper introduces 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 destinations nodes. This problem, known as the Cooperative Communication Problem in Mobile Ad Hoc Networks, is known to be NP-hard.
| Publisher | University of Florida | File Format | |
|---|---|---|---|
| Date Published | March 2006 | Downloads | 1 |
| Format | White Papers | ||
| Topics | |||



