Incentive scheduler algorithm for cooperation and coverage extension in wireless NetworksReportar como inadecuado

Incentive scheduler algorithm for cooperation and coverage extension in wireless Networks - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 ATNET - Advanced Technolgy in Networking IRISA-D2 - RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES 2 PASNET LIA - Laboratoire Informatique d-Avignon 3 Qatar University

Abstract : In this paper, we focus on the wireless coverage extension and nodes- cooperation. We propose a new protocol based on an incentive approach and a scheduling algorithm in order to reward cooperative nodes. The cost of cooperation can be prohibitively expensive in terms of QoS and energy consumption which does not motivate some nodes to cooperate. Therefore, we introduce a percentage of cooperation and QoS parameters in the scheduling algorithm called CEI in order to incite potential mobile relaying nodes to cooperate and in turn extend the wireless areas. We use the cross-layer approach in order to optimize the QoS parameters. The proposed solution does not only incite the nodes to cooperate but also enhance the QoS by increasing the average throughput and decreasing the delay. The simulation results show that the proposed solution does not only give better results than the well known scheduling algorithms like MaxSNR and WFO but also allows the cooperative mobile nodes to increase their own throughput by around 114%. The total amount of data transmitted out of the cell in order to extend the coverage can be increased by around 59% compared to the scheduling algorithm MaxSNR.

Keywords : Coverage extension Cooperation Incentive Scheduling Quality of Service Multipath fading

Autor: Cédric Gueguen - Abderrezak Rachedi - Mohsen Guizani -



Documentos relacionados