Fully Dynamic Broadcasting under SINR

Dongxiao Yu, Long Lin, Yong Zhang, Jiguo Yu, Yifei Zou, Qiang-Sheng Hua, Xiuzhen Cheng
{"title":"Fully Dynamic Broadcasting under SINR","authors":"Dongxiao Yu, Long Lin, Yong Zhang, Jiguo Yu, Yifei Zou, Qiang-Sheng Hua, Xiuzhen Cheng","doi":"10.1109/PCCC.2018.8710988","DOIUrl":null,"url":null,"abstract":"Dynamicity is one of the critical characteristics and a major challenge in designing communication protocols in wireless networks. Most of the previous works had focused on the internal node changes (e.g., mobility, arrival, or departure) and not considered the effect of external environmental change. However, the external environmental change, in general, is a more complex phenomenon that can impede nodes from successful communication, implying the protocols of the previous dynamic models do not work well in practice. In this paper, we give an algorithm for distributed broadcasting in a more general model with fully dynamic wireless networks, called FD-Broadcast. Specifically, we present a fully dynamic model which allows node mobility and churns (due to node arrivals/departure) and external environmental change. In contrast to the previous works on dynamic networks, our model defines the full dynamicity in terms of localized topological changes of each node and can tolerate some external environmental change. The external environment changes are captured by the random jamming method. We show that FD-Broadcast can achieve broadcasting in $O(D_{S})$ rounds with a high probability guarantee under the assumption of constant dynamic rate in the SINR model, where $D_{S}$ is the dynamic diameter, a parameter proposed to depict the complexity of dynamic broadcasting. Moreover, the lower bound of dynamic broadcasting is proved to be $\\Omega(D_{S})$, thus, FD-Broadcast is asymptotically optimal with high probability.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2018.8710988","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Dynamicity is one of the critical characteristics and a major challenge in designing communication protocols in wireless networks. Most of the previous works had focused on the internal node changes (e.g., mobility, arrival, or departure) and not considered the effect of external environmental change. However, the external environmental change, in general, is a more complex phenomenon that can impede nodes from successful communication, implying the protocols of the previous dynamic models do not work well in practice. In this paper, we give an algorithm for distributed broadcasting in a more general model with fully dynamic wireless networks, called FD-Broadcast. Specifically, we present a fully dynamic model which allows node mobility and churns (due to node arrivals/departure) and external environmental change. In contrast to the previous works on dynamic networks, our model defines the full dynamicity in terms of localized topological changes of each node and can tolerate some external environmental change. The external environment changes are captured by the random jamming method. We show that FD-Broadcast can achieve broadcasting in $O(D_{S})$ rounds with a high probability guarantee under the assumption of constant dynamic rate in the SINR model, where $D_{S}$ is the dynamic diameter, a parameter proposed to depict the complexity of dynamic broadcasting. Moreover, the lower bound of dynamic broadcasting is proved to be $\Omega(D_{S})$, thus, FD-Broadcast is asymptotically optimal with high probability.
全动态广播下的SINR
动态是无线网络通信协议设计的一个重要特点和主要挑战。以往的研究大多侧重于内部节点的变化(如移动性、到达或离开),而没有考虑外部环境变化的影响。然而,外部环境的变化通常是一个更复杂的现象,它会阻碍节点之间的成功通信,这意味着之前的动态模型的协议在实践中不能很好地工作。本文给出了一种基于全动态无线网络的分布式广播算法,称为FD-Broadcast。具体来说,我们提出了一个完全动态的模型,该模型允许节点移动和流失(由于节点到达/离开)以及外部环境变化。与以往关于动态网络的研究不同,我们的模型从每个节点局部拓扑变化的角度定义了网络的完全动态性,并能承受一定的外部环境变化。随机干扰法捕获外部环境的变化。我们证明了在SINR模型中,在动态速率恒定的假设下,FD-Broadcast可以在$O(D_{S})$轮内以高概率保证实现广播,其中$D_{S}$为动态直径,这是描述动态广播复杂性的参数。此外,还证明了动态广播的下界为$\Omega(D_{S})$,因此,FD-Broadcast具有高概率的渐近最优性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信