#### DMCA

## A tutorial on cross-layer optimization in wireless networks (2006)

### Cached

### Download Links

- [cobweb.ecn.purdue.edu]
- [www.ifp.uiuc.edu]
- [www.ece.purdue.edu]
- [www.stanford.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS |

Citations: | 240 - 27 self |

### Citations

1918 |
Rate control in communication networks: shadow prices, proportional fairness and stability
- Kelly, Maulloo, et al.
- 1998
(Show Context)
Citation Context ... system performance (or utility). Such approaches have resulted in a deep understanding of the ubiquitous transmission control protocol (TCP) and resulted in improved solutions for congestion control =-=[1]-=-–[6]. The key question is whether such approaches can be applied to emerging multihop wireless networks to enable a clean-slate Manuscript received April 30, 2006; revised May 8, 2006. X. Lin and N. B... |

1663 |
Combinatorial Optimization: Algorithms and Complexity
- Papadimitriou, Steiglitz
- 1982
(Show Context)
Citation Context ...t , and the only wireless constraint is that each node can only communicate with one other node at any time), where the optimal schedule corresponds to a maximum-weighted-matching problem [28], [29], =-=[42]-=-. This model is an accurate representation for Bluetooth-like networks and a reasonable approximation to frequency-hopping code-division multiple-access (FH-CDMA) systems. When the data rate of a link... |

926 | Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Tassiulas, Ephremides
- 1992
(Show Context)
Citation Context ... or other QoS constraints. Here, the problem moves from the maximization of utility to stochastic stability. The work has largely been motivated by the seminal work on throughput-optimal 3 scheduling =-=[15]-=-. This work shows that scheduling schemes that maximize the queue-weighted sum 3 A scheduling scheme is said to be throughput optimal if it stabilizes the system whenever any other feasible scheduler ... |

660 | Fair end-to-end window-based congestion control
- Mo, Walrand
- 2000
(Show Context)
Citation Context ...ngestion control literature to model fairness, since with different utility functions the rate allocations that maximize the total system utility can be mapped to a range of fairness objectives [35], =-=[36]-=-. We assume that time is divided into slots. At each time slot, the scheduling policy will select a power assignment vector (or, equivalently, ), and select data to be forwarded on each link. Given a ... |

454 |
Information capacity and power control in single-cell multiuser communications
- Knopp, Humblet
- 1995
(Show Context)
Citation Context ...uling achieves multiuser diversity gains because when users experiencing good channels are selected, it enables the system to potentially operate close to its peak rather than average performance. In =-=[8]-=-, under an additive white Gaussian noise (AWGN) model, it has been shown that the sum capacity 2 of a wireless system is maximized when only one user is selected to transmit at any given time. This re... |

427 |
The Mathematics of Internet Congestion Control
- Srikant
- 2003
(Show Context)
Citation Context ...tem performance (or utility). Such approaches have resulted in a deep understanding of the ubiquitous transmission control protocol (TCP) and resulted in improved solutions for congestion control [1]–=-=[6]-=-. The key question is whether such approaches can be applied to emerging multihop wireless networks to enable a clean-slate Manuscript received April 30, 2006; revised May 8, 2006. X. Lin and N. B. Sh... |

350 | Dynamic power allocation and routing for time varying wireless networks
- Neely, Modiano, et al.
- 2003
(Show Context)
Citation Context ...-Centric Formulation In the node-centric formulation, a user rate vector is in the capacity region if and only if there exists a link rate vector associated with each destination node satisfies [15], =-=[37]-=- , and the vector where can be interpreted as the rate on link that is allocated for data towards destination . These set of equations simply represent a balance of incoming rates and outgoing rates a... |

338 | The impact of imperfect scheduling on crosslayer rate control in multihop wireless networks
- Lin, Shroff
(Show Context)
Citation Context ...oth formulations can be generalized to the case with channel variations (e.g., due to fading and/or mobility of the nodes), in which case only the scheduling component needs to be changed [30], [33], =-=[40]-=-. As a final note, the node-centric formulation can also be generalized to the case with predetermined routing, and the linkcentric formulation can also be generalized to the case with multipath routi... |

