Mid Sweden University

Positioning of users in cellular systems is an area attracting large interest and the number of applications for the location information is growing rapidly. Large-scale deployment of such applications will require methods for positioning that are simple enough to be used in mobile phones. In this paper, we evaluate the location accuracy for some different algorithms in a microcellular environment. We propose some simple but quite accurate methods and compare them with commonly known methods. Our results show that in the studied environment, all our proposed algorithms can at least manage the US E911 phase II requirements of positioning emergency calls within 125 m, 67 percent of the time.

Centralized dynamic channel allocation strategies can, in theory, achieve very high capacity in terms of achievable load at a certain quality level. Unfortunately, these strategies have often been considered non-feasible in practice due to the massive amount of measurements and signaling typically required. In this paper we evaluate some methods to maintain high performance while drastically reducing the measurement and signaling requirements. Our DCA algorithm is based on measurements of the link gain matrix. We show that for a microcellular Manhattan environment, only the gains from the three strongest beacons have to be measured and signaled by each mobile in order to achieve almost the same capacity as an ideal system where all beacons can be measured

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 today's 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.