OPTIMAL DELAY BOUND FOR MAXIMUM WEIGHT SCHEDULING POLICY IN WIRELESS NETWORKS

Sri Vasavi College, Erode Self-Finance Wing 3rd February 2017 National Conference on Computer and Communication NCCC’17

Format: Volume 5, Issue 1, No 4, 2017

Copyright: All Rights Reserved ©2017

Year of Publication: 2017

Author: B.SindhuPiriyaa,Dr.D.Maruthanayagam

Reference:IJCS-175

View PDF Format

Abstract

This paper analysis delay properties of the well known maximum weight scheduling algorithm in wireless adhoc networks. We consider wireless networks with either one hop or multi-hop flows. Specifically, this paper shows that the 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. This condition would be satisfied for most practical wireless networks.This paper focuses themethod is general and it can be used to derive bounds for the sumof even higher moments of the stationary queue sizes. However,for the approximate MWS policy, the bounds for the second orhigher moments are only valid when the average arrival ratevector is limited to a subset of the capacity region that dependson the order of the moment.

References

[1] L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” IEEE Trans. Automatic Control, vol. 37, no.12, pp. 1936-1948, Dec. 1992. [2] M. Neely, E. Modiano, and C. Rohrs, “Power allocation and routinginmultibeam satellites with time-varying channels,” IEEE/ACM Trans Networking, vol. 11, no. 1, pp. 138-152, Feb. 2003. [3] M. Neely, E. Modiano, and C. Rohrs, “Dynamic power allocation androuting for time varying wireless networks,” IEEE INFOCOM 2003. [4] M. Neely, E. Modiano, and C. Li, “Fairness and optimal stochastic control for heterogeneous networks,” IEEE INFOCOM 2005. [5] E. Modiano, D. Shah, and G. Zussman, “Maximizing throughput in wireless networks via gossiping,” ACM SIGMETRICS 2006. [6] M. Neely, “Delay analysis for maximal scheduling in wireless networks with bursty traffic,” IEEE INFOCOM 2008. [7] P. Charporkar, K. Kar, and S. Sarkar, “Throughput guarantees through maximal scheduling in wireless networks,” Allerton 2005, Sept. 2005 [8] M. Neely, “Order optimal delay for opportunistic scheduling in multiuser wireless uplinks and downlinks,” Allerton 2006, Sept. 2006. [9] M. Neely, “Delay analysis for max weight opportunistic scheduling in wireless systems,” Allerton 2008, Sept. 2008. [10] Aksenti, Sajal K. Das and DamlaTurgut “An On- Demand Weighted Clustering Algorithm (WCA) for Ad hoc Networks”, Texas Advanced Research Program grant TARP-003594-013, [11] G.Sivakannu, M.Lakshmiprabha, “Implementation of Weighted Fair Queuing Technique along with IEEE 802.11p to Enhance Quality of Service (QoS) in VANET”, Vol. 5, Issue 6, June 2016. [12] A Charles, R.Bensraj, “Enhanced Weighted Fair- Queuing Technique For Improving The Qos In Manet”, Int J AdvEngg Tech/Vol. VII/Issue II/April-June, 2016/1308-1311. [13] Bin Li, Ruogu Li, AtillaEryilmaz, Wireless scheduling design for optimizing both service regularity and mean delay in heavy-traffic regimes, Volume 24 Issue 3, June 2016 [14] Ali Ghiasian ,HosseinSaidi , BehnazOmoomi , SoodehAmiri, “The impact of network topology on delay bound in wireless Ad Hoc networks”, DOI 10.1007/s11276- 012-0462-z,2015.


Keywords

Wireless networks, Maximum Weight Scheduling, Single hop, multi hop and subnet.

This work is licensed under a Creative Commons Attribution 3.0 Unported License.   

TOP
Facebook IconYouTube IconTwitter IconVisit Our Blog