首页> 外文会议> >Enhancing broadcast operations in ad hoc networks with two-hop connected dominating sets
【24h】

Enhancing broadcast operations in ad hoc networks with two-hop connected dominating sets

机译:通过两跳连接的主导集增强ad hoc网络中的广播操作

获取原文

摘要

We introduce the three-hop horizon pruning (THP) algorithm to make broadcast operations more efficient in ad hoc networks using contention-based MAC protocols. THP builds a two-hop connected dominating set (TCDS) of the network, which is a set of nodes such that every node in the network is within two hops from some node in the dominating set. Efficiency of broadcast operations is attained by implementing forwarding schemes that take advantage of a TCDS. More specifically, every node provides its one-hop neighbors with a list specifying one or more tuples, each with the identifier of a one-hop neighbor and a bit indicating if that neighbor dominates any two-hop neighbor. To forward a broadcast packet, a node tries to obtain the smallest subset of forwarders, which are one-hop neighbors that use some of the node's two-hop neighbors to reach any node that is three hops away. After such a selection of forwarders, the node broadcasts its packet with a header specifying the list of forwarders, and each forwarder in turn repeats the process.
机译:我们介绍了三跳地平线修剪(THP)算法,使用基于争用的MAC协议在临时网络中更高效地进行广播操作。 THP构建了一个双跳连接的主导集合(TCD)的网络,这是一组节点,使得网络中的每个节点都在主导集中的某些节点中的两个跳中。通过实施利用TCD的转发方案实现广播操作的效率。更具体地,每个节点都提供了与指定一个或多个元组的列表的一跳邻居,每个节点都具有单跳邻居的标识符和指示该邻居主导任何两个跳邻居的比特。为了转发广播数据包,节点尝试获取转发器的最小子集,这是一个跳邻居,它使用一些节点的两跳邻居来到达三个跳跃的任何节点。在这样的选择转发器之后,节点使用指定转发器列表的标题广播其数据包,并且每个转发器反过来重复该过程。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号