Miguel Berg

A RADIO RESOURCE MANAGEMENT CONCEPT FOR "BUNCHED" PERSONAL COMMUNICATION SYSTEMS

The radio resource management (RRM) techniques used in current 2nd generation mobile communication systems rely heavily on fixed frequency or timeslot allocation techniques which are not well suited for large variations in data rates. Spread spectrum systems proposed provide partial solutions to this problem but exhibit deficiencies when faced with uneven user populations. The overall objective of ACTS project AC090 FRAMES is to define, develop and evaluate a wideband multiple radio access scheme fulfilling the UMTS requirements. Within the project several RRM concepts have been proposed. The “bunch” concept discussed in this paper uses synchronous dynamic physical layer radio resource reservation combined with fast SIR based power control in a local cluster (“bunch”). Uncontrolled, “interbunch”, interference is handled by time/frequency hopping (“interference averaging”). In the paper some initial performance results are presented.

A concept for hybrid random/dynamic radio resource management

Third generation mobile communication systems will allow many different services with varying demands on data rate and delay. For those systems, the fixed radio resource management (RRM) techniques used in todays low rate systems will not be appropriate to ensure efficient utilization of the radio spectrum. Dynamic RRM is necessary in order to cope with the large variations in data rate. We study the bunch concept which is a hybrid between random and dynamic RRM. Within a small synchronized cluster (bunch) we use dynamic radio resource allocation combined with SIR-based power control and between the bunches we use time/frequency hopping to average the interference. We propose an improved RRM algorithm and evaluate the performance of the bunch concept for a Manhattan scenario with mixed traffic. The performance is improved while the computational complexity is reduced compared to our previously published results for the bunch concept. We also show that the performance of a single bunch system is close to the theoretical upper bound.

On Selfish Distributed Access Selection Algorithms in IEEE 802.11 Networks

An important question for future wireless networks is whether the prioritization between different accesses should be controlled by the networks or terminals. Herein we evaluate the performance of distributed access-selection algorithms where terminals are responsible for both AP selection and the necessary measurements. In particular, we focus on determining whether selfish distributed algorithms can perform as well as centralized ones (for comparison we include max-sum, max-min, proportional fair and minimum delay allocations). The study is conducted by time-dynamic simulations in a IEEE 802.11a network and as performance measures we use file transfer delay and supportable load at a maximum tolerable delay. Our results show that selfish algorithms can offer similar performance, both in terms of throughput and fairness, as the centralized schemes as long as they account for both path- loss and access point load. This is an important result and it suggests that terminal-controlled algorithms are just as efficient as centralized schemes, which besides extensive measurements also require that AP exchange information, for improving the efficiency in WLAN networks. Compared with a minimum path- loss selection criteria, which is standard in the IEEE 802.11 family today, our distributed load-aware algorithm increases the maximum supportable load with more than 200 percent even after accounting for measurement time and estimation errors. With fast reselection during ongoing sessions the gains can be further increased with, typically, 20 percent.