Elements of information theory
Elements of information theory
Empirically derived analytic models of wide-area TCP connections
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Principles of mobile communication (2nd ed.)
Principles of mobile communication (2nd ed.)
Wideband CDMA For Third Generation Mobile Communications: Universal Personal Communications
Wideband CDMA For Third Generation Mobile Communications: Universal Personal Communications
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic bandwidth allocation with fair scheduling for WCDMA systems
IEEE Wireless Communications
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Adaptation techniques in wireless packet data services
IEEE Communications Magazine
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Self-organizing packet radio ad hoc networks with overlay (SOPRANO)
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
Integrated cellular and ad hoc relaying systems: iCAR
IEEE Journal on Selected Areas in Communications
OMAR: Utilizing Multiuser Diversity in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Improving fairness in relay-based access networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Opportunistic scheduling and spectrum reuse in relay-based cellular networks
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is "spread" over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems.