On sparse spanners of weighted graphs
Discrete & Computational Geometry
Wireless information networks
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Wireless integrated network sensors
Communications of the ACM
Power consumption in packet radio networks
Theoretical Computer Science
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
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
Competitive online routing in geometric graphs
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Toward self-organized mobile ad hoc networks: the terminodes project
IEEE Communications Magazine
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
Efficient topology control scheme for wireless ad-hoc networks
International Journal of Computational Intelligence Studies
| Hi-index | 0.00 |
A power assignment is an assignment of transmission power to each of the nodes of a wireless network, so that the induced communication graph has some desired properties. The cost of a power assignment is the sum of the powers. The energy of a transmission path from node u to node v is the sum of the squares of the distances between adjacent nodes along the path. For a constant t 1, an energy t-spanner is a graph G′, such that for any two nodes u and v, there exists a path from u to v in G′, whose energy is at most t times the energy of a minimum-energy path from u to v in the complete Euclidean graph. In this paper, we study the problem of finding a power assignment, such that (i) its induced communication graph is a 'good' energy spanner, and (ii) its cost is 'low'. We show that for any constant t 1, one can find a power assignment, such that its induced communication graph is an energy t-spanner, and its cost is bounded by some constant times the cost of an optimal power assignment (where the sole requirement is strong connectivity of the induced communication graph). This is a very significant improvement over the best current result due to Shpungin and Segal [1], presented in last year's conference.