• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>9th ACM/IEEE international conference on information processing in sensor networks 2010 >U-Connect: A Low-Latency Energy-Efficient Asynchronous Neighbor Discovery Protocol
【24h】

U-Connect: A Low-Latency Energy-Efficient Asynchronous Neighbor Discovery Protocol

机译：U-Connect：一种低延迟节能的异步邻居发现协议

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Mobile sensor nodes can be used for a wide variety of applications such as social networks and location tracking. An important requirement for all such applications is that the mobile nodes need to actively discover their neighbors with minimal energy and latency. Nodes in mobile networks are not necessarily synchronized with each other, making the neighbor discovery problem all the more challenging. In this paper, we propose a neighbor discovery protocol called U-Connect, which achieves neighbor discovery at minimal and predictable energy costs while allowing nodes to pick dissimilar duty-cycles. We provide a theoretical formulation of this asynchronous neighbor discovery problem, and evaluate it using the power-latency product metric. We analytically establish that U-Connect is an 1.5-approximation algorithm for the symmetric asynchronous neighbor discovery problem, whereas existing protocols like Quorum and Disco are 2-approximation algorithms. We evaluate the performance of U-Connect and compare the performance of U-Connect with that of existing neighbor discovery protocols. We have implemented U-Connect on our custom portable FireFly Badge hardware platform. A key aspect of our implementation is that it uses a slot duration of only 250/xs, and achieves orders of magnitude lower latency for a given duty cycle compared to existing schemes for wireless sensor networks. We provide experimental results from our implementation on a network of around 20 sensor nodes. Finally, we also describe a Friend-Finder application that uses the neighbor discovery service provided by U-Connect.
机译：移动传感器节点可用于多种应用，例如社交网络和位置跟踪。对所有此类应用程序的重要要求是，移动节点需要以最小的能量和延迟来主动发现其邻居。移动网络中的节点不一定彼此同步，这使得邻居发现问题更具挑战性。在本文中，我们提出了一种称为U-Connect的邻居发现协议，该协议以最小且可预测的能源成本实现邻居发现，同时允许节点选择不同的占空比。我们提供了此异步邻居发现问题的理论表述，并使用功率等待时间乘积度量对其进行了评估。我们通过分析确定，U-Connect是对称异步邻居发现问题的1.5近似算法，而Quorum和Disco之类的现有协议是2近似算法。我们评估U-Connect的性能，并将U-Connect的性能与现有邻居发现协议的性能进行比较。我们已经在定制的便携式FireFly Badge硬件平台上实现了U-Connect。与无线传感器网络的现有方案相比，我们实施的一个关键方面是它仅使用250 / xs的时隙持续时间，并且在给定的占空比下，延迟降低了几个数量级。我们在约20个传感器节点的网络上提供了实验结果。最后，我们还描述了一个使用U-Connect提供的邻居发现服务的Friend-Finder应用程序。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号