Incentive Scheduler Algorithm for Cooperation and Coverage Extension in Wireless Networks

Cédric Gueguen, Abderrezak Rachedi, Mohsen GuizaniIEEE Trans. Vehicular Technology 2013 · DOI

TL;DR

This paper introduces a novel "Coverage Extension based on Incentive scheduling" (CEI) algorithm designed to encourage cooperation among mobile nodes in wireless networks. By rewarding cooperative behavior through prioritized resource allocation and improved Quality of Service (QoS), CEI effectively extends network coverage while simultaneously enhancing throughput and reducing delay for all users, even in overloaded scenarios.

What Problem Does This Paper Address?

Wireless networks, particularly in scenarios aiming for coverage extension, face a significant challenge with "selfish nodes." These nodes, while capable of relaying data for others to expand the network's reach, often prioritize their own Quality of Service (QoS) and energy efficiency. This self-interested behavior means they are reluctant to expend their resources (bandwidth, energy) to help others, thus hindering efforts to extend network coverage beyond the primary access point's range. Existing solutions often assume cooperation or rely on complex economic models that are difficult to implement. This paper addresses the need for a practical incentive mechanism integrated into existing network infrastructure to motivate cooperation and achieve broader coverage.

Methods

The core of this paper is the proposed Coverage Extension based on Incentive scheduling (CEI) algorithm. CEI is a cross-layer scheduling algorithm that operates at the Access Point (AP) or cluster head. It enhances traditional opportunistic scheduling (like MaxSNR and WFO) by incorporating an "Incentive Parameter" (IPk) and a "Confidence Parameter" (Tk).

  • Opportunistic Scheduling Foundation: CEI builds upon the principle of allocating resources (Resource Units - RUs) based on channel conditions (e.g., signal-to-noise ratio) to maximize system throughput.
  • Incentive Parameter (IPk): This parameter directly rewards cooperative nodes. It's calculated based on the mobile node's cooperation ratio (Ck), which quantifies how much data it relays for others relative to its own consumption. A higher cooperation ratio leads to a higher IPk.
  • Confidence Parameter (Tk): To prevent malicious nodes from falsely claiming cooperation, a confidence parameter is introduced. This parameter is monitored by the AP and reflects the actual observed forwarding behavior against the reported cooperation ratio. It acts as a deterrent against cheating.
  • CEI Algorithm: The final priority for a mobile node (CEIk,n) is a product of its channel state-dependent capacity (mk,n), its incentive parameter (IPk), and its confidence parameter (Tk). This weighted approach ensures that cooperative nodes receive higher priority for resource allocation, leading to better QoS and throughput.

Datasets

Not discussed in the paper. The evaluation is based on simulations using OPNET.

Key Insights and Ideas

  • Cooperation as a Rewarded Behavior: The fundamental insight is that instead of penalizing nodes for not cooperating, the system should actively reward those that do. This shifts the incentive structure from "don't be selfish" to "be helpful and get rewarded."
  • Integrated Incentive and Scheduling: The paper demonstrates that integrating incentive mechanisms directly into the scheduling algorithm is a practical and effective way to encourage cooperation without requiring entirely new network architectures.
  • Balancing Throughput and Fairness: CEI aims to achieve both high system throughput (through opportunistic scheduling) and fairness by prioritizing cooperative nodes, ensuring they don't suffer performance degradation for their efforts.
  • Mitigating Malicious Behavior: The inclusion of a confidence parameter is crucial for the robustness of the incentive system, preventing nodes from exploiting the reward mechanism.

Key Results

  • Improved Delay and Throughput: CEI significantly reduces mean packet delay and increases mean throughput, especially for cooperative nodes, compared to RR, MaxSNR, and WFO. For nodes with 100% cooperation, delay is substantially lower, and throughput can be up to 114% higher than MaxSNR in overloaded scenarios.
  • Enhanced Coverage Extension: The incentive mechanism directly leads to increased data transmission out of the cell (relay efficiency), with CEI achieving a 59% increase compared to MaxSNR and 129% compared to RR.
  • Fairness for Cooperative Nodes: Unlike MaxSNR and RR, CEI ensures that cooperative nodes are not penalized and can even experience better QoS than selfish nodes. WFO offers fairness but doesn't actively reward cooperation.
  • Robustness: The confidence parameter helps in handling potential misbehavior from nodes.

Limitations and Future Work

  • Limitations:
    • The paper assumes perfect time and frequency synchronization between mobiles and the AP.
  • The simulation setup relies on specific traffic models (MPEG-4 video, AMR voice) and channel conditions (flat fading, Rayleigh distribution).
  • The confidence parameter's effectiveness relies on accurate monitoring by the AP.
  • Future Work:
    • The authors propose introducing services' differentiation into the CEI algorithm. This could involve prioritizing different types of traffic or users based on their needs and cooperation levels.

Summary updated

BibTeX
@article{gueguen2013incentive,
  author = {Cédric Gueguen and Abderrezak Rachedi and Mohsen Guizani},
  title = {{Incentive Scheduler Algorithm for Cooperation and Coverage Extension in Wireless Networks}},
  journal = {IEEE Trans. Vehicular Technology},
  year = {2013},
  doi = {10.1109/tvt.2012.2225855},
}
Figure