Elements of information theory
Elements of information theory
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Delay aware link scheduling for multi-hop TDMA wireless networks
IEEE/ACM Transactions on Networking (TON)
Reduced-complexity spectrum-efficient routing in TDMA multihop wireless networks
ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
IEEE 802.16J relay-based wireless access networks: an overview
IEEE Wireless Communications
Joint power and bandwidth allocation in downlink transmission
IEEE Transactions on Wireless Communications
Distributed spectrum-efficient routing algorithms in wireless networks
IEEE Transactions on Wireless Communications - Part 2
Optimal spectrum-efficient routing in multihop wireless networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
The transport capacity of wireless networks over fading channels
IEEE Transactions on Information Theory
Spectrum sharing for unlicensed bands
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
This paper addresses the problem of finding the route with maximum end-to-end spectral efficiency, under the constraint of equal bandwidth sharing, in multihop wireless networks that use time division multiple access (TDMA) or frequency division multiple access (FDMA). The conceptual difficulty of this problem arises from the fact that the associated routing metric is neither isotonic nor monotone, and, thus, it cannot be solved directly using shortest path algorithms. The author has recently presented the first polynomial-time algorithm that solves the problem to exact optimality for TDMA networks. The contribution of this paper is twofold. For TDMA networks, we present a new algorithm that achieves a significant improvement in the computational complexity as compared to the algorithms previously known. For FDMA networks, we introduce the first polynomial-time algorithm that provides provably optimal routes. The proposed algorithms rely on the divide-and-conquer principle and a modified Bellman-Ford algorithm for widest path computation. Our computational results further illustrate the efficiency of the proposed approach.