Temporal Fairness Enhanced Scheduling for Cooperative Relaying Networks in Low Mobility Fading Environments
AuthorsIngmar Hammerström, Jian Zhao, and Armin Wittneben
Reference6th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2005, New York, June 2005.
AbstractWe consider a wireless network, which consists of several active source/destination pairs and a number of idle nodes. Multiple idle nodes volunteer as relays to facilitate the communication. All nodes have low mobility and the fading channel is essentially constant over the latency time scale of interest (block fading). Conventional adaptive scheduling techniques are either unfair or inefficient in this context. In a previous paper we proposed a scheduling scheme which does not compromise the quality of service of individual source/destination links (fairness) if the number of relay nodes is sufficiently high. In this paper we propose a simple extension to our scheduling scheme which guarantees short-term temporal fairness among the individual links in the network, while achieving considerable multi-user diversity gains.
Keywordsrelaying, cooperative diversity, opportunistic scheduling, fairness
Download this document:
Copyright Notice: © 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.