PROJECT TITLE :

Cooperative Routing With Relay Assignment in Multiradio Multihop Wireless Networks

ABSTRACT:

Cooperative Communication (CC) for wireless networks has gained a heap of recent interests. It has been shown that CC has the potential to significantly increase the capability of wireless networks, with its ability of mitigating fading by exploiting spatial diversity. However, most of the works on CC are limited to single radio wireless network. To demonstrate the benefits of CC in multiradio multihop wireless network, this paper studies a joint problem of multiradio cooperative routing and relay assignment to maximise the minimum rate among a group of concurrent communication sessions. We have a tendency to first model this drawback as a mixed-integer programming (MIP) drawback and prove it to be NP-arduous. Then, we have a tendency to propose a centralized algorithm and a distributed algorithm to solve the problem. The centralized algorithm is intended among a branch-and-certain framework by using the relaxation of the formulated MIP, that can find a international -optimal answer. Our distributed algorithm includes 2 subalgorithms: a cooperative route choice subalgorithm and a fairness-aware route adjustment subalgorithm. Our simulation results demonstrate the effectiveness of the proposed algorithms and the many rate gains that may be achieved by incorporating CC in multiradio multihop networks.