[论文解读] Deterministic Backbone Creation in an SINR Network without Knowledge of Location

Dariusz R. Kowalski, William K. Moses+1 more|arXiv (Cornell University)|Feb 8, 2017

Mobile Ad Hoc Networks参考文献 17被引用 6

一句话总结

本文提出了一种确定性协议，用于在无位置信息的SINR无线网络中构建骨干网，仅依赖节点标签、邻域信息和全局参数。该协议在$O(\Delta \lg^2 N)$轮内完成骨干网构建，确保连通性、有界度数，并在大小和直径上达到常数因子最优。

ABSTRACT

For a given network, a backbone is an overlay network consisting of a connected dominating set with additional accessibility properties. Once a backbone is created for a network, it can be utilized for fast communication amongst the nodes of the network. The Signal-to-Interference-plus-Noise-Ratio (SINR) model has become the standard for modeling communication among devices in wireless networks. For this model, the community has pondered what the most realistic solutions for communication problems in wireless networks would look like. Such solutions would have the characteristic that they would make the least number of assumptions about the availability of information about the participating nodes. Solving problems when nothing at all is known about the network and having nodes just start participating would be ideal. However, this is quite challenging and most likely not feasible. The pragmatic approach is then to make meaningful assumptions about the available information and present efficient solutions based on this information. We present a solution for creation of backbone in the SINR model, when nodes do not have access to their physical coordinates or the coordinates of other nodes in the network. This restriction models the deployment of nodes in various situations for sensing hurricanes, cyclones, and so on, where only information about nodes prior to their deployment may be known but not their actual locations post deployment. We assume that nodes have access to knowledge of their label, the labels of nodes within their neighborhood, the range from which labels are taken $[N]$ and the total number of participating nodes $n$. We also assume that nodes wake up spontaneously. We present an efficient deterministic protocol to create a backbone with a round complexity of $O(Δ\lg^2 N)$.

研究动机与目标

• 解决在节点缺乏物理坐标信息的SINR网络中构建骨干网的挑战，这一场景常见于灾难监测或传感器部署。
• 设计一种分布式、确定性算法，在最小假设条件下运行——仅依赖节点标签、本地邻域知识以及全局参数（$n$、$\Delta$、$N$）。
• 确保骨干网保持关键特性：每个节点的度数有界，直径渐近等价于网络原始直径，且大小在最优CDS的常数因子范围内。
• 在缺乏位置信息且节点随机唤醒的条件下，实现高效的轮复杂度。

提出的方法

• 使用关键网格分解将节点分组为网格盒，通过基于标签的选举机制确保每盒至多一个领导者。
• 应用三跳连接协议，利用令牌传递协调相距三跳的领导者之间的辅助节点。
• 利用$(N,c)$-SSF（强同步帧）技术，在SINR约束下实现领导者之间可靠的消息传输。
• 采用消息聚合与选择启发式方法（例如选择标签最小的辅助节点）以最小化消息大小并确保一致性。
• 使用确定性令牌传递机制，在受控且有界时间内跨网络传播标签和邻居信息。
• 确保所有消息大小为$O(\lg N)$比特，以维持效率并避免通信瓶颈。

实验结果

研究问题

• RQ1 在节点缺乏物理位置信息的SINR网络中，能否构建确定性骨干网？
• RQ2 在最小假设条件下（无位置信息，仅依赖标签和邻域信息），SINR模型中骨干网构建的最小轮复杂度是多少？
• RQ3 如何在无位置信息的情况下保持骨干网的连通性与结构特性（度数、直径、大小）？
• RQ4 该协议能否在SINR模型中弱设备与弱连通性假设下保持效率与正确性？
• RQ5 如何在无全局协调的情况下，实现相距三跳的领导者之间的一致辅助节点选择？

主要发现

• 所提出的协议在$O(\Delta \lg^2 N)$轮内构建骨干网，显著优于以往依赖概率方法或位置信息的方案。
• 骨干网保持每个节点的常数度数，确保可扩展性及路由与维护的低开销。
• 骨干网的直径渐近等价于原始通信图的直径，保持了网络效率。
• 骨干网的大小在最小可能连通支配集的常数因子范围内，确保近似最优。
• 通过基于标签的协调与令牌传递，协议确保了相距三跳的领导者之间的一致辅助节点选择。
• 所有交换的消息大小均为$O(\lg N)$比特，维持了通信效率，并支持协议的轮复杂度。