Please use this identifier to cite or link to this item:
https://repository.cihe.edu.hk/jspui/handle/cihe/1290
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chan, Anthony Hing-Hung | en_US |
dc.contributor.other | Falowo, O. E. | - |
dc.date.accessioned | 2021-08-13T08:57:25Z | - |
dc.date.available | 2021-08-13T08:57:25Z | - |
dc.date.issued | 2010 | - |
dc.identifier.uri | https://repository.cihe.edu.hk/jspui/handle/cihe/1290 | - |
dc.description.abstract | In next generation wireless network (NGWN) where multiple radio access technologies (RAT) co-exist, a joint call admission control (JCAC) algorithm is needed to make a RAT selection decision for each arriving call. RAT selection policy has a significant effect on the overall new call blocking probability in the network. We propose a heuristic RAT selection policy to minimize new call blocking probability in NGWN. The proposed JCAC scheme measures the arrival rate of each class of calls in the heterogeneous wireless network. Based of the measured values of the arrival rates and using linear programming technique, the JCAC scheme determines the RAT selection policy that minimizes overall call blocking probability in the heterogeneous wireless network. Using Markov decision process, we develop an analytical model for the JCAC scheme, and derive new call blocking probability, handoff call dropping probability (HCDP), and call incompletion probability (CIP). Performance of the proposed scheme is compared with the performance of other JCAC scheme. Simulation results show that the proposed scheme reduces new call blocking probability, HCDP, and CIP in the heterogeneous wireless network. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Wiley | en_US |
dc.relation.ispartof | Wireless Communications and Mobile Computing | en_US |
dc.title | Heuristic RAT selection policy to minimize call blocking probability in next generation wireless networks | en_US |
dc.type | journal article | en_US |
dc.identifier.doi | 10.1002/wcm.754 | - |
dc.contributor.affiliation | School of Computing and Information Sciences | en_US |
dc.relation.issn | 1530-8677 | en_US |
dc.description.volume | 10 | en_US |
dc.description.issue | 2 | en_US |
dc.description.startpage | 214 | en_US |
dc.description.endpage | 229 | en_US |
dc.cihe.affiliated | No | - |
item.languageiso639-1 | en | - |
item.fulltext | With Fulltext | - |
item.openairetype | journal article | - |
item.grantfulltext | open | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Yam Pak Charitable Foundation School of Computing and Information Sciences | - |
crisitem.author.orcid | 0000-0001-7479-0787 | - |
Appears in Collections: | CIS Publication |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
View Online | 118 B | HTML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.