PROJECT TITLE :
Channel-Adaptive Packetization Policy for Minimal Latency and Maximal Energy Efficiency - 2016
This paper considers the matter of delay-optimal bundling of the input symbols into transmit packets in the entry point of a wireless sensor network such that the link delay is minimized below an arbitrary arrival rate and a given channel error rate. The proposed policy exploits the variable packet length feature of up to date communications protocols so as to minimize the link delay via packet length regularization. This is often performed through concrete characterization of the tip-to-end link delay for zero-error tolerance system with first come back initial serve (FCFS) queuing discipline and automatic repeat request (ARQ) re-transmission mechanism. The derivations are provided for an uncoded system also a coded system with a given bit error rate. The proposed packetization policy provides an optimal packetization interval that minimizes the top-to-finish delay for a given channel with sure bit error probability. This algorithm will conjointly be used for near-optimal bundling of input symbols for dynamic channel conditions provided that the channel condition varies slowly over time with respect to symbol arrival rate. This algorithm enhances this network-based delay-optimal routing and scheduling algorithms so as to any cut back the end-to-finish delivery time. Moreover, the proposed technique is used to solve the matter of energy potency maximization below a median delay constraint by recasting it as a convex optimization problem.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here