• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Neighbor Discovery in Wireless Networks with Multipacket Reception
【24h】

Neighbor Discovery in Wireless Networks with Multipacket Reception

机译：具有多数据包接收的无线网络中的邻居发现

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

摘要

Neighbor discovery is one of the first steps in configuring and managing a wireless network. Most existing studies on neighbor discovery assume a single-packet reception model where only a single packet can be received successfully at a receiver. In this paper, motivated by the increasing prevalence of multipacket reception (MPR) technologies such as CDMA and MIMO, we study neighbor discovery in MPR networks that allow packets from multiple simultaneous transmitters to be received successfully at a receiver. Starting with a clique of nodes, we first analyze a simple Aloha-like algorithm and show that it takes time to discover all neighbors with high probability when allowing up to simultaneous transmissions. We then design two adaptive neighbor discovery algorithms that dynamically adjust the transmission probability for each node. We show that the adaptive algorithms yield a improvement over the Aloha-like scheme for a clique with nodes and are thus order-optimal. Finally, we analyze our algorithms in a general multi-hop network setting. We show an upper bound of for the Aloha-like algorithm when the maximum node degree is , which is at most a factor worse than the optimal. In addition, when is large, we show that the adaptive algorithms are order-optimal, i.e., have a running time of which matches the lower bound for the problem.
机译：邻居发现是配置和管理无线网络的第一步。现有的大多数关于邻居发现的研究都假设采用单数据包接收模型，其中只有单个数据包可以在接收器处成功接收。在本文中，受诸如CDMA和MIMO之类的多分组接收（MPR）技术日益普及的启发，我们研究了MPR网络中的邻居发现，该发现允许在接收器处成功接收来自多个同时发送器的数据包。首先从节点组开始，我们首先分析一种简单的类似Aloha的算法，并表明当允许同时传输时，要花很长时间才能发现所有邻居。然后，我们设计了两种自适应邻居发现算法，可动态调整每个节点的传输概率。我们表明，对于带有节点的小集团，自适应算法比Aloha式方案产生了改进，因此是顺序最优的。最后，我们在一般的多跳网络环境中分析算法。当最大节点度为时，我们显示了类似Aloha的算法的上限，这最多比最佳情况差一个因素。另外，当较大时，我们表明自适应算法是顺序最优的，即运行时间与问题的下限相匹配。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号