当前位置: X-MOL 学术Sensors › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Low-Latency and Energy-Efficient Neighbor Discovery Algorithm for Wireless Sensor Networks.
Sensors ( IF 3.4 ) Pub Date : 2020-01-24 , DOI: 10.3390/s20030657
Zhaoquan Gu 1 , Zhen Cao 2 , Zhihong Tian 1 , Yuexuan Wang 3 , Xiaojiang Du 4, 5 , Guizani Mohsen 5
Affiliation  

Wireless sensor networks have been widely adopted, and neighbor discovery is an essential step to construct the networks. Most existing studies on neighbor discovery are designed on the assumption that either all nodes are fully connected or only two nodes compose the network. However, networks are partially connected in reality: some nodes are within radio range of each other, while others are not. Low latency and energy efficiency are two common goals, which become even more challenging to achieve at the same time in partially connected networks. We find that the collision caused by simultaneous transmissions is the main obstruction of achieving the two goals. In this paper, we present an efficient algorithm called Panacea to address these challenges by alleviating collisions. To begin with, we design Panacea-NCD (Panacea no collision detection) for nodes that do not have a collision detection mechanism.

中文翻译:

无线传感器网络的低延迟和节能邻居发现算法。

无线传感器网络已被广泛采用,邻居发现是构建网络的必不可少的步骤。现有的大多数关于邻居发现的研究都是基于以下假设进行的:所有节点都完全连接,或者只有两个节点组成网络。但是,实际上网络是部分连接的:有些节点在彼此的无线电范围内,而另一些不在。低延迟和高能效是两个共同的目标,在部分连接的网络中同时实现这些目标变得更加具有挑战性。我们发现,同时传输引起的碰撞是实现这两个目标的主要障碍。在本文中,我们提出了一种称为Panacea的有效算法,可以通过缓解碰撞来应对这些挑战。首先,
更新日期:2020-01-24
down
wechat
bug