Distributed routing schemes for multi-hop fixed relay networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Power savings from half-duplex relaying in downlink cellular systems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A geometric approach to improve spectrum efficiency for cognitive relay networks
IEEE Transactions on Wireless Communications
Distributed routing schemes with accessibility consideration in multi-hop wireless networks
IEEE Transactions on Wireless Communications
Cross-layer design for multihop wireless relaying networks
IEEE Transactions on Wireless Communications
On optimal spectrum-efficient routing in TDMA and FDMA multihop wireless networks
Computer Communications
Hi-index | 0.00 |
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.