.png){kind=icon}
返回
BlindDate: A Neighbor Discovery Protocol
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2014.2316159.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many wireless applications urgently demand an efficient neighbor discovery protocol to build up bridges connecting user themselves or to some service providers. However, due to intrinsic constraints of wireless devices, e.g., limited energy and error of clock synchronization, there is still absence of effective and efficient neighbor discovery protocols in the literature. In this work, we propose neighbor discovery protocols for the following two problems. First, we study Asynchronous Symmetry Neighbor Discovery problem, in which potential neighbor devices with asynchronous time clocks but the same duty cycle aim to find each other. Second, we propose an efficient protocol (utilizing Bouncing strategy) named Blind Date with guaranteed worst-case performance 9/10 (1 + delta)(2) x(2) where d is a small fraction of the length of a time slot unit and 1/x is the duty cycle. Third, we extend this strategy to address Asynchronous Asymmetry Neighbor Discovery problem, in which both the time clock and the duty cycles of potential neighbors are considered to be heterogeneous. We conduct extensive experiments and simulations to examine the feasibility and efficiency of the proposed protocols, and results show that BlindDate greatly outperforms existing approaches in average-case. Compared with known protocols, BlindDate also achieves a better worst-case discovery latency bound (e.g., 10 percent performance gain comparing with Searchlight [1]).
Keyword:
Neighbor discovery
energy efficiency
latency
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
Numerical integration of the cartesian equations of motion of a system with constraints: molecular dynamics of n-alkanes具有约束的系统的笛卡尔运动方程的数值积分: 正构烷烃的分子动力学
.png){kind=icon}
PREAI
分享收藏
查看更多内容