320 |
Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system
- Jalali, Padovani, et al.
- 2000
(Show Context)
Citation Context ...at is proportionally fair, i.e., increasing the mean throughput of one user from the optimal level by results in a cumulative percentage decrease by greater than of the mean throughput of other users =-=[14]-=-. It turns out that such a solution is achieved when the optimization problem is to maximize the sum of the logarithms of the expected rates (or the product of the expected rates), i.e., In each of th... |

281 | Capacity Regions for Wireless Ad Hoc Networks
- Toumpis, Goldsmith
- 2003
(Show Context)
Citation Context ...ards destination . These set of equations simply represent a balance of incoming rates and outgoing rates at each node. The convex-hull operator is due to a standard timeaveraging argument [15], [37]–=-=[39]-=-. The Solution: Although the rate-power function is generally a nonconvex function, the convex-hull operator in fact makes the capacity region a convex set. Hence, the problem (5) has a dual such that... |

259 | Fairness and optimal stochastic control for heterogeneous networks
- Neely, Modiano, et al.
- 2005
(Show Context)
Citation Context ...nvex set. Hence, the problem (5) has a dual such that there is no duality gap [28]. Associating a Lagrange multiplier for each constraint in (6), we can then obtain the following solution [28], [32], =-=[33]-=-. The data rates of the users are determined by The schedule is determined by first solving the following subproblem: Each link then picks the corresponding power assignment that achieves , and comput... |

248 |
Providing quality of service over a shared wireless link
- Andrews, Kumaran, et al.
- 2001
(Show Context)
Citation Context ...emes. This idea has been further developed into a general class of queue-length-based (or, equivalently, delaybased) opportunistic scheduling schemes that focus on stability and throughput optimality =-=[16]-=-–[20]. For example, in [16], [17], simple index scheduling policies of the following form are shown to be throughput optimal: where is a constant, is the head-of-the-line packet delay at queue , and a... |

239 |
Cdma/hdr: A bandwidth-efficient high-speed wireless data service for nomadic users
- Bender, Black, et al.
- 2000
(Show Context)
Citation Context ...efit to user of the receiving data rate . Note that is a function of the channel condition and the coding and modulation scheme used. There have been many scheduling schemes that address this problem =-=[9]-=-–[13]. Interestingly, most of these approaches result in an optimal solution that can be expressed in the form of simple myopic index policies given by 2 The maximum total throughput that can be achie... |

231 | A game-theoretic framework for bandwidth allocation and pricing in broadband networks - Yaiche, Mazumdar, et al. - 2000 |

220 | The throughput of data switches with and without speed-up
- Dai, Prabhakar
- 2000
(Show Context)
Citation Context ...it is not scheduled is that another link from its interference set is scheduled. The above policy is a natural extension of the maximal schedules considered for high-speed switches in [51], [53], and =-=[54]-=- and, for Bluetooth-like wireless networks, in [29]. The simplest model to consider is one where are independent identically distributed (i.i.d.) across . In other words, the arrival process is i.i.d.... |

219 | Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
- Liu, Chong, et al.
- 2001
(Show Context)
Citation Context ...IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 24, NO. 8, AUGUST 2006 where and are constants and can be viewed as Lagrange multipliers. For example, consider the following problem studied in =-=[12]-=-, [13]: where is the set of all stationary scheduling policies, and is the minimum fraction of time-slots assigned to user (i.e., fairness in time). Clearly, this is a nonlinear optimization problem. ... |

213 | User-level performance of channel-aware scheduling algorithms in wireless data networks
- Borst
- 2003
(Show Context)
Citation Context ...ay-based index policy that provides exponential weight to the delay (the so-called exponential rule) is shown to be throughput optimal. Throughput optimal scheduling schemes have also been derived in =-=[21]-=-, where the authors also incorporate flow-level dynamics into their model. In particular, the authors model users arriving to the system with a random amount of workload (e.g., a file size), and depar... |

