CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Review of Various Scheduling Techniques Considering Energy Efficiency in WSN

by Rajwinder Kaur, Sandeep Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 162 - Number 8
Year of Publication: 2017
Authors: Rajwinder Kaur, Sandeep Sharma
10.5120/ijca2017913395

Rajwinder Kaur, Sandeep Sharma . A Review of Various Scheduling Techniques Considering Energy Efficiency in WSN. International Journal of Computer Applications. 162, 8 ( Mar 2017), 33-38. DOI=10.5120/ijca2017913395

@article{ 10.5120/ijca2017913395,
author = { Rajwinder Kaur, Sandeep Sharma },
title = { A Review of Various Scheduling Techniques Considering Energy Efficiency in WSN },
journal = { International Journal of Computer Applications },
issue_date = { Mar 2017 },
volume = { 162 },
number = { 8 },
month = { Mar },
year = { 2017 },
issn = { 0975-8887 },
pages = { 33-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume162/number8/27266-2017913395/ },
doi = { 10.5120/ijca2017913395 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:08:30.686081+05:30
%A Rajwinder Kaur
%A Sandeep Sharma
%T A Review of Various Scheduling Techniques Considering Energy Efficiency in WSN
%J International Journal of Computer Applications
%@ 0975-8887
%V 162
%N 8
%P 33-38
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In advanced computing the Wireless Sensor Networks becomes the need of hour. The resources which are used in Wireless sensor Networks are limited in numbers. Resources are required to be allocated wisely to perform the numerous tasks in which job scheduling is always considered to be a key feature. Wireless sensor network has many sensor nodes as which are considered to be main components. Sensor node has limited energy and storage capabilities. So energy consumption in this field during scheduling is a biggest issue. This issue is carried out by many researchers and legion of algorithms are devised for achieving energy efficiency during scheduling of resources in wireless sensor networks. In this paper we have focused both the moving and stationery nodes for our study. Moving nodes are considered to be more prone to energy loss as compared to static nodes. This paper aims to study various techniques used to perform scheduling among such nodes to minimize energy consumption.

References
  1. A. Kaur and A. Singh, “A Review on Enhancement of Lifetime of Wireless Sensor Network using Prediction Based Mobile Sink Path Determination : a Review,” pp. 14120–14126, 2016.
  2. D. V Jose and G. Sadashivappa, “a Novel Energy Efficient Routing a Lgorithm for Wireless Sensor Networks,” Int. J. Wirel. Mob. Networks, vol. 6, no. 6, pp. 15–25, 2014.
  3. R. Ramya, G. Saravanakumar, and S. Ravi, “Energy Harvesting in Wireless Sensor Networks,” Springer India, 2016, pp. 841–853.
  4. M. Azharuddin and P. K. Jana, “A distributed algorithm for energy efficient and fault tolerant routing in wireless sensor networks,” Wirel. Networks, vol. 21, no. 1, pp. 251–267, 2015.
  5. A. Mateska, L. Gavrilovska, and S. Nikoletseas, “Mobility Aspects in WSN,” Springer London, 2011, pp. 119–143.
  6. S. Chand, S. Singh, and B. Kumar, “Heterogeneous HEED protocol for wireless sensor networks,” Wirel. Pers. Commun., vol. 77, no. 3, pp. 2117–2139, 2014.
  7. F. M. Al-Turjman, H. Hassanein, S. Oteafy, and W. Alsalih, “Towards augmenting federated wireless sensor networks in forestry applications,” Pers. Ubiquitous Comput., vol. 17, no. 5, pp. 1025–1034, 2013.
  8. T. Kokilavani and D. I. G. Amalarethinam, “Reduced Makespan Task Scheduling Algorithm for Grid Computing,” vol. 9, no. 27, pp. 71–76, 2016.
  9. V. Hamscher, U. Schwiegelshohn, A. Streit, R. Yahyapour, R. Buyya, and M. Baker, “Evaluation of Job-Scheduling Strategies for Grid Computing,” Grid Comput., vol. 1971, pp. 191–202, 2000.
  10. S. D. Dwivedi and P. Kaushik, “Energy Efficient Routing Algorithm with sleep scheduling in Wireless Sensor Network,” vol. 3, no. 3, pp. 4350–4353, 2012.
  11. C. Wu, J. Li, D. Xu, P.-C. Yew, J. Li, and Z. Wang, “FPS: A Fair-Progress Process Scheduling Policy on Shared-Memory Multiprocessors,” IEEE Trans. Parallel Distrib. Syst., vol. 26, no. 2, pp. 444–454, Feb. 2015.
  12. I. J. I. Systems, M. S. Garshasbi, M. Effatparvar, and A. Branch, “High Performance Scheduling in Parallel Heterogeneous Multiprocessor Systems Using Evolutionary Algorithms,” no. October, pp. 89–95, 2013.
  13. P. Delisle and P. Delisle, “Parallel Ant Colony Optimization : Algorithmic Parallel Ant Optimization : Algorithmic Models Models and Colony Hardware Implementations and Hardware Implementations.”
  14. B. Yuce, M. S. Packianather, E. Mastrocinque, D. T. Pham, A. Lambiase, and T. Parade, “Honey Bees Inspired Optimization Method: The Bees Algorithm,” pp. 646–662, 2013.
  15. E. Gabaldon, J. L. Lerida, F. Guirado, and J. Planes, “Multi-criteria genetic algorithm applied to scheduling in multi-cluster environments,” J. Simul., vol. 9, no. 4, pp. 287–295, 2015.
  16. W. Abdulal, A. Jabas, S. Ramachandram, and O. Al Jadaan, “Task Scheduling in Grid Environment Using Simulated Annealing and Genetic Algorithm,” 2012.
  17. S. G. Ahmad, C. S. Liew, E. U. Munir, T. F. Ang, and S. U. Khan, “A hybrid genetic algorithm for optimization of scheduling workflow applications in heterogeneous computing systems,” J. Parallel Distrib. Comput., vol. 87, pp. 80–90, 2016
  18. R. Singh, “Task Scheduling in Parallel Systems using Genetic Algorithm,” vol. 108, no. 16, pp. 34–40, 2014.
  19. S. Gupta and K. C. Roy, “Comparison of Sensor Node Scheduling Algorithms in Wireless Sensor Networks,” Int. Res. J. Eng. Technol., vol. 2, no. 6, pp. 97–104, 2015.
  20. L. Aslanyan, H. Aslanyan, and H. Khosravi, “Optimal node scheduling for integrated connected-coverage in wireless sensor networks,” CSIT 2013 - 9th Int. Conf. Comput. Sci. Inf. Technol. Revis. Sel. Pap., 2013.
  21. S. C. Ergen and P. Varaiya, “TDMA scheduling algorithms for wireless sensor networks,” Wirel. Networks, vol. 16, no. 4, pp. 985–997, 2010.
  22. F. Xhafa and A. Abraham, “Meta-heuristics for grid scheduling problems,” … Sched. Distrib. Comput. …, pp. 1–37, 2008.
  23. A. Mishra, S. Mishra, and D. S. Kushwaha, “An Improved Backfilling Algorithm : SJF-BF,” vol. 05, no. 01, 2011.
  24. F. A. B. Silva, E. P. Lopes, E. P. L. Aude, F. Mendes, T. C. Júlio, H. Serdeira, M. Martins, and W. Cirne, “Response Time Analysis of Gang Scheduling for Real Time Systems.”
  25. L. R. Dror G. Feitelson, D. G. Feitelson, and L. Rudolph, “Parallel Job Scheduling: Issues and Approaches,” Jsspp, vol. 949, pp. 1–18, 1995.
  26. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182–197, Apr. 2002.
  27. R. Nedunchezhian and P.Vivekanandan, “a Fast Genetic Algorithm for Mining Classification Rules in,” Soft Comput., vol. 1, no. 1, pp. 10–20, 2010.
  28. J. Carretero, F. Xhafa, and A. Abraham, “Genetic Algorithm Based Schedulers for Grid Computing Systems,” Int. J. Innov. Comput. Inf. Control, vol. 3, no. 6, pp. 1–19, 2007.
  29. D. Maruthanayagam and R. UmaRani, “Enhanced Ant Colony Algorithm for Grid Scheduling,” Int. J. Comput. Technol. Appl., vol. 1, no. 1, pp. 43–53, 2010.
  30. M. Wang and W. Zeng, “A comparison of four popular heuristics for task scheduling problem in computational grid,” 2010 6th Int. Conf. Wirel. Commun. Netw. Mob. Comput. WiCOM 2010, pp. 3–6, 2010.
  31. S. Sharma, A. Chhabra, and S. Sharma, “Comparative Analysis of Scheduling Algorithms for Grid Computing,” pp. 349–354, 2015.
  32. A. Kousalya and R. Radhakrishnan, “A Comparative Study of Parallel Job Scheduling Algorithms in Cloud Computing,” vol. 6, no. 3, pp. 2687–2690, 2015.
  33. H. D. Karatza, “SCHEDULING GANGS IN A DISTRIBUTED SYSTEM,” vol. 7, no. 1, pp. 15–22, 2000.
  34. Z. Zhou, C. Du, L. Shu, G. Hancke, J. Niu, and H. Ning, “An Energy-Balanced Heuristic for Mobile Sink Scheduling in Hybrid WSNs,” IEEE Trans. Ind. Informatics, vol. 12, no. 1, pp. 28–40, 2016.
  35. P. Chatterjee and N. Das, “Multiple sink deployment in multi-hop wireless sensor networks to enhance lifetime,” Proc. - Int. Conf. 2015 Appl. Innov. Mob. Comput. AIMoC 2015, pp. 48–54, 2015.
  36. C.-F. Wang, J.-D. Shih, B.-H. Pan, and T.-Y. Wu, “A Network Lifetime Enhancement Method for Sink Relocation and Its Analysis in Wireless Sensor Networks,” IEEE Sens. J., vol. 14, no. 6, pp. 1932–1943, Jun. 2014.
  37. Zijan Wang, and Eyuphan Bulut, “Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks”, International Conference on Communications, IEEE, (2009), 1-5.
  38. Maciej Nikodem and Bartosz Wojciechowski, “Upper Bounds on Network Lifetime for Clustered Wireless Sensor Networks”, 4th IFPI International Conference, IEEE, (2011), 1-6.
  39. F. Restuccia and S. K. Das, “Lifetime optimization with QoS of sensor networks with uncontrollable mobile sinks,” in 2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2015, pp. 1–9.
  40. O. Cayirpunar, E. Kadioglu-Urtis, and B. Tavli, “Optimal Base Station Mobility Patterns for Wireless Sensor Network Lifetime Maximization,” IEEE Sens. J., vol. 15, no. 11, pp. 6592–6603, Nov. 2015.
  41. V. Devasvaran, N. M. A. Latiff, and N. N. N. A. Malik, “Energy efficient protocol in wireless sensor networks using mobile base station,” in 2014 IEEE 2nd International Symposium on Telecommunication Technologies (ISTT), 2014, pp. 56–60.
  42. B. E. Far, S. Alirezaee, and S. V. Makki, “Wireless sensor network energy minimization using the mobile sink,” in 7’th International Symposium on Telecommunications (IST'2014), 2014, pp. 1184–1188.
  43. X. Zhang, H. Bao, J. Ye, K. Yan, and H. Zhang, “A Data Gathering Scheme for WSN/WSAN Based on Partitioning Algorithm and Mobile Sinks,” in 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2013, pp. 1968–1973.
  44. F. Tashtarian, M. H. Yaghmaee Moghaddam, K. Sohraby, and S. Effati, “On Maximizing the Lifetime of Wireless Sensor Networks in Event-Driven Applications With Mobile Sinks,” IEEE Trans. Veh. Technol., vol. 64, no. 7, pp. 3177–3189, 2015.
  45. W. Liu, K. Lu, J. Wang, G. Xing, and L. Huang, “Performance Analysis of Wireless Sensor Networks With Mobile Sinks,” IEEE Trans. Veh. Technol., vol. 61, no. 6, pp. 2777–2788, Jul. 2012.
  46. S. Gao, H. Zhang, and S. K. Das, “Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks,” IEEE Trans. Mob. Comput., vol. 10, no. 4, pp. 592–608, Apr. 2011.
  47. Wei Wang, V. Srinivasan, and Kee-Chaing Chua, “Extending the Lifetime of Wireless Sensor Networks Through Mobile Relays,” IEEE/ACM Trans. Netw., vol. 16, no. 5, pp. 1108–1120, Oct. 2008.
  48. Gandham, S.r., M. Dawande, R. Prakash, and S. Venkatesan, "Energy efficient schemes for wireless sensor networks with multiple mobile base stations."GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489). doi:10.1109/glocom.2003.1258265.
  49. Z. M. Wang, S. Basagni, E. Melachrinoudis, and C. Petrioli, “Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime,” in Proceedings of the 38th Annual Hawaii International Conference on System Sciences, p. 287a–287a
Index Terms

Computer Science
Information Sciences

Keywords

Wireless Sensor Network Job Scheduling Fixed Nodes Stationery Nodes Energy Consumption

Powered by PhDFocusTM