• Previous Article
    An effective hybrid firefly algorithm with the cuckoo search for engineering optimization problems
  • MFC Home
  • This Issue
  • Next Article
    Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate
November  2018, 1(4): 369-382. doi: 10.3934/mfc.2018018

Relay selection based on social relationship prediction and information leakage reduction for mobile social networks

1. 

School of Computer Science and Engineering, Changshu Institute of Technology, Changshu, China

2. 

Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou, China

3. 

The School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China

4. 

Computer Science, The George Washington University, Washington DC, USA

* Corresponding author: Gaofei Sun

Received  July 2018 Revised  August 2018 Published  December 2018

Fund Project: The first author is supported by National Natural Science Foundation of China (61602062) and the Natural Science Foundation of Jiangsu Province (BK20160410)

Despite the extensive study on relay selection in mobile social networks (MSNs), few work has taken both transmission latency (i.e. efficiency) and information leakage probability (i.e. security) into consideration. Therefore we target on designing an efficient and secure relay selection algorithm to enable communication among legitimate users while reducing the information leakage probability to other users. In this paper, we propose a novel mobility model for MSN users considering both the randomness and the sociality of the movements, based on which the social relationship among users, i.e. the meeting probabilities among the users, are predicted. Taken both efficiency and security into consideration, we design a network formation game based relay selection algorithm by defining the payoff functions of the users, designing the game evolving rules, and proving the stability of the formed network structure. Extensive simulation is conducted to validate the performance of the relay selection algorithm by using both synthetic trace and real-world trace. The results show that our algorithm outperforms other algorithms by trading a balance between efficiency and security.

Citation: Xiaoshuang Xing, Gaofei Sun, Yong Jin, Wenyi Tang, Xiuzhen Cheng. Relay selection based on social relationship prediction and information leakage reduction for mobile social networks. Mathematical Foundations of Computing, 2018, 1 (4) : 369-382. doi: 10.3934/mfc.2018018
References:
[1]

J. A. Bazerque and G. B. Giannakis, Distributed spectrum sensing for cognitive radio networks by exploiting sparsity, IEEE Transactions on Signal Processing, 58 (2010), 1847-1862. doi: 10.1109/TSP.2009.2038417. Google Scholar

[2]

Z. CaiZ. HeX. Guan and Y. Li, Collective data-sanitization for preventing sensitive information inference attacks in social networks, IEEE Transactions on Dependable and Secure Computing, 15 (2018), 577-590. doi: 10.1109/TDSC.2016.2613521. Google Scholar

[3]

Z. Cai and X. Zheng, A private and efficient mechanism for data uploading in smart cyber-physical systems, IEEE Transactions on Network Science and Engineering.Google Scholar

[4]

W. ChengD. WuX. Cheng and D. Chen, Routing for information leakage reduction in multi-channel multi-hop ad-hoc social networks, Lecture Notes in Computer Science, 7405 (2012), 31-42. Google Scholar

[5]

R. Ciobanu, C. Dobre and V. Cristea, Sprint: Social prediction-based opportunistic routing, in IEEE WoWMoM, 2013, 1–7. doi: 10.1109/WoWMoM.2013.6583442. Google Scholar

[6]

V. Erramilli, M. Crovella, A. Chaintreau and C. Diot, Delegation forwarding, in Proc. MobiHoc, 2008, 251–260. doi: 10.1145/1374618.1374653. Google Scholar

[7]

Z. HeZ. Cai and J. Yu, Latent-data privacy preserving with customized data utility for social network data, IEEE Transactions on Vehicular Technology, 67 (2018), 665-673. Google Scholar

[8]

Z. HeZ. CaiJ. YuX. WangY. Sun and Y. Li, Cost-efficient strategies for restraining rumor spreading in mobile social networks, IEEE Transactions on Vehicular Technology, 66 (2017), 2789-2800. doi: 10.1109/TVT.2016.2585591. Google Scholar

[9]

M. O. Jackson, A survey of models of network formation: Stability and efficiency, Cambridge University Press, (2010), 11–57. doi: 10.1017/CBO9780511614385.002. Google Scholar

[10]

T. JingJ. ZhouH. Liu and Z. Zhang, Soroute: a reliable and effective social-based routing in cognitive radio ad hoc networks, EURASIP Journal on Wireless Communications and Networking, 2014 (2014), 200-214. doi: 10.1186/1687-1499-2014-200. Google Scholar

[11]

