EVEREST IST - 2002 - 00185 : D23 : final report

Deliverable públic del projecte europeu EVERESTThis deliverable constitutes the final report of the project IST-2002-001858 EVEREST. After its successful completion, the project presents this document that firstly summarizes the context, goal and the approach objective of the project. Then it presents a concise summary of the major goals and results, as well as highlights the most valuable lessons derived form the project work. A list of deliverables and publications is included in the annex.Postprint (published version

Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

Congestion probabilities in CDMA-based networks supporting batched Poisson traffic

We propose a new multirate teletraffic loss model for the calculation of time and call congestion probabilities in CDMA-based networks that accommodate calls of different serviceclasses whose arrival follows a batched Poisson process. The latter is more "peaked" and "bursty" than the ordinary Poisson process. The acceptance of calls in the system is based on the partial batch blocking discipline. This policy accepts a part of the batch (one or more calls) and discards the rest if the available resources are not enough to accept the whole batch. The proposed model takes into account the multiple access interference, the notion of local (soft) blocking, user’s activity and the interference cancellation. Although the analysis of the model does not lead to a product form solution of the steady state probabilities, we show that the calculation of the call-level performance metrics, time and call congestion probabilities, can be based on approximate but recursive formulas. The accuracy of the proposed formulas are verified through simulation and found to be quite satisfactory

4. generációs mobil rendszerek kutatása = Research on 4-th Generation Mobile Systems

A 3G mobil rendszerek szabványosítása a végéhez közeledik, legalábbis a meghatározó képességek tekintetében. Ezért létfontosságú azon technikák, eljárások vizsgálata, melyek a következő, 4G rendszerekben meghatározó szerepet töltenek majd be. Több ilyen kutatási irányvonal is létezik, ezek közül projektünkben a fontosabbakra koncentráltunk. A következőben felsoroljuk a kutatott területeket, és röviden összegezzük az elért eredményeket. Szórt spektrumú rendszerek Kifejlesztettünk egy új, rádiós interfészen alkalmazható hívásengedélyezési eljárást. Szimulációs vizsgálatokkal támasztottuk alá a megoldás hatékonyságát. A projektben kutatóként résztvevő Jeney Gábor sikeresen megvédte Ph.D. disszertációját neurális hálózatokra épülő többfelhasználós detekciós technikák témában. Az elért eredmények Imre Sándor MTA doktori disszertációjába is beépültek. IP alkalmazása mobil rendszerekben Továbbfejlesztettük, teszteltük és általánosítottuk a projekt keretében megalkotott új, gyűrű alapú topológiára épülő, a jelenleginél nagyobb megbízhatóságú IP alapú hozzáférési koncepciót. A témakörben Szalay Máté Ph.D. disszertációja már a nyilvános védésig jutott. Kvantum-informatikai módszerek alkalmazása 3G/4G detekcióra Új, kvantum-informatikai elvekre épülő többfelhasználós detekciós eljárást dolgoztunk ki. Ehhez új kvantum alapú algoritmusokat is kifejlesztettünk. Az eredményeket nemzetközi folyóiratok mellett egy saját könyvben is publikáltuk. | The project consists of three main research directions. Spread spectrum systems: we developed a new call admission control method for 3G air interfaces. Project member Gabor Jeney obtained the Ph.D. degree and project leader Sandor Imre submitted his DSc theses from this area. Application of IP in mobile systems: A ring-based reliable IP mobility mobile access concept and corresponding protocols have been developed. Project member Máté Szalay submitted his Ph.D. theses from this field. Quantum computing based solutions in 3G/4G detection: Quantum computing based multiuser detection algorithm was developed. Based on the results on this field a book was published at Wiley entitled: 'Quantum Computing and Communications - an engineering approach'

An intelligent-agent approach for managing congestion in W-CDMA networks

PhDResource Management is a crucial aspect in the next generation cellular networks since the use of W-CDMA technology gives an inherent flexibility in managing the system capacity. The concept of a “Service Level Agreement” (SLA) also plays a very important role as it is the means to guarantee the quality of service provided to the customers in response to the level of service to which they have subscribed. Hence there is a need to introduce effective SLA-based policies as part of the radio resource management. This work proposes the application of intelligent agents in SLA-based control in resource management, especially when congestion occurs. The work demonstrates the ability of intelligent agents in improving and maintaining the quality of service to meet the required SLA as the congestion occurs. A particularly novel aspect of this work is the use of learning (here Case Based Reasoning) to predict the control strategies to be imposed. As the system environment changes, the most suitable policy will be implemented. When congestion occurs, the system either proposes the solution by recalling from experience (if the event is similar to what has been previously solved) or recalculates the solution from its knowledge (if the event is new). With this approach, the system performance will be monitored at all times and a suitable policy can be immediately applied as the system environment changes, resulting in maintaining the system quality of service

Optimal call admission control for voice traffic in cellular mobile communication networks

We propose a new call admission control (CAC) scheme for voice calls in cellular mobile communication networks. It is assumed thatthe rejection of a hand-off call is less desirable than that of a new call,for a hand-off call loss would cause a severe mental pain to a user. We consider the pains of rejecting new and hand-off calls as differentcosts. The key idea of our CAC is to restrict the admission of new calls in order to minimize the total expected costs per unit time over thelong term. An optimal policy is derived from a semi-Markov decision process in which the intervals between successive decision epochs areexponentially distributed. Based on this optimal policy, we calculate the steady state probability for the number of established voice connections in a cell. We then evaluate the probability of blocking new calls and the probability of forced termination of hand-odd calls. In the numerical experiments, it is found that the forced termination probability of hand-off calls is reduced significantly by our CAC scheme at the slight expense of the blocking probability of new calls and the channel utilization.Includes bibliographical reference