Channel access scheduling in Ad Hoc networks with unidirectional links
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
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
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Introduction to Algorithms
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
A fault tolerant topology control in wireless sensor networks
AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks
IEEE Transactions on Mobile Computing
A minimum-energy path-preserving topology-control algorithm
IEEE Transactions on Wireless Communications
Design and analysis of an MST-based topology control algorithm
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In wireless multi-hop and ad-hoc networks, minimizing power consumption and at the same time maintaining desired properties of the network topology is of prime importance. In this work, we present a distributed algorithm for assigning minimum possible power to all the nodes in a static wireless network such that the resultant network topology is k-connected. In this algorithm, a node collects the location and maximum power information from all nodes in its vicinity, and then adjusts the power of these nodes in such a way that it can reach all of them through k optimal vertex-disjoint paths. The algorithm ensures k-connectivity in the final topology provided the topology induced when all nodes transmit with their maximum power is k-connected. We extend our topology control algorithm from static networks to networks having mobile nodes. We present proof of correctness for our algorithm for both static and mobile scenarios, and through extensive simulation we present its behavior.