Mobility Model and Relay Management for Disaster Area Wireless Networks

摘要

This paper investigates the disaster area communication system using relay-assisted wireless networks. At first, a novel mobility model is proposed to describe the movement pattern of the first responders as Mobile Nodes (MNs) within a large disaster area. Secondly, we study the relay management of placing a fixed number of Relay Nodes (RNs) to cover as many MNs as possible within the disaster area. We first formulate the Mobile Node Association (MNA) problem, and propose a Bipartite-graph based Approach (BA). Afterwards, a Relay Node Placement (RNP) problem is formulated and two different algorithms, including the Constrained Exhaustive Search (CES) algorithm as the optimal solution and the Bipartite graph based Incremental Greedy (BIG) algorithm. Simulation results are presented to compare the performance of two algorithms, which show that the BIG algorithm can produce near-optimal solutions but with significantly reduced computational complexity.