MaxWeight scheduling has gained enormous popularity as a powerful paradigm for achieving queue stability and maximum throughput in a wide variety of network system. The delay analysis of throughput optimal (queue length based) scheduling policies in such systems is extremely difficult due to complex correlations arising between the arrival, service and the queue length process. This paper explain about maximum weight scheduling algorithm achieves order optimal delay for wireless ad hoc networks with single-hop traffic flows if the number of activated links in one typical schedule has the same order with the number of links in the network. And also explain the weight function calculation, upper and lower bound then the estimation of delay for achieves order optimal delay for wireless ad hoc networks.
Keywords
Wireless adhoc networks
Maxweight scheduling Policy
Maximum Weighted Matching
lower bound and upper bound.
Authors
B.SindhuPiriyaa
Dr.D.Maruthanayagam
How to Cite this Article
B.SindhuPiriyaa, Dr.D.Maruthanayagam (2016).
"A REVIEW ON MAXIMUM WEIGHTED SCHEDULING IN AD HOC NETWORKS".
International Journal of Contemporary Research in Computer Science and Technology,
2(11), pp. 1081-1085.
