216 research outputs found
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
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
Recommended from our members
Performance Modelling and Analysis of Handover and Call Admission Control Algorithm for Next Generation Wireless Networks
The next generation wireless system (NGWS) has been conceived as a ubiquitous wireless environment. It integrates existing heterogeneous access networks, as well as future networks, and will offer high speed data, real-time applications (e.g. Voice over IP, videoconference ) and real-time multimedia (e.g. real-time audio and video) support with a certain Quality of Service (QoS) level to mobile users. It is required that the mobile nodes have the capability of selecting services that are offered by each provider and determining the best path through the various networks.
Efficient radio resource management (RRM) is one of the key issues required to support global roaming of the mobile users among different network architectures of the NGWS and a precise call admission control (CAC) scheme satisfies the requirements of high network utilization, cost reduction, minimum handover latency and high-level QoS of all the connections.
This thesis is going to describe an adaptive class-based CAC algorithm, which is expected to prioritize the arriving channel resource requests, based on userÂżs classification and channel allocation policy. The proposed CAC algorithm couples with Fuzzy Logic (FL) and Pre-emptive Resume (PR) theories to manage and improve the performance of the integrated wireless network system. The novel algorithm is assessed using a mathematical analytic method to measure the performance by evaluating the handover dropping probability and the system utilization
Performance analysis of the intelligent mobility optimization CRRM approach using a markovian chain model
Due to the increasing demand of wireless services, mobile technology has rapidly progressed towards the fourth generation (4G) networking paradigm. This generation will be heterogeneous in nature and it can be achieved through the integration of different Radio Access Technologies (RATs) over a common platform. Common Radio Resource Management (CRRM) was proposed to manage radio resource utilization in heterogeneous wireless networks and to provide required Quality of Service (QoS) for allocated calls. RAT selection algorithms are an integral part of the CRRM algorithms. Their role is to decide, when a new or Vertical Handover (VHO) call is requested, which of the available RATs is most suitable to fit the need of the incoming call and when to admit them. This paper extends our earlier work on the proposed intelligent hybrid mobility optimization RAT selection approach which allocates users in high mobility to the most suitable RAT and proposes an analytical presentation of the proposed approach in a multidimensional Markov chain model. A comparison for the performance of centralized load-balancing, distributed and the proposed intelligent mobility optimization algorithms is presented in terms of new calls blocking probability, VHO calls dropping probability, users' satisfactions probability, average networks load and average system throughput. Simulation and analytical results show that the proposed algorithm performs better than the centralized loadbalancing and distributed algorithms. © 2014 ACADEMY PUBLISHER
Quality of service optimization of multimedia traffic in mobile networks
Mobile communication systems have continued to evolve beyond the currently deployed Third
Generation (3G) systems with the main goal of providing higher capacity. Systems beyond 3G
are expected to cater for a wide variety of services such as speech, data, image transmission,
video, as well as multimedia services consisting of a combination of these. With the air interface
being the bottleneck in mobile networks, recent enhancing technologies such as the High Speed
Downlink Packet Access (HSDPA), incorporate major changes to the radio access segment of
3G Universal Mobile Telecommunications System (UMTS). HSDPA introduces new features
such as fast link adaptation mechanisms, fast packet scheduling, and physical layer retransmissions
in the base stations, necessitating buffering of data at the air interface which presents a
bottleneck to end-to-end communication. Hence, in order to provide end-to-end Quality of
Service (QoS) guarantees to multimedia services in wireless networks such as HSDPA, efficient
buffer management schemes are required at the air interface.
The main objective of this thesis is to propose and evaluate solutions that will address the
QoS optimization of multimedia traffic at the radio link interface of HSDPA systems. In the
thesis, a novel queuing system known as the Time-Space Priority (TSP) scheme is proposed for
multimedia traffic QoS control. TSP provides customized preferential treatment to the constituent
flows in the multimedia traffic to suit their diverse QoS requirements. With TSP queuing, the
real-time component of the multimedia traffic, being delay sensitive and loss tolerant, is given
transmission priority; while the non-real-time component, being loss sensitive and delay tolerant,
enjoys space priority. Hence, based on the TSP queuing paradigm, new buffer managementalgorithms are designed for joint QoS control of the diverse components in a multimedia session
of the same HSDPA user. In the thesis, a TSP based buffer management algorithm known as the
Enhanced Time Space Priority (E-TSP) is proposed for HSDPA. E-TSP incorporates flow
control mechanisms to mitigate congestion in the air interface buffer of a user with multimedia
session comprising real-time and non-real-time flows. Thus, E-TSP is designed to provide
efficient network and radio resource utilization to improve end-to-end multimedia traffic
performance. In order to allow real-time optimization of the QoS control between the real-time
and non-real-time flows of the HSDPA multimedia session, another TSP based buffer management
algorithm known as the Dynamic Time Space Priority (D-TSP) is proposed. D-TSP
incorporates dynamic priority switching between the real-time and non-real-time flows. D-TSP
is designed to allow optimum QoS trade-off between the flows whilst still guaranteeing the
stringent real-time componentâs QoS requirements. The thesis presents results of extensive
performance studies undertaken via analytical modelling and dynamic network-level HSDPA
simulations demonstrating the effectiveness of the proposed TSP queuing system and the TSP
based buffer management schemes
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
Admission Control for Multiuser Communication Systems
During the last few years, broadband wireless communication has experienced very rapid growth in telecommunications industry. Hence, the performance analysis of such systems is one of the most important topics. However, accurate systemsâ analysis requires first good modeling of the network traffic. Moreover, broadband wireless communication should achieve certain performance in order to satisfy the customers as well as the operators. Therefore, some call admission control techniques should be integrated with wireless networks in order to deny new users/services if accepting them will lead to degrade the network performance to less than the allowed threshold. This thesis mainly discusses the above two issues which can be summarized as follows. First issue is the traffic modeling of wireless communication. The performance analysis is discussed in terms of the quality of services (QoS) and also the grade of services (GoS). Different scenarios have been studies such as enhancing the GoS of handover users. The second issue is the admission control algorithms. Admission Control is part of radio resource management. The performance of admission control is affected by channel characteristics such as fading and interference. Hence, some wireless channel characteristics are introduced briefly. Seven different channel allocation schemes have been discussed and analyzed. Moreover, different admission control algorithms are analyzed such as power-based and multi-classes fuzzy-logic based. Some simulations analyses are given as well to show the system performance of different algorithms and scenarios.fi=OpinnĂ€ytetyö kokotekstinĂ€ PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=LĂ€rdomsprov tillgĂ€ngligt som fulltext i PDF-format
- âŠ