Wireless communication using shortest job first scheduling algorithm for temporary network

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.