Joint base station placement and fault-tolerant routing in wireless sensor networks

Authors:
Dejun Yang;Satyajayant Misra;Guoliang Xue
Affiliations:
Arizona State University, Tempe, AZ;New Mexico State University, Las Cruces, NM;Arizona State University, Tempe, AZ
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 5
Cited 1

Error control systems for digital communication and storage

Error control systems for digital communication and storage
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Linear Programming and Network Flows

Linear Programming and Network Flows
The capacity of wireless networks

IEEE Transactions on Information Theory

A delay-tolerant framework for integrated RSNs in IoT

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limited research has been done on the joint base station placement and fault-tolerant routing problem. To fill this void, we study this problem and present a fully polynomial time approximation scheme in this paper. Our scheme can compute a (1 - Ɛ)- approximation with a running time bounded by a polynomial in 1/Ɛ and the input size of the instance. Despite our solution is presented for the model where the base station can be placed anywhere, however it can be easily extended to cases where forbidden areas are present or candidate locations for the base station are given. To the best of our knowledge, this paper is the first theoretical result on this problem.