Development of bandwidth allocation scheme in wireless communication networks using the Shapley game theory

Bandwidth allocation in wireless networks is a critical aspect of resource management that directly impacts network performance. Existing methods, such as the minimum-maximum bandwidth allocation, fail in dynamic environments, leading to inefficiency and unequal bandwidth distribution. Hence, this research developed a bandwidth allocation scheme for wireless communication networks using the Shapley Game Theory (SGT). Users (nodes) request cache space and bandwidth based on their needs, treated as claimants in a system with limited bandwidth. When demand exceeds supply, the Shapley value allocates bandwidth fairly based on individual contributions. Network slicing was used to create virtual networks, each dedicated to specific services and allocated bandwidthusing the bankruptcy model, guided by Quality of Service parameters like delay, throughput, and reliability. Cache memory was allocated from the kernel to reduce latency. The developed model was simulated using MATLAB R2023a, while the correlation visualisation was done with the aid of the MATLAB Scatter Tool. Validation of the developed technique was done by comparing it with an existing method, the minimum-maximum bandwidth allocation method. The developed Shapley allocation method gave a bandwidth allocation fairness of 99.7% against the minimum-maximum allocation method with 77%, while the corresponding values for QoS were 0.000315 and 0.075479, respectivel