.png){kind=icon}
.png){kind=icon}
Return
Distributed Spectrum-Efficient Routing Algorithms in Wireless Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/T-WC.2008.070413.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Capacity
routing
wireless networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W