海报:无线通信网络性能指标建模的几何距离分布

Maryam Ahmadi, Jianping Pan, Lei Zheng, Lin X. Cai, Fei Tong
{"title":"海报:无线通信网络性能指标建模的几何距离分布","authors":"Maryam Ahmadi, Jianping Pan, Lei Zheng, Lin X. Cai, Fei Tong","doi":"10.1145/2639108.2642905","DOIUrl":null,"url":null,"abstract":"Geometrical distance distribution (GDD) between nodes in wireless communication networks plays a significant role in modeling network performance metrics. Existing work on obtaining GDD assumes the network geometry to be a regular one, such as circle and square. Due to the various complex effects of wireless signals, however, the network geometry usually is quite irregular. Therefore, this paper proposes a novel systematic and unified approach to obtain the GDD between two random nodes associated with arbitrary network geometries. To the best of our knowledge, this is the first work that will fill the gap in the literature of this field.","PeriodicalId":331897,"journal":{"name":"Proceedings of the 20th annual international conference on Mobile computing and networking","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Poster: geometrical distance distribution for modeling performance metrics in wireless communication networks\",\"authors\":\"Maryam Ahmadi, Jianping Pan, Lei Zheng, Lin X. Cai, Fei Tong\",\"doi\":\"10.1145/2639108.2642905\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Geometrical distance distribution (GDD) between nodes in wireless communication networks plays a significant role in modeling network performance metrics. Existing work on obtaining GDD assumes the network geometry to be a regular one, such as circle and square. Due to the various complex effects of wireless signals, however, the network geometry usually is quite irregular. Therefore, this paper proposes a novel systematic and unified approach to obtain the GDD between two random nodes associated with arbitrary network geometries. To the best of our knowledge, this is the first work that will fill the gap in the literature of this field.\",\"PeriodicalId\":331897,\"journal\":{\"name\":\"Proceedings of the 20th annual international conference on Mobile computing and networking\",\"volume\":\"116 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 20th annual international conference on Mobile computing and networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2639108.2642905\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 20th annual international conference on Mobile computing and networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2639108.2642905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

无线通信网络中节点间的几何距离分布(GDD)在网络性能指标建模中起着重要作用。现有的计算GDD的工作假设网络几何形状是规则的,如圆形和正方形。然而,由于无线信号的各种复杂影响,网络的几何形状通常是相当不规则的。因此,本文提出了一种新的系统统一的方法来获取任意网络几何形状的两个随机节点之间的GDD。据我们所知,这是第一部填补这一领域文献空白的著作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Poster: geometrical distance distribution for modeling performance metrics in wireless communication networks
Geometrical distance distribution (GDD) between nodes in wireless communication networks plays a significant role in modeling network performance metrics. Existing work on obtaining GDD assumes the network geometry to be a regular one, such as circle and square. Due to the various complex effects of wireless signals, however, the network geometry usually is quite irregular. Therefore, this paper proposes a novel systematic and unified approach to obtain the GDD between two random nodes associated with arbitrary network geometries. To the best of our knowledge, this is the first work that will fill the gap in the literature of this field.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信