{"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}
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.