Indian Journal of Science and Technology
Year: 2019, Volume: 12, Issue: 2, Pages: 1-11
B. Sindhupiriyaa* and D. Maruthanayagam
PG and Research Department of Computer Science, Sri Vijay Vidyalaya College of Arts and Science, Dharmapuri – 636807, Tamil Nadu, India; [email protected], [email protected]
*Author for correspondence
PG and Research Department of Computer Science, Sri Vijay Vidyalaya College of Arts and Science, Dharmapuri – 636807, Tamil Nadu, India.
Email: [email protected]
Objectives: The goal of the work is to design a network as well as a new scheduling approach that provides minimizing the delay, better operation of resources in the network and increasing optimality. Methods: In the wireless network and wireline Network, the delay stability is one of the significant metrics considered. The delay analysis of packets plays an essential job in the network. Decomposition of packets partition into multiple paths, checks whether any two nodes assemble at same point as bottleneck occurred or not. To overcome these issues, it utilizes a new delay efficient scheduling policy. Findings: In this research, a new scheduling algorithm, Ant Colony Optimization Max Weight Scheduling (ACOMWS) for minimizing the delay, is proposed. For recognizing the behavior of each path in the network, lower bound analysis is used. Comparative result analyses of proposed scheduling algorithm (ACOMWS) are evaluated with other algorithms (MWS, BP, ACO, Greedy, and GMWS). Application/Improvements: The proposed hybrid scheduling algorithm (ACOMWS) improves the results to achieve better precision results compared to the previous related works.
Keywords: Adhoc, Backpressure, Greedy, Max-weight, Packet Delay, Scheduling, Throughput Optimal
Subscribe now for latest articles and news.