Social networks are playing an increasingly important role in information dissemination in wireless ad hoc networks with the wide adoption of the mobile Internet. In particular, in social application scenarios such as Facebook and Twitter, the questions of how to fully consider the social relationships between users to ensure the quality of service (QoS) urgently needs to be explored. This paper investigates an optimal social relay selection scheme with high intimacy requirements to maximize the system throughput for social-physical ad hoc networks with device-to-device (D2D) communication. Different from previous studies, we jointly consider feasible relays and multiuser cooperative mobility with satisfactory link reliability for throughput maximization. On the one hand, we formulate a nonlinear and nonconvex problem, which is typically NP-hard, for throughput optimization. Specifically, this optimization problem is divided into two subproblems: i) selecting the optimal relays and ii) determining the best mobility strategy in terms of throughput. On the other hand, we first convert the relay selection subproblem into an optimal stopping phase problem, and then propose a definition of a graph representing the degrees of interference between physical links, transforming the original optimization problem into a convex problem that is solvable using the Lagrange multiplier method. Based on the above, we propose the Relay selection and Link Interference Degree Graph (RS-LIDG) algorithm to solve the two subproblems. Numerical simulations verify that the proposed RS-LIDG method improves the throughput gain by 26.29%, 123.43%, and 236.47% compared to the intuitive method (IM), the social-trust-based random mobility selection method (STS-RM), and the physical-based random mobility selection method (PHS-RM), respectively.

中文翻译：

---

基于社交物理自组织网络中多用户协作移动性的有效协作以最大化吞吐量


随着移动互联网的广泛应用，社交网络在无线自组织网络的信息传播中发挥着越来越重要的作用。尤其是在Facebook、Twitter等社交应用场景中，如何充分考虑用户之间的社交关系以保证服务质量（QoS）的问题亟待探索。本文研究了一种具有高亲密性要求的最佳社交中继选择方案，以最大化具有设备到设备（D2D）通信的社交物理自组织网络的系统吞吐量。与以前的研究不同，我们共同考虑可行的中继和多用户协作移动性以及令人满意的链路可靠性以实现吞吐量最大化。一方面，我们制定了一个非线性和非凸问题，通常是 NP 难问题，用于吞吐量优化。具体来说，该优化问题分为两个子问题：i）选择最佳中继；ii）确定吞吐量方面的最佳移动策略。另一方面，我们首先将中继选择子问题转化为最优停止阶段问题，然后提出表示物理链路之间干扰程度的图的定义，将原始优化问题转化为可使用以下公式求解的凸问题：拉格朗日乘子法。基于此，我们提出了中继选择和链路干扰度图（RS-LIDG）算法来解决这两个子问题。数值模拟验证了所提出的RS-LIDG方法将吞吐量增益提高了26.29%、123.43%和236。与直观方法（IM）、基于社会信任的随机移动选择方法（STS-RM）和基于物理的随机移动选择方法（PHS-RM）分别相比，提高了 47%。