Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Approximations for Steiner Trees with Minimum Number of Steiner Points
Journal of Global Optimization
Impact of interference on multi-hop wireless network performance
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
Challenges for efficient communication in underwater acoustic sensor networks
ACM SIGBED Review - Special issue on embedded sensor networks and wireless computing
State-of-the-art in protocol research for underwater acoustic sensor networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
A survey of practical issues in underwater networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Deployment analysis in underwater acoustic wireless sensor networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Relay sensor placement in wireless sensor networks
Wireless Networks
Steiner Tree Problems In Computer Communication Networks
Steiner Tree Problems In Computer Communication Networks
Hi-index | 0.00 |
An Underwater Acoustic Wireless Sensor Network (UA-WSN) consists of many resource-constrained Underwater Sensor Nodes (USNs), which are deployed to perform collaborative monitoring tasks over a given region. One way to preserve network connectivity while guaranteing other network QoS is to deploy some Relay Nodes (RNs) in the networks, in which RNs' function is more powerful than USNs and their cost is more expensive. This paper addresses Constrained Low-interference Relay Node Deployment (C-LRND) problem for 3-D UA-WSNs in which the RNs are placed at a subset of candidate locations to ensure connectivity between the USNs, under both the number of RNs deployed and the value of total incremental interference constraints. We first prove that it is NP-hard, then present a general approximation algorithm framework and get two polynomial time O(1)-approximation algorithms.