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

Authors:
Muhammad Nur Rizal;Iqbal Gondal;Pari Delir Haghighi;Bin Qiu
Affiliations:
Monash University, Clayton, Victoria, Australia;Monash University, Caulfield, Victoria, Australia;Monash University, Caulfield, Victoria, Australia;Monash University, Clayton, Victoria, Australia
Venue:
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Year:
2012

Citing 6
Cited 0

SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Lightweight detection and classification for wireless sensor networks in realistic environments

Proceedings of the 3rd international conference on Embedded networked sensor systems
Design of a wireless sensor network platform for detecting rare, random, and ephemeral events

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Performance analysis of IEEE 802.15.4 and ZigBee for large-scale wireless sensor network applications

Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Traffic-Differentiation-Based Modular QoS Localized Routing for Wireless Sensor Networks

IEEE Transactions on Mobile Computing
A SURVEY OF QOS ROUTING SOLUTIONS FOR MOBILE AD HOC NETWORKS

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.