S. K. KimJ. H. YoonJ. Y. LeeG. Y. Jang and S. B. Yang, A cooperative forwarding scheme for social preference-based selfishness in mobile social networks, Wireless Networks, 22 (2016), 537-552. doi: 10.1007/s11276-015-0984-2. Google Scholar

[12]

W. Li, X. Cheng, T. Jing and X. Xing, Cooperative multi-hop relaying via network formation games in cognitive radio networks, in IEEE INFOCOM, 2013, 971–979. doi: 10.1109/INFCOM.2013.6566886. Google Scholar

[13]

Y. Liang, Z. Cai, Q. Han and Y. Li, Location privacy leakage through sensory data, Security and Communication Networks, 2017 (2017), Article ID 7576307, 12 pages. doi: 10.1155/2017/7576307. Google Scholar

[14]

J. LuZ. CaiX. WangL. ZhangP. Li and Z. He, User social activity-based routing for cognitive radio networks, Personal and Ubiquitous Computing, 22 (2018), 471-487. doi: 10.1007/s00779-018-1114-9. Google Scholar

[15]

W. Moreira, P. Mendes and S. Sargento, Opportunistic routing based on daily routines, in IEEE WoWMoM, 2012, 1–6. doi: 10.1109/WoWMoM.2012.6263749. Google Scholar

[16]

L. Muchnik, S. Pei, L. C. Parra, S. D. S. Reis, J. S. Andrade Jr., S. Havlin and H. A. Makse, Origins of power-law degree distribution in the heterogeneity of human activity in social networks, Scientific Reports, 3.Google Scholar

[17]

I. Parris and F. Ben Abdesslem, Crawdad trace/social network analysis/st_andrews/locshare/2010/sta1, Downloaded from http://crawdad.org//download/st_andrews/locshare/locshare-StA1.tar.gz, Nov. 2010.Google Scholar

[18]

T. SpyropoulosK. Psounis and C. Raghavendra, Efficient routing in intermittently connected mobile networks: The multiple-copy case, IEEE/ACM Transactions on Networking, 16 (2008), 77-90. doi: 10.1109/TNET.2007.897964. Google Scholar

[19]

A. Vahdat and D. Becker, Epidemic Routing for Partially-Connected ad Hoc Networks, Technical report, Duke University, 2000.Google Scholar

[20]

J. Wang, Z. Cai, Y. Li, D. Yang, J. Li and H. Gao, Protecting query privacy with differentially private k-anonymity in location-based services, Personal and Ubiquitous Computing, 1–17.Google Scholar

[21]

S. Wang, M. Liu, X. Cheng, Z. Li, J. Huang and B. Chen, Hero-a home based routing in pocket switched networks, in Proc. Wireless Algorithms, Systems, and Applications, 2012, 20–30. doi: 10.1007/978-3-642-31869-6_2. Google Scholar

[22]

J. Wu and Y. Wang, Social feature-based multi-path routing in delay tolerant networks, in Proc. IEEE INFOCOM, 2012, 1368–1376.Google Scholar

[23]

J. Wu, M. Xiao and L. Huang, Homing spread: Community home-based multi-copy routing in mobile social networks, in Proc. IEEE INFOCOM, 2013, 2319–2327.Google Scholar

[24]

X. XingT. JingW. ZhouX. ChengY. Huo and H. Liu, Routing in user-centric networks, IEEE Communications Magazine, 52 (2014), 44-51. Google Scholar

[25]

X. Zheng, Z. Cai, J. Li and H. Gao, Location-privacy-aware review publication mechanism for local business service systems, in IEEE INFOCOM, 2017. doi: 10.1109/INFOCOM.2017.8056976. Google Scholar

[26]

X. Zheng, Z. Cai and Y. Li, Data linkage in smart iot systems: A consideration from privacy perspective, IEEE Communications Magazine.Google Scholar

[27]

X. ZhengZ. CaiJ. YuC. Wang and Y. Li, Follow but no track: Privacy preserved profile publishing in cyber-physical social systems, IEEE Internet of Things Journal, 4 (2017), 1868-1878. Google Scholar

[28]

X. Zheng, G. Luo and Z. Cai, A fair mechanism for private data publication in online social networks, IEEE Transactions on Network Science and Engineering.Google Scholar

show all references

References:
[1]

J. A. Bazerque and G. B. Giannakis, Distributed spectrum sensing for cognitive radio networks by exploiting sparsity, IEEE Transactions on Signal Processing, 58 (2010), 1847-1862. doi: 10.1109/TSP.2009.2038417. Google Scholar

[2]

