Data networks (2nd ed.)
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Wireless Communications
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
Bandwidth- and power-efficient routing in linear wireless networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Routing strategies in multihop cooperative networks
IEEE Transactions on Wireless Communications
Distributed and power efficient routing in wireless cooperative networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Fixed relaying versus selective relaying in multi-hop diversity transmission systems
IEEE Transactions on Communications
Optimal power allocation for relayed transmissions over Rayleigh-fading channels
IEEE Transactions on Wireless Communications
Cross-layer optimization frameworks for multihop wireless networks using cooperative diversity
IEEE Transactions on Wireless Communications
Reliability and route diversity in wireless networks
IEEE Transactions on Wireless Communications - Part 1
Distributed spectrum-efficient routing algorithms in wireless networks
IEEE Transactions on Wireless Communications - Part 2
The capacity of wireless networks
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Cooperative communication in wireless networks
IEEE Communications Magazine
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
Employing channel state information at the network layer, efficient routing protocols for equal-power and optimal-power allocation in a multihop network in fading are proposed. The end-to-end outage probability from source to destination is used as the optimization criterion. The problem of finding the optimal route is investigated under either known mean channel state information (CSI) or known instantaneous CSI. The analysis shows that the proposed routing strategy achieves full diversity order, equal to the total number of nodes in the network excluding the destination, only when instantaneous CSI is known and used. The optimal routing algorithm requires a centralized exhaustive search which leads to an exponential complexity, which is infeasible for large networks. An algorithm of polynomial complexity for a centralized environment is developed by reducing the search space. A distributed approach based on the Bellman-Ford routing algorithm is proposed which achieves a good implementation complexity-performance trade-off.