Priority based expansion of neighborhood size for heterogeneous traffic routing in WSN

This paper presents a new routing scheme that adapts to the requirements of heterogeneous traffic. The proposed scheme introduces further improvements to our developed ExtTeGAR algorithm. The aim of the scheme is to achieve low latency and to satisfy multiple quality of service (QoS) in various network conditions. In doing so, the proposed approach exploits multiple nodes' attributes such as energy, distance to the base station (BS), history of hop delay of data to neighbors and probability of link availability to determine the best node for delivering different traffic requirements. The contribution of the scheme is its ability to differentiate the required data-related to each type of traffic and give different priorities to different data categories so that each type of traffic classification ensures to meet the demands of the application requirements. The proposed scheme uses a distance-based and a location-aware approach to create a shortest path for type of packets with given deadlines and it provides adaptability to increase the transmission range to expand the neighborhood sizes for data delivery continuation. The paper shows that the proposed scheme outperforms an existing QoS routing algorithm (SPEED) in various application scenarios and different network sizes.