Z. CaiZ. HeX. Guan and Y. Li, Collective data-sanitization for preventing sensitive information inference attacks in social networks, IEEE Transactions on Dependable and Secure Computing, 15 (2018), 577-590. doi: 10.1109/TDSC.2016.2613521. Google Scholar

[3]

Z. Cai and X. Zheng, A private and efficient mechanism for data uploading in smart cyber-physical systems, IEEE Transactions on Network Science and Engineering.Google Scholar

[4]

W. ChengD. WuX. Cheng and D. Chen, Routing for information leakage reduction in multi-channel multi-hop ad-hoc social networks, Lecture Notes in Computer Science, 7405 (2012), 31-42. Google Scholar

[5]

R. Ciobanu, C. Dobre and V. Cristea, Sprint: Social prediction-based opportunistic routing, in IEEE WoWMoM, 2013, 1–7. doi: 10.1109/WoWMoM.2013.6583442. Google Scholar

[6]

V. Erramilli, M. Crovella, A. Chaintreau and C. Diot, Delegation forwarding, in Proc. MobiHoc, 2008, 251–260. doi: 10.1145/1374618.1374653. Google Scholar

[7]

Z. HeZ. Cai and J. Yu, Latent-data privacy preserving with customized data utility for social network data, IEEE Transactions on Vehicular Technology, 67 (2018), 665-673. Google Scholar

[8]

Z. HeZ. CaiJ. YuX. WangY. Sun and Y. Li, Cost-efficient strategies for restraining rumor spreading in mobile social networks, IEEE Transactions on Vehicular Technology, 66 (2017), 2789-2800. doi: 10.1109/TVT.2016.2585591. Google Scholar

[9]

M. O. Jackson, A survey of models of network formation: Stability and efficiency, Cambridge University Press, (2010), 11–57. doi: 10.1017/CBO9780511614385.002. Google Scholar

[10]

T. JingJ. ZhouH. Liu and Z. Zhang, Soroute: a reliable and effective social-based routing in cognitive radio ad hoc networks, EURASIP Journal on Wireless Communications and Networking, 2014 (2014), 200-214. doi: 10.1186/1687-1499-2014-200. Google Scholar

[11]

S. K. KimJ. H. YoonJ. Y. LeeG. Y. Jang and S. B. Yang, A cooperative forwarding scheme for social preference-based selfishness in mobile social networks, Wireless Networks, 22 (2016), 537-552. doi: 10.1007/s11276-015-0984-2. Google Scholar

[12]

W. Li, X. Cheng, T. Jing and X. Xing, Cooperative multi-hop relaying via network formation games in cognitive radio networks, in IEEE INFOCOM, 2013, 971–979. doi: 10.1109/INFCOM.2013.6566886. Google Scholar

[13]

Y. Liang, Z. Cai, Q. Han and Y. Li, Location privacy leakage through sensory data, Security and Communication Networks, 2017 (2017), Article ID 7576307, 12 pages. doi: 10.1155/2017/7576307. Google Scholar

[14]

J. LuZ. CaiX. WangL. ZhangP. Li and Z. He, User social activity-based routing for cognitive radio networks, Personal and Ubiquitous Computing, 22 (2018), 471-487. doi: 10.1007/s00779-018-1114-9. Google Scholar

[15]

W. Moreira, P. Mendes and S. Sargento, Opportunistic routing based on daily routines, in IEEE WoWMoM, 2012, 1–6. doi: 10.1109/WoWMoM.2012.6263749. Google Scholar

[16]

L. Muchnik, S. Pei, L. C. Parra, S. D. S. Reis, J. S. Andrade Jr., S. Havlin and H. A. Makse, Origins of power-law degree distribution in the heterogeneity of human activity in social networks, Scientific Reports, 3.Google Scholar

[17]

I. Parris and F. Ben Abdesslem, Crawdad trace/social network analysis/st_andrews/locshare/2010/sta1, Downloaded from http://crawdad.org//download/st_andrews/locshare/locshare-StA1.tar.gz, Nov. 2010.Google Scholar

[18]

T. SpyropoulosK. Psounis and C. Raghavendra, Efficient routing in intermittently connected mobile networks: The multiple-copy case, IEEE/ACM Transactions on Networking, 16 (2008), 77-90. doi: 10.1109/TNET.2007.897964. Google Scholar

[19]

A. Vahdat and D. Becker, Epidemic Routing for Partially-Connected ad Hoc Networks, Technical report, Duke University, 2000.Google Scholar

[20]

