This paper investigates the problem of delay-constrained encoding by applying transmission power control in wireless networks. First, we formulate the problem using integer nonlinear programming and demonstrate that it is… Click to show full abstract
This paper investigates the problem of delay-constrained encoding by applying transmission power control in wireless networks. First, we formulate the problem using integer nonlinear programming and demonstrate that it is NP-complete. Moreover, a heuristic encoding algorithm based on power self-adaptation (EAPS) is proposed, which includes two sub-algorithms: the power optimal algorithm (POA) and encoding selection algorithm (ESA). The POA determines the initial transmission power for each packet by taking advantage of opportunities in which the transmission power is increased, thereby decreasing the transmission time without extra energy consumption. The ESA constructs two linked lists: the packet delay constraint linked list (D-List) and optimal power linked list (P-List) based on the POA. Whenever possible, it selects one packet with a tight delay constraint in the D-List and other packets in the same location as the above packet in the P-List to code. Furthermore, this paper includes an analysis of the probability of increasing any transmission power level without extra energy consumption in the POA. Lastly, the simulation results show that EAPS can significantly improve the delay satisfaction ratio and reduce transmission time compared to the COPE, TAONC, and heur.VC algorithms.
               
Click one of the above tabs to view related content.