Performance Evaluation on Common Radio Resource Management Algorithms

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Wu, Leijia en_US
dc.contributor.author Al Sabbagh, Abdallah en_US
dc.contributor.author Sandrasegaran, Kumbesan en_US
dc.contributor.author Elkashlan, Maaged en_US
dc.contributor.author Lin, Cheng-Chung en_US
dc.contributor.editor O'Conner, L en_US
dc.date.accessioned 2011-02-07T06:28:45Z
dc.date.available 2011-02-07T06:28:45Z
dc.date.issued 2010 en_US
dc.identifier 2009005661 en_US
dc.identifier.citation Wu Leijia et al. 2010, 'Performance Evaluation on Common Radio Resource Management Algorithms', , IEEE Computer Society, California, USA, , pp. 491-495. en_US
dc.identifier.issn 978-0-7695-4019-1 en_US
dc.identifier.other E1 en_US
dc.identifier.uri http://hdl.handle.net/10453/14162
dc.description.abstract The next generation wireless network is expected to be a heterogeneous. The Radio Access Technology (RAT) selection algorithm, including initial RAT selection and vertical handover, is one of the key research areas in Common Radio Resource Management (CRRM). A suitable RAT selection algorithm can maximize the system performance and Quality of Service (QoS) by allocating users to the most suitable RAT in the case of two or more RATs co-located in the same coverage area. This paper evaluates the performance of three RAT selection algorithms, load balancing based using maximum resource consumption, load balancing based using minimum resource consumption and service based algorithms, in terms of traffic distribution, blocking probability, throughput and throughput fairness for a co-located GERAN/UTRAN/WLAN network. Simulation results show that in terms of blocking probability, the service based algorithm is the worst one when the traffic load is high. In terms of data throughput, the load balancing based using maximum resource consumption algorithm performs better than the other two when the traffic load is low. However, the service based algorithm outperforms the other two when the traffic load is high. In terms of throughput fairness, the service based algorithm achieves the best performance. en_US
dc.language English en_US
dc.publisher IEEE Computer Society en_US
dc.relation.isbasedon http://dx.doi.org/10.1109/WAINA.2010.13 en_US
dc.title Performance Evaluation on Common Radio Resource Management Algorithms en_US
dc.parent Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications (AINA 2010) Workshops en_US
dc.journal.volume en_US
dc.journal.number en_US
dc.publocation California, USA en_US
dc.identifier.startpage 491 en_US
dc.identifier.endpage 495 en_US
dc.cauo.name FEIT.School of Systems, Management and Leadership en_US
dc.conference Verified OK en_US
dc.for 100500 en_US
dc.personcode 996370 en_US
dc.personcode 110401 en_US
dc.personcode 000544 en_US
dc.personcode 0000051682 en_US
dc.personcode 10931347 en_US
dc.percentage 100 en_US
dc.classification.name Communications Technologies en_US
dc.classification.type FOR-08 en_US
dc.edition en_US
dc.custom International Conference on Advanced Information Networking and Applications en_US
dc.date.activity 20100420 en_US
dc.location.activity Perth, WA en_US
dc.description.keywords common radio resource management; heterogeneous wireless network; RAT selection algorithm; performance evaluation en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record