Intelligent overlapping MAP domain forming for mobility management in HMIPv6 access networks

A. M. Barkoosaraei, H. Aghvami
{"title":"Intelligent overlapping MAP domain forming for mobility management in HMIPv6 access networks","authors":"A. M. Barkoosaraei, H. Aghvami","doi":"10.1109/WCNC.2012.6214253","DOIUrl":null,"url":null,"abstract":"Hierarchical Mobile IPv6 (HMIPv6) was proposed by Internet Engineering Task Force (IETF) to reduce signalling cost by localising the mobility signalling traffic of Mobile Nodes (MNs). However, certain MNs still generate excessive signalling overhead, due to their ping pong movement at borders of different Mobility Anchor Point (MAP) domains. In this paper, an algorithm is proposed, to effectively reduce the handover signalling overhead in the network. A cost function was developed and allocated to Access Routers (ARs) in then network, by taking into account several parameters. The proposed algorithm spreads the domain of each MAP to its adjacent MAP(s) domains by selecting boundary ARs one by one, based on their cost values, and creating overlapping regions between the domains. The performance in the new network structure created by the proposed algorithm is evaluated against a single MAP per domain HMIPv6 access network. A comparison simulation study illustrates a significant improved performance in the network is obtained, in terms of average rate of inter-area handover, whilst balance in terms of bandwidth utilisation among MAPs is maintained.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2012.6214253","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Hierarchical Mobile IPv6 (HMIPv6) was proposed by Internet Engineering Task Force (IETF) to reduce signalling cost by localising the mobility signalling traffic of Mobile Nodes (MNs). However, certain MNs still generate excessive signalling overhead, due to their ping pong movement at borders of different Mobility Anchor Point (MAP) domains. In this paper, an algorithm is proposed, to effectively reduce the handover signalling overhead in the network. A cost function was developed and allocated to Access Routers (ARs) in then network, by taking into account several parameters. The proposed algorithm spreads the domain of each MAP to its adjacent MAP(s) domains by selecting boundary ARs one by one, based on their cost values, and creating overlapping regions between the domains. The performance in the new network structure created by the proposed algorithm is evaluated against a single MAP per domain HMIPv6 access network. A comparison simulation study illustrates a significant improved performance in the network is obtained, in terms of average rate of inter-area handover, whilst balance in terms of bandwidth utilisation among MAPs is maintained.
面向HMIPv6接入网移动性管理的智能重叠MAP域形成
分层移动IPv6 (Hierarchical Mobile IPv6, HMIPv6)是IETF提出的一种通过对移动节点(MNs)的移动信令流量进行本地化来降低信令成本的协议。然而,由于在不同移动锚点(MAP)域边界处的乒乓运动,某些MNs仍然会产生过多的信号开销。本文提出了一种有效降低网络切换信令开销的算法。在考虑多个参数的基础上,建立了一个成本函数,并对网络中的接入路由器进行了分配。该算法根据每个MAP的代价值逐个选择边界ar,将每个MAP的域扩展到相邻的MAP(s)域中,并在域之间创建重叠区域。该算法创建的新网络结构的性能是针对单个MAP每域HMIPv6接入网进行评估的。对比仿真研究表明,在区域间切换的平均速率方面,网络性能得到了显着改善,同时在map之间的带宽利用率方面保持了平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信