212 | Impact of fairness on internet performance
- Bonald, Massouli
- 2001
(Show Context)
Citation Context ...the congestion control literature to model fairness, since with different utility functions the rate allocations that maximize the total system utility can be mapped to a range of fairness objectives =-=[35]-=-, [36]. We assume that time is divided into slots. At each time slot, the scheduling policy will select a power assignment vector (or, equivalently, ), and select data to be forwarded on each link. Gi... |

209 | End-to-end congestion control schemes: Utility functions, Random losses and ECN marks - Kunniyur, Srikant - 2000 |

200 | Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm,” Queue
- Stolyar
- 2005
(Show Context)
Citation Context ... This idea has been further developed into a general class of queue-length-based (or, equivalently, delaybased) opportunistic scheduling schemes that focus on stability and throughput optimality [16]–=-=[20]-=-. For example, in [16], [17], simple index scheduling policies of the following form are shown to be throughput optimal: where is a constant, is the head-of-the-line packet delay at queue , and as bef... |

194 | Fair resource allocation in wireless networks using queue-length based scheduling and congestion control - Eryilmaz, Srikant |

191 | Optimal Routing, Link Scheduling and Power Control in Multi-hop Wireless Networks
- Cruz, Santhanam
- 2003
(Show Context)
Citation Context ...erty that each node either does not transmit at all, or transmits at the maximum power to only one other node. This property significantly reduces the search space for optimal power assignments [28], =-=[38]-=-. However, the complexity remains exponential in the number of nodes. For certain special rate-power functions, although the function is originally not a concave function of , it may become a concave ... |

171 | Scheduling for multiple flows sharing a time-varying channel: The exponential rule
- Shakkottai, Stolyar
- 2002
(Show Context)
Citation Context ...developed into a general class of queue-length-based (or, equivalently, delaybased) opportunistic scheduling schemes that focus on stability and throughput optimality [16]–[20]. For example, in [16], =-=[17]-=-, simple index scheduling policies of the following form are shown to be throughput optimal: where is a constant, is the head-of-the-line packet delay at queue , and as before is the data rate of user... |

168 | Simultaneous routing and resource allocation via dual decomposition
- Xiao, Johansson, et al.
- 2004
(Show Context)
Citation Context ...tooth-like networks and a reasonable approximation to frequency-hopping code-division multiple-access (FH-CDMA) systems. When the data rate of a link is a concave function of its own power assignment =-=[43]-=- (which implies no interference between links). Further, in the so-called low-SINR case when the data rate of a link is a linear function of its SINR, the perfect schedule (i.e., power assignment) sat... |

156 | Joint rate control and scheduling in multihop wireless networks
- Lin, Shroff
(Show Context)
Citation Context ...ach results in a conservative rate allocation. The general cross-layer solutions for jointly optimizing congestion control and scheduling have recently been developed by a number of researchers [20], =-=[28]-=-–[34]. In this section, we will review two types of formulations and solutions that can potentially be used for online implementation. A. The Model We consider a multihop wireless network with nodes. ... |

139 |
Ergodicity of stochastic processes describing the operation of open queueing networks
- Rybko, Stolyar
- 1992
(Show Context)
Citation Context ...eue-length stability when packets are assumed to arrive at all nodes on a route simultaneously does not guarantee the stability of networks where the packets have to traverse one node at a time [60], =-=[61]-=-. One solution to this problem was suggested in [50] and [52] using a policing device called a regulator to reshape traffic at each node in the network. However, this solution requires the use of per-... |

135 | Hop-by-hop Congestion Control over a Wireless Multi-hop Network - Yi, Shakkottai - 2004 |

