基于IEEE 802.11的接入点覆盖区域和邻居发现研究

S. Hermann, M. Emmelmann, O. Belaifa, A. Wolisz
{"title":"基于IEEE 802.11的接入点覆盖区域和邻居发现研究","authors":"S. Hermann, M. Emmelmann, O. Belaifa, A. Wolisz","doi":"10.1109/LCN.2007.110","DOIUrl":null,"url":null,"abstract":"Possessing knowledge about access point coverage areas and neighbors is of essential need for the provisioning of, e.g., location based handovers or push services. A convenient method for their discovery is the usage of information obtained by the mobile devices which are currently associated with the access points. The time span being required for the discovery of coverage areas and neighbors is fundamental in order to assess the suitability of such a method in a dynamic environment. In this paper, exemplary numerical results of the required bootstrapping phase for the information determination are presented. Additionally, a relatively simple enhancement of the algorithm computing the coverage areas is introduced, reducing the number of vertices for the description of the areas. Besides, the paper shows how the upcoming IEEE 802.11k standard enables APs to query mobile devices for location and neighbor information and hence presents for the first time an entirely standard compliant acquisition scheme.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Investigation of IEEE 802.11k-based Access Point Coverage Area and Neighbor Discovery\",\"authors\":\"S. Hermann, M. Emmelmann, O. Belaifa, A. Wolisz\",\"doi\":\"10.1109/LCN.2007.110\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Possessing knowledge about access point coverage areas and neighbors is of essential need for the provisioning of, e.g., location based handovers or push services. A convenient method for their discovery is the usage of information obtained by the mobile devices which are currently associated with the access points. The time span being required for the discovery of coverage areas and neighbors is fundamental in order to assess the suitability of such a method in a dynamic environment. In this paper, exemplary numerical results of the required bootstrapping phase for the information determination are presented. Additionally, a relatively simple enhancement of the algorithm computing the coverage areas is introduced, reducing the number of vertices for the description of the areas. Besides, the paper shows how the upcoming IEEE 802.11k standard enables APs to query mobile devices for location and neighbor information and hence presents for the first time an entirely standard compliant acquisition scheme.\",\"PeriodicalId\":333233,\"journal\":{\"name\":\"32nd IEEE Conference on Local Computer Networks (LCN 2007)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"32nd IEEE Conference on Local Computer Networks (LCN 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2007.110\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2007.110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

摘要

拥有关于接入点覆盖区域和邻居的知识是提供例如基于位置的移交或推送服务的基本需要。用于发现它们的一种方便方法是使用由当前与接入点相关联的移动设备获得的信息。为了评估这种方法在动态环境中的适用性,发现覆盖区域和邻近区域所需的时间跨度是基本的。本文给出了信息确定所需的自举相位的示例性数值结果。此外,对计算覆盖区域的算法进行了相对简单的改进,减少了用于描述覆盖区域的顶点数量。此外,本文还展示了即将到来的IEEE 802.11k标准如何使ap能够查询移动设备的位置和邻居信息,从而首次提出了完全符合标准的获取方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Investigation of IEEE 802.11k-based Access Point Coverage Area and Neighbor Discovery
Possessing knowledge about access point coverage areas and neighbors is of essential need for the provisioning of, e.g., location based handovers or push services. A convenient method for their discovery is the usage of information obtained by the mobile devices which are currently associated with the access points. The time span being required for the discovery of coverage areas and neighbors is fundamental in order to assess the suitability of such a method in a dynamic environment. In this paper, exemplary numerical results of the required bootstrapping phase for the information determination are presented. Additionally, a relatively simple enhancement of the algorithm computing the coverage areas is introduced, reducing the number of vertices for the description of the areas. Besides, the paper shows how the upcoming IEEE 802.11k standard enables APs to query mobile devices for location and neighbor information and hence presents for the first time an entirely standard compliant acquisition scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信