无线网络拓扑优化。定向天线的决策

Aye Min Thike, S. Lupin, Ba Hla Than, Htun Htun Linn, Kyaw Nay Zaw Lin
{"title":"无线网络拓扑优化。定向天线的决策","authors":"Aye Min Thike, S. Lupin, Ba Hla Than, Htun Htun Linn, Kyaw Nay Zaw Lin","doi":"10.1109/EICONRUS.2018.8317374","DOIUrl":null,"url":null,"abstract":"Developing the wireless topology require the solving an optimization task. This is complex task especially for directional antennas. We propose to use brute force algorithm for building the optimal topology. Paper presents some results which illustration the usability and performance the parallel implementation of brute force algorithm.","PeriodicalId":6562,"journal":{"name":"2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)","volume":"59 1","pages":"1467-1471"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Wireless network topology optimization — Decisions for directional antennas\",\"authors\":\"Aye Min Thike, S. Lupin, Ba Hla Than, Htun Htun Linn, Kyaw Nay Zaw Lin\",\"doi\":\"10.1109/EICONRUS.2018.8317374\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Developing the wireless topology require the solving an optimization task. This is complex task especially for directional antennas. We propose to use brute force algorithm for building the optimal topology. Paper presents some results which illustration the usability and performance the parallel implementation of brute force algorithm.\",\"PeriodicalId\":6562,\"journal\":{\"name\":\"2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)\",\"volume\":\"59 1\",\"pages\":\"1467-1471\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EICONRUS.2018.8317374\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EICONRUS.2018.8317374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

开发无线拓扑需要解决一个优化问题。这是一项复杂的任务,特别是对于定向天线。我们建议使用蛮力算法来构建最优拓扑。文中给出了一些结果,说明了蛮力算法并行实现的可用性和性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Wireless network topology optimization — Decisions for directional antennas
Developing the wireless topology require the solving an optimization task. This is complex task especially for directional antennas. We propose to use brute force algorithm for building the optimal topology. Paper presents some results which illustration the usability and performance the parallel implementation of brute force algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信