🤖 AI Summary
To address bandwidth exhaustion and user capacity limitations in high-density mobile wireless networks for real-time streaming, this paper proposes ACIDE—a peer-to-peer (P2P)-assisted intra-cluster block-level distribution model. ACIDE dynamically groups users with shared content interests into *n*-node clusters; the base station transmits only one data block per cluster, while the remaining *n*−1 blocks are disseminated via intra-cluster P2P transfers. Its key contributions include: (1) a novel intra-cluster block-level task allocation mechanism, and (2) a bi-objective optimization framework jointly optimizing block size and user admission—formulating user-scale maximization as an NP-complete problem and devising an efficient greedy approximation algorithm. Theoretical analysis proves ACIDE minimizes the bandwidth required to sustain uninterrupted playback. Experimental evaluation demonstrates that, under identical base station uplink bandwidth constraints, ACIDE increases supported user count by up to 3.2× compared to baseline approaches.
📝 Abstract
In mobile wireless networks, livestreaming in high user density areas presents two typical challenges: the wireless bandwidth is depleted and the number of users is limited. In this study, a media distribution model utilizing peer to peer communications, Active Control in an Intelligent and Distributed Environment, is proposed for bandwidth efficient livestreaming. The basic idea is to group users with identical livestream interest in a cluster of n peers. Instead of sending n copies of a livestream package, only one copy is sent to the cluster. A package is divided into n blocks. Each user receives one block from the base station and the remaining n-1 blocks from the other peers. Two optimization problems are addressed. The first problem is minimizing the bandwidth needed to guarantee a continuous live media play on all peers. A solution is proposed to find the optimal block sizes such that the wireless bandwidth is minimized. The second problem is maximizing the number of peers admitted to a cluster, given a fixed wireless bandwidth. This problem is NP-complete and a greedy strategy is proposed to calculate a feasible solution for peer selection. The proposed model improves the bandwidth efficiency and allows more users to be served.