Cluster based Earliest Deadline First Scheduling approach for Wireless Sensor Networks

Authors

  • Dr. M. Senthil Kumaran  Department of Computer Science and Engineering, SCSVMV University, Kanchipuram, Tamil Nadu, India

Keywords:

Cluster, Data packets, Deadline, Earliest Deadline First, Scheduling, Task

Abstract

The advancement of cluster based technique with real time scheduling algorithm earliest deadline first improves the success ratio of earliest deadline scheduling during the overload condition of sensor nodes. This proposal is mainly applicable to group the sensors data with closest deadline for the purpose of data processing. After forming the cluster, the sensor nodes use shortest job first scheduling algorithm for scheduling the data to various nodes. Cluster based EDF scheduling technique is used for transmission and the simulation results shows that the degree of parallelization increases the success ratio compared to EDF scheduling.

References

  1. Jiayu Gong, Xiliang Zhong, and Cheng-Zhong Xu, “Maximizing Rewards in Wireless Networks with Energy and Timing Constraints for Periodic Data Streams”, IEEE Trans. on Mobile Computing, vol 9, no. 8, pp.1187-1200, August 2010.
  2. Sem Borst,” User-Level performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks”, IEEE/ACM Trans. on Networking, vol 13, no. 3, pp. 636-647, June 2005.
  3. G. Manimaran and C. Siva Ram Murthy, “An efficient dynamic scheduling algorithm for multi-processor real-time systems”, IEEE Trans. on Parallel and Distributed Systems, vol. 9, no. 3, pp. 312-319, Mar 1998.
  4. K. Ramamritham, J.A. Stankovic, and P.F. Shiah, “ Efficient scheduling algorithms for real-time multiprocessor systems”, IEEE Trans. on Parallel and Distributed Systems, vol. 1, no. 2, pp. 184-194, Apr 1990.
  5. R. Graham, “Bounds on the performance of scheduling algorithms”, In Computer and Job Scheduling Theory (E.G. Coffman, ed.) John Wiley and Sons, pp. 165-227, 1976.
  6. A. Bhapnagar, and T.G. Robertezi, “ Layer Net: A new self organizing network protocol”, Proc. IEEE Military Comm. Conf. (MILCOM) vol 2, pp. 845-849, Oct 1990.
  7. B. Collins and R.L. Cruz, “Transmission Policies for Time Varying Channels with Average Delay Constraints”, Proc. Allerton Conf.  Comm., Control, and Computing, 1999.
  8. R.A. Berry and R.G. Gallager, “Communication over Fading Channels with Delay Constraints”, IEEE Trans. on Information Theory, vol 48, no. 5, pp. 1135-1149, May 2002.
  9. E. Uysal-Biyikoglu, B. Prabakar, and A.E. Gamal, “Energy Efficient Packet Transmission over a Wireless Link”, IEEE/ACM Trans. Networking,  vol 10, no. 4, pp. 487-499, Aug 2002.
  10. A. Fu, E. Modiano, and J.N. Tsitsiklis, “ Optimal Energy Allocation for Delay-Constrained Data Transmission over a Time-Varying Channel”, Proc. IEEE INFOCOM, 2003.
  11. F. Zhang and S.T. Chanson, “Improving Communication Energy Efficiency in Wireless Networks Powered by Renewable Energy Sources”, IEEE Trans. Vehicular Technology, vol. 54, no. 6, pp. 2125-2136, Nov. 2005.
  12. D. Rajan, A. Sabharwal, and B. Aazhang, “Delay-Bounded Packet Scheduling of Bursty Traffic over Wireless Channels”, IEEE Trans. Information Theory, vol. 50, no. 1, pp. 125-144, Jan 2004.
  13. A. E. Gamal, C. Nair, B. Prabhakar, E. Uysai-Biyikoglu, and S. Zahedi, “Energy-Efficient Scheduling of Packet Transmissions over Wireless Networks”, Proc. IEEE Infocom, 2002.
  14. M. Senthil Kumaran  and R. Rangarajan,     “An Adaptive Power Resourceful and Energy Conscious Protocol for Multi channel Medium Access Control layer in Wireless sensor Networks”, International Journal of Computer and Network Security, vol. 2, no. 7, pp. 32-36, July 2010.

Downloads

Published

2017-04-30

Issue

Section

Research Articles

How to Cite

[1]
Dr. M. Senthil Kumaran, " Cluster based Earliest Deadline First Scheduling approach for Wireless Sensor Networks, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 3, Issue 2, pp.846-849, March-April-2017.