Paper Info
Title
Joint packet scheduling and dynamic base station assignment for CDMA data networks
Abstract
In current code division multiple access (CDMA) based wireless systems, a base station (BS) schedules packets independently of its neighbours, which may lead to resource wastage and the degradation of the system's performance. In wireless networks, in order to achieve an efficient packet scheduling, there are two conflicting performance metrics that have to be optimized: throughput and fairness. Their maximization is a key goal, particularly in next-generation wireless networks. This paper proposes joint packet scheduling and BS assignment schemes for a cluster of interdependent neighbouring BSs in CDMA-based wireless networks, in order to enhance the system performance through dynamic load balancing. The proposed schemes are based on sector subdivision in terms of average required resource per mobile station and utility function approach. The fairness is achieved by minimizing the variance of the delay for the remaining head-of-queue packets. Inter-cell and intra-cell interferences from scheduled packets are also minimized in order to increase the system capacity and performance. The simulation results show that our proposed schemes perform better than existing schemes available in the open literature. Copyright © 2007 John Wiley & Sons, Ltd.
Year
DOI
Venue
2008
10.1002/dac.v21:2
Int. J. Communication Systems
Keywords
Field
DocType
base station assignment,W‐CDMA,packet scheduling,quality of service,throughput,fairness,utility function,wireless data networks
Base station,Wireless network,Mobile station,Computer science,Network packet,Computer network,Real-time computing,Schedule,Fairness measure,Maximum throughput scheduling,Throughput
Journal
Volume
Issue
ISSN
21
2
1074-5351
Citations 
PageRank 
References 
0
0.34
11
Authors
2
Name
Order
Citations
PageRank
Christian Makaya121314.49
Sonia Aïssa22471187.03