• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Ad-Hoc, Mobile, and Wireless Networks(ADHOC-NOW 2006); 20060817-19; Ottawa(CA) >A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks
【24h】

A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks

机译：Ad-Hoc网络中有界跳跃收敛广播的分布式协议

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

摘要

Given a set S of points (stations) located in the d-dim. Euclidean space and a root b ∈ S, the h-HOPS CONVERGECAST problem asks to find for a minimal energy-cost range assignment which allows to perform the converge-east primitive (i.e. node accumulation) towards b in at most h hops. For this problem no polynomial time algorithm is known even for h = 2. The main goal of this work is the design of an efficient distributed heuristic (i.e. protocol) and the analysis (both theoretical and experimental) of its expected solution cost. In particular, we introduce an efficient parameterized randomized protocol for h-HOPS CONVERGECAST and we analyze it on random instances created by placing n points uniformly at random in a d-cube of side length L. We prove that for h = 2, its expected approximation ratio is bounded by some constant factor. Finally, for h = 3,..., 8, we provide a wide experimental study showing that our protocol has very good performances when compared with previously introduced (centralized) heuristics.
机译：给定D点上的点（站）的集合S。欧氏空间和根b∈S，h-HOPS CONVERGECAST问题要求找到一个最小的能量成本范围分配，该赋值范围允许最多在h跳中朝b执行收敛东原语（即节点积累）。对于这个问题，甚至对于h = 2也不知道多项式时间算法。这项工作的主要目标是设计一种有效的分布式启发式算法（即协议），并对其预期的解决方案成本进行分析（理论和实验）。特别是，我们为h-HOPS CONVERGECAST引入了有效的参数化随机协议，并在边长为L的d立方体中均匀随机放置n个点所创建的随机实例上对其进行了分析。我们证明了对于h = 2，其预期近似比率受某个常数因子限制。最后，对于h = 3，...，8，我们提供了广泛的实验研究，表明与先前引入的（集中式）启发式算法相比，我们的协议具有很好的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号