Abstract

Wireless Sensor Network (WSN) has an enormous scope of utilizations in detecting different parameters such as temperature, pressure, sound, pollution, etc. The sensed data in each sensor node are a valuable one. To communicate the information to the base station for further processing, a lot of strategies are available. Each sensor senses the data in different sampling rate depending upon the sudden raise in the sensing parameters. Data communication to the base station is very critical due to the dynamicity of the environment during the stipulated time.The sensed data should reach the base station before the data becomes invalid due to the violation of the deadline. In order to avoid deadline violation so that the sensed data becomes useless, this paper proposing a novel data collection algorithm based on the popular Earliest Deadline First (EDF) scheduling algorithm. The various simulation parameters are taken into account to verify the performance of the proposed method and the result shows that it achieves high throughput, low delay, high Packet Delivery Ratio (PDR) and low energy consumption.

Highlights

  • Sensor nodes are deployed around the region to sense various details like enemy tracking in the army, weather forecasting, checking the quality of plants, monitoring patients’ health remotely when the doctor is not present, detecting and controlling city traffic congestion and can be used to avoid road accidents and forest fires

  • Earliest Deadline First (EDF) scheduling algorithm is employed to create a schedule for mobile sink and the mobile sink meets and collects data from the CH one by one according to the schedule prescribed by EDF, which preserves the deadline of every cluster head and deliver the collected data to the base station, which solves the deadline violation problem

  • This paper, proposed an EDF based scheduling algorithm DBaC to collect the data from the sensors and to reach them to the base station before the deadline of the data getting violated

Read more

Summary

Introduction

Sensor nodes are deployed around the region to sense various details like enemy tracking in the army, weather forecasting, checking the quality of plants, monitoring patients’ health remotely when the doctor is not present, detecting and controlling city traffic congestion and can be used to avoid road accidents and forest fires. Another approach for data collection is using mobile collectors to collect the data which are discussed in [11 - 14] In this approach a dedicated node called as mobile sink travels in a fixed or random path moves around the sensing region and collects the data from the sensors. The base station requires some data to be supplied to the destination urgently based upon the sudden changes occurring in the sampling rate This has been addressed as a deadline violation problem in many researches in [24 - 26]. After collecting data from all the sensors, the cluster head will deliver the data to the base station without missing the deadline through the mobile sink which meets each cluster head in a predefined order fixed by the EDF algorithm.

Related work
System model
Problem formulation
Data collection at cluster heads
EDF scheduled mobile sink
Performance evaluation
Findings
Conclusion
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.