To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Incentive Scheduler Algorithm for Cooperation and Coverage Extension in Wireless Networks |
|
Author |
KARTHIKA K.P.R.C, T.M.THIYAGU |
| Citation |
Vol. 15 No. 1 pp. 58-61 |
|
Abstract |
The main purpose of the coverage extension area in wireless networks is to enhance the network connectivity without increasing the infrastructure. In wireless networks, this is one of the main applications in cooperative communications. So propose a new protocol based on an incentive approach and a scheduling algorithm to reward cooperative nodes. To increase the network connectivity, concentrate on the Quality of Service and energy consumption, which does not motivate some nodes to cooperate. In the existing system, use some of the algorithms such as Classical round robin, maximum signal-to-noise ratio (MaxSNR) and weighted fair opportunistic (WFO). But in these approaches there is no interest for a mobile to cooperate, increase in its mean packet delay, but reduces its potential throughput particularly in an overloaded context. So, introduce a new technique called coverage extension based on incentive scheduling (CEI). The scheduler, which is located in the central node such as the AP or the CH node, grants RUs to each mobile as a function of its channel state, its current cooperation ratio, its network confidence percentage, and its traffic backlog. In this method, significant priority is given to mobiles that help the network provide a low packet delay and a high personal throughput. |
|
Keywords |
Wireless Network,Incentive Scheduler |
|
URL |
