Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
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
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics
IEEE Transactions on Mobile Computing
Rate allocation in wireless sensor networks with network lifetime requirement
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Relay sensor placement in wireless sensor networks
Wireless Networks
Relay node placement in large scale wireless sensor networks
Computer Communications
On relay node placement and assignment for two-tiered wireless networks
Mobile Networks and Applications
Improved Approximation Algorithms for Relay Placement
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Relay Nodes in Wireless Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Connectivity-aware network maintenance and repair via relays deployment
IEEE Transactions on Wireless Communications
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Node addressing schemes for scalable and fault tolerant routing in hierarchical WSNs
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Towards a taxonomy of task allocation in sensor networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree
Journal of Parallel and Distributed Computing
Constrained relay node placement in wireless sensor networks: formulation and approximations
IEEE/ACM Transactions on Networking (TON)
Backbone construction for heterogeneous wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
QoS-aware relay node placement in a segmented wireless sensor network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Optimized relay placement to federate segments in wireless sensor networks
IEEE Journal on Selected Areas in Communications
Deploying mesh nodes under non-uniform propagation
INFOCOM'10 Proceedings of the 29th conference on Information communications
On improved relay nodes placement in two-tiered wireless sensor networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Robust sensor placements at informative and communication-efficient locations
ACM Transactions on Sensor Networks (TOSN)
Relay placement for fault tolerance in wireless networks in higher dimensions
Computational Geometry: Theory and Applications
Relay placement problem in smart grid deployment
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Constrained low-interference relay node deployment for underwater acoustic wireless sensor networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
LBP: a secure and efficient network bootstrapping protocol for 6LoWPAN
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
A multi-objective memetic algorithm for relay node placement in wireless sensor network
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
On the problem of k-coverage in mission-oriented mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A least-movement topology repair algorithm for partitioned wireless sensor-actor networks
International Journal of Sensor Networks
Survey: A survey on relay placement with runtime and approximation guarantees
Computer Science Review
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
Theoretical Computer Science
Optimized relay node placement for connecting disjoint wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-layer hybrid wired-cum-wireless sensor network design
International Journal of Communication Networks and Distributed Systems
Towards augmented connectivity with delay constraints in WSN federation
International Journal of Ad Hoc and Ubiquitous Computing
A store-carry-process-and-forward paradigm for intelligent sensor grids
Information Sciences: an International Journal
Efficient deployment of wireless sensor networks targeting environment monitoring applications
Computer Communications
Sink Node Placement Strategies for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
On optimal connectivity restoration in segmented sensor networks
EWSN'13 Proceedings of the 10th European conference on Wireless Sensor Networks
On bounding node-to-sink latency in wireless sensor networks with multiple sinks
International Journal of Sensor Networks
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
Towards augmenting federated wireless sensor networks in forestry applications
Personal and Ubiquitous Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Relay node placement in two-tiered wireless sensor networks with base stations
Journal of Combinatorial Optimization
Hi-index | 14.98 |
A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy consumption is a superlinear function of the transmission distance. One approach to prolonging network lifetime while preserving network connectivity is to deploy a small number of costly, but more powerful, relay nodes whose main task is communication with other sensor or relay nodes. In this paper, we assume that sensor nodes have communication range r 0, while relay nodes have communication range R\geq r, and we study two versions of relay node placement problems. In the first version, we want to deploy the minimum number of relay nodes so that, between each pair of sensor nodes, there is a connecting path consisting of relay and/or sensor nodes. In the second version, we want to deploy the minimum number of relay nodes so that, between each pair of sensor nodes, there is a connecting path consisting solely of relay nodes. We present a polynomial time 7-approximation algorithm for the first problem and a polynomial time (5 + \epsilon){\hbox{-}}\rm approximation algorithm for the second problem, where \epsilon 0 can be any given constant.