Relay node placement in two-tiered wireless sensor networks with base stations

Authors:
Guangting Chen;Suhui Cui
Affiliations:
The Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou, P.R. China 310018;The Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou, P.R. China 310018
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 12
Cited 0

Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
Next century challenges: scalable coordination in sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Research challenges in wireless networks of biomedical sensors

Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Topology control for wireless sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Mobile backbone networks --: construction and maintenance

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Relay Node Placement in Wireless Sensor Networks

IEEE Transactions on Computers
Relay sensor placement in wireless sensor networks

Wireless Networks
Relay node placement in large scale wireless sensor networks

Computer Communications
Constrained relay node placement in wireless sensor networks: formulation and approximations

IEEE/ACM Transactions on Networking (TON)
Fault-tolerant relay node placement in wireless sensor networks

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the relay node placement problem in two-tiered wireless sensor networks with base stations, which aims to deploy a minimum number of relay nodes to achieve certain coverage and connectivity requirement. Under the assumption that the communication range of the sensor nodes is no more than that of the relay node, we present a polynomial time (5+∈)-approximation algorithm for the 1-coverage 1-connected problem. Furthermore, we consider the fault tolerant problem in the network, we present a polynomial time (20+∈)-approximation algorithm for the 2-coverage 2-connected problem, where ∈ is any given positive constant. For the k-coverage 2-connected situation, we present a polynomial time (15k驴10+∈)-approximation algorithm.