CHANNEL SHARING SCHEME FOR CELLULAR NETWORKS USING MDDCA PROTOCOL IN WLAN

.P JesuJayarin, T. Ravi
{"title":"CHANNEL SHARING SCHEME FOR CELLULAR NETWORKS USING MDDCA PROTOCOL IN WLAN","authors":".P JesuJayarin, T. Ravi","doi":"10.18000/IJISAC.50093","DOIUrl":null,"url":null,"abstract":"In cellular networks, it is vital to allocate communication channels efficiently because the bandwidth allocated for cellular communication is limited. When mobile hosts move from one cell to another cell, to provide uninterrupted service, the new cell should have enough channels to support the ongoing communication of the mobile hosts that moved into the cell. If channels are statically allocated, a cell may run out of channels when large number of mobile hosts moves to a cell, thus degrading the quality of service. To overcome this problem, dynamic channel allocation approaches have been proposed which allocate channels to cells on demand, thus increasing channel utilization and hence improving the quality of service. A distributed dynamic channel allocation algorithms gained a lot of attention due to their high reliability and scalability. The cell that wants to borrow a channel has to wait for replies from all its interference neighbors and hence, is not fault-tolerant. This work aims to propose a Distributed dynamic channel allocation algorithm to make use of the available channel efficiently. It can tolerate the failure of mobile nodes as well as static nodes and enhance the quality of service by making efficient reuse of channels. This paper proposes a channel allocation scheme with efficient bandwidth reservation, which initially reserves some channels for handoff calls, and later reserves the channels dynamically, based on the user mobility The results indicate that the proposed channel allocation scheme exhibits better performance by considering the above mentioned user mobility, type of cells, and maintaining of the queues for various traffic sources. In addition, it can be observed that our approach reduces the dropping probability by using reservation factor.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal on Information Sciences and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18000/IJISAC.50093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In cellular networks, it is vital to allocate communication channels efficiently because the bandwidth allocated for cellular communication is limited. When mobile hosts move from one cell to another cell, to provide uninterrupted service, the new cell should have enough channels to support the ongoing communication of the mobile hosts that moved into the cell. If channels are statically allocated, a cell may run out of channels when large number of mobile hosts moves to a cell, thus degrading the quality of service. To overcome this problem, dynamic channel allocation approaches have been proposed which allocate channels to cells on demand, thus increasing channel utilization and hence improving the quality of service. A distributed dynamic channel allocation algorithms gained a lot of attention due to their high reliability and scalability. The cell that wants to borrow a channel has to wait for replies from all its interference neighbors and hence, is not fault-tolerant. This work aims to propose a Distributed dynamic channel allocation algorithm to make use of the available channel efficiently. It can tolerate the failure of mobile nodes as well as static nodes and enhance the quality of service by making efficient reuse of channels. This paper proposes a channel allocation scheme with efficient bandwidth reservation, which initially reserves some channels for handoff calls, and later reserves the channels dynamically, based on the user mobility The results indicate that the proposed channel allocation scheme exhibits better performance by considering the above mentioned user mobility, type of cells, and maintaining of the queues for various traffic sources. In addition, it can be observed that our approach reduces the dropping probability by using reservation factor.
无线局域网中基于mddca协议的蜂窝网络信道共享方案
在蜂窝网络中,有效分配通信信道至关重要,因为分配给蜂窝通信的带宽是有限的。当移动主机从一个计算单元移动到另一个计算单元时,为了提供不间断的服务,新的计算单元应该有足够的通道来支持移动到该计算单元的移动主机的持续通信。如果通道是静态分配的,当大量移动主机移动到一个小区时,小区可能会耗尽通道,从而降低服务质量。为了克服这一问题,提出了动态信道分配方法,将信道按需分配给小区,从而提高了信道利用率,从而提高了服务质量。分布式动态信道分配算法因其高可靠性和可扩展性而受到广泛关注。想要借用信道的单元必须等待来自其所有干扰邻居的应答,因此不能容错。本文旨在提出一种分布式动态信道分配算法,以有效地利用可用信道。它既能容忍移动节点的故障,也能容忍静态节点的故障,并通过有效地复用信道来提高服务质量。本文提出了一种有效的信道分配方案,该方案首先为切换呼叫保留一些信道,然后根据用户的移动性动态保留信道。结果表明,考虑到上述用户的移动性、蜂窝的类型以及各种业务源的队列维护,所提出的信道分配方案具有更好的性能。此外,可以观察到我们的方法通过使用保留因子来降低掉弹概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信