Distributed spectrum-efficient routing algorithms in wireless networks
- 22 December 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 7 (12), 5297-5305
- https://doi.org/10.1109/t-wc.2008.070413
Abstract
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 approximatelyideal- path routing (AIPR) scheme and the distributed spectrumefficient 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
This publication has 24 references indexed in Scilit:
- Non-Ergodic Power-Bandwidth Tradeoff in Linear Multi-hop NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Routing in ad hoc networks: a case for long hopsIEEE Communications Magazine, 2005
- Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage BehaviorIEEE Transactions on Information Theory, 2004
- The impact of power amplifier characteristics on routing in random wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- A Network Information Theory for Wireless Communication: Scaling Laws and Optimal OperationIEEE Transactions on Information Theory, 2004
- Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channelsIEEE Transactions on Information Theory, 2003
- Algebra and algorithms for QoS path computation and hop-by-hop routing in the InternetIEEE/ACM Transactions on Networking, 2002
- Elements of Information TheoryPublished by Wiley ,2001
- Link scheduling in polynomial timeIEEE Transactions on Information Theory, 1988
- The capacity of digital links in tandemIEEE Transactions on Information Theory, 1984