Paper Info
Title
Dynamic relay deployment for disaster area wireless networks
Abstract
This paper investigates the disaster area communication system using relay-assisted wireless network for first responders as mobile nodes (MNs). Firstly, a novel mobility model is proposed to describe the movement pattern of MNs within a large disaster area. Secondly, we study the relay management problem of finding a minimum number of relay nodes (RNs) and their dynamic locations to cover all the MNs within the disaster area. A square disk cover (SDC) problem is formulated and three different algorithms, including the two-vertex square covering (TVSC) algorithm, the circle covering algorithm and the binary integer programming (BIP) algorithm, are proposed to solve the SDC problem. Simulation results are presented to validate the mobility model and compare the algorithms with respect to computational complexity and worst case performance ratio. Copyright © 2008 John Wiley & Sons, Ltd.
Year
DOI
Venue
2010
10.1002/wcm.v10:9
Wireless Communications and Mobile Computing
Keywords
Field
DocType
dynamic relay deployment,square disk cover,disaster area wireless network,mobility model
Wireless network,Software deployment,Computer science,Computer network,Mobility model,Communications system,Integer programming,Disaster area,Relay,Distributed computing,Computational complexity theory
Journal
Volume
Issue
ISSN
10
9
1530-8669
Citations 
PageRank 
References 
5
0.47
31
Authors
3
Name
Order
Citations
PageRank
Wenxuan Guo1224.70
Xin-ming Huang235646.91
Youjian Liu360549.82