Two-dimensional Intensity Distribution and Connectivity in Ultraviolet Ad-Hoc Network

Hong Qi, Difan Zou, Chen Gong, Zhengyuan Xu
{"title":"Two-dimensional Intensity Distribution and Connectivity in Ultraviolet Ad-Hoc Network","authors":"Hong Qi, Difan Zou, Chen Gong, Zhengyuan Xu","doi":"10.1109/ICC40277.2020.9148886","DOIUrl":null,"url":null,"abstract":"Consider directional antenna array in an ultraviolet (UV) scattering communication Ad-Hoc network. To efficiently obtain the link gain coverage of single antenna, we propose an algorithm based on one-dimensional (1D) numerical integration and an off-line data library. We also analyze the two-dimensional (2D) scattering intensity distribution, where numerical results show that the path loss profile can be well fitted by elliptic models. In addition, assume that the node distribution in Ad-Hoc network obeys Poisson point process (PPP). For both directional antenna array and omnidirectional antenna, adopting ellipses and circles to represent the coverage of nodes, we investigate the minimum power such that the network still keeps connected. Simulation results show that employing directional antenna array can effectively reduce the minimum power that guarantees coverage.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC40277.2020.9148886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Consider directional antenna array in an ultraviolet (UV) scattering communication Ad-Hoc network. To efficiently obtain the link gain coverage of single antenna, we propose an algorithm based on one-dimensional (1D) numerical integration and an off-line data library. We also analyze the two-dimensional (2D) scattering intensity distribution, where numerical results show that the path loss profile can be well fitted by elliptic models. In addition, assume that the node distribution in Ad-Hoc network obeys Poisson point process (PPP). For both directional antenna array and omnidirectional antenna, adopting ellipses and circles to represent the coverage of nodes, we investigate the minimum power such that the network still keeps connected. Simulation results show that employing directional antenna array can effectively reduce the minimum power that guarantees coverage.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
紫外自组织网络中的二维强度分布和连通性
考虑紫外(UV)散射通信Ad-Hoc网络中的定向天线阵列。为了有效地获得单天线的链路增益覆盖,我们提出了一种基于一维数值积分和离线数据库的算法。本文还对二维散射强度分布进行了分析,结果表明椭圆模型可以很好地拟合路径损耗曲线。另外,假设Ad-Hoc网络中的节点分布遵循PPP(泊松点过程)。对于定向天线阵列和全向天线,我们采用椭圆和圆形表示节点的覆盖范围,研究使网络保持连接的最小功率。仿真结果表明,采用定向天线阵可以有效降低保证覆盖的最小功率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Full Duplex MIMO Digital Beamforming with Reduced Complexity AUXTX Analog Cancellation Cognitive Management and Control of Optical Networks in Dynamic Environments Offloading Media Traffic to Programmable Data Plane Switches Simultaneous Transmitting and Air Computing for High-Speed Point-to-Point Wireless Communication A YouTube Dataset with User-level Usage Data: Baseline Characteristics and Key Insights
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1