A distributed routing algorithm for mobile wireless networks
Wireless Networks
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
SIAM Journal on Computing
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Power consumption in packet radio networks
Theoretical Computer Science
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Introduction to Algorithms
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Transmission power control at individual nodes is used in wireless ad hoc networks for reducing interference and energy consumption. In this paper, two new distributed node-based power control techniques have been proposed to cope up with two different situations, one for lifetime-critical networks with nodes having less mobility, and the other for networks with mobility-prone nodes. The first algorithm is based on the idea of minimum spanning tree (MST) computation. It takes O(n) rounds (n is the total number of nodes), and results better optimization in terms of node power levels. The lower transmission power of nodes makes it suitable for lifespan-critical networks. But O(n) time complexity limits its application to networks with nodes having high mobility causing frequent topology changes. However, it will be suitable for wireless sensor networks where, after the deployment, nodes become more or less static but lifetime remains to be a critical issue. The second one is based on neighbor pruning scheme that completes transmission power assignment in two rounds of message passing only. Though in terms of the node power levels, the first algorithm performs better, with less computational complexity the second one can easily adapt to the topology changes caused by the mobility of the nodes, and hence is suitable for mobile networks. Simulation studies have been done to compare the performances in terms of different performance metrics.