Power consumption in packet radio networks
Theoretical Computer Science
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
Computers and Operations Research
Design patterns from biology for distributed computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Hi-index | 0.00 |
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes are connected by bidirectional links and the total power consumption is minimized. We present a distributed protocol, obtained by extending a connectivity protocol recently appeared in the literature. The new extended protocol is obtained by using in a local, distributed fashion, well-known centralized techniques for power minimization. The result is a self-organization framework where a set of rules, implemented locally at each node, guarantees global properties, i.e. connectivity and power expenditure minimization. Preliminary computational results are finally presented. They show that the new extended protocol guarantees a substantial saving in the total transmission power.