Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximations for Steiner Trees with Minimum Number of Steiner Points
Journal of Global Optimization
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
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
Fault-tolerant relay node placement in wireless sensor networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the problem of k-coverage in mission-oriented mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimized relay node placement for connecting disjoint wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sink Node Placement Strategies for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Establishing connectivity among disjoint terminals using a mix of stationary and mobile relays
Computer Communications
Relay node placement in two-tiered wireless sensor networks with base stations
Journal of Combinatorial Optimization
Hi-index | 0.00 |
One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stations. The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectivity or survivability requirements. Previous studies have concentrated on the unconstrained version of the problem in the sense that relay nodes can be placed anywhere. In practice, there may be some physical constraints on the placement of relay nodes. To address this issue, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a set of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with a base station through a bidirectional path. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with two base stations (or the only base station in case there is only one base station) through two node-disjoint bidirectional paths. For each of the two problems, we discuss its computational complexity and present a framework of polynomial time O(1)-approximation algorithms with small approximation ratios. Extensive numerical results showthat our approximation algorithms can produce solutions very close to optimal solutions.