Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Design, realization and evaluation of a component-based compositional software architecture for network simulation
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
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
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient management of transient station failures in linear radio communication networks with bases
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
A scalable, power-efficient broadcast algorithm for wireless networks
Wireless Networks
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Construction of a fault-tolerant wireless communication topology using distributed agreement
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
On computing conditional fault-tolerance measures for k-covered wireless sensor networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network
ACM Transactions on Sensor Networks (TOSN)
Bounded-distance multi-coverage backbones in wireless sensor networks
Proceedings of the 2007 ACM symposium on Applied computing
Sensor localization in concave environments
ACM Transactions on Sensor Networks (TOSN)
Fault tolerant topology control for one-to-all communications in symmetric wireless networks
International Journal of Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Variable radii connected sensor cover in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Distributed localization for anisotropic sensor networks
ACM Transactions on Sensor Networks (TOSN)
Journal of Network and Computer Applications
Self-organizing fault-tolerant topology control in large-scale three-dimensional wireless networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Network coding-based protection of many-to-one wireless flows
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Information Sciences: an International Journal
Graphical properties of easily localizable sensor networks
Wireless Networks
Coverage, connectivity, and fault tolerance measures of wireless sensor networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A connectivity based partition approach for node scheduling in sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
K-connected target coverage problem in wireless sensor networks
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Topology control algorithms in WISELIB
Proceedings of the 2010 ICSE Workshop on Software Engineering for Sensor Network Applications
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
Fault and intrusion tolerance of wireless sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Survivability strategies in multihop wireless networks
IEEE Wireless Communications
Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks
Theoretical Computer Science
Discrete PSO-based fault-tolerant topology control scheme in wireless sensor networks
ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
Reliably detecting connectivity using local graph traits
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Self organization and self maintenance of mobile ad hoc networks through dynamic topology control
Architecting dependable systems VII
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
International Journal of Sensor Networks
Robust topology control protocols
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Fault-tolerant power-aware topology control for ad-hoc wireless networks
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
International Journal of Sensor Networks
Fault-tolerant routing mechanism based on network coding in wireless mesh networks
Journal of Network and Computer Applications
Construction of low weighted and fault-tolerant topology for wireless ad hoc and sensor network
International Journal of Sensor Networks
Scalable redundancy for sensors-to-sink communication
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
Topology control algorithms usually reduce the number of links in a wireless network, which in turn decreases the degree of connectivity. The resulting network topology is more susceptible to system faults such as node failures and departures. In this paper, we consider k-vertex connectivity of a wireless network. We first present a centralized algorithm, Fault-tolerant Global Spanning Subgraph (FGSSk), which preserves k-vertex connectivity. FGSSk is min-max optimal, i.e., FGSSk minimizes the maximum transmission power used in the network, among all algorithms that preserve k-vertex connectivity. Based on FGSSk, we propose a localized algorithm, Fault-tolerant Local Spanning Subgraph (FLSSk). It is proved that FLSSk preserves k-vertex connectivity while maintaining bi-directionality of the network, and FLSSk is min-max optimal among all strictly localized algorithms. We then relax several widely used assumptions for topology control to enhance the practicality of FGSSk and FLSSk. Simulation results show that FLSSk is more power-efficient than other existing distributed/localized topology control algorithms.