On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays

• Main Authors: Guo Wenxuan, Huang Xinming
• Format: Article
• Language: English
• Published: SpringerOpen 2009-01-01
• Series: EURASIP Journal on Wireless Communications and Networking
• Online Access: http://jwcn.eurasipjournals.com/content/2009/251314

<p/> <p>Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p>