Elements of information theory
Elements of information theory
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Introduction to Linear Optimization
Introduction to Linear Optimization
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Towards an information theory of large networks: an achievable rate region
IEEE Transactions on Information Theory
An achievable rate for the multiple-level relay channel
IEEE Transactions on Information Theory
Capacity of a class of relay channels with orthogonal components
IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Myopic Coding in Multiterminal Networks
IEEE Transactions on Information Theory
Optimal schedules for the D-node half duplex phase fading MRC
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
| Hi-index | 0.00 |
Half duplex devices are widely used in today's wireless networks. These devices can only send or receive, but not do both at the same time. In this paper, we use cooperative decode-forward relay strategies to increase the throughput of half-duplex wireless networks. Due to the half duplex constraint, relays need to carefully choose their transmission states in order to maximize the throughput. We show that the transmission schedule optimization can be formulated as a linear programming problem. Although the number of possible states grows exponentially as the number of relays increases, only a small subset of these states needs to be used in the optimal transmission schedule. This observation allows us to use heuristic algorithms to solve for near-optimal schedule in large networks. Our numerical results show that the decode-forward strategy can provide nearly 3 times more throughput than the traditional multi-hop relaying strategy in half duplex wireless networks.