Wireless Communication using Shortest Job First Scheduling Algorithm for Temporary Network

K. Thamizhmaran*
Deptartment of Electronics Communication Engineering, Government College of Engineering, Bodinayakkanur, Theni, Tamilnadu, India.
Periodicity:January - June'2024
DOI : https://doi.org/10.26634/jmt.11.1.20408

Abstract

Recent researchers are interested in the field of Wireless Sensor Network (WSN) due to the challenges posed by communication via the air medium. These challenges include difficulties arising from the use of the same carrier channel for all communications, making the network vulnerable to security threats such as malicious attacks, misbehavior attacks, grey hole attacks, block hole attacks, etc. In traditional path-based approaches, it is not easy to identify and overcome these drawbacks. To address this, we propose and implement a scheduling algorithm called "shortest first job" with the assistance of infrastructure-less networks. This leading algorithm effectively mitigates the aforementioned security issues in wireless sensor networks by determining the most cost-effective and distance-optimal path between sender and receiver, simulated using NS2.

Keywords

SJF Algorithm, Emptive Algorithm, Turnaround Time, Average Waiting Time, NS2 Simulator, Wireless Sensor Network, GPS, Black Holes.

How to Cite this Article?

Thamizhmaran, K. (2024). Wireless Communication using Shortest Job First Scheduling Algorithm for Temporary Network. i-manager’s Journal on Mobile Applications & Technologies, 11(1), 1-4. https://doi.org/10.26634/jmt.11.1.20408

References

[1]. Abbas, A. (2015). Multiprocessor and Real-Time Scheduling Shortest-Job-First (SJF) scheduling algorithm. European Journal of Computer Science and Information Technology, 3(5), 8-20.
[2]. Arivazhagan, A., Thamizhmaran, K., & Thamilselvi, N. (2015). Performance comparison of on demand routing protocols under back whole for MANET. Advance Research in Computer science and software Engineering, 5(3), 407-411.
[4]. Natsheh, E., Khatun, S., Jantan, A. B., & Shamala, S. (2008). Fuzzy metric approach for route lifetime determination in wireless ad hoc networks. International Journal of Ad Hoc and Ubiquitous Computing, 3(1), 1-9.
[5]. Owaidat, B., Nassar, H., & Kassem, R. (2015, April). A Shortest Job First (SJF)-like scheme for efficient call handoff in mobile networks. In 2015 Fifth International Conference on Digital Information and Communication Technology and its Applications (DICTAP) (pp. 216-221). IEEE.
[7]. Prabu, K., & Thamizhmaran, K. (2016). Cluster head selection techniques and algorithm for mobile ad-hoc networks (MANETS). Advance Research in Computer science and software Engineering, 6(7), 169-173.
[8]. Rajkumar, M., & Grace, K. (2013). Efficient data prediction scheme using SVM classification. In International Conference on Computer Science and Information Technology (pp. 215-219).
[10]. Sreenatha, M., Rajendra, B. R., Niranjan, C. K., & Kumar, M. M. (2014, July). Prediction of length of the next CPU burst in SJF scheduling algorithm using dual simplex method. In Second International Conference on Current Trends in Engineering and Technology-ICCTET 2014 (pp. 248-252). IEEE.
[12]. Thamizhmaran, K. (2012). Authentication and intrusion detection in MANET. International Journal of Advance Research in Technology, 3(3), 15-21.
[13]. Thamizhmaran, K. (2016). Performance evaluation of EA3ACK in different topologies using EAACK for MANET. i- manager's Journal on Information Technology, 5(4), 5-10.
[14]. Thamizhmaran, K., Mahto, R. S. K., & Tripathi, V. S. K. (2012). Performance analysis of secure routing protocols in MANET. International Journal of Advanced Research in Computer and Communication Engineering, 1(9), 651-654.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.