Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
LSSP: A novel local segment-shared protection for multi-domain optical mesh networks
Computer Communications
Impact of Routing Metrics on Path Capacity in Multirate and Multihop Wireless Ad Hoc Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Optimal relay assignment for cooperative communications
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Cooperative Protocols Design for Wireless Ad-Hoc Networks with Multi-hop Routing
Mobile Networks and Applications
A QoS Routing for Maximum Bandwidth in Ad Hoc Networks
ICFN '10 Proceedings of the 2010 Second International Conference on Future Networks
Joint power allocation and relay selection for multiuser cooperative communication
IEEE Transactions on Wireless Communications
Available bandwidth in multirate and multihop wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Implementation and evaluation of cooperative communication schemes in software-defined radio testbed
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Transactions on Communications
Distributed energy-efficient cooperative routing in wireless networks
IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Bandwidth- and power-efficient routing in linear wireless networks
IEEE Transactions on Information Theory
Cooperative communication in wireless networks
IEEE Communications Magazine
CoopMAC: A Cooperative MAC for Wireless LANs
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Cooperative communication is a new physical technology, which has the potential to improve QoS support for multi-hop wireless network. Existing works did not consider the interference effect among links while designing cooperative QoS routing. To overcome this limitation, this paper targets at designing an interference-aware Cooperative QoS routing algorithm (CQ-routing) to satisfy users' bandwidth requirement. We formulate the problem of finding cooperative routing path with maximum available bandwidth as an optimization problem, called Coop-routing problem. We prove that the Coop-routing problem is strong NP-hard. We propose both centralized and distributed algorithm to solve the Coop-routing problem. We prove that the centralized algorithm can achieve a constant approximation ratio. We evaluate the performance of these algorithms through simulations. The results show that CQ-routing algorithms can significantly improve the network performance in terms of available bandwidth and number of admitted flows.