{"title":"综合无线移动网络中基于概率信道借用的切换方案","authors":"Wei Li, Hang-Li Chen, D. Agrawal","doi":"10.1109/WTS.2004.1319568","DOIUrl":null,"url":null,"abstract":"We propose and analyze a handoff scheme with channel borrowing in integrated wireless mobile networks. Channels in each cell are divided into two parts and pre-allocated to real-time and non-real-time services. Each type of service is allowed to borrow channels from the other under certain conditions. A non-real-time service call can borrow an unused channel assigned to real-time service but it can be preempted by a real-time service call. A real-time service call borrows a channel from non-real-time service with a certain probability which depends on the number of available idle non-real-time service channels. We model the system by a six-dimensional Markov chain and compute the system performance in terms of blocking probability of originating calls, forced termination probability of real-time service calls, and average transmission delay of non-real-time service calls. The proposed scheme maximizes the resource utilization and keeps a certain quality of service (QoS) for each service at the time of congestion.","PeriodicalId":242981,"journal":{"name":"2004 Symposium on Wireless Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A handoff scheme with probability-based channel borrowing in integrated wireless mobile networks\",\"authors\":\"Wei Li, Hang-Li Chen, D. Agrawal\",\"doi\":\"10.1109/WTS.2004.1319568\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose and analyze a handoff scheme with channel borrowing in integrated wireless mobile networks. Channels in each cell are divided into two parts and pre-allocated to real-time and non-real-time services. Each type of service is allowed to borrow channels from the other under certain conditions. A non-real-time service call can borrow an unused channel assigned to real-time service but it can be preempted by a real-time service call. A real-time service call borrows a channel from non-real-time service with a certain probability which depends on the number of available idle non-real-time service channels. We model the system by a six-dimensional Markov chain and compute the system performance in terms of blocking probability of originating calls, forced termination probability of real-time service calls, and average transmission delay of non-real-time service calls. The proposed scheme maximizes the resource utilization and keeps a certain quality of service (QoS) for each service at the time of congestion.\",\"PeriodicalId\":242981,\"journal\":{\"name\":\"2004 Symposium on Wireless Telecommunications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 Symposium on Wireless Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WTS.2004.1319568\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 Symposium on Wireless Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WTS.2004.1319568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A handoff scheme with probability-based channel borrowing in integrated wireless mobile networks
We propose and analyze a handoff scheme with channel borrowing in integrated wireless mobile networks. Channels in each cell are divided into two parts and pre-allocated to real-time and non-real-time services. Each type of service is allowed to borrow channels from the other under certain conditions. A non-real-time service call can borrow an unused channel assigned to real-time service but it can be preempted by a real-time service call. A real-time service call borrows a channel from non-real-time service with a certain probability which depends on the number of available idle non-real-time service channels. We model the system by a six-dimensional Markov chain and compute the system performance in terms of blocking probability of originating calls, forced termination probability of real-time service calls, and average transmission delay of non-real-time service calls. The proposed scheme maximizes the resource utilization and keeps a certain quality of service (QoS) for each service at the time of congestion.