A linear-time algorithm for triangulating simple polygons
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
Energy-efficient packet transmission over a wireless link
IEEE/ACM Transactions on Networking (TON)
Power-efficient rate scheduling in wireless links using computational geometric algorithms
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Energy-constrained modulation optimization
IEEE Transactions on Wireless Communications
Power control and capacity of spread spectrum wireless networks
Automatica (Journal of IFAC)
IEEE Transactions on Information Theory
Spectral efficiency in the wideband regime
IEEE Transactions on Information Theory
Power-efficient rate scheduling in wireless links using computational geometric algorithms
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Reducing network energy consumption via sleeping and rate-adaptation
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
| Hi-index | 0.00 |
Energy efficiency has become increasingly critical in designing and operating wireless networks, especially for mobile ad hoc networks consisting of portable mobile wireless computing/communication devices powered by limited battery capacity. Since the energy required to transmit a given amount of data is a convex and monotonically increasing function of the transmission rate [5, 12], theoretically one can improve energy efficiency by transmitting data at lower rates. Unfortunately, low data rates result in longer transmission duration and larger communication delay at receiving end, which is usually undesirable. How to optimally schedule transmission process to both minimize the total power consumption and observe all time constraints (available times and transmission deadlines) is a challenging and interesting problem.In this paper, we propose a technique to solve the above rate scheduling problem by transforming it into finding the shortest path between two vertices of a two dimensional polygon, which yields an elegant analytical solution and easy-to-prove optimality. To the best of our knowledge, this is the first solution to the rate scheduling problem in its general form.