Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Localization and routing in sensor networks by local angle information
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we consider the problem of how to place redundant sensor nodes in an arbitrary sensor network to establish multi-connectivity. Specifically, after exploring the existing general k-connectivity algorithm, this paper proves that its approximation ratio is upper-bounded by only O(k3α), asymptotically one order of k lower than that presented before. Since establishing k-connectivity is not cost-efficient for many applications, this paper further relaxes k-connectivity to partial k-connectivity and upper-bounds the approximation ratio of partial k-connectivity with O(k4α).