Channel assignment algorithm to improve relaying nodes fairness in WCDMA multihop cellular networks

It is emerging to deploy multihop cellular networks (MCNs) for increasing cell capacity and to provide large coverage to mobile users without increasing infrastructure cost. It very much decreases the dead-spot and hot-spot problems with rapidly growing mobile users in cellular networks. However, channel assignment is the most important concern in these networks. Quite a few recent proposals has been given attention to channel assignment troubles like channel conflicts, mobility, delay, relaying points, fairness of relaying node and etc. However, relaying nodes are playing major role in MCNs and it is relaying packets of other nodes and for this it sacrifices its own resources for others nodes survival. The fairness of the relaying nodes during the channel assignment needs to consider for an effective channel assignment in MCNs. This research work, we propose a channel assignment algorithm, which improves relaying nodes fairness in a TDD (Time Division Duplex) W-CDMA (Wideband Code Division Multiple Access) MCNs. Our simulation results prove that increased relaying nodes fairness, which is resulted in improved quality of service and increased throughput in MCNs.