Non-Cooperative MDS Coding Game In CSMA Wireless Networks

TL;DR

This paper introduces a game-theoretic model to optimize erasure coding in CSMA wireless networks, balancing redundancy and access conflicts to improve throughput and reduce delays.

Contribution

It presents a novel game-based approach to manage erasure coding and user behavior, achieving network equilibrium for enhanced performance.

Findings

Reduced collision rates at equilibrium

Decreased transmission delays

Increased network throughput

Abstract

Maximum distance separable erasure coding has been introduced in wireless networks based on random medium access protocols in order to recover collided and erased packets. So, this help to avoid retransmission process which weaken the network throughput and prolong the overall propagation delay. However, erasure coding may degrade the network performances by causing overload traffic due to added redundancy (parity) and also when extending the propagation delay due to additional calculations and encoding/decoding process time which can lead quickly the network into saturation. Here, the redundancy should be applied properly. In addition, multiple access make conflicting situations due to simultaneous access and selfish behaviour of users which affect too the network performances. For this purpose, we present a game model based on the use of game theory to analyse and manage multiple users that assuming random access protocol and erasure coding algorithm. Our model is used to operate the network at equilibrium by selecting a suitable type of erasure coding. Making the network work at equilibrium, leads to decrease collisions, decrease also the overall transmission delay and as well as increasing the throughput.