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

Analysis of packet scheduling for UMTS EUL - design decisions and performance evaluation

The UMTS Enhanced Uplink (EUL) provides higher capacity, increased data rates and smaller latency on the communication link from users towards the network. In this paper we present a performance comparison of three distinct EUL scheduling schemes (one-by-one, partial parallel and full parallel) taking into account both the packet level characteristics and the flow level dynamics due to the (random) user behaviour.\ud Using a very efficient hybrid analytical and simulation approach we analyse the three schemes with respect to performance measures such as mean file transfer time and fairness. In UMTS, a significant part of the system capacity will be used to support non-elastic voice traffic. Hence, part of our investigation is dedicated to the effects that the volume of voice traffic has on the performance of the elastic traffic supported by the EUL. Finally, we evaluate the impact that implementation specifics of a full parallel scheduler has on these measures.\ud \ud Our main conclusion is that our partial parallel scheduler, which is a hybrid between the one-by-one and full parallel, outperforms the other two schedulers in terms of mean flow transfer time, and is less sensitive to volume and nature of voice traffic. However, under certain circumstances, the partial parallel scheduler exhibits a somewhat lower fairness than the alternatives

Mobile Communication Networks and Digital Television Broadcasting Systems in the Same Frequency Bands – Advanced Co-Existence Scenarios

The increasing demand for wireless multimedia services provided by modern communication systems with stable services is a key feature of advanced markets. On the other hand, these systems can many times operate in a neighboring or in the same frequency bands. Therefore, numerous unwanted co-existence scenarios can occur. The aim of this paper is to summarize our results which were achieved during exploration and measurement of the co-existences between still used and upcoming mobile networks (from GSM to LTE) and digital terrestrial television broadcasting (DVB) systems. For all of these measurements and their evaluation universal measurement testbed has been proposed and used. Results presented in this paper are a significant part of our activities in work package WP5 in the ENIAC JU project “Agile RF Transceivers and Front-Ends for Future Smart Multi-Standard Communications Applications (ARTEMOS)”

Impact of inter-cell interference on flow level performance of scheduling schemes for the UMTS EUL

The UMTS Enhanced Uplink (EUL) is expected to provide higher capacity, increased data rates, and smaller latency on the communication link from users towards the network. A key mechanism in EUL traffic handling is the packet scheduler, for which a number of basic schemes can be identified (one-by- one, partial parallel, and full parallel). In this paper we analyze the interaction between the EUL scheduling scheme deployed in the network and the inter-cell interference. On the one hand, different scheduling schemes cause different inter-cell interference patterns on neighbouring cells. On the other hand, the different schemes are affected by inter-cell interference in different ways. The scheduling schemes are evaluated and compared under different approaches for reserving part of the allowed noise rise at the base station for inter-cell interference. For our analysis, we have developed a hybrid analytical/simulation approach allowing for fast evaluation of performance measures such as the mean flow transfer time and fairness expressing how the performance depends on the user’s location. This approach takes into account both the packet-level characteristics and the flow-level dynamics due to the random user behaviour

A survey of handover algorithms in DVB-H

Digital Video Broadcasting for Handhelds (DVB-H) is a standard for broadcasting IP Datacast (IPDC) services to mobile handheld terminals. Based on the DVB-T standard, DVB-H adds new features such as time slicing, MPE-FEC, in-depth interleavers, mandatory cell id identifier, optional 4K-modulation mode and the use of 5 MHz bandwidth in addition to the usually used 6, 7, or 8 MHz raster. IPDC over DVB-H is proposed for ETSI to complement the DVB-H standard by combining IPDC and DVB-H in an end-to-end system. Handover in such unidirectional broadcasting networks is a novel issue. In the last few years since the birth of DVB-H technology, great attention has been given to the performance analysis of DVB-H mobile terminals. Handover is one of the main research topics for DVB-H in mobile scenarios. Better reception quality and greater power efficiency are considered to be the main targets of handover research for DVB-H. New algorithms for different handover stages in DVB-H have been the subject of recent research and are currently being studied. Further novel algorithms need to be designed to improve the mobile reception quality. This article provides a comprehensive survey of the handover algorithms in DVB-H. A systematic evaluation and categorization approach is proposed based on the problems the algorithms solve and the handover stages being focused on. Criteria are proposed and analyzed to facilitate designing better handover algorithms for DVB-H that have been identified from the research conducted by the author

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

Call blocking probabilities for Poisson traffic under the Multiple Fractional Channel Reservation policy

In this paper, we study the performance of the Multiple Fractional Channel Reservation (MFCR) policy, which is a bandwidth reservation policy that allows the reservation of real (not integer) number of channels in order to favor calls of high channel (bandwidth) requirements. We consider a link of fixed capacity that accommodates Poisson arriving calls of different service-classes with different bandwidth-per-call requirements. Calls compete for the available bandwidth under the MFCR policy. To determine call blocking probabilities, we propose approximate but recursive formulas based on the notion of reserve transition rates. The accuracy of the proposed method is verified through simulation