Download now Free registration required
Inter-domain networking in MANETs is an important capability for various coalition operations in real life. Current inter-domain networking solutions typically rely on gateways for protocol translation, inter-domain route update, and policy enforcement. Previous work assumed that the gateway functionalities are statically assigned to a subset of nodes. While this approach will work well in a static scenario, it may not be effective in MANET due to node mobility. In this paper, the authors develop distributed mechanisms to elect minimal number of gateways while ensuring all eligible network partitions are connected. To this aim, they formulate a novel graph optimization problem, called minimal gateway assignment problem, and formally prove its hardness. They then design efficient algorithms to solve this problem with varying degree of complexity and coordination.
- Format: PDF
- Size: 371.2 KB