#### DMCA

## Dynamic packet scheduler optimization in wireless relay networks (2012)

Venue: | Selected Areas in Communications, IEEE Journal on |

Citations: | 1 - 0 self |

### Citations

1925 | Cooperative diversity in wireless networks: Efficient protocols and outage behavior
- Laneman, Tse, et al.
(Show Context)
Citation Context ...ss limited functionality and have low power consumption. Consequently, they are significantly cheaper than a full-scale base station. Early studies of cooperative communication were initiated by [2], =-=[3]-=- and [4]. Since then, the subject attracted the attention of many researchers, cf. [5] [6]. Most of the existing work in this area aimed at exploiting the diversity and multiplexing gain to improve so... |

465 |
Lectures on the coupling method
- Lindvall
- 2002
(Show Context)
Citation Context ...less networks. The optimization cost that we consider in this work is a monotone, non-decreasing function of the system queue occupancy. We prove using stochastic dominance [9] and coupling arguments =-=[10]-=-, that a most balancing (MB) policy minimizes, in stochastic ordering sense1, the cost function random process. 1.1 Previous Work The problem we are investigating lies in the area of optimal control i... |

417 | User cooperation diversity-part i: system description
- Sendonaris, Erkip, et al.
- 2003
(Show Context)
Citation Context ...possess limited functionality and have low power consumption. Consequently, they are significantly cheaper than a full-scale base station. Early studies of cooperative communication were initiated by =-=[2]-=-, [3] and [4]. Since then, the subject attracted the attention of many researchers, cf. [5] [6]. Most of the existing work in this area aimed at exploiting the diversity and multiplexing gain to impro... |

368 |
Cooperative communication in wireless networks
- Nosratinia, Hunter, et al.
- 2004
(Show Context)
Citation Context ...ed functionality and have low power consumption. Consequently, they are significantly cheaper than a full-scale base station. Early studies of cooperative communication were initiated by [2], [3] and =-=[4]-=-. Since then, the subject attracted the attention of many researchers, cf. [5] [6]. Most of the existing work in this area aimed at exploiting the diversity and multiplexing gain to improve some perfo... |

316 |
Comparison Methods for Queues and Other Stochastic Models
- Stoyan, Daley
- 1983
(Show Context)
Citation Context ...ted, fourth generation wireless networks. The optimization cost that we consider in this work is a monotone, non-decreasing function of the system queue occupancy. We prove using stochastic dominance =-=[9]-=- and coupling arguments [10], that a most balancing (MB) policy minimizes, in stochastic ordering sense1, the cost function random process. 1.1 Previous Work The problem we are investigating lies in t... |

314 | Capacity bounds and power allocation for wireless relay channel
- Host-Madsen, Zhang
- 2005
(Show Context)
Citation Context ...nvestigated thoroughly in recent literature. Relay selection and cooperation strategies for relay networks have been investigated by [16] and [17] among others. Power control has been investigated by =-=[18]-=- and [19] and many others. However, the modern wireless networks are mostly IP-based, and therefore the optimization problem may be reduced to finding the optimal dynamic packet scheduling policies in... |

275 | Dynamic server allocation to parallel queues with randomly varying connectivity
- Tassiulas, Ephremides
- 1993
(Show Context)
Citation Context ...s. queues with infinite size (see Figure 1). The wireless channel in such network is varying with time and can best be described by a random process. This assumption is widely used in literature, cf. =-=[11]-=-, [12] and many other. A wireless link is assumed to be ‘connected’ with probability p and ‘not connected’ otherwise. We further assume that the connectivity processes are independent across the wirel... |

140 |
Increasing uplink capacity via user cooperation diversity
- Sendonaris, Erkip, et al.
- 1998
(Show Context)
Citation Context ...icantly cheaper than a full-scale base station. Early studies of cooperative communication were initiated by [2], [3] and [4]. Since then, the subject attracted the attention of many researchers, cf. =-=[5]-=- [6]. Most of the existing work in this area aimed at exploiting the diversity and multiplexing gain to improve some performance criteria, e.g., capacity and bandwidth utilization, outage probability,... |

91 |
Stochastic Processes, 2nd ed
- Ross
- 1996
(Show Context)
Citation Context ...l in [8]. They investigated an optimal 1Stochastic dominance is a stronger optimization notion than the expected cost minimization since the former implies the later; however, the reverse is not true =-=[7]-=-. control policy of service rate in a system of two queues in tandem. They proved, using dynamic programming argument, that a threshold policy is optimal in that it minimizes the expected cost functio... |

33 | Relayer selection strategies in cellular networks with peer-to-peer relaying
- Sreng, Yanikomeroglu, et al.
- 2003
(Show Context)
Citation Context ...andwidth for each user are important design parameters which were investigated thoroughly in recent literature. Relay selection and cooperation strategies for relay networks have been investigated by =-=[16]-=- and [17] among others. Power control has been investigated by [18] and [19] and many others. However, the modern wireless networks are mostly IP-based, and therefore the optimization problem may be r... |

