An Enhanced Delay Sensitive Data Packet Scheduling Algorithm to Maximizing the Network Lifetime

The objective of the packet scheduling algorithm is to avoid the delay and drop rate in the wireless network. At the same time, without proper scheduling it may lead to high collision, delay and drop rate. This can be overcome by a proposed Enhanced Delay Sensitive Data Packet scheduling (EDSP) algorithm. This algorithm mainly focus on reduction of the delay and increase in the network lifetime and energy efficiency. This proposed EDSP algorithm follows three rules for proper scheduling such as medium selection, weight calculation and priority scheduling. After assigning the source and destination node, by using the AODV routing protocol shortest path with lesser number of relay nodes will be found. Then the source node data flows will be stored in the queue, when the queue size starts to increase, a particular threshold rate scheduling is required. Scheduling checks the channel medium, based on the busy or idle state, node may be sleep or awake state respectively. If the state is busy, all the data flows will be stored in the buffer. If the state is idle, buffered data will move to queue and then forward based high weighted data as first priority. Simulation results have analyzed the performance of the proposed algorithm in two different stages by varying the queue size of 50 and 100 cm. The proposed algorithm has increased the network lifetime and energy efficiency and decreased the delay and drop rate.