Neighbor Discovery in Wireless Networks: Moving from two to the Multi-Device and Asymmetric Case

无线网络中的邻居发现：从两个转向多设备和非对称情况

• 批准号: 492661503
• 负责人: Dr.-Ing. Philipp Heinrich Kindt
• 金额: --
• 依托单位: Juniorprofessur Pervasive Computing Systeme
• 依托单位国家: 德国
• 项目类别: Research Grants
• 财政年份: 2022
• 资助国家: 德国
• 起止时间: 2021-12-31 至 2022-12-31
• 项目状态: 已结题
• 来源: https://gepris.dfg.de/gepris/projekt/492661503?language=en
• 关键词: Neighbor; Discovery; Wireless; Networks; Moving

The Internet of Things relies on energy-efficient wireless communications for achieving sufficiently long battery runtimes, or for being able to power devices using energy harvesting. However, the procedure for establishing a first wireless contact, called neighbor discovery, remains to be very energy-hungry. This particularly aggravates applications, in which such a procedure needs to be carried out continuously for detecting new devices in the environment.For establishing a first contact, every device transmits packets regularly to the channel, and regularly schedules reception windows for detecting incoming transmissions from other devices. For saving energy, the devices sleep whenever they don't participate in the communication. As soon as a packet is sent while another device is carrying out a reception window, a first contact has been established. The main goal is to minimize the latency until which a first contact can be established in the worst-case. Towards this, the schedule of packets and reception windows needs to be optimized. For the case of one transmitter and one receiver, an optimal solution is known for this problem. However, when multiple devices discover each other simultaneously, colliding packets become predominant in this procedure and existing solutions are no longer optimal. Furthermore, even for the case of only two devices, no optimal protocols that allow each device to adjust its energy-budget autonomously are known. Both scenarios are highly relevant in the Internet of Things, with its growing number of heterogeneous devices with different energy requirements. Goal of this project is creating the theoretical foundations for an efficient neighbor discovery procedure in such scenarios. Based thereupon, we develop practical protocols with a significantly higher performance than existing solutions. We furthermore evaluate our results using discrete event simulations and real-world experiments using wireless radio hardware.

物联网依靠节能的无线通信来实现足够长的电池运行时间，或者能够通过能量收集为设备供电。然而，建立第一个无线联系的过程，称为邻居发现，仍然是非常耗能的。这尤其加剧了应用，在这些应用中，需要连续执行这样的程序来检测环境中的新设备。为了建立第一次接触，每个设备定期向信道发送数据包，并定期安排接收窗口来检测来自其他设备的传入传输。为了节省能源，设备在不参与通信时处于休眠状态。当另一个设备正在执行接收窗口时，一旦发送了数据包，就建立了第一次联系。主要目标是尽量减少在最坏情况下建立第一次接触的延迟。为此，需要对数据包的调度和接收窗口进行优化。对于一个发射器和一个接收器的情况，已知这个问题的最优解。但是，当多台设备同时发现对方时，在这个过程中，冲突报文占主导地位，现有的解决方案不再是最优的。此外，即使在只有两个设备的情况下，也没有最佳协议允许每个设备自主调整其能量预算。这两种场景在物联网中都是高度相关的，因为物联网中越来越多的异构设备具有不同的能量需求。该项目的目标是为在这种情况下有效的邻居发现过程创建理论基础。在此基础上，我们开发了具有比现有解决方案更高性能的实用协议。我们进一步使用离散事件模拟和使用无线无线电硬件的真实世界实验来评估我们的结果。