ID 原文 译文
3673 首先使用空间泊松点过程刻画多个潜在窃听者场景下的安全传输概率，然后构建两跳总安全传输概率约束下的时延及能耗最小化问题。 First, the Poisson point process was used to calculate the secure trans-mission probability for the scenario with multiple potential eavesdroppers. Then, a delay and energy minimization prob-lem was formulated under a constraint on the two-hop secure transmission probability.
3674 通过一维搜索结合线性规划，得到了最优压缩与解压方案。 The optimal compression and de-compression scheme was obtained using the one-dimensional search combined with linear programming.
3675 仿真结果表明，给定安全概率约束下私密信息速率小的链路在传输前需要进行文件压缩，反之不需要压缩，可直接传输。 Simulation re-sults show that the document compression is necessary for the link with small achievable secrecy rate under a given se-cure transmission probability; otherwise, the document should be directly transmitted without compression.
3676 针对蜂窝网、车联网等网络中用户的内容下载场景，提出了一种基于终端直通（D2D）多播通信的合作内容下载机制改善下载性能。 Aiming at the content downloading scenario in the network such as cellular network and vehicular network, acooperative content downloading scheme based on device-to-device multicast communications was proposed to improvethe content downloading performance.
3677 该机制充分利用内容请求者位置的邻近特性，将其分成不相交的簇。 Such a scheme took advantage of the proximity feature of the content requestersand groups them into disjoint clusters.
3678 簇内的内容请求者合作从基站处下载一份完整的内容，并轮流向簇内其他内容请求者共享所下载的内容。 Firstly, the base station delivered the entire content to a cluster, and each contentrequester in a cluster downloaded a proportion of the entire content. Then, the content requesters took turns sharing their downloaded content with other content requesters in the same cluster.
3679 这种下载方式下，内容共享额外消耗的资源由簇内内容请求者共同承担。 In this way, the additional resource consumption ofcontent sharing in a cluster was shared by the content requesters in the cluster together.
3680 在此过程中，提出了一种定价方法来激励内容请求者间的合作。 During this process, a pric-ing-based approach was proposed to motivate these content requesters to cooperate with each other.
3681 该方法仅需要基站维持一个内容下载的价格。 Such an approach only required the base station to maintain a content downloading price.
3682 基于此，为最小化内容请求者的下载代价，研究了用户分簇、链路调度和功率分配的联合优化问题。 Based on this, the joint issue of user clustering,link scheduling and power allocation was studied to minimize the total cost of content requesters.