• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Foundations and trends in networking >Opportunistic Routing in Wireless Networks
【24h】

Opportunistic Routing in Wireless Networks

机译：无线网络中的机会路由

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

摘要

Wireless multi-hop networks have become an important part of many modern communication systems. Opportunistic routing aims to overcome the deficiencies of conventional routing on wireless multi-hop networks, by specifically utilizing wireless broadcast opportunities and receiver diversity. Opportunistic routing algorithms, which are specifically optimized to incorporate into the routing decisions a model of wireless transmission, take advantage of scheduling, multi-user, and receiver diversity gains and result in significant reduction in the expected cost of routing per packet. The ability of the algorithm to take advantage of the aspects of wireless transmission, however, depends on the scalability and the additional overhead associated with the opportunistic routing as well as the availability of side information regarding wireless channel statistics, topology, etc. This manuscript sheds light on the performance gains associated with incorporating into the routing strategy the nature of wireless transmission and devises algorithms and solutions to realize these gains in a scalable, practical, and low cost manner. This manuscript first provides an overview of various opportunistic distance-vector algorithms that have been developed to incorporate wireless transmission and routing opportunities. Furthermore, an optimal opportunistic distance metric is proposed whose construction follows from a dynamic programming characterization of the problem. The performance of the optimal routing is then examined against the performance of several other known routing algorithms. To allow for a scalable and distributed solution, the distributed computation of this optimal distance-metric is provided. The performance of a distributed implementation of the optimal opportunistic routing algorithm is also examined via simulation. In addition to the construction of the opportunistic schemes in centralized and distributed fashions, this manuscript also addresses how learning the wireless medium can be efficiently incorporated in the structure of routing algorithm. Finally, this manuscript examines the dynamic congestion-based distance metric and its performance against other congestion aware solutions in the literature.
机译：无线多跳网络已成为许多现代通信系统的重要组成部分。机会路由旨在通过专门利用无线广播机会和接收机多样性来克服无线多跳网络上常规路由的缺陷。机会路由算法经过特别优化，可以将无线传输模型纳入路由决策中，从而充分利用了调度，多用户和接收机分集增益，并显着降低了每个数据包的预期路由成本。然而，算法利用无线传输方面的能力取决于可伸缩性和与机会路由相关的额外开销，以及有关无线信道统计信息，拓扑结构等方面的辅助信息的可用性。着眼于将无线传输的本质纳入路由策略所带来的性能提升，并设计了算法和解决方案以可扩展，实用且低成本的方式实现这些提升。该手稿首先概述了各种机会距离矢量算法，这些算法已被开发为结合无线传输和路由机会。此外，提出了最佳机会距离度量，其构造基于问题的动态编程特征。然后对照其他几种已知的路由算法的性能来检查最佳路由的性能。为了允许可扩展和分布式的解决方案，提供了该最佳距离度量的分布式计算。还通过仿真检查了最佳机会路由算法的分布式实现的性能。除了以集中式和分布式方式构建机会方案外，该手稿还讨论了如何将学习无线媒体有效地整合到路由算法的结构中。最后，该手稿检查了基于动态拥塞的距离度量及其相对于文献中其他拥塞感知解决方案的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号