...
首页> 外文期刊>Procedia Computer Science >An Algorithm to Construct Minimum Velocity Based Stable Connected Dominating Sets for MANETs using Strong Neighborhoods
【24h】

An Algorithm to Construct Minimum Velocity Based Stable Connected Dominating Sets for MANETs using Strong Neighborhoods

机译:一种算法,用于使用强邻域构造基于疯狂的稳定连接的主导集合的算法

获取原文
   

获取外文期刊封面封底 >>

       

摘要

This paper investigates a stable connected dominating set (CDS) construction algorithm for mobile ad hoc networks(MANETs). The proposed algorithm is based on the node velocity using the notion of Strong Neighborhood determined by the Threshold Neighborhood Distance Ratio (TNDR) constraint, which contributes to a stable CDS without considering unstable edges in the network. If a node has the lowest speed in all competing nodes with at least one neighbor that has not been explored, it is selected as a dominator. When a node becomes a CDS node, we say that all its neighbors are explored and have the opportunities to participate in the next iteration. This process of selecting nodes continues until all nodes in the network are explored. The tradeoff is that the size of the nodes and edges in CDS are slightly larger.
机译:本文研究了移动临时网络(船只)的稳定连接的主导集合(CDS)施工算法。所提出的算法基于使用由阈值邻距离比(TNDR)约束的强邻域的概念的节点速度,这有助于稳定的CD而不考虑网络中的不稳定边缘。如果节点在所有竞争节点中具有至少一个尚未探索的邻居的速度最低,则选择为占主导地位。当节点成为CDS节点时,我们说探索所有邻居并具有参与下一次迭代的机会。选择节点的此过程继续,直到探索网络中的所有节点。权衡是CD中节点和边缘的大小略大。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号