• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International conference on engineering vibration, communication and information processing >Minimum Shared-Link-Count Forwarding for Alleviating Congestion in Wireless Sensor Networks
【24h】

Minimum Shared-Link-Count Forwarding for Alleviating Congestion in Wireless Sensor Networks

机译：最低共享链路计数转发，用于减轻无线传感器网络中拥塞的转发

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In a wireless sensor network, when two or more forwarding paths share a common link that link is overloaded compared to an unshared link. The overload may cause congestion at the terminal nodes of that link. Therefore, link-disjoint paths are preferred to reduce the eventual congestion. When the topology does not support full link-disjoint paths, the primary objective is to maximize the link-disjoint paths or to minimize the shared-link paths to alleviate congestion. When several minimum shared-link paths are available, we select the least-cost route. Since the data forwarding task is basically, "many to one" communication, the least-cost minimum shared-link paths form a tree. Thus, the goal is to determine the optimal tree which has minimum shared-link paths with least cost. A new iterative algorithm is presented to determine such an optimal tree. The number of iterations is equal to the number of sources. In the first iteration, we construct the shortest path for one of the sources and assign virtual weights to the edges (links) of that path. Then, calculate the next minimum edge weight path from the next source and so on. The virtual weights are manipulated from iteration to iteration in such a way that the least cost and the minimum shared-link criteria are satisfied. The proposed algorithm adjusts the virtual weights and determines the shortest path. This is a centralized algorithm which can be easily converted into a distributed one.
机译：在无线传感器网络中，当两个或多个转发路径共享与未共享的链路相比，链接过载链接。过载可能会导致该链路的终端节点处的拥塞。因此，链路 - 不相交的路径是优选的，以减少最终拥塞。当拓扑不支持完全链路不相交的路径时，主要目标是最大化链路不相交的路径或最小化共享链路路径以缓解拥塞。当有几个最小共享链路路径可用时，我们选择最不成本的路线。由于数据转发任务基本上是“很多到一个”通信，因此最低成本的最小共享链路路径形成树。因此，目标是确定具有最小成本的最小共享链路路径的最佳树。提出了一种新的迭代算法来确定这种最佳树。迭代的数量等于源的数量。在第一次迭代中，我们构建一个源的最短路径，并将虚拟权重分配给该路径的边缘（链接）。然后，计算来自下一个源等的下一个最小边缘权重路径等。虚拟权重被操纵从迭代到迭代，以这样的方式，即满足最少的成本和最小共享链路标准。该算法调整虚拟权重并确定最短路径。这是一种集中式算法，它可以很容易地转换为分布式算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号