31 | Tsitsiklis, “Optimal transmission scheduling in symmetric communication models with intermittent connectivity
- Ganti, Modiano, et al.
- 2007
(Show Context)
Citation Context ...ues with infinite size (see Figure 1). The wireless channel in such network is varying with time and can best be described by a random process. This assumption is widely used in literature, cf. [11], =-=[12]-=- and many other. A wireless link is assumed to be ‘connected’ with probability p and ‘not connected’ otherwise. We further assume that the connectivity processes are independent across the wireless li... |

31 |
Applied abstract algebra
- Lidl, Pilz
- 1998
(Show Context)
Citation Context ...r (4) is defined as the transitive closure of the relation v on the set ZM+ ,M > 0. The transitive closure of v on the set ZM+ is the smallest transitive relation on ZM+ that contains the relationv =-=[20]-=-. Intuitively, x̃ 4 x if the vector x̃ is obtained from x by performing a sequence reductions, permutations of two components and/or balancing interchanges. 4.2 Definition of the Class of Cost Functio... |

29 |
Optimal control of service in tandem queues
- Rosberg, Varaiya, et al.
- 1982
(Show Context)
Citation Context ...the cost function random process. 1.1 Previous Work The problem we are investigating lies in the area of optimal control in queueing networks. A related problem was first studied by Roseburg et al in =-=[8]-=-. They investigated an optimal 1Stochastic dominance is a stronger optimization notion than the expected cost minimization since the former implies the later; however, the reverse is not true [7]. con... |

27 | Is amplify-and-forward practically better than decodeand-forward or vice versa
- Yu, Li
- 2005
(Show Context)
Citation Context ...for each user are important design parameters which were investigated thoroughly in recent literature. Relay selection and cooperation strategies for relay networks have been investigated by [16] and =-=[17]-=- among others. Power control has been investigated by [18] and [19] and many others. However, the modern wireless networks are mostly IP-based, and therefore the optimization problem may be reduced to... |

17 | Distributed power allocation for parallel relay networks
- Chen, Serbetli, et al.
- 2005
(Show Context)
Citation Context ...ed thoroughly in recent literature. Relay selection and cooperation strategies for relay networks have been investigated by [16] and [17] among others. Power control has been investigated by [18] and =-=[19]-=- and many others. However, the modern wireless networks are mostly IP-based, and therefore the optimization problem may be reduced to finding the optimal dynamic packet scheduling policies in these ne... |

16 |
Cooperative diversity of wireless ad hoc networks
- Stankovic, Host-Madsen, et al.
- 2006
(Show Context)
Citation Context ...tly cheaper than a full-scale base station. Early studies of cooperative communication were initiated by [2], [3] and [4]. Since then, the subject attracted the attention of many researchers, cf. [5] =-=[6]-=-. Most of the existing work in this area aimed at exploiting the diversity and multiplexing gain to improve some performance criteria, e.g., capacity and bandwidth utilization, outage probability, err... |

14 |
Interchange arguments in stochastic scheduling
- NAIN, TSOUCAS, et al.
- 1989
(Show Context)
Citation Context ...lly used by mathematicians to prove properties for stochastic processes. Later on, coupling methods proved to be handy in proving optimality results for dynamic control of queueing systems. cf. [21], =-=[22]-=-, [11], [12] and many others. In the proof of Lemmas 3 and 4 we apply the coupling method as follows: For the scheduling policy pi, let ω be a given sample path of the system state process. We constru... |

3 |
Cooperative Multiplexing and Scheduling
- Shi, Zhang, et al.
- 2008
(Show Context)
Citation Context ... [12] above. We proved, using coupling arguments, that a Most Balancing (MB) policy is optimal in that it minimizes, in stochastic ordering sense, a cost function of the queue sizes in the system. In =-=[14]-=-, the authors proposed a cooperative multiplexing and scheduling algorithm for a wireless relay network with a single relay node. They showed that this algorithm outperforms the traditional opportunis... |

2 |
A note on optimal control of a queuing system with two heterogeneous servers
- Walrand
- 1984
(Show Context)
Citation Context ...initially used by mathematicians to prove properties for stochastic processes. Later on, coupling methods proved to be handy in proving optimality results for dynamic control of queueing systems. cf. =-=[21]-=-, [22], [11], [12] and many others. In the proof of Lemmas 3 and 4 we apply the coupling method as follows: For the scheduling policy pi, let ω be a given sample path of the system state process. We c... |

1 | Optimal Resource Scheduling - Al-Zubaidy, Lambadaris, et al. - 2009 |

1 | Scheduling with QoS Guarantee for Wireless Relay Networks
- Hong, Pang, et al.
- 2009
(Show Context)
Citation Context ...g algorithm for a wireless relay network with a single relay node. They showed that this algorithm outperforms the traditional opportunistic techniques in terms of spectral efficiency. The authors in =-=[15]-=- studied link scheduling in WRN with bandwidth and delay guarantees. They modelled the system using simple directed graph. They proposed an efficient algorithm to provide delay guarantee over WRN. For... |