Performance evaluation of Dynamic Multilevel Priority (DMP) packet scheduling method for wireless sensor networks (WSNs)
Performance evaluation of Dynamic Multilevel Priority (DMP) packet scheduling method for wireless sensor networks (WSNs)
复制标题
无线传感器网络 (WSN) 动态多级优先级 (DMP) 数据包调度方法的性能评估
DOI：
10.1109/pervasive.2015.7086986
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
S. Sambare
中科院分区：
文献类型：
--
作者：
S. Bansode;S. Sambare
无线传感器网络（WSNs）在许多真实的实时环境中的应用越来越广泛，特别是在军事、健康监测、安全监测等领域。因此，提高无线传感器网络的能量效率，延长网络的生命周期，是当前无线传感器网络研究的热点。在本文中，我们专注于工作的分组调度方案，起着至关重要的作用，以提高能源效率和QoS性能。目前在无线传感器网络应用中，研究人员采用的分组调度方案有先到先服务（FCFS）、抢占式优先级调度、非抢占式优先级调度等。然而，这种方法受到限制，如较高的路由开销，更多的端到端延迟，因此更多的能量消耗。在本文中，我们的目标是研究新的算法，克服了现有的方法的局限性，并取得更好的QoS和更少的能量消耗的结果。所研究的算法被称为动态多级优先级调度方法。顾名思义，这种方法是动态工作的，并根据分组调度的要求。该算法采用三个队列分别用于优先级调度和真实的时间、非真实的时间等应用。在第一个队列中，以最高优先级处理的真实的实时数据包。在第二队列中，以比第三队列高的优先级处理非实时数据包。在第三队列中，处理在本地感测到的非真实的时间数据包。使用NS2对该方法进行了实际评估。
There are many real time environment in which the use of wireless sensor networks (WSNs) is growing, especially the applications like military, health monitoring, security monitoring etc. WSN is nothing but collection of small, tiny sensor nodes which is having resource constraints like battery life. Therefore many research comes on WSNs are targeted on improving the energy efficiency of WSNs and extend the lifetime. In this paper, we are focusing to work on packet scheduling scheme which plays vital role to improve the energy efficiency and QoS performances. Currently there are many packet scheduling schemes used by researchers in WSNs applications such as First Come First Serve (FCFS), preemptive priority scheduling, non-preemptive priority scheduling methods. However this method suffered from limitations like higher routing overhead, more end to end delay and hence more energy consumption. In this paper, we are aiming to investigate new algorithm which overcomes the limitations of this existing method and achieves the better QoS and less energy consumption results. The investigated algorithm is called Dynamic Multilevel Priority (DMP) scheduling method. As the name indicates, this method works dynamically and as per the requirement of packet scheduling. There are three queues used by this algorithm for priority scheduling and applications like real time, non-real time. In first queue, real time packets processed with highest priority. In second queue, non-real time data packets processed with highest priority than third queue. In third queue, non real time data packets those are sensed at local are processed. The practical evaluation of this method is done using NS2.