Semi-equalizing load in multi-hop wireless networks

Abstract

Scheduling transmissions in a well-organized and fair manner in multi hop wireless network [MWN] is very crucial and challenging. For semi equalizing the load a distributed node scheduling algorithm is used through slot reallocation based on local information swap. The algorithm helps to find the delay or shortest delivery time is achieved when the load is semi-equalized throughout the network. We have simulated the Local voting algorithm and found that the system converges asymptotically toward the optimal schedule. In this paper we propose a congestion free scheme to schedule the node transmissions conflict free. The proposed algorithm achieves better performance than the other distributed algorithms in terms of fairness, average delay, and maximum delay in simulation results.