一种设计无线光宽带接入网多跳无线连接的有效算法

Panaya Pengboon, P. Kaewplung
{"title":"一种设计无线光宽带接入网多跳无线连接的有效算法","authors":"Panaya Pengboon, P. Kaewplung","doi":"10.1109/WOCC.2012.6198175","DOIUrl":null,"url":null,"abstract":"This paper presents an algorithm for the design of the wireless-optical broadband access network (WOBAN) considering the multi-hop wireless connection among subscribers. With our algorithm, we can specify the number of hop in which subscribers can access to optical network units (ONUs) or base stations (BSs). Our algorithm will give the optimum positions, as well as the number, of ONU required in the network, when the number of wireless connection hop is given.Furthermore, the algorithm can also assign for the shortest routes connecting among subscribers. Noted that the placement, the number of ONU, and the routes connecting among subscribers, will vary with the designed number of hop as well as the constraints of wireless connection such as the limitation of signal power.","PeriodicalId":118220,"journal":{"name":"2012 21st Annual Wireless and Optical Communications Conference (WOCC)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An efficient algorithm for designing multi-hop wireless connections for wireless-optical broadband access network\",\"authors\":\"Panaya Pengboon, P. Kaewplung\",\"doi\":\"10.1109/WOCC.2012.6198175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an algorithm for the design of the wireless-optical broadband access network (WOBAN) considering the multi-hop wireless connection among subscribers. With our algorithm, we can specify the number of hop in which subscribers can access to optical network units (ONUs) or base stations (BSs). Our algorithm will give the optimum positions, as well as the number, of ONU required in the network, when the number of wireless connection hop is given.Furthermore, the algorithm can also assign for the shortest routes connecting among subscribers. Noted that the placement, the number of ONU, and the routes connecting among subscribers, will vary with the designed number of hop as well as the constraints of wireless connection such as the limitation of signal power.\",\"PeriodicalId\":118220,\"journal\":{\"name\":\"2012 21st Annual Wireless and Optical Communications Conference (WOCC)\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 21st Annual Wireless and Optical Communications Conference (WOCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCC.2012.6198175\",\"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 21st Annual Wireless and Optical Communications Conference (WOCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCC.2012.6198175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种考虑用户间多跳无线连接的无线光宽带接入网(WOBAN)设计算法。使用我们的算法,我们可以指定用户可以访问光网络单元(onu)或基站(BSs)的跳数。当无线连接跳数给定时,我们的算法将给出网络中所需的ONU的最优位置和数量。此外,该算法还可以分配用户之间最短的连接路径。需要注意的是,ONU的放置、ONU的数量以及用户之间的路由连接会随着设计的跳数以及无线连接的限制(如信号功率的限制)而变化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient algorithm for designing multi-hop wireless connections for wireless-optical broadband access network
This paper presents an algorithm for the design of the wireless-optical broadband access network (WOBAN) considering the multi-hop wireless connection among subscribers. With our algorithm, we can specify the number of hop in which subscribers can access to optical network units (ONUs) or base stations (BSs). Our algorithm will give the optimum positions, as well as the number, of ONU required in the network, when the number of wireless connection hop is given.Furthermore, the algorithm can also assign for the shortest routes connecting among subscribers. Noted that the placement, the number of ONU, and the routes connecting among subscribers, will vary with the designed number of hop as well as the constraints of wireless connection such as the limitation of signal power.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信