In this study, the Active Control in an Intelligent and Distributed Environment (ACIDE) media distribution model solution and algorithms are proposed for livestreaming in capacity efficient mobile wireless networks. The elements of the ACIDE model are a base station and a cluster formed by a number of peers able to establish peer to peer communications. The cluster peers are selected from a group of users interested in livestreaming the same media. The ACIDE model solution minimizes the bandwidth allocated to a cluster of n peers such that an uninterrupted media play for all peers is guaranteed. The livestream media is sent to the peers in packages and every media package is divided into n blocks. The blocks are distributed to the n peers of a cluster in two phases, such that the base station bandwidth is utilized during first phase only. The allocated bandwidth, the amount of bandwidth the base station has to allocate to a cluster, is minimized and its lower bound is equal to the bandwidth required for multicasting. In this study, the ACIDE model is used to address the problem of how to find the maximum number of peers n, chosen from a group of N users, that can be admitted to a cluster knowing the given allocated bandwidth, the amount of bandwidth that a base station allocates to a cluster in advance, prior to admitting users. When users become peers of an ACIDE cluster, the network capacity, the total number of users who are able to access live media, increases meaning that network resources are used more efficiently. The problem of finding the maximum number of peers n is addressed as an optimization problem, with the objective of having the entire given allocated bandwidth used by the peers admitted to the cluster. This problem is NP-complete and a non-optimal solution is proposed for peers selection such that all admitted peers play media continuously.

翻译：在本研究中，提出了面向容量高效移动无线网络的智能分布式环境主动控制（ACIDE）媒体分发模型解决方案与算法。ACIDE模型要素包括基站和由多个能建立点对点通信的对等节点构成的集群。集群中的对等节点选自对直播同一媒体感兴趣的用户群体。该ACIDE模型方案最小化分配给n个对等节点集群的带宽，同时保证所有对等节点实现无中断媒体播放。直播媒体以数据包形式发送给对等节点，每个媒体包被划分为n个数据块。数据块分两阶段分发至集群的n个对等节点，使得基站带宽仅在第一阶段被使用。分配的带宽（基站需分配给集群的带宽量）被最小化，其下界等于组播所需带宽。本研究利用ACIDE模型解决如下问题：在已知给定分配带宽（即基站预先分配给集群的带宽量）的前提下，如何从N个用户群体中选出最大数量的对等节点n并接纳至集群。当用户成为ACIDE集群的对等节点时，网络容量（能访问直播媒体的用户总数）得以提升，意味着网络资源利用效率更高。寻找最大对等节点数n的问题被转化为优化问题，其目标为使所有被接纳对等节点充分使用给定分配带宽。该问题为NP完全问题，本文提出一种非最优的对等节点选择方案，确保所有被接纳对等节点能连续播放媒体。