Joint Routing, Scheduling and Power Control Providing Hard Deadline in Wireless Multihop Networks

TL;DR

This paper develops an efficient online algorithm for joint routing, scheduling, and power control in multihop wireless networks to meet hard deadline constraints, optimizing power consumption for real-time data transmission.

Contribution

It introduces a novel dynamic programming approach and extends it to multiuser multihop networks with diverse deadline requirements.

Findings

Optimal power allocation policies for single-hop networks.

Efficient online algorithm minimizing average power consumption.

Generalization to multiuser multihop scenarios with multiple deadlines.

Abstract

We consider optimal/efficient power allocation policies in a single/multihop wireless network in the presence of hard end-to-end deadline delay constraints on the transmitted packets. Such constraints can be useful for real time voice and video. Power is consumed in only transmission of the data. We consider the case when the power used in transmission is a convex function of the data transmitted. We develop a computationally efficient online algorithm, which minimizes the average power for the single hop. We model this problem as dynamic program (DP) and obtain the optimal solution. Next, we generalize it to the multiuser, multihop scenario when there are multiple real time streams with different hard deadline constraints.