An efficient data packet scheduling schemes in wireless sensor networks

Wireless sensor networks (WSN) are designed for data gathering, processing and transmitting with particular requirements: low hardware complexity, low energy consumption, special traffic pattern support, scalability, and in some cases, real-time operation. The emergence of wireless cyber physical systems leads to the need of real time scheduling of data packets. Developing packet scheduling algorithms in WSNs can efficiently enhance delivery of packets through wireless links. Packet scheduling is a process defined as selecting or rejecting a packet depending upon a decision. The packets are transmitted based on various algorithms within the network and there is a possibility of dropping the packets due to packet size, bandwidth, packet arrival rate, deadline of packet. To achieve real time delivery, the paths must deliver the data in time. Some of the algorithms have been selected for packet scheduling of real time data to achieve predictable and bounded end-to-end latencies while meeting the deadlines of queries, in which NJNC (Nearest Job Next-with combination) outperforms in mobility assisted data collection with combination of multiple requests served together in on-demand manner without starvation problem as in the case of existing schemes like first-come-first-serve (FCFS), shortest-job-next (SJN). The results shows that NJNC provides better performance than the nearest-job-next(NJN).