Node Application and Time Based Fairness in Ad-Hoc Networks: An Integrated Approach

In ad hoc networks, balancing overall delay among multiple flows with different priorities is a major challenge. Normally, packets having higher priority are scheduled to dispatch first than the packets having lower priority. However, priority is calculated by considering the weights of either application or region. As a result, flows with lower priority reach to the destination after a long delay or dropped because of starvation. So an efficient mechanism must be framed for achieving delay bounded service in heterogeneous applications of ad hoc network. In this paper, we propose an integrated priority measurement technique for minimize overall delay among multiple flows. The proposed model uses the elapsed time as a measure factor to calculate priority. The packets suffered a larger as well as less delay are assigned a lower priority as they are either less important at sink node or can be delayed to reach at destination within time bound. Performance evaluation of this protocol moderates the end to end latency to the flows having lower priority.