J. Wang, Z. Cai, Y. Li, D. Yang, J. Li and H. Gao, Protecting query privacy with differentially private k-anonymity in location-based services, Personal and Ubiquitous Computing, 1–17.Google Scholar

[21]

S. Wang, M. Liu, X. Cheng, Z. Li, J. Huang and B. Chen, Hero-a home based routing in pocket switched networks, in Proc. Wireless Algorithms, Systems, and Applications, 2012, 20–30. doi: 10.1007/978-3-642-31869-6_2. Google Scholar

[22]

J. Wu and Y. Wang, Social feature-based multi-path routing in delay tolerant networks, in Proc. IEEE INFOCOM, 2012, 1368–1376.Google Scholar

[23]

J. Wu, M. Xiao and L. Huang, Homing spread: Community home-based multi-copy routing in mobile social networks, in Proc. IEEE INFOCOM, 2013, 2319–2327.Google Scholar

[24]

X. XingT. JingW. ZhouX. ChengY. Huo and H. Liu, Routing in user-centric networks, IEEE Communications Magazine, 52 (2014), 44-51. Google Scholar

[25]

X. Zheng, Z. Cai, J. Li and H. Gao, Location-privacy-aware review publication mechanism for local business service systems, in IEEE INFOCOM, 2017. doi: 10.1109/INFOCOM.2017.8056976. Google Scholar

[26]

X. Zheng, Z. Cai and Y. Li, Data linkage in smart iot systems: A consideration from privacy perspective, IEEE Communications Magazine.Google Scholar

[27]

X. ZhengZ. CaiJ. YuC. Wang and Y. Li, Follow but no track: Privacy preserved profile publishing in cyber-physical social systems, IEEE Internet of Things Journal, 4 (2017), 1868-1878. Google Scholar

[28]

X. Zheng, G. Luo and Z. Cai, A fair mechanism for private data publication in online social networks, IEEE Transactions on Network Science and Engineering.Google Scholar

Figure 1.  A toy example of user $i$'s movement
Figure 2.  The power law distribution under different $k$
Figure 3.  Performance comparison in the real trace. (a) Comparing the A-Latency performance. (b) Comparing the A-MLP performance
Table 1.  Simulation Settings
Parameter Meaning Setting
$k_r$ The exponent of the power law distribution for $\zeta_{i\tau}$ 1.7
$k_l$ The exponent of the power law distribution for $p_i$ 3
$C_l$ The maximum value of $p_i$ 0.6
$R_d$ The radius of the communication range 6m
$\epsilon$ The length of the time interval within which users keep their moving direction and speed unchanged 30s
$\mu$ The mean of the normal distribution for users' speed 1.4
$\sigma$ The standard deviation of the normal distribution for users' speed $\frac{\mu}{3}$
Parameter Meaning Setting
$k_r$ The exponent of the power law distribution for $\zeta_{i\tau}$ 1.7
$k_l$ The exponent of the power law distribution for $p_i$ 3
$C_l$ The maximum value of $p_i$ 0.6
$R_d$ The radius of the communication range 6m
$\epsilon$ The length of the time interval within which users keep their moving direction and speed unchanged 30s
$\mu$ The mean of the normal distribution for users' speed 1.4
$\sigma$ The standard deviation of the normal distribution for users' speed $\frac{\mu}{3}$
Table 2.  Simulation Results
ESRS Relation Leakage Rand
A-Latency 16.2 15.4 17.9 30.4
A-MLP 0.38 0.63 0.35 0.72
ESRS Relation Leakage Rand
A-Latency 16.2 15.4 17.9 30.4
A-MLP 0.38 0.63 0.35 0.72
[1]

Jingli Ren, Dandan Zhu, Haiyan Wang. Spreading-vanishing dichotomy in information diffusion in online social networks with intervention. Discrete & Continuous Dynamical Systems - B, 2019, 24 (4) : 1843-1865. doi: 10.3934/dcdsb.2018240

[2]

Vikram Krishnamurthy, William Hoiles. Information diffusion in social sensing. Numerical Algebra, Control & Optimization, 2016, 6 (3) : 365-411. doi: 10.3934/naco.2016017

[3]

Werner Creixell, Juan Carlos Losada, Tomás Arredondo, Patricio Olivares, Rosa María Benito. Serendipity in social networks. Networks & Heterogeneous Media, 2012, 7 (3) : 363-371. doi: 10.3934/nhm.2012.7.363

[4]

Yuki Kumagai. Social networks and global transactions. Journal of Dynamics & Games, 2019, 6 (3) : 211-219. doi: 10.3934/jdg.2019015

