通过重复扫描过程降低切换失败概率

S. Chatterjee, J. K. Bag, M. Samadder
{"title":"通过重复扫描过程降低切换失败概率","authors":"S. Chatterjee, J. K. Bag, M. Samadder","doi":"10.1109/ICCICT.2012.6398117","DOIUrl":null,"url":null,"abstract":"In wireless communication, handoff has become an important topic of research. A mobile station (MS) requires handoff when it travels out of the coverage area of its current access point (AP) and tries to associate with another AP. But handoff failure probability provides a serious barrier for such services to be made available to mobile platforms. Throughout the last few years plenty of research had been done to reduce handoff failure probability, whereas very few of them can be applied for an irregular (haphazard) motion of MS. In this paper, we are going to implement a new handoff scheme which is applicable for both regular and irregular motion of MS. We will find the minimum time interval (T) that the MS should stay within the handoff region (the particular area within a cell where the handoff is initiated and performed). We will repeat the scanning process number of times at different points of MS trajectory within the handoff region until the total scanning time exceeds the fixed time interval (T) and by doing so we can find out the most significant AP. Our simulation results show the effectiveness of our proposed scheme in practical field.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Reducing handover failure probability by repetitive scanning process\",\"authors\":\"S. Chatterjee, J. K. Bag, M. Samadder\",\"doi\":\"10.1109/ICCICT.2012.6398117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless communication, handoff has become an important topic of research. A mobile station (MS) requires handoff when it travels out of the coverage area of its current access point (AP) and tries to associate with another AP. But handoff failure probability provides a serious barrier for such services to be made available to mobile platforms. Throughout the last few years plenty of research had been done to reduce handoff failure probability, whereas very few of them can be applied for an irregular (haphazard) motion of MS. In this paper, we are going to implement a new handoff scheme which is applicable for both regular and irregular motion of MS. We will find the minimum time interval (T) that the MS should stay within the handoff region (the particular area within a cell where the handoff is initiated and performed). We will repeat the scanning process number of times at different points of MS trajectory within the handoff region until the total scanning time exceeds the fixed time interval (T) and by doing so we can find out the most significant AP. Our simulation results show the effectiveness of our proposed scheme in practical field.\",\"PeriodicalId\":319467,\"journal\":{\"name\":\"2012 International Conference on Communication, Information & Computing Technology (ICCICT)\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Communication, Information & Computing Technology (ICCICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCICT.2012.6398117\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCICT.2012.6398117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在无线通信中,切换已成为一个重要的研究课题。当移动站(MS)走出其当前接入点(AP)的覆盖区域并试图与另一个AP关联时,需要切换。但是切换失败的概率为移动平台提供此类服务提供了严重的障碍。在过去的几年里,大量的研究已经完成减少切换失败概率,而很少人可以申请一个不规则(偶然的)摘要女士的运动,我们要实现一个新的切换方案既适用于规则和不规则的运动,我们会发现女士的最小时间间隔(T),女士应该呆在切换区域(细胞内特定区域切换启动和执行)。我们将在切换区域内MS轨迹的不同点重复扫描过程次数,直到总扫描时间超过固定的时间间隔(T),从而找到最显著的AP。仿真结果表明了我们提出的方案在实际领域的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reducing handover failure probability by repetitive scanning process
In wireless communication, handoff has become an important topic of research. A mobile station (MS) requires handoff when it travels out of the coverage area of its current access point (AP) and tries to associate with another AP. But handoff failure probability provides a serious barrier for such services to be made available to mobile platforms. Throughout the last few years plenty of research had been done to reduce handoff failure probability, whereas very few of them can be applied for an irregular (haphazard) motion of MS. In this paper, we are going to implement a new handoff scheme which is applicable for both regular and irregular motion of MS. We will find the minimum time interval (T) that the MS should stay within the handoff region (the particular area within a cell where the handoff is initiated and performed). We will repeat the scanning process number of times at different points of MS trajectory within the handoff region until the total scanning time exceeds the fixed time interval (T) and by doing so we can find out the most significant AP. Our simulation results show the effectiveness of our proposed scheme in practical field.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Compression strategy for handwritten gray level document images EKSS: An efficient approach for similarity search A semi-blind image watermarking based on Discrete Wavelet Transform and Secret Sharing Neuro Analytical hierarchy process (NAHP) approach for CAD/CAM/CIM tool selection in the context of small manufacturing industries ‘Robot-Cloud’: A framework to assist heterogeneous low cost robots
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1