Low-complexity beamforming techniques for wireless multihop networks

R. Vilzmann, J. Widmer, I. Aad, C. Hartmann
{"title":"Low-complexity beamforming techniques for wireless multihop networks","authors":"R. Vilzmann, J. Widmer, I. Aad, C. Hartmann","doi":"10.1109/SAHCN.2006.288505","DOIUrl":null,"url":null,"abstract":"Protocols for beamforming antennas usually direct the beam toward the respective communication partner. This requires significant coordination between nodes and results in frequent changes of the beam direction. In this paper, we present much simpler algorithms that instead aim at improving connectivity and robustness of routing. A node computes the optimal beam direction using aggregate information about its neighborhood such as the number of neighbors in each beam direction. We analyze the performance of such algorithms in terms of number of paths to a destination, mutual interference, and route lifetime in mobile networks, and show that they are a promising alternative to existing beamforming schemes","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"37 1","pages":"489-497"},"PeriodicalIF":0.0000,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAHCN.2006.288505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

Protocols for beamforming antennas usually direct the beam toward the respective communication partner. This requires significant coordination between nodes and results in frequent changes of the beam direction. In this paper, we present much simpler algorithms that instead aim at improving connectivity and robustness of routing. A node computes the optimal beam direction using aggregate information about its neighborhood such as the number of neighbors in each beam direction. We analyze the performance of such algorithms in terms of number of paths to a destination, mutual interference, and route lifetime in mobile networks, and show that they are a promising alternative to existing beamforming schemes
无线多跳网络的低复杂度波束形成技术
波束形成天线的协议通常将波束指向各自的通信伙伴。这就需要节点之间进行大量的协调,并导致波束方向的频繁变化。在本文中,我们提出了更简单的算法,而不是旨在提高路由的连通性和鲁棒性。节点使用有关其邻居的聚合信息(例如每个波束方向上的邻居数量)计算最优波束方向。我们从到达目的地的路径数、相互干扰和移动网络中的路由生存期等方面分析了这些算法的性能,并表明它们是现有波束形成方案的一个有希望的替代方案
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
158
×
引用
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学术官方微信