[5]

Sourabh Bhattacharya, Abhishek Gupta, Tamer Başar. Jamming in mobile networks: A game-theoretic approach. Numerical Algebra, Control & Optimization, 2013, 3 (1) : 1-30. doi: 10.3934/naco.2013.3.1

[6]

A. Cascone, Alessia Marigo, B. Piccoli, L. Rarità. Decentralized optimal routing for packets flow on data networks. Discrete & Continuous Dynamical Systems - B, 2010, 13 (1) : 59-78. doi: 10.3934/dcdsb.2010.13.59

[7]

Hong Il Cho, Myungwoo Lee, Ganguk Hwang. A cross-layer relay selection scheme of a wireless network with multiple relays under Rayleigh fading. Journal of Industrial & Management Optimization, 2014, 10 (1) : 1-19. doi: 10.3934/jimo.2014.10.1

[8]

Sharon M. Cameron, Ariel Cintrón-Arias. Prisoner's Dilemma on real social networks: Revisited. Mathematical Biosciences & Engineering, 2013, 10 (5&6) : 1381-1398. doi: 10.3934/mbe.2013.10.1381

[9]

Robin Cohen, Alan Tsang, Krishna Vaidyanathan, Haotian Zhang. Analyzing opinion dynamics in online social networks. Big Data & Information Analytics, 2016, 1 (4) : 279-298. doi: 10.3934/bdia.2016011

[10]

Karan Pattni, Mark Broom, Jan Rychtář. Evolving multiplayer networks: Modelling the evolution of cooperation in a mobile population. Discrete & Continuous Dynamical Systems - B, 2018, 23 (5) : 1975-2004. doi: 10.3934/dcdsb.2018191

[11]

Weiping Li, Haiyan Wu, Jie Yang. Intelligent recognition algorithm for social network sensitive information based on classification technology. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1385-1398. doi: 10.3934/dcdss.2019095

[12]

Linet Ozdamar, Dilek Tuzun Aksu, Elifcan Yasa, Biket Ergunes. Disaster relief routing in limited capacity road networks with heterogeneous flows. Journal of Industrial & Management Optimization, 2018, 14 (4) : 1367-1380. doi: 10.3934/jimo.2018011

[13]

Rui Wang, Denghua Zhong, Yuankun Zhang, Jia Yu, Mingchao Li. A multidimensional information model for managing construction information. Journal of Industrial & Management Optimization, 2015, 11 (4) : 1285-1300. doi: 10.3934/jimo.2015.11.1285

[14]

Mahendra Piraveenan, Mikhail Prokopenko, Albert Y. Zomaya. On congruity of nodes and assortative information content in complex networks. Networks & Heterogeneous Media, 2012, 7 (3) : 441-461. doi: 10.3934/nhm.2012.7.441

[15]

Guowei Dai, Ruyun Ma, Haiyan Wang, Feng Wang, Kuai Xu. Partial differential equations with Robin boundary condition in online social networks. Discrete & Continuous Dynamical Systems - B, 2015, 20 (6) : 1609-1624. doi: 10.3934/dcdsb.2015.20.1609

[16]

Lea Ellwardt, Penélope Hernández, Guillem Martínez-Cánovas, Manuel Muñoz-Herrera. Conflict and segregation in networks: An experiment on the interplay between individual preferences and social influence. Journal of Dynamics & Games, 2016, 3 (2) : 191-216. doi: 10.3934/jdg.2016010

[17]

Yi Xu, Qing Yang, Dianhui Chu. Exploring timeliness for accurate recommendation in location-based social networks. Mathematical Foundations of Computing, 2018, 1 (1) : 11-48. doi: 10.3934/mfc.2018002

[18]

Serap Ergün, Bariş Bülent Kırlar, Sırma Zeynep Alparslan Gök, Gerhard-Wilhelm Weber. An application of crypto cloud computing in social networks by cooperative game theory. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-15. doi: 10.3934/jimo.2019036

[19]

Filipe Martins, Alberto A. Pinto, Jorge Passamani Zubelli. Nash and social welfare impact in an international trade model. Journal of Dynamics & Games, 2017, 4 (2) : 149-173. doi: 10.3934/jdg.2017009

[20]

Hans Weinberger. The approximate controllability of a model for mutant selection. Evolution Equations & Control Theory, 2013, 2 (4) : 741-747. doi: 10.3934/eect.2013.2.741

 Impact Factor: 

Metrics

  • PDF downloads (33)
  • HTML views (549)
  • Cited by (0)

[Back to Top]