Diversity routing for multi-hop wireless networks with cooperative transmissions
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Fast flooding using cooperative transmissions in wireless networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Energy efficient cooperative broadcasting in wireless networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
MWS'09 Proceedings of the 2009 IEEE conference on Mobile WiMAX
Randomized parity forwarding in large-scale cooperative broadcast network
IEEE Transactions on Communications
Multi-layer cooperative transmission protocol with VMISO and power control in ad hoc networks
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Cooperative bridges: topology control in cooperative wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Packet error probability of a transmit beamforming system with imperfect feedback
IEEE Transactions on Signal Processing
Repetition-based cooperative broadcasting for vehicular ad-hoc networks
Computer Communications
Energy-balanced cooperative routing in multihop wireless networks
Wireless Networks
Hi-index | 0.08 |
Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperative diversity have been extensive, higher layer protocols which translate the achievable reduction in the SNR per bit for a given target BER, into system wide performance enhancements are yet to mature. The challenge is that appropriate higher layer functions are needed in order to enable cooperative diversity at the physical layer. We focus on network-wide broadcasting with the use of cooperative diversity in ad hoc networks. We design a novel distributed network-wide broadcasting protocol that takes into account the physical layer dependencies that arise with cooperative diversity. We perform extensive simulations that show that our protocol can outperform the best of the noncooperative broadcasting protocols by: (a) achieving up to a threefold increase in network coverage and, (b) by decreasing the latency incurred during the broadcast by about 50%. We also construct an analytical model that captures the behavior of our protocol. Furthermore, we show that computing the optimal solution to the cooperative broadcast problem is NP-complete and construct centralized approximation algorithms. Specifically, we construct an O(N epsi)-approximation algorithm with a computational complexity of O(N4/epsi); we also construct a simpler greedy algorithm.. The costs incurred with these algorithms serve as benchmarks with which one can compare that achieved by any distributed protocol