134 | Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems
- Kumar, Seidman
- 1990
(Show Context)
Citation Context ...hat queue-length stability when packets are assumed to arrive at all nodes on a route simultaneously does not guarantee the stability of networks where the packets have to traverse one node at a time =-=[60]-=-, [61]. One solution to this problem was suggested in [50] and [52] using a policing device called a regulator to reshape traffic at each node in the network. However, this solution requires the use o... |

122 | Joint congestion control, routing, and MAC for stability and fairness in wireless networks
- Eryilmaz, Srikant
- 2006
(Show Context)
Citation Context ... to the case with predetermined routing, and the linkcentric formulation can also be generalized to the case with multipath routing [28]. Primal-dual solutions to this problem are studied in [20] and =-=[31]-=-. E. Cases Where the Perfect Scheduling Components is Solvable The scheduling component (8) or (12) is usually difficult to solve because the rate power function in many wireless settings is not conca... |

121 | Optimization Flow Control{I: Basic Algorithm and Convergence - Low, Lapsley - 1999 |

118 | Joint congestion control and media access control design for ad hoc wireless networks
- Chen, Low, et al.
- 2005
(Show Context)
Citation Context ...n multihop wireless networks varies and depends on the scheduling policies at the underlying layers. There have been attempts to solve this cross-layer control problem using a “layered” approach [24]–=-=[27]-=-. The approach is to find a feasible rate region that has a simpler set of constraints similar to that of wireline networks, and then develop congestion controllers that compute the rate allocation wi... |

83 | Dynamic rate control algorithms for HDR throughput optimization - Borst, Whiting - 2001 |

74 |
Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing
- Wu, Srikant
(Show Context)
Citation Context ...he traffic on a route arrives at all the links on a route instantaneously, then it is effectively the same problem as one where the routes consist of a single hop. Alternatively, it has been shown in =-=[52]-=- that if one uses traffic reshaping at each link, the stability conditions for single-hop routes also apply to multihop routes. in time slot or not. We make the assumption that link is eligible for sc... |

74 | Constant-time distributed scheduling policies for ad hoc wireless networks
- Lin, Rasool
- 2009
(Show Context)
Citation Context ...n that indeed a constant-overhead algorithm does exists provided that we are willing to tolerate a further small reduction in throughput beyond the loss in throughput dictated by the maximal schedule =-=[58]-=-. The algorithm is similar in spirit to an algorithm suggested earlier for switches [51]. VI. CONCLUSION AND OPEN PROBLEMS In the previous sections, we have summarized the significant progress in opti... |

69 | Scheduling nonuniform traffic in a packetswitching system with small propagation delay
- Weller, Hajek
- 1997
(Show Context)
Citation Context ...ason that it is not scheduled is that another link from its interference set is scheduled. The above policy is a natural extension of the maximal schedules considered for high-speed switches in [51], =-=[53]-=-, and [54] and, for Bluetooth-like wireless networks, in [29]. The simplest model to consider is one where are independent identically distributed (i.i.d.) across . In other words, the arrival process... |

68 | On the stability of input-queued switches with speed-up
- Leonardi, Mellia, et al.
- 2001
(Show Context)
Citation Context ...of the imperfect schedule. A number of low-complexity scheduling algorithms fall into this class. For example, under the node-exclusive interference model, simple Greedy Maximal Matching policy [29], =-=[51]-=- is an -policy with . In [29], the fairness and efficiency of a cross-layer solution using an -policy are studied. Two types of results are reported. In the static case where the user population is fi... |

63 | Layering as optimization decomposition
- Chiang, Low, et al.
- 2007
(Show Context)
Citation Context ...cus is to provide the readers with a sketch of the main issues, challenges, and techniques in this area, and also identify the main open problems to the community. For another survey in this area see =-=[7]-=-. The rest of this tutorial is organized as follows. Section II will begin with an exposition of the important problem of scheduling in cellular networks. Here, the emphasis is on incorporating physic... |

62 | Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access
- Wang, Kar
- 2005
(Show Context)
Citation Context ...bles. Such cases include: 1) the so-called high-SINR case where the rate of each link is a logarithmic function of its SINR [44], [45]; 2) the low-SINR case [46]; and 3) single-channel Aloha networks =-=[47]-=-–[49]. With these rate-power functions, rather than solving the problem (5), several researchers instead study the following problem [44]–[49] (the link-centric formulation is used here): (14) Note th... |

