TY - GEN
T1 - Maintaining social connections through direct link placement in wireless networks
AU - Qiu, Li
AU - Ma, Liang
AU - Cao, Guohong
N1 - Funding Information:
This work was supported in part by Network Science CTA under grant W911NF-09-2-0053.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/7
Y1 - 2019/7
N2 - Mobile Social Network (MSN), built on inter-connected mobile devices, enables the flexibility of information exchanges of individuals within a virtual community. MSN may be self-organized and/or infrastructure-less, and the communication links may frequently fluctuate. When link qualities degrade, it remains critical to maintain the connections of important social pairs when supporting all social pairs is impossible. To achieve this goal, we propose to proactively place some reliable links (e.g., satellite links or UAV links) into the underlying communication network, so as to improve the service quality of the important social pairs, referred to as the Maintaining Social Connections (MSC) problem. We formulate the MSC problem and prove it is NP-hard. As such, we first study a special case of MSC, which is submodular and solvable with high approximation-ratio. Since the general MSC problem is not submodular, we propose an efficient approximation algorithm. Specially, by carefully choosing two submodular functions to lower/upper bound the MSC problem, we are able to prove the high approximation ratio of the proposed algorithm using these selected submodular functions. We further develop evolutionary algorithms to iteratively adjust the link placement via different exploration strategies, which also yield guaranteed approximation-ratio. Extensive evaluations based on both synthetic and real-world social network traces demonstrate the effectiveness of our proposed algorithms.
AB - Mobile Social Network (MSN), built on inter-connected mobile devices, enables the flexibility of information exchanges of individuals within a virtual community. MSN may be self-organized and/or infrastructure-less, and the communication links may frequently fluctuate. When link qualities degrade, it remains critical to maintain the connections of important social pairs when supporting all social pairs is impossible. To achieve this goal, we propose to proactively place some reliable links (e.g., satellite links or UAV links) into the underlying communication network, so as to improve the service quality of the important social pairs, referred to as the Maintaining Social Connections (MSC) problem. We formulate the MSC problem and prove it is NP-hard. As such, we first study a special case of MSC, which is submodular and solvable with high approximation-ratio. Since the general MSC problem is not submodular, we propose an efficient approximation algorithm. Specially, by carefully choosing two submodular functions to lower/upper bound the MSC problem, we are able to prove the high approximation ratio of the proposed algorithm using these selected submodular functions. We further develop evolutionary algorithms to iteratively adjust the link placement via different exploration strategies, which also yield guaranteed approximation-ratio. Extensive evaluations based on both synthetic and real-world social network traces demonstrate the effectiveness of our proposed algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85074864354&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85074864354&partnerID=8YFLogxK
U2 - 10.1109/ICDCS.2019.00052
DO - 10.1109/ICDCS.2019.00052
M3 - Conference contribution
AN - SCOPUS:85074864354
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 453
EP - 463
BT - Proceedings - 2019 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019
Y2 - 7 July 2019 through 9 July 2019
ER -