Scheduling in Multihop Wireless Networks without Back-pressure
|
|
- Milton Lyons
- 5 years ago
- Views:
Transcription
1 Forty-Eighth Annual Allerton Conerence Allerton House, UIUC, Illinois, USA September 29 - October 1, 2010 Scheduling in Multihop Wireless Networks without Back-pressure Shihuan Liu, Eylem Ekici, and Lei Ying Department o Electrical and Computer Engineering, Iowa State University {liush08, leiying}@iastate.edu Department o Electrical and Computer Engineering, The Ohio State University ekici@ece.osu.edu Abstract This paper ocuses on scheduling in multihop wireless networks. The well-known back-pressure scheduling algorithm is throughput optimal, but requires constant exchange o queue-length inormation among neighboring nodes or calculating the back-pressure. In this paper, we propose a selregulated MaxWeight scheduling, which does not require backpressure calculation. We prove that the sel-regulated MaxWeight scheduling is throughput optimal 1 when the traic lows are associated with ixed routes and deterministic arrivals. I. INTRODUCTION This paper considers scheduling in multihop wireless networks. A widely-used algorithm to stabilize multihop lows in wireless networks is the back-pressure algorithm proposed in [1], which can stabilize any traic lows that can be supported by any other routing/scheduling algorithm. We reer to [2], [3] or a comprehensive survey on the back-pressure algorithm and its variations. A key idea o the back-pressure algorithm is to use queue dierence as link weight, and schedule the links with large weights. Thereore, the backpressure algorithm requires constant exchange o queue-length inormation among neighboring nodes. Further, the sum o the queue-lengths along a route increases quadratically as the route length [4], which leads to poor delay perormance. The delay perormance o the back-pressure algorithm has received much attention recently. Dierent approaches have been developed to improve the delay perormance o back-pressure [4], [5], [6]. These algorithms however still rely on back-pressure or scheduling, so still require a constant exchange o queuelength inormation. In this paper, we consider the ollowing question: can the network be stabilized without using back-pressure? We address this question in a multi-hop wireless network with ixed routing. We note that a multi-hop low with a ixed route can be broken into multiple single-hop lows, one or each link on the route. A scheduling policy that stabilizes the collection o single-hop lows also provides suicient service or supporting the set o multi-hop lows. Thereore, assuming each link knows the aggregated rate it needs to carry, an alternative scheduling approach is to let each link generate virtual packets according to the aggregated rate and then let the network schedule the links according to the virtual 1 An algorithm is said to be throughput-optimal i it can stabilize any traic that can be stabilized by any other algorithm. queues. When a virtual queue is scheduled, real packets are served according to the allocated link rate. This approach is throughput optimal under the ixed routing assumption, but again requires inormation exchange in network. A source needs to estimate the arrival rate and communicate the rate to all nodes along the route associated with the source. A directly ollowing question is whether, and under what conditions, it is possible to stabilize a network without explicitly exchanging any inormation among nodes in the network. In the ollowing, we present an algorithm that can achieve this goal or networks where i sources generate packet at constant rates, and ii routes are ixed. We propose a sel-regulated MaxWeight scheduling algorithm where each node estimates the aggregated link rate locally i.e., by taking average over the past arrivals on that link. We would like to emphasize that the accuracy o linkrate estimates relies on the stability o the network because i one queue builds up, it blocks packets to down-stream nodes so that those nodes cannot accurately estimate the link rates. On the other hand, the stability o the network relies on the accuracy o the link-rate estimates, which is an interesting paradox and makes the stability o the selregulated MaxWeight scheduling a non-trivial problem. In this paper, we prove that the sel-regulated MaxWeight scheduling is throughput optimal when the traic lows are associated with ixed routes and constant arrivals. The sel-regulated MaxWeight scheduling combined with distributed scheduling algorithms such as the CSMA-based scheduling [7], [8], [9] provides a scheduling algorithm or multi-hop wireless networks, which does not require any inormation exchange in the network. Finally, we would like to comment that the proposed algorithm is motivated by the idea o regulators, which was irst proposed or re-entrant lines in [10] and later used or scheduling in wireless networks [11]. Our algorithm however does not require any inormation exchange in network, while the algorithm in [11] requires the mean arrival rates to be communicated to regulators in the network. II. BASIC MODEL In this section, we describe the basic model. We consider a network represented by a graph G N, L, where N is the set o nodes and L is the set o directed links. Denote by m, n the link rom node m to node n, which implies /10/$ IEEE 686
2 that node m can communicate with node n. Furthermore, let µ {µ m,n } denote a link-rate vector such that µ m,n is the transmission rate over link m, n. A link-rate vector µ is said to be admissible i the link-rates speciied by µ can be achieved simultaneously. Deine Γ to be the set o all admissible link-rate vectors. It is easy to see that Γ depends on the choice o intererence model and might not be a convex set. Furthermore, Γ is time-varying i channels are time-varying. Furthermore, we assume that there exists µ max such that µ m,n µ max or all m, n L and all admissible µ. We consider multihop traic lows with ixed routing in this paper. Let denote a low, and R denote the route associated with low. We use F to denote the set o all lows in the network. Assume that time is discretized, and let X F denote the number o packets injected by low at time t. In this paper, we assume X is a constant. Denote by S the source node o low, and D the destination node o low. Further, let µ m,n denote the rate at which packets o low are served over link m, n. III. NECESSARY CONDITIONS FOR STABILITY In this section, we study the necessary conditions or network stability. We say a traic coniguration {X } F is supportable i there exists { µ m,n } such that the ollowing two conditions hold: i For any low and node n D, X I {S n} + µ m,n µ n,b, 1 ii m: b:n,b L where I {S n} equals to one i S n occurs and equals to zero otherwise. F µ m,n CHΓ, 2 where CHΓ is the convex hull o Γ. Recall that each low is associated with a ixed route. It is easy to see the necessary condition 1 is equivalent to the ollowing statement: For any low and m, n R, we have µ m,n X. 3 IV. SELF-REGULATED MAXWEIGHT SCHEDULING FOR MULTIHOP WIRELESS NETWORKS In this section, we introduce the sel-regulated MaxWeight scheduling or multhop wireless networks. Two-stage queue architecture: Each node maintains two types o queues: per-low queues and per-link queues as shown in Figure 1. An incoming packet is at irst buered at the corresponding per-low queue and then moved to the per-link queue where the link is on the route o the low the details will be described later. In this paper, we denote by Q n the length o the queue maintained at node n or low, and Q n n,b the length o the queue maintained at node n or link n, b. Clearly, queue or link n, b is maintained Fig. 1. The two-stage queue architecture only at node n, so we simpliy Q n n,b to be Q n,b without causing any conusion. Sel-Regulated MaxWeight Scheduling MaxWeight scheduling: Compute the admissible link-rate vector µ t such that µ t arg max µ n,b tq n,b t. 4 µ Γ n,b L Per-link queue transmission: Node n transmits s n,b t min{µ n,b t, Q n,bt} packets to node b over link n, b. The packets are deposited into per-low queues at node b according to their lows. We let s n,bt denote the number o packets o low that are transmitted over link n, b at time t. Note that s n,b t s n,b t always holds. Per-low queue transmission: Denote by a n t the number o packets deposited into queue Q n at time slot t, i.e., a n t s b,n t. b,n L For each low, node n maintains a rate estimate t X n τ1 t 1 + γ an τ, 5 t where γ is a positive constant which can be set as small as desired. At time slot t, node n moves s n t min{ X n t, Q n t} packets rom queue Q n to queue Q n,b where b is the next hop to reach destination D rom node n in other words, b is on the route to destination D. We urther deine a n,b t s n t. :n,b R 687
3 The notations are illustrated in Figure 2. From the deinition o the sel-regulated MaxWeight scheduling algorithm, we can see that the dynamics o queue Q n and Q n,b are: Fig. 2. Q n t + 1 Qn Q n,b t + 1 The notations and the lows t sn t + an t Q n,b t s n,b t + a n,b t, In the ollowing, we will prove that the sel-regulated MaxWeight scheduling algorithm stabilizes any traic that satisies the necessary conditions. The analysis consists o two steps: we irst show that the per-link queues are bounded Lemma 1, and then using induction to prove that the per-low queues are bounded as well Lemma 2. Lemma 1: Given a set o traic lows {1 + ǫx } is supportable or some ǫ > γ, there exists a positive constant M > 0 such that the lengths o the per-link queues are no more than M or all t 0. Proo: First, note that t τ1 an τ tx according to causality, which implies that X n t 1 + γx, t. Since {1 + ǫx } is supportable, according to the necessary conditions, there exist µ such that µ m,n 1 + ǫx or all low and link m, n that is on the route o. Let µ m,n :m,n R µ m,n, then or any link m, n L, we can conclude that a m,n t Xm t Note that ǫ > γ. :m,n R 1 + γx :m,n R 1 + ǫx ǫ γx :m,n R :m,n R ǫ γ :m,n R µ m,n µ m,n ǫ γ We construct Lyapunov unction as ollows: V t Q 2 m,n t. :m,n R X :m,n R X. 6 Then V t + 1 V t t + 1 Q 2 m,n Q 2 m,n t Qm,n t Q m,n t Qm,n t + 1 Q m,n t 2Qm,n t + a m,n t s m,n t am,n t s m,n t δ + δ + + where δ Lµ max 2. 2Q m,n t a m,n t s m,n t 2Q m,n t a m,n t µ m,n 7 2Q m,n t µ m,n s m,n t, 8 From inequality 6, we can get 2Q m,n t a m,n t µ m,n ǫ γ 2Q m,n t :m,n R X. Furthermore, rom the MaxWeight scheduler 4 and necessary condition 2, 2Q m,n t µ m,n s m,n t 2δ. Thereore, we conclude that V t + 1 V t 3δ ǫ γ 2Q m,n t µ m,n µ m,n t + 2δ 2Q m,n t :m,n R X. V t Now note that max Q m,n t L. So V t > 2 2δ L ǫ γmin X implies that max Q 2δ m,nt >, ǫ γmin X 688
4 and V t + 1 V t 3δ ǫ γ 2Q m,n t 3δ 2ǫ γ max Q m,nt < δ. :m,n R X min X From the analysis above, it is easy to show that there exists a constant M V such that V t M V or all t. Since Q n,b t V t holds or all t, we can conclude the lemma by choosing M M V. Next, based on Lemma 1, we will prove that all per-low queues are bounded as well. Lemma 2: Given a set o traic lows {X } such that {1+ ǫx } is supportable or some ǫ > γ, under the sel-regulated MaxWeight scheduling, there exists a constant M such that, the lengths o the per-low queues are no more than M or all t. Proo: For the node S, the number o packets arriving at each time slot to queue Q s is a constant, i.e., a S t X, t. Since a S t is a constant, the estimate X S t is a constant as well. From 5, we have X S t 1 + γx, t. Thereore Q s t X or all t. Next we use induction to prove all per-low queues are bounded by a constant. Denote by n i the ith node on the route o low. Now assume that Q nj t M i or all t, and j i. induction assumption From Lemma 1 we know, or any traic that {1 + ǫx } is supportable and ǫ > γ, all per-link queues are bounded by a constant M. In other words, Q n i,n i+1 t M or all t. We next deine M δ im i + M. Now consider the departures o the per-low queue Q ni+1 at node n i+1. It is easy to see that tx M δ t τ1 a ni+1 τ tx because M δ is an upper bound on the number o packets belonging to low and queued at nodes n 1 to node ni the up-streaming nodes o node i + 1. We then can obtain that t τ1 ani+1 τ X ni+1 t 1 + γ, t which converges to 1 + γx as t. In other words, there exists t δ, such that when t > t δ, 1 + γx ni+1 X t > 1 + γ 2 X holds or all t. Now we deine a super time slot, each super time slot consists o M time slots, where M is a large number such that M > 2M δ γx. We index the super time slots using T. During super time slot T such that TM t δ, the number o arrivals to Q ni+1, denoted by a ni+1 T, satisies the ollowing inequality X M M δ a ni+1 T X M + M δ because otherwise, the number o packets that belong to low and are queued at the up-streaming nodes o node i+1 is more than M δ at time MT + 1 when the irst inequality ails or at time MT when the second inequality ails. According to the condition that M > 2M δ γx, we urther have that a ni+1 T 1 + γ/2x M or all T such that MT t δ. Now consider super time slot T + 1 recall that MT t δ. X ni+1 The estimates t or t such that MT + 1 t < MT + 2 satisies X ni+1 t > 1 + γ X, 2 which implies that the available service rate during super time slot T + 1 satisies X ni+1 T > 1 + γ X M a ni+1 T, 2 which implies that the available service rate or the per-low queue Q ni+1 during super time slot T + 1 is always greater than the arrivals at super time slot T. In other words, under the proposed scheme, the arrival packets at super time slot T can always be completely served at the end o super time slot T + 1. Thereore there exists an M i+1 value such that Q ni+1 t M i+1 or all, i and t. The lemma ollows rom the induction principle. Based on Lemma 1 and Lemma 2, we have the ollowing theorem. Theorem 3: Given a set o lows with constant arrival rates {X } such that {1 + ǫx } is supportable or some ǫ > γ, all queues under the sel-regulated MaxWeight algorithm are bounded. V. CONCLUSION In this paper, we considered scheduling in multihop wireless networks,and proposed the sel-regulated MaxWeight scheduling that does not require the exchange o queue-length inormation among neighboring nodes, hence completely eliminates the communication overhead when combined with recent CSMA-based scheduling algorithms. ACKNOWLEDGEMENT Research supported by NSF CNS , CNS , and CCF and the DTRA grants HDTRA and HDTRA
5 REFERENCES [1] L. Tassiulas and A. Ephremides, Stability properties o constrained queueing systems and scheduling policies or maximum throughput in multihop radio networks, IEEE Trans. Automat. Contr., vol. 4, pp , December [2] X. Lin, N. Shro, and R. Srikant, A tutorial on cross-layer optimization in wireless networks, IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp , [3] L. Georgiadis, M. J. Neely, and L. Tassiulas, Resource Allocation and Cross-Layer Control in Wireless Networks. NOW, 2006, oundations and Trends in Networking. [4] L. Bui, R. Srikant, and A. L. Stolyar, Novel architectures and algorithms or delay reduction in back-pressure scheduling and routing, Proc. IEEE Inocom. Mini Con., [5] L. Ying, S. Shakkottai, and A. Reddy, On combining shortest-path and back-pressure routing over multihop wireless networks, in Proc. IEEE Inocom., Rio de Janeiro, Brazil, [6] L. Huang and M. Neely, Delay reduction via lagrange multipliers in stochastic network optimization, in Proc. Intl. Symposium on Modelling and Optimization in Mobile, Ad Hoc, and Wireless Networks WiOpt, [7] L. Jiang and J. Walrand, Distributed CSMA algorithm or throughput and utility maximization in wireless networks, in Proc. Ann. Allerton Con. Communication, Control and Computing, [8] J. Ni and R. Srikant, Distributed CSMA/CA algorithms or achieving maximum throughput in wireless networks, Technical Report, [9] S. Rajagopalan, D. Shah, and J. Shin, Network adiabatic theorem: An eicient randomized protocol or contention resolution, in Proc. Ann. ACM SIGMETRICS Con., 2009, pp [10] C. Humes, A regulator stabilization technique: Kumar-seidman revisited, IEEE Trans. Automat. Contr., vol. 39, no. 1, pp , Janunary [11] X. Wu and R. Srikant, Regulated maximal matching: A distributed scheduling algorithm or multi-hop wireless networks with nodeexclusive spectrum sharing, in Proc. Con. on Decision and Control, 2005, pp
Scheduling in Multihop Wireless Networks Without Back-Pressure
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 22, NO. 5, OCTOBER 2014 1477 Scheduling in Multihop Wireless Networks Without Back-Pressure Shihuan Liu, Member, IEEE, EylemEkici, Senior Member, IEEE, and LeiYing,Member,
More informationDistributed Power Control and Coding-Modulation Adaptation in Wireless Networks using Annealed Gibbs Sampling
The 31st Annual IEEE International Conference on Computer Communications: Mini-Conference Distributed Power Control and Coding-Modulation Adaptation in Wireless Networks using Annealed Gibbs Sampling Shan
More informationIEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19, NO. 3, JUNE
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19, NO. 3, JUNE 2011 841 On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks Lei Ying, Member, IEEE, Sanjay Shakkottai, Member,
More informationOn Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks Lei Ying ECE Department Iowa State University Email: leiying@iastate.edu Sanjay Shakkottai and Aneesh Reddy ECE Department
More informationA Distributed Throughput-Optimal CSMA/CA
A Distributed Throughput-Optimal CSMA/CA Tae Hyun im, Jian Ni and Nitin H. Vaidya Technical Report, March 16, 2010. Coordinated Science Laboratory Dept. Electrical and Computer Engineering in the University
More informationMULTIUSER scheduling is one of the core challenges in
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19, NO. 4, AUGUST 2011 1057 Throughput-Optimal Opportunistic Scheduling in the Presence of Flow-Level Dynamics Shihuan Liu, Student Member, IEEE, Lei Ying, Member,
More informationMinimization of Congestion using Backpressure Routing Algorithm in Wireless Networks
Vol. 3, Issue. 3, May.-June. 2013 pp-1681-1689 ISSN: 2249-6645 Minimization of Congestion using Backpressure Routing Algorithm in Wireless Networks A. Priyadharsini, Mr. S. Mohanarangan, Dr. D. Sivakumar
More informationDistributed Power Control in Wireless Ad Hoc Networks Using Message Passing: Throughput Optimality and Network Utility Maximization
Distributed Power Control in Wireless Ad Hoc Networks Using Message Passing: Throughput Optimality and Network Utility Maximization Aneesh Reddy, Sanjay Shakkottai, and Lei Ying Abstract This paper presents
More informationOptimal Delay Throughput Tradeoffs in Mobile Ad Hoc Networks Lei Ying, Member, IEEE, Sichao Yang, and R. Srikant, Fellow, IEEE
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 9, SEPTEMBER 2008 4119 Optimal Delay Throughput Tradeoffs in Mobile Ad Hoc Networks Lei Ying, Member, IEEE, Sichao Yang, and R. Srikant, Fellow, IEEE
More informationScheduling in Mobile Ad Hoc Networks With Topology and Channel-State Uncertainty
2504 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 57, NO. 10, OCTOBER 2012 Scheduling in Mobile Ad Hoc Networks With Topology Channel-State Uncertainty Lei Ying, Member, IEEE, Sanjay Shakkottai, Senior
More informationA Distributed CSMA Algorithm for Maximizing Throughput in Wireless Networks
International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 2, Number 2 (2012), pp. 125-132 International Research Publications House http://www. ripublication.com A Distributed
More informationA Survey on Congestion Control and Maximization of Throughput in Wireless Networks
A Survey on Congestion Control and Maximization of Throughput in Wireless Networks K.Ravindra Babu Post graduate student V.R.Siddhartha Engineering College ravindra.bec2008@gmail.com J.Ranga Rao Assistant
More informationJoint Congestion Control and Scheduling in Wireless Networks with Network Coding
Title Joint Congestion Control and Scheduling in Wireless Networks with Network Coding Authors Hou, R; Wong Lui, KS; Li, J Citation IEEE Transactions on Vehicular Technology, 2014, v. 63 n. 7, p. 3304-3317
More informationREDUCING DEFICIT QUEUE DELAY USING VIRTUAL MEMORY
REDUCING DEFICIT QUEUE DELAY USING VIRTUAL MEMORY N.Deepa 1, V.R.Arulmozhi 2, B.Vijaya Nirmala 3 1,2,3 Assistant Professor/Department of CSE, RVS Educational Trust s Group of Institution Dindigul, Tamilnadu,
More informationOptimizing Scheduling Policies and Analyzing Delay in Multi-Hop Wireless Networks P.Pavan kumar Reddy 1, Manohar Gosul 2
Optimizing Scheduling Policies and Analyzing Delay in Multi-Hop Wireless Networks P.Pavan kumar Reddy 1, Manohar Gosul 2 1 M.Tech in CSE Dept, 2 Associate Professor Abstract: In this paper a multi-hop
More informationCROSS-LAYER design of congestion control, routing
IEEE/ACM TRANSACTIONS ON NETWORKING 1 Delay-Guaranteed Cross-Layer Scheduling in Multihop Wireless Networks Dongyue Xue, StudentMember,IEEE,EylemEkici,SeniorMember,IEEE Abstract In this paper, we propose
More informationExploring the Inefficiency and Instability of Back-Pressure Algorithms
Exploring the Inefficiency and Instability of Back-Pressure Algorithms Bo Ji, Changhee Joo, and Ness B. Shroff Abstract In this paper, we focus on the issue of stability in multihop wireless networks under
More informationNode-based Scheduling with Provable Evacuation Time
Node-based Scheduling with Provable Evacuation Time Bo Ji and Jie Wu Department of Computer and Information Sciences Temple University, Philadelphia, PA Email:{boji, jiewu}@temple.edu Abstract This paper
More informationConnection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information
Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information Javad Ghaderi, Tianxiong Ji and R. Srikant Coordinated Science Laboratory and Department of Electrical and Computer Engineering
More informationOptimal Control of Wireless Networks With Finite Buffers
1316 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 20, NO. 4, AUGUST 2012 Optimal Control of Wireless Networks With Finite Buffers Long Bao Le, Member, IEEE, Eytan Modiano, Fellow, IEEE, and Ness B. Shroff,
More informationOptimality of Periodwise Static Priority Policies in Real-time Communications
Optimality of Periodwise Static Priority Policies in Real-time Communications I-Hong Hou, Anh Truong, Santanu Chakraborty and P. R. Kumar Abstract We consider the problem of real-time communication with
More informationDelay Minimization in Multihop Wireless Networks: Static Scheduling Does It
Delay Minimization in Multihop Wireless Networks: Static Scheduling Does It Sharad Birmiwal 1, Jayakrishnan Nair 2, D. Manjunath 3, and Ravi R. Mazumdar 1 1 Department of Electrical and Computer Engineering,
More informationSome Optimization Trade-offs in Wireless Network Coding
Some Optimization Trade-offs in Wireless Network Coding Yalin Evren Sagduyu and Anthony Ephremides Electrical and Computer Engineering Department and Institute for Systems Research University of Maryland,
More informationThroughput-Optimal LIFO Policy for Bounded Delay in the Presence of Heavy-Tailed Traffic
Throughput-Optimal Policy or Bounded Delay in the Presence o Heavy-Tailed Traic Shih-Chun Lin, Pu Wang, Ian F. Akyildiz, and Min Luo BWN Lab, School o Electrical and Computer Engineering, Georgia Institute
More informationCross-Layer Optimization for Wireless Networks with Multi-Receiver Diversity
Cross-Layer Optimization for Wireless Networks with Multi-Receiver Diversity 1 2 3 error broadcasting Michael J. Neely University of Southern California http://www-rcf.usc.edu/~mjneely/ Comm Theory Workshop,
More informationBeyond Interference Avoidance: Distributed Sub-network Scheduling in Wireless Networks with Local Views
Beyond Interference Avoidance: Distributed Sub-network Scheduling in Wireless etworks with Local Views Pedro E. Santacruz, Vaneet Aggarwal, and Ashutosh Sabharwal Abstract In most wireless networks, nodes
More informationNotes on Backpressure Routing
EE 649 STOCHASTIC NETWORK OPTIMIZATION, MICHAEL J. NEELY, SPRING 2011 1 Notes on Backpressure Routing I. BACKPRESSURE ROUTING FOR NETWORKS Backpressure routing refers to an algorithm for dynamically routing
More informationBlocking Avoidance in Wireless Networks
Blocking Avoidance in Wireless Networks Shanyu Zhou University of Illinois at Chicago szhou45@uic.edu Hulya Seferoglu University of Illinois at Chicago hulya@uic.edu Erdem Koyuncu University of California,
More informationWireless Scheduling Design for Optimizing Both Service Regularity and Mean Delay in Heavy-Traffic Regimes
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 24, NO. 3, JUNE 2016 1867 Wireless Scheduling Design for Optimizing Both Service Regularity Mean Delay in Heavy-Traffic Regimes Bin Li, Member, IEEE, Ruogu Li,
More informationThroughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information
IEEE/ACM TRANSACTIONS ON NETWORKING 1 Throughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information Bo Ji, Student Member, IEEE, Changhee Joo, Member, IEEE, and Ness B. Shroff,Fellow,
More informationOptimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks
Optimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks ITA 11, San Diego CA, February 2011 MHR. Khouzani, Saswati Sarkar, Koushik Kar UPenn, UPenn, RPI March 23, 2011 Khouzani, Sarkar,
More informationConstrained Coalitional Games and Networks of Autonomous Agents
972 ISCCSP 2008, Malta, 12-14 March 2008 Constrained Coalitional Games and Networks o Autonomous Agents John S. Baras, Tao Jiang and Punyaslok Purkayastha Institute or Systems Research, Department o Electrical
More informationRouting over Parallel Queues with Time Varying Channels with Application to Satellite and Wireless Networks
2002 Conference on Information Sciences and Systems, Princeton University, March 20-22, 2002 Routing over Parallel Queues with Time Varying Channels with Application to Satellite and Wireless Networks
More informationDelay-minimal Transmission for Energy Constrained Wireless Communications
Delay-minimal Transmission for Energy Constrained Wireless Communications Jing Yang Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, M0742 yangjing@umd.edu
More informationWHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? MARIA AXENOVICH Abstract. It is well known that any two longest paths in a connected graph share a vertex. It is also known that there are connected graphs
More informationContent Caching and Scheduling For Clusters with Elastic and Inelastic Traffic
International Journal of Research Studies in Science, Engineering and Technology Volume 3, Issue 1, January 2016, PP 1-5 ISSN 2349-4751 (Print) & ISSN 2349-476X (Online) Content Caching and Scheduling
More informationTimescale Decoupled Routing and Rate Control in Intermittently Connected Networks
1138 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 20, NO. 4, AUGUST 2012 Timescale Decoupled Routing and Rate Control in Intermittently Connected Networks Jung Ryu, Lei Ying, Member, IEEE, and Sanjay Shakkottai,
More informationPerformance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks Changhee Joo, Member, IEEE, and Ness B. Shroff, Fellow, IEEE
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 17, NO. 5, OCTOBER 2009 1481 Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks Changhee Joo, Member, IEEE, and Ness B. Shroff, Fellow,
More informationJoint Rate Control and Scheduling in Multihop Wireless Networks
Joint Rate Control and Scheduling in Multihop Wireless Networks Xiaojun Lin and Ness B. Shroff School of Electrical and Computer Engineering, Purdue University West Lafayette, IN 47907, U.S.A. {linx, shroff}@ecn.purdue.edu
More informationDual Subgradient Methods Using Approximate Multipliers
Dual Subgradient Methods Using Approximate Multipliers Víctor Valls, Douglas J. Leith Trinity College Dublin Abstract We consider the subgradient method for the dual problem in convex optimisation with
More informationSome Inequalities Involving Fuzzy Complex Numbers
Theory Applications o Mathematics & Computer Science 4 1 014 106 113 Some Inequalities Involving Fuzzy Complex Numbers Sanjib Kumar Datta a,, Tanmay Biswas b, Samten Tamang a a Department o Mathematics,
More informationArchitectures and Algorithms for Wireless Networks
Architectures and Algorithms for Wireless Networks A. Eryilmaz R. Srikant (Ohio State University) (UIUC) Softcopy available at: http://www.ece.osu.edu/~eryilmaz/uiucsummerschool09.pdf Principles and Applications
More informationComparative of Delay Tolerant Network Routings and Scheduling using Max- Weight, Back Pressure and ACO
Comparative of Delay Tolerant Network Routings and Scheduling using Max- Weight, Back Pressure and ACO B.Sindhupiriyaa, 2 Dr.D.Maruthanayagam Research Scholar, Sri Vay Vidyalaya College of Arts & Science,
More informationDynamic Index Coding for Wireless Broadcast Networks
PROC. IEEE INFOCOM 202 Dynamic Index Coding for Wireless Broadcast Networks Michael J. Neely, Arash Saber Tehrani, Zhen Zhang Abstract We consider a wireless broadcast station that transmits packets to
More information13 Sensor networks Gathering in an adversarial environment
13 Sensor networks Wireless sensor systems have a broad range of civil and military applications such as controlling inventory in a warehouse or office complex, monitoring and disseminating traffic conditions,
More informationADAPTIVE ROUTING IN COMMUNICATION NETWORKS USING CELL BREATHING BASED BACKPRESSURE ALGORITHM
Indian Journal of Communications Technology and Electronics (IJCTE) Vol.2.No.1 2014pp 13-17. available at: www.goniv.com Paper Received :05-03-2014 Paper Published:28-03-2014 Paper Reviewed by: 1. John
More informationJoint Scheduling and Instantaneously Decodable Network Coding
1 Joint Scheduling and Instantaneously Decodable Network Coding Danail Traskov, Muriel Médard, Parastoo Sadeghi, and Ralf Koetter Institute for Communications Engineering, Technical University Munich,
More informationAN 608: HST Jitter and BER Estimator Tool for Stratix IV GX and GT Devices
AN 608: HST Jitter and BER Estimator Tool or Stratix IV GX and GT Devices July 2010 AN-608-1.0 The high-speed communication link design toolkit (HST) jitter and bit error rate (BER) estimator tool is a
More informationThroughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions
Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions Abhishek Sinha Laboratory for Information and Decision Systems MIT MobiHoc, 2017 April 18, 2017 1 / 63 Introduction
More informationContent Caching and Scheduling in Wireless Networks with Elastic and Inelastic Traffic B.Muniswamy, Dr. N. Geethanjali
www.ijecs.in International Journal Of Engineering And Computer Science ISSN: 2319-7242 Volume 5 Issue 5 May 2016, Page No. 16679-16679 Content Caching and Scheduling in Wireless Networks with Elastic and
More informationConstant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks
Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks Xiaojun Lin and Shahzada B. Rasool School of Electrical and Computer Engineering, Purdue University West Lafayette, IN 49, U.S.A.
More informationDelay-Based Back-Pressure Scheduling in Multihop Wireless Networks
IEEE/ACM TRANSACTIONS ON NETWORKING 1 Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks Bo Ji, Member, IEEE, Changhee Joo, Member, IEEE, and NessB.Shroff, Fellow, IEEE Abstract Scheduling
More informationDistributed Throughput Maximization in Wireless Mesh Networks via Pre-Partitioning
TO APPEAR IN IEEE/ACM TRANSACTIONS ON NETWORKING, 2008 1 Distributed Throughput Maximization in Wireless Mesh Networks via Pre-Partitioning Andrew Brzezinski, Gil Zussman Senior Member, IEEE, and Eytan
More informationA CLASSIFICATION FRAMEWORK FOR SCHEDULING ALGORITHMS IN WIRELESS MESH NETWORKS Lav Upadhyay 1, Himanshu Nagar 2, Dharmveer Singh Rajpoot 3
A CLASSIFICATION FRAMEWORK FOR SCHEDULING ALGORITHMS IN WIRELESS MESH NETWORKS Lav Upadhyay 1, Himanshu Nagar 2, Dharmveer Singh Rajpoot 3 1,2,3 Department of Computer Science Engineering Jaypee Institute
More informationEnd-to-end bandwidth guarantees through fair local spectrum share in wireless ad hoc networks
End-to-end bandwidth guarantees through fair local spectrum share in wireless ad hoc networks Saswati Sarkar and Leandros Tassiulas 1 Abstract Sharing the common spectrum among the links in a vicinity
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationGD-Aggregate: A WAN Virtual Topology Building Tool for Hard Real-Time and Embedded Applications
GD-Aggregate: A WAN Virtual Topology Building Tool or ard Real-Time and Embedded Applications Qixin Wang,Xueiu, Jennier ou, and ui Sha Department o Computer Science, University o Illinois at Urbana-Champaign
More informationPiecewise polynomial interpolation
Chapter 2 Piecewise polynomial interpolation In ection.6., and in Lab, we learned that it is not a good idea to interpolate unctions by a highorder polynomials at equally spaced points. However, it transpires
More informationSystem Wide Average interruption of Packet Using forecast policy in Wireless System
System Wide Average interruption of Packet Using forecast policy in Wireless System Veerraju Gampala, Department of Computer Science and Engineering, GMR Institute of Technology, Rajam, Andhra Pradesh,
More informationPolynomial Complexity Algorithms for Full Utilization of Multi-hop Wireless Networks
Polynomial Complexity Algorithms for Full Utilization of Multi-hop Wireless Networks Atilla Eryilmaz, Asuman Ozdaglar and Eytan Modiano Laboratory for Information and Decision Systems Massachusetts Institute
More informationPerformance of Multihop Communications Using Logical Topologies on Optical Torus Networks
Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks X. Yuan, R. Melhem and R. Gupta Department of Computer Science University of Pittsburgh Pittsburgh, PA 156 fxyuan,
More informationQueue Length Stability in Trees Under Slowly Convergent Traffic Using Sequential Maximal Scheduling
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering November 2008 Queue Length Stability in Trees Under Slowly Convergent Traffic Using
More informationWIRELESS systems have emerged as a ubiquitous part
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 23, NO. 1, JANUARY 2005 89 Dynamic Power Allocation and Routing for Time-Varying Wireless Networks Michael J. Neely, Eytan Modiano, Senior Member,
More informationDistributed Algorithm for Improving Performance through Swap Link in Wireless Networks
Distributed Algorithm for Improving Performance through Swap Link in Wireless Networks 1 T.Kalaiselvi 2 P.S.Balamurugan 3.K.Sudhakar 1. PG Scholar, Faculty of Engineering, Karpagam University, Coimbatore.
More informationEnd-to-End Bandwidth Guarantees Through Fair Local Spectrum Share in Wireless Ad-Hoc Networks
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering September 2005 End-to-End Bandwidth Guarantees Through Fair Local Spectrum Share in
More informationA Systematic Approach to Network Coding Problems using Conflict Graphs
A Systematic Approach to Network Coding Problems using Conflict Graphs Jay Kumar Sundararajan Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge, MA 02139,
More informationEE 599: Papers on Stochastic Network Optimization
UNIVERSITY OF SOUTHERN CALIFORNIA, SPRING 2007 1 EE 599: Papers on Stochastic Network Optimization I. INTRODUCTION The papers listed below are representative of the area of stochastic network optimization.
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 9, SEPTEMBER /$ IEEE
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 9, SEPTEMBER 2009 4087 Queue Back-Pressure Random Access in Multihop Wireless Networks: Optimality and Stability Jiaping Liu, Alexander L. Stolyar,
More informationToken-DCF: An Opportunistic MAC protocol for Wireless Networks
Token-DCF: An Opportunistic MAC protocol for Wireless Networks Ghazale Hosseinabadi and Nitin Vaidya Department of ECE and Coordinated Science Lab. University of Illinois at Urbana-Champaign {ghossei2,nhv}@illinois.edu
More informationNumerical Analysis of IEEE Broadcast Scheme in Multihop Wireless Ad Hoc Networks
Numerical Analysis of IEEE 802.11 Broadcast Scheme in Multihop Wireless Ad Hoc Networks Jong-Mu Choi 1, Jungmin So 2, and Young-Bae Ko 1 1 School of Information and Computer Engineering Ajou University,
More informationA Joint Congestion Control, Routing, and Scheduling Algorithm in Multihop Wireless Networks with Heterogeneous Flows
1 A Joint Congestion Control, Routing, and Scheduling Algorithm in Multihop Wireless Networks with Heterogeneous Flows Phuong Luu Vo, Nguyen H. Tran, Choong Seon Hong, *KiJoon Chae Kyung H University,
More informationDesign and Implementation of AMRP for Multi hop wireless Mobile ad hoc Networks
1662 Design and Implementation of AMRP for Multi hop wireless Mobile ad hoc Networks Dr.R.Balakrishna Professor & HOD, Dept of ISE, Rajarajeswari College of Engineering Bangalore, India. Email: rayankibala@yahoo.com
More informationCSMA based Medium Access Control for Wireless Sensor Network
CSMA based Medium Access Control for Wireless Sensor Network H. Hoang, Halmstad University Abstract Wireless sensor networks bring many challenges on implementation of Medium Access Control protocols because
More informationA Proposed Approach for Solving Rough Bi-Level. Programming Problems by Genetic Algorithm
Int J Contemp Math Sciences, Vol 6, 0, no 0, 45 465 A Proposed Approach or Solving Rough Bi-Level Programming Problems by Genetic Algorithm M S Osman Department o Basic Science, Higher Technological Institute
More informationThroughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering February 2008 Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless
More informationA STUDY ON COEXISTENCE OF WLAN AND WPAN USING A PAN COORDINATOR WITH AN ARRAY ANTENNA
A STUDY ON COEXISTENCE OF WLAN AND WPAN USING A PAN COORDINATOR WITH AN ARRAY ANTENNA Yuta NAKAO(Graduate School o Engineering, Division o Physics, Electrical and Computer Engineering, Yokohama National
More informationScheduling Heterogeneous Real-Time Traffic over Fading Wireless Channels
Scheduling Heterogeneous Real-Time Traffic over Fading Wireless Channels I-Hong Hou Abstract We develop a general approach for designing scheduling policies for real-time traffic over wireless channels.
More informationRegenerating Codes for Errors and Erasures in Distributed Storage
Regenerating Codes or Errors and Erasures in Distributed Storage K V Rashmi, Nihar B Shah, Kannan Ramchandran, Fellow, IEEE, and P Vijay Kumar, Fellow, IEEE arxiv:0050v csit] 3 May 0 Abstract Regenerating
More informationAcyclic orientations do not lead to optimal deadlock-free packet routing algorithms
Acyclic orientations do not lead to optimal deadloc-ree pacet routing algorithms Daniel Šteanovič 1 Department o Computer Science, Comenius University, Bratislava, Slovaia Abstract In this paper e consider
More informationMinimum Delay Packet-sizing for Linear Multi-hop Networks with Cooperative Transmissions
Minimum Delay acket-sizing for inear Multi-hop Networks with Cooperative Transmissions Ning Wen and Randall A. Berry Department of Electrical Engineering and Computer Science Northwestern University, Evanston,
More informationMATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM
UDC 681.3.06 MATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM V.K. Pogrebnoy TPU Institute «Cybernetic centre» E-mail: vk@ad.cctpu.edu.ru Matrix algorithm o solving graph cutting problem has been suggested.
More informationCONGESTION CONTROL BASED ON SLIDING MODE CONTROL AND SCHEDULING WITH PRIORITIZED QUEUING FOR WIRELESS NETWORKS
CONGESTION CONTROL BASED ON SLIDING MODE CONTROL AND SCHEDULING WITH PRIORITIZED QUEUING FOR WIRELESS NETWORKS R.Keerthana 1, S.Lavanya 2 1 PG Scholar, Dept. of CSE, Sona College of Technology, Salem 636005,
More informationEnd-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks
End-to- bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks Saswati Sarkar and Leandros Tassiulas Abstract Sharing the locally common spectrum among the links of the same
More informationHow to cope with last hop impairments? Part 2 ARQ #5. How to cope with last hop impairments?
How to cope with last hop impairments? Part 2 ARQ #5 Victor S. Frost Dan F. Servey Distinguished Proessor Electrical Engineering and Computer Science University o Kansas 2335 Irving Hill Dr. Lawrence,
More informationGenerell Topologi. Richard Williamson. May 6, 2013
Generell Topologi Richard Williamson May 6, Thursday 7th January. Basis o a topological space generating a topology with a speciied basis standard topology on R examples Deinition.. Let (, O) be a topological
More informationReduced-State, Optimal Medium Access Control for Wireless Data Collection Networks
Reduced-State, Optimal edium Access Control for Wireless Data Collection Networks Avinash ohan Dept. of ECE, Indian Institute of Science, Bangalore, India. avinashmohan@iisc.ac.in Aditya Gopalan Dept.
More informationFUTURE communication networks are expected to support
1146 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 13, NO 5, OCTOBER 2005 A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast Ariel Orda, Senior Member, IEEE, and Alexander Sprintson,
More informationRough Connected Topologized. Approximation Spaces
International Journal o Mathematical Analysis Vol. 8 04 no. 53 69-68 HIARI Ltd www.m-hikari.com http://dx.doi.org/0.988/ijma.04.4038 Rough Connected Topologized Approximation Spaces M. J. Iqelan Department
More informationSome Star Related Vertex Odd Divisor Cordial Labeling of Graphs
Annals o Pure and Applied Mathematics Vol. 6, No., 08, 385-39 ISSN: 79-087X (P), 79-0888(online) Published on 6 February 08 www.researchmathsci.org DOI: http://dx.doi.org/0.457/apam.v6na5 Annals o Some
More informationConstructing Connected Dominating Sets with Bounded Diameters in Wireless Networks
Constructing Connected Dominating Sets with Bounded Diameters in Wireless Networks Yingshu Li Department of Computer Science Georgia State University Atlanta, GA 30303 yli@cs.gsu.edu Donghyun Kim Feng
More informationWorst-case Ethernet Network Latency for Shaped Sources
Worst-case Ethernet Network Latency for Shaped Sources Max Azarov, SMSC 7th October 2005 Contents For 802.3 ResE study group 1 Worst-case latency theorem 1 1.1 Assumptions.............................
More informationKeywords: Medium access control, network coding, routing, throughput, transmission rate. I. INTRODUCTION
Performance Analysis of Network Parameters, Throughput Optimization Using Joint Routing, XOR Routing and Medium Access Control in Wireless Multihop Network 1 Dr. Anuradha M. S., 2 Ms. Anjali kulkarni 1
More informationGeneralization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows
Generalization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows Gianluca Rizzo EPFL, CH-1015 Lausanne, Switzerland Email: gianluca.rizzo@epfl.ch Jean-Yves
More informationToken-DCF: An Opportunistic MAC Protocol for Wireless Networks
Token-DCF: An Opportunistic MAC Protocol for Wireless Networks Ghazale Hosseinabadi and Nitin Vaidya Department of ECE and Coordinated Science Lab. University of Illinois at Urbana-Champaign {ghossei2,
More informationProportional-Share Scheduling for Distributed Storage Systems
Proportional-Share Scheduling or Distributed Storage Systems Abstract Yin Wang University o Michigan yinw@eecs.umich.edu Fully distributed storage systems have gained popularity in the past ew years because
More informationChapter 3 Image Enhancement in the Spatial Domain
Chapter 3 Image Enhancement in the Spatial Domain Yinghua He School o Computer Science and Technology Tianjin University Image enhancement approaches Spatial domain image plane itsel Spatial domain methods
More informationAn Efficient Configuration Methodology for Time-Division Multiplexed Single Resources
An Eicient Coniguration Methodology or Time-Division Multiplexed Single Resources Benny Akesson 1, Anna Minaeva 1, Přemysl Šůcha 1, Andrew Nelson 2 and Zdeněk Hanzálek 1 1 Czech Technical University in
More informationTO meet the increasing bandwidth demands and reduce
Assembling TCP/IP Packets in Optical Burst Switched Networks Xiaojun Cao Jikai Li Yang Chen Chunming Qiao Department o Computer Science and Engineering State University o New York at Bualo Bualo, NY -
More informationCan Multiple Subchannels Improve the Delay Performance of RTS/CTS-based MAC Schemes?
Can Multiple Subchannels Improve the Delay Performance of RTS/CTS-based MAC Schemes? By: Jing Deng, Yunghsiang S. Han, and Sanjeev R. Kulkarni. J. Deng, Y. S. Han, and S. R. Kulkarni, "Can Multiple Subchannels
More information