Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in CommunicationsPublished 1 January 2001
Xiao Liu, Edwin K. P. Chong, Ness B. Shroff
Citations591
SJR quartileQ1
SJR score7.02
SNIP4.91
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is demonstrated via simulation results that the opportunistic transmission scheduling scheme is robust to estimation errors and also works well for nonstationary scenarios, resulting in performance improvements of 20%-150% compared with a scheduling scheme that does not take into account channel conditions.
Abstract
We present an "opportunistic" transmission scheduling policy that exploits time-varying channel conditions and maximizes the system performance stochastically under a certain resource allocation constraint. We establish the optimality of the scheduling scheme and also that every user experiences a performance improvement over any nonopportunistic scheduling policy when users have independent performance values. We demonstrate via simulation results that the scheme is robust to estimation errors and also works well for nonstationary scenarios, resulting in performance improvements of 20%-150% compared with a scheduling scheme that does not take into account channel conditions. Last, we discuss an extension of our opportunistic scheduling scheme to improve "short-term" performance.
Keywords
Computer ScienceEngineering
IEEE/ACM Transactions on NetworkingA generalized processor sharing approach to flow control in integrated services networks: the single-node case
3,723 Citations1993Abhay Parekh, Robert G. Gallager
European Transactions on TelecommunicationsCharging and rate control for elastic traffic
2,961 Citations1997F. P. Kelly
This paper addresses the issues of charging, rate control and routing for a communication network carrying elastic traffic, such as an ATM network offering an available bit rate service, from which max-min fairness of rates emerges as a limiting special case.
Kluwer Academic Publishers eBooksPrinciples of Mobile Communication
2,691 Citations2002Stüber, Gordon L
Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system
1,426 Citations2002Ali Jalali, R. Padovani +1 more
Forward link data throughput performance of a high data rate wireless access system is presented and the throughput of the forward link of the embedded sector is simulated for stationary terminals.
IEEE Communications MagazineCDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
1,196 Citations2000Paul Bender, Peter Black +4 more
The network architecture, based on Internet protocols adapted to the mobile environment, is described, followed by a discussion of economic considerations in comparison to cable and DSL services.
Proceedings of the IEEEService disciplines for guaranteed performance service in packet-switching networks
1,110 Citations1995Hui Zhang
Several service disciplines that are proposed in the literature to provide per-connection end-to-end performance guarantees in packet-switching networks are surveyed and a general framework for studying and comparing these disciplines is presented.
Journal of the American Statistical AssociationStochastic Approximation Algorithms and Applications
1,025 Citations1998Anatolii A. Puhalskii, Harold J. Kushner +1 more
Stochastic Approximation Algorithms and Applications
858 Citations1997Harold J. Kushner, G. George Yin
Applications and issues application to learning, state dependent noise and queueing applications to signal processing and adaptive control mathematical background convergence with probability one, introduction weak convergence methods for general algorithms applications, proofs of convergence rate of convergence averaging of the iterates distributed/decentralized and asynchronous algorithms.
IEEE/ACM Transactions on NetworkingFair scheduling in wireless packet networks
640 Citations1999Songwu Lu, V. Bharghavan +1 more
An ideal wireless fair-scheduling algorithm which provides a packetized implementation of the fluid mode, while assuming full knowledge of the current channel conditions is described, and the worst-case throughput and delay bounds are derived.
Packet fair queueing algorithms for wireless networks with location-dependent errors
434 Citations2002T. S. Eugene Ng, Ion Stoica +1 more
This work identifies a set of properties, called channel-condition independent fair (CIF), that a packet fair queueing algorithm should have in a wireless environment and derives a novel algorithm based on start-timeFair queueing, called CIF-Q, that achieves all the above properties.
IEEE Communications MagazineAdaptation techniques in wireless packet data services
344 Citations2000S. Nanda, K. Balachandran +1 more
Data rate adaptation procedures for CDMA (IS-95), widebandCDMA (cdma2000 and UMTS WCDMA), TDMA (is-136), and GSM (GPRS and EDGE) are described.
IEEE Transactions on CommunicationsFairness in network optimal flow control: optimality of product forms
224 Citations1991Ravi R. Mazumdar, L.G. Mason +1 more
The Nash (1950) arbitration scheme from game theory is shown to be a suitable candidate for a fair, optimal operation point in the sense that it satisfies certain axioms of fairness and is pareto optimal.
A unified architecture for the design and evaluation of wireless fair queueing algorithms
107 Citations1999Thyaga Nandagopal, Songwu Lu +1 more
This paper presents a Wireless fair service model that captures the scheduling requirements of wireless scheduling algorithms, and presents a unified wireless fair queueing architecture in which scheduling algorithms can be designed to achieve wireless fair service.
Transmission scheduling for efficient wireless utilization
93 Citations2002Xin Liu, Edwin K. P. Chong +1 more
This work presents an "opportunistic" transmission scheduling policy that exploits time-varying channel conditions and maximizes the system performance stochastically under a certain resource allocation fairness constraint and establishes the optimality of the scheduling scheme.
Wireless NetworksA Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms
84 Citations2002Thyaga Nandagopal, Songwu Lu +1 more
Mathematics of Control Signals and SystemsWeighted averaging and stochastic approximation
28 Citations1997I.-J. Wang, Edwin K. P. Chong +1 more
Trends in resource management future wireless networks
5 Citations2002Jens Zander
It is shown that spectrum resource management remains an important topic in the near and distant future for wideband multimedia services with the existing spectrum allocations for these types of systems.