Abstract
Ad hoc sensor network is a compilation of ad hoc nodes with sensing capability. Recently, the network structure changes rapidly in modern applications and imposes priority for heterogeneous flows which may change dynamically to fulfill the end-user requirement. In some scenarios, the priorities of the flows need to change in middle of the communication. However the major problem is that the packets of different applications are not served in the destination by their expected priority ratio even if the priority does not change. Considering the above problem, this paper presents a fair packet scheduling policy which collects information from each individual flow according to its priority and auto-updates the priorities of flows when required. The presented work focuses on the prioritized packet scheduling policy with the help of multiple queues, whose lengths are determined by priority of each application. To the best of our knowledge, this is the first research effort to consider a scenario where change in priority of flow occurs dynamically. The proposed protocol has been simulated using NS2 for two applications, where each application carries multiple flows. The simulation result shows the internal buffer queues are occupied and transmitted by their respective packets according to their priority ratio. Moreover, it reduces overall packet loss which leads to serve more packets at destination than the existing fairness protocols and the packet service rate reflects instantly soon after the priority changes.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call