The fundamental role of hop distance in IEEE 802.11 multi-hop ad hoc networks

Yan Gao, D. Chiu, John C.S. Lui
{"title":"The fundamental role of hop distance in IEEE 802.11 multi-hop ad hoc networks","authors":"Yan Gao, D. Chiu, John C.S. Lui","doi":"10.1109/ICNP.2005.41","DOIUrl":null,"url":null,"abstract":"In wireless networks, it is well understood what throughput can be achieved by nodes who can hear each other (i.e. nodes within a single cell). The effects of nodes beyond the sensing range (known as hidden nodes) on a sender are complicated and difficult to analyze. Consequently, how to analytically model multi-hop ad-hoc networks, specially networks based on the popular IEEE 802.11 standards remains largely open. In a recent paper, the throughput of a particular wireless network topology (linear network with a given number of hidden nodes) has been derived analytically. In this paper, we unify previous results on single-cell models, and results characterizing different types of hidden node interference and the analysis of C. Ng et al., (2004), to derive a general solution for throughput given a linear network of arbitrary density and transmission distance between source and destination nodes. An important insight from our model is that there is a certain transmission distance, which is less than the maximum transmission distance, that optimizes throughput in such networks. This result is verified using ns-2 simulation with both single as well as multiple flows.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"13TH IEEE International Conference on Network Protocols (ICNP'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.2005.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

In wireless networks, it is well understood what throughput can be achieved by nodes who can hear each other (i.e. nodes within a single cell). The effects of nodes beyond the sensing range (known as hidden nodes) on a sender are complicated and difficult to analyze. Consequently, how to analytically model multi-hop ad-hoc networks, specially networks based on the popular IEEE 802.11 standards remains largely open. In a recent paper, the throughput of a particular wireless network topology (linear network with a given number of hidden nodes) has been derived analytically. In this paper, we unify previous results on single-cell models, and results characterizing different types of hidden node interference and the analysis of C. Ng et al., (2004), to derive a general solution for throughput given a linear network of arbitrary density and transmission distance between source and destination nodes. An important insight from our model is that there is a certain transmission distance, which is less than the maximum transmission distance, that optimizes throughput in such networks. This result is verified using ns-2 simulation with both single as well as multiple flows.
跳距离在IEEE 802.11多跳自组织网络中的基本作用
在无线网络中,可以听到彼此的节点(即单个单元内的节点)所能达到的吞吐量是很容易理解的。超出感知范围的节点(称为隐藏节点)对发送方的影响是复杂且难以分析的。因此,如何对多跳自组织网络,特别是基于流行的IEEE 802.11标准的网络进行分析建模仍然是一个很大的开放性问题。在最近的一篇论文中,对特定无线网络拓扑(具有给定数量隐藏节点的线性网络)的吞吐量进行了解析推导。在本文中,我们统一了先前关于单细胞模型的结果,以及表征不同类型隐藏节点干扰的结果和C. Ng等人(2004)的分析,得出了给定任意密度和源节点与目标节点之间传输距离的线性网络的吞吐量的一般解。我们的模型得出的一个重要结论是,在这样的网络中,存在一个小于最大传输距离的传输距离来优化吞吐量。用ns-2模拟单流和多流验证了这一结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信