PFPS: Priority-First Packet Scheduler for IEEE 802.15.4 Heterogeneous Wireless Sensor Networks

This paper presents priority-first packet scheduling approach for heterogeneous traffic flows in low data rate heterogeneous wireless sensor networks (HWSNs). A delay sensitive or emergency event occurrence demands the data delivery on the priority basis over regular monitoring sensing applications....

Full description

Saved in:
Bibliographic Details
Published in:International journal of communication networks and information security 2017-08, Vol.9 (2), p.253
Main Authors: Sarode, Sambhaji, Bakal, Jagdish
Format: Article
Language:English
Subjects:
Access control
Algorithms
Communication
Communications networks
Communications traffic
Computer simulation
Data transmission
Delivery scheduling
Design
Packets (communication)
Priority scheduling
Protocol
Queues
Remote sensors
Scheduling
Sensors
Stores
Traffic congestion
Traffic flow
Wireless networks
Wireless sensor networks
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents priority-first packet scheduling approach for heterogeneous traffic flows in low data rate heterogeneous wireless sensor networks (HWSNs). A delay sensitive or emergency event occurrence demands the data delivery on the priority basis over regular monitoring sensing applications. In addition, handling sudden multi-event data and achieving their reliability requirements distinctly becomes the challenge and necessity in the critical situations. To address this problem, this paper presents distributed approach of managing data transmission for simultaneous traffic flows over multi-hop topology, which reduces the load of a sink node; and helps to make a life of the network prolong. For this reason, heterogeneous traffic flows algorithm (CHTF) algorithm classifies the each incoming packets either from source nodes or downstream hop node based on the packet priority and stores them into the respective queues. The PFPS-Earliest Deadline First (PFPS-EDF) and PFPS- First Come First Serve (FCFS) algorithms present scheduling for each data packets using priority weight. Furthermore, reporting rate is timely updated based on the queue level considering their fairness index and processing rate. The reported work in this paper is validated in ns2 (ns2.32 allinone) simulator by putting the network into each distinct cases for validation of presented work and real time TestBed. The protocol evaluation presents that the distributed queue-based PFPS scheduling mechanism works efficiently using IEEE CSMA/CA.
ISSN:2073-607X
2076-0930