Mobility Model and Relay Management for Disaster Area Wireless Networks

Authors:
Wenxuan Guo;Xinming Huang
Affiliations:
Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA 01609;Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA 01609
Venue:
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Year:
2008

Citing 6
Cited 0

Computing the block triangular form of a sparse matrix

ACM Transactions on Mathematical Software (TOMS)
On the Performance of a Hybrid Wireless Network for Emergency Communications in Disaster Areas

ICNS '07 Proceedings of the Third International Conference on Networking and Services
Event-driven, role-based mobility in disaster recovery networks

Proceedings of the second ACM workshop on Challenged networks
Modelling mobility in disaster area scenarios

Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Communications Support for Disaster Recovery Operations using Hybrid Mobile Ad-Hoc Networks

LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Characterisation and Modelling of Voice Traffic in First Responder Networks

LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.