{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:43:41Z","timestamp":1777902221318,"version":"3.51.4"},"reference-count":30,"publisher":"SAGE Publications","issue":"10","license":[{"start":{"date-parts":[[2011,9,15]],"date-time":"2011-09-15T00:00:00Z","timestamp":1316044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2012,10]]},"abstract":"<jats:p>Presently, mobile and wireless networks are witnessing rapid growth and the users of these networks demand many services that require unlimited frequency spectrum. Providing unlimited frequency spectrum is expensive and difficult. So,efficient use of the available frequency spectrum will greatly satisfy the demands of various services. In this paper, we propose a learning automata (LA)-based channel reservation scheme, which determines the optimal number of reserved channels for the system that is being tested. The proposed scheme is tested on four different extended models (systems) \u2013 Single Traffic No Queues (STNQ), Single Traffic with Queues (STWQ), Multi-traffic No Queues (MTNQ), and Multi-traffic with Queues (MTWQ). These four systems employ the channel allocation procedure, which is based on the distributed dynamic allocation policies. The presented systems deal with both originating calls and handoff calls. Quality of Service (QoS) may be improved further by reserving the channels for handoff calls based on the user mobility and type of cell. The performance evaluation of the systems with the proposed LA scheme shows improvement when compared with legacy systems. At a particular instant when the system load is 100, 21%, 28%, 18%, 23%, 22%, 27%, 11%, and 18% of the originating calls are blocked and only 2.4%, 3.6%, 1.9%, 2.1%, 1.9%, 2.3%, 0.4%, and 0.55% of the handoff calls are dropped in the case of the STNQ with LA, STNQ without LA, STWQ with LA, STWQ without LA, MTNQ with LA, MTNQ without LA, MTWQ with LA, and MTWQ without LA systems respectively.<\/jats:p>","DOI":"10.1177\/0037549711420175","type":"journal-article","created":{"date-parts":[[2011,9,16]],"date-time":"2011-09-16T04:40:56Z","timestamp":1316148056000},"page":"1166-1179","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":11,"title":["An efficient approach for distributed channel allocation with learning automata-based reservation in cellular networks"],"prefix":"10.1177","volume":"88","author":[{"given":"Sudip","family":"Misra","sequence":"first","affiliation":[{"name":"Indian Institute of Technology, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P Venkata","family":"Krishna","sequence":"additional","affiliation":[{"name":"School of Computing Science and Engineering, VIT University, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vankadara","family":"Saritha","sequence":"additional","affiliation":[{"name":"School of Computing Science and Engineering, VIT University, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2011,9,15]]},"reference":[{"key":"bibr1-0037549711420175","volume-title":"Introduction to wireless and mobile systems","author":"Agrawal DP","year":"2003","edition":"1"},{"key":"bibr2-0037549711420175","volume-title":"Wireless crash course","author":"Bedell P","year":"2002","edition":"2"},{"key":"bibr3-0037549711420175","volume-title":"Principles & applications of GSM","author":"Garg VK","year":"2003","edition":"2"},{"key":"bibr4-0037549711420175","volume-title":"Mobile cellular telecommunications analog and digital systems","author":"Lee WCY","year":"1995","edition":"2"},{"key":"bibr5-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.99"},{"key":"bibr6-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/98.511762"},{"key":"bibr7-0037549711420175","first-page":"202","volume":"32","author":"Kim S","year":"1994","journal-title":"INFOR"},{"key":"bibr8-0037549711420175","first-page":"1","volume-title":"Proceedings of the International Conference on Wireless and Optical Communications Networks (IFIP\u201906)","author":"Tokekar S"},{"key":"bibr9-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/35.109664"},{"key":"bibr10-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/25.155974"},{"key":"bibr11-0037549711420175","first-page":"342","volume-title":"Proceedings of the IEEE International Conference on Wireless Networks, Communications and Mobile Computing","author":"Boukerche A"},{"key":"bibr12-0037549711420175","first-page":"445","volume-title":"Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","author":"Boukerche A"},{"key":"bibr13-0037549711420175","first-page":"4275","volume":"7","author":"Chen SL","year":"2004","journal-title":"IEEE Int Conf Commun"},{"key":"bibr14-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094082"},{"key":"bibr15-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2002.800623"},{"key":"bibr16-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2009.2031180"},{"key":"bibr17-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1504\/IJCNDS.2008.017203"},{"key":"bibr18-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.01.043"},{"key":"bibr19-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.10.018"},{"key":"bibr20-0037549711420175","first-page":"342","volume-title":"Proceedings of the IEEE International Conference on Wireless Networks, Communications and Mobile Computing","author":"Boukerche A"},{"key":"bibr21-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.850180"},{"key":"bibr22-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1002\/dac.684"},{"key":"bibr23-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.83"},{"key":"bibr24-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1045"},{"key":"bibr25-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090510"},{"key":"bibr26-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-009-9883-0"},{"key":"bibr27-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2009.12.035"},{"key":"bibr28-0037549711420175","volume-title":"Learning automata","author":"Narendra KS","year":"1989"},{"key":"bibr29-0037549711420175","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78831-7_12"},{"key":"bibr30-0037549711420175","unstructured":"Stewart W. Introduction to the numerical solution of Markov chains. Princeton, NJ: Princeton University Press, 1994, Chapter 3, p.131."}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549711420175","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549711420175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:23:23Z","timestamp":1777634603000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549711420175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,15]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["10.1177\/0037549711420175"],"URL":"https:\/\/doi.org\/10.1177\/0037549711420175","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,15]]}}}