Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Power consumption in packet radio networks
Theoretical Computer Science
On the Spanning Ratio of Gabriel Graphs and beta-skeletons
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
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
A cone-based distributed topology-control algorithm for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Localized topology control for heterogeneous wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Power control is one of the most important techniques used in wireless sensor networks. However, most power control algorithms proposed so far are impractical, because previous work usually makes such perfect assumptions as uniform transmission ranges, location-awareness, and so on. In this paper, we propose REG (Relative Energy-cost Graph), an algorithm to derive a novel proximity graph, which is optimal in the sense of sparseness while preserving the least energy consumption path between any two nodes. And based on REG, we further put forward a new practical power control algorithm PREG (Practicalized REG) for heterogeneous networks. Our theoretical analyses and simulation results show that PREG has a better performance than other power control algorithms thanks to its high practicality and energy efficiency.