Improving Coverage Area Quality Using Physical Topology Information in IEEE 802.16 Mesh Networks

Shoichi Takemori, G. Hasegawa, Y. Taniguchi, H. Nakano
{"title":"Improving Coverage Area Quality Using Physical Topology Information in IEEE 802.16 Mesh Networks","authors":"Shoichi Takemori, G. Hasegawa, Y. Taniguchi, H. Nakano","doi":"10.1109/UBICOMM.2009.20","DOIUrl":null,"url":null,"abstract":"In wireless mesh networks based on IEEE 802.16 WiMAX, each mesh node has its own service area that provides wireless Internet access service to client terminals. The network performance degrades due to radio interference when multiple service areas overlap with each other. To avoid this problem, information of the exact location and size of the service area of neighboring mesh nodes is useful for each mesh node to determine its own service area size. However, the availability of the information depends on the topology construction procedure. In this paper, we discuss a method to determine the size of service areas using the information obtained in topology construction based on IEEE 802.16 WiMAX. Specifically, each mesh node estimates the distance to the nearest neighboring node, and sets the service area size based on this distance. Through performance evaluation, we confirm that our method can increase the size of a single covered area by an average of 32% compared with the existing method, which is the constant service radius, and can reduce the maximum number of overlapped service areas by approximately 50%.","PeriodicalId":150024,"journal":{"name":"2009 Third International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UBICOMM.2009.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In wireless mesh networks based on IEEE 802.16 WiMAX, each mesh node has its own service area that provides wireless Internet access service to client terminals. The network performance degrades due to radio interference when multiple service areas overlap with each other. To avoid this problem, information of the exact location and size of the service area of neighboring mesh nodes is useful for each mesh node to determine its own service area size. However, the availability of the information depends on the topology construction procedure. In this paper, we discuss a method to determine the size of service areas using the information obtained in topology construction based on IEEE 802.16 WiMAX. Specifically, each mesh node estimates the distance to the nearest neighboring node, and sets the service area size based on this distance. Through performance evaluation, we confirm that our method can increase the size of a single covered area by an average of 32% compared with the existing method, which is the constant service radius, and can reduce the maximum number of overlapped service areas by approximately 50%.
利用物理拓扑信息提高IEEE 802.16 Mesh网络覆盖区域质量
在基于IEEE 802.16 WiMAX的无线mesh网络中,每个mesh节点都有自己的服务区,为客户端提供无线上网服务。当多个业务区域相互重叠时,由于无线电干扰,导致网络性能下降。为了避免这个问题,相邻网格节点服务区域的精确位置和大小信息对每个网格节点确定自己的服务区域大小是有用的。然而,信息的可用性取决于拓扑构造过程。本文讨论了一种利用基于IEEE 802.16 WiMAX的拓扑构建中获得的信息来确定服务区域大小的方法。具体来说,每个网格节点估计到最近的相邻节点的距离,并根据该距离设置服务区域的大小。通过性能评估,我们确认,与现有方法相比,我们的方法可以将单个覆盖区域的大小(即恒定服务半径)平均增加32%,并且可以将最大重叠服务区域的数量减少约50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信