• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks
【24h】

A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks

机译：移动自组织网络中使用1-Hop信息的分布式高效洪泛方案

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

摘要

Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of messages, resource contention, and signal collision. This causes high protocol overhead and interference with the existing traffic in the networks. Some efficient flooding algorithms were proposed to avoid these problems. However, these algorithms either perform poorly in reducing redundant transmissions or require each node to maintain 2-hop (or more) neighbors information. In the paper, we study the sufficient and necessary condition of 100 percent deliverability for flooding schemes that are based on only 1-hop neighbors information. We further propose an efficient flooding algorithm that achieves the local optimality in two senses: 1) The number of forwarding nodes in each step is minimal and 2) the time complexity for computing forwarding nodes is the lowest, which is O(nlogn), where n is the number of neighbors of a node. Extensive simulations have been conducted and simulation results have shown the excellent performance of our algorithm.
机译：泛洪是移动自组织网络中最基本的操作之一。洪泛的传统实现遭受消息过多冗余，资源争用和信号冲突的问题。这会导致较高的协议开销并干扰网络中的现有流量。为了避免这些问题，提出了一些有效的泛洪算法。但是，这些算法在减少冗余传输方面效果不佳，或者要求每个节点维护2跳（或更多）邻居信息。在本文中，我们研究了仅基于一跳邻居信息的洪泛方案的100％可交付性的充要条件。我们进一步提出了一种有效的泛洪算法，该算法可以从两种意义上实现局部最优：1）每个步骤中转发节点的数量最少，并且2）计算转发节点的时间复杂度最低，即O（nlogn），其中n是节点的邻居数。进行了广泛的仿真，仿真结果表明了我们算法的出色性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号