53 | End-to-end Bandwidth Guarantees Through Fair Local Spectrum Share
- Sarkar, Tassiulas
- 2003
(Show Context)
Citation Context ...ity in multihop wireless networks varies and depends on the scheduling policies at the underlying layers. There have been attempts to solve this cross-layer control problem using a “layered” approach =-=[24]-=-–[27]. The approach is to find a feasible rate region that has a simpler set of constraints similar to that of wireline networks, and then develop congestion controllers that compute the rate allocati... |

50 | A Mathematical Framework for Designing a Low-Loss, Low-Delay Internet - Low, Srikant - 2004 |

46 | Downlink power allocation for multi-class CDMA wireless networks - Lee, Mazumdar, et al. - 2005 |

40 | Price-based Resource Allocation in Wireless Ad Hoc Networks - Xue, Li, et al. - 2003 |

38 | Jointly optimal congestion and contention control based on network utility maximization - Lee, Chiang, et al. |

35 | Dullerud, “A large deviations analysis of scheduling in wireless networks
- Ying, Srikant, et al.
- 2006
(Show Context)
Citation Context ...model. In particular, the authors model users arriving to the system with a random amount of workload (e.g., a file size), and departing when this workload has been transmitted. Recently, in [22] and =-=[23]-=-, the authors have attempted to characterize the impact of different forms of scheduling on stability and QoS using techniques from large-deviation and heavy traffic limits. The key results from these... |

34 |
On the connectionlevel stability of congestion-controlled communication networks
- Lin, Shroff, et al.
- 2006
(Show Context)
Citation Context ...n networks with a fixed number of users, we had discussed connection arrivals and departures in the context of imperfect schedules (in Section IV). For the case of perfect schedules, it was proven in =-=[59]-=- that the class of joint congestion-control/routing/MAC policies discussed in Section III is throughput optimal when there are connection-level arrivals and departures. However, it was assumed that th... |

30 | Queue length stability of maximal greedy schedules in wireless networks
- Wu, Srikant, et al.
- 2006
(Show Context)
Citation Context ...lies to more general models as well; in fact, it holds for any rule used to choose the set of active links, as long as the resulting schedule is a maximal schedule. The following result was proved in =-=[55]-=- and [56]. Proposition 2: For any distributions , the Markov chain is stable-in-the-mean, i.e., if (18) Remark: The condition in (18) can be used to form the region (see Section IV-A). One may then us... |

26 |
Effective Capacity and QoS for wireless scheduling
- Shakkottai
- 2008
(Show Context)
Citation Context ...s into their model. In particular, the authors model users arriving to the system with a random amount of workload (e.g., a file size) and depart when this workload has been transmitted. Recently, in =-=[22]-=-, [23] the authors have attempted to characterize the impact of different forms of scheduling on stability and QoS using techniques from large-deviation and heavy traffic limits. The key results from ... |

22 | Maximum Weighted Matching with Interference Constraints
- Sharma, Mazumdar, et al.
- 2006
(Show Context)
Citation Context ...rs change every time slot. Hence, a different optimal schedule needs to be computed at every time slot. Thus, the complexity of the scheduling component is the main bottleneck for the entire solution =-=[41]-=-. A few cases have been studied where computing the exact optimal schedule is of polynomial-time complexity. Cellular networks or access-point-based single-hop wireless networks where at each time onl... |

22 | Distributed rate allocation for inelastic flows: Optimization framework, optimality conditions, and optimal algorithms - Chiang, Zhang, et al. - 2005 |

21 | Scheduling, Routing and Power Allocation for Fairness in Wireless Networks
- Johansson, Xiao
- 2004
(Show Context)
Citation Context ...esults in a conservative rate allocation. The general cross-layer solutions for jointly optimizing congestion control and scheduling have recently been developed by a number of researchers [20], [28]–=-=[34]-=-. In this section, we will review two types of formulations and solutions that can potentially be used for online implementation. A. The Model We consider a multihop wireless network with nodes. Let d... |

14 | and H.J.Kushner. Control of mobile communication systems with time-varying channels via stability methods - Buche |

13 | Achieving queue length stability through maximal scheduling in wireless networks
- Chaporkar, Kar, et al.
- 2006
(Show Context)
Citation Context ...ore general models as well; in fact, it holds for any rule used to choose the set of active links, as long as the resulting schedule is a maximal schedule. The following result was proved in [55] and =-=[56]-=-. Proposition 2: For any distributions , the Markov chain is stable-in-the-mean, i.e., if (18) Remark: The condition in (18) can be used to form the region (see Section IV-A). One may then use the lay... |

12 | Dynamic rate control algorithms for CDMA throughput optimization - Borst, Whiting |

11 |
A Stochastic Primal-Dual Algorithm for Joint Flow Control and
- Zhang, Zheng
- 2006
(Show Context)
Citation Context ... Such cases include: 1) the so-called high-SINR case where the rate of each link is a logarithmic function of its SINR [44], [45]; 2) the low-SINR case [46]; and 3) single-channel Aloha networks [47]–=-=[49]-=-. With these rate-power functions, rather than solving the problem (5), several researchers instead study the following problem [44]–[49] (the link-centric formulation is used here): (14) Note the omi... |

10 |
Joint congestion control and distributed schedulingin multihop wireless networks with a node-exclusive interference model
- Bui, Eryilmaz, et al.
- 2006
(Show Context)
Citation Context ...blem (5) with the constraints replaced by . Since now the “optimal” rate allocation lies in , the imperfect scheduling policy will then be able to support the computed end-to-end user rate-vector. In =-=[50]-=-, such a layered approach is applied to the node-exclusive interference model. Under this model, a simple scheduling policy called Maximal Matching can guarantee the following capacity region (see Sec... |

9 |
framework for opportunistic scheduling in wireless networks
- “A
- 2003
(Show Context)
Citation Context ... to user of the receiving data rate . Note that is a function of the channel condition and the coding and modulation scheme used. There have been many scheduling schemes that address this problem [9]–=-=[13]-=-. Interestingly, most of these approaches result in an optimal solution that can be expressed in the form of simple myopic index policies given by 2 The maximum total throughput that can be achieved i... |

9 |
congestion control, routing and MAC for stability and fairness in wireless networks
- “Joint
- 2006
(Show Context)
Citation Context ... to the case with pre-determined routing, and the link-centric formulation can also be generalized to the case with multi-path routing [28]. Primal-dual solutions to this problem are studied in [20], =-=[31]-=-. E. Cases where the Perfect Scheduling Component is Solvable The scheduling component (8) or (12) is usually difficult to solve because the rate power function u(·) in many wireless settings is not c... |

9 | Opportunistic power scheduling for multi-server wireless systems with minimum performance constraints - Lee, Mazumdar, et al. - 2006 |

8 |
Learning contention patterns and adapting to load/topology changes in a mac scheduling algorithm
- Yi, Veciana, et al.
- 2006
(Show Context)
Citation Context ...ver, its guaranteed throughput is lower than the guaranteed throughput of maximal schedules of Section V. Recently, distributed algorithms that achieve full throughput have been discussed in [62] and =-=[63]-=-. However, these algorithms require significant overheads or require unacceptably large delays. An open problem is to characterize the tradeoff between the overhead required and the reduction in throu... |

4 |
Balancing transport and physical layer in multihop wireless networks: jointly optimal congestion and power control
- Chiang
- 2005
(Show Context)
Citation Context ...ve function of , it may become a concave function after some change of variables. Such cases include: 1) the so-called high-SINR case where the rate of each link is a logarithmic function of its SINR =-=[44]-=-, [45]; 2) the low-SINR case [46]; and 3) single-channel Aloha networks [47]–[49]. With these rate-power functions, rather than solving the problem (5), several researchers instead study the following... |

3 |
Scheduling, Routing, and Power Allocation for Fairness
- Johansson, Xiao
- 2004
(Show Context)
Citation Context ...esults in a conservative rate allocation. The general cross-layer solutions for jointly optimizing congestion control and scheduling have recently been developed by a number of researchers [20], [28]–=-=[34]-=-. In this section, we will review two types of formulations and solutions that can potentially be used for online implementation. A. The Model We consider a multi-hop wireless network with N nodes. Le... |

2 | End-to-end and MAC-layer fair rate assignment in interference limited wireless access networks
- Arisoylu, Javidi, et al.
- 2006
(Show Context)
Citation Context ...concave function after some change of variables. Such cases include: 1) the so-called high-SINR case where the rate of each link is a logarithmic function of its SINR [44], [45]; 2) the low-SINR case =-=[46]-=-; and 3) single-channel Aloha networks [47]–[49]. With these rate-power functions, rather than solving the problem (5), several researchers instead study the following problem [44]–[49] (the link-cent... |

2 |
End-to-End and Mac-Layer Fair Rate Assignment
- Arisoylu, Javidi, et al.
- 2006
(Show Context)
Citation Context ...ion after some change of variables. Such cases include: (a) the so-called high-SINR case where the rate rij of each link (i, j) is a logarithmic function of its SINR [44], [45]; (b) the low-SINR case =-=[46]-=-; (c) single-channel Aloha networks [47]–[49]. With these ratepower functions, rather than solving the problem (5), several researchers instead study the following problem [44]–[49] (the link-centric ... |

1 |
Effective capacity and QoS for wireless scheduling,” preprint
- Shakkottai
- 2004
(Show Context)
Citation Context ...to their model. In particular, the authors model users arriving to the system with a random amount of workload (e.g., a file size), and departing when this workload has been transmitted. Recently, in =-=[22]-=- and [23], the authors have attempted to characterize the impact of different forms of scheduling on stability and QoS using techniques from large-deviation and heavy traffic limits. The key results f... |

1 |
Asymptotically optimal transmission policies for low-power wireless sensor networks
- Paschalidis, Lai, et al.
- 2005
(Show Context)
Citation Context ...n a convex set. Hence, the problem (5) has a dual such that there is no duality gap [28]. Associating a Lagrange multiplier for each constraint in (6), we can then obtain the following solution [28], =-=[32]-=-, [33]. The data rates of the users are determined by The schedule is determined by first solving the following subproblem: Each link then picks the corresponding power assignment that achieves , and ... |

1 |
guarantees in maximal scheduling in wireless networks
- “Throughput
- 2005
(Show Context)
Citation Context ... the set of stabilizable arrival rates must satisfy Comparing this to the sufficient condition for stability under maximal schedules, we see that the throughput is reduced by a factor of at most . In =-=[57]-=-, it has been shown that the above bound for throughput loss is tight for certain types of arrival processes and topologies. However, the argument requires that the arrival processes to the various li... |

1 |
Distributed control for throughput-optimality and fairness in wireless networks
- Eryilmaz, Modiano, et al.
- 2006
(Show Context)
Citation Context ...58]. However, its guaranteed throughput is lower than the guaranteed throughput of maximal schedules of Section V. Recently, distributed algorithms that achieve full throughput have been discussed in =-=[62]-=- and [63]. However, these algorithms require significant overheads or require unacceptably large delays. An open problem is to characterize the tradeoff between the overhead required and the reduction... |