.png){kind=icon}
返回
Distributed Spectrum-Efficient Routing Algorithms in Wireless Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/T-WC.2008.070413.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper applies spectral efficiency as a performance measure for routing schemes and considers how to obtain a good route in a wireless network. The objective for this study is to combine different perspectives from networking and information theory in the design of routing schemes. The problem of finding the optimum route with the maximum spectral efficiency is difficult to solve in a distributed fashion. Motivated by an information-theoretic analysis, this paper proposes two suboptimal alternatives, namely, the approximately-ideal-path routing (AIPR) scheme and the distributed spectrum-efficient routing (DSER) scheme. AIPR finds a path to approximate an optimum regular path and requires location information. DSER is more amenable to distributed implementations based on the Bellman-Ford or Dijkstra's algorithms. The spectral efficiencies of AIPR and DSER for random networks approach that of nearest-neighbor routing in the low signal-to-noise ratio (SNR) regime and that of single-hop routing in the high SNR regime. In the moderate SNR regime, the spectral efficiency of DSER is up to twice that of nearest-neighbor or single-hop routing.
Keyword:
Capacity
routing
wireless networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
分享收藏
A mobility optimized SPRT based distributed security solution for replica node detection in mobile sensor networks移动传感器网络中基于移动优化SPRT的副本节点检测分布式安全解决方案
PREAI
分享收藏Algebra and algorithms for QoS path computation and hop-by-hop routing in the InternetInternet中QoS路径计算和逐跳路由的代数和算法
PREAI
分享收藏
查看更多内容