Abstract
Despite the extensive study on relay selection in mobile social networks (MSNs), few work has considered the fundamental problem of preventing information leakage to non-destination users. To the best of our knowledge, no existing work has taken both transmission latency (i.e. efficiency) and information leakage probability (i.e. security) into consideration for relay selection in MSNs. 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, a network formation game based relay selection algorithm named ESRS is proposed. We define the payoff functions of the users, design the game evolving rules, and prove the stability of the formed network structure. Extensive simulation is conducted to validate the performance of the ESRS 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Li, J., Cai, Z., Yan, M., Li, Y.: Using crowdsourced data in location-based social netowrks to explore influence maximization. In: IEEE INFOCOM (2016)
He, Z., Cai, Z., Wang, X.: Modeling propagation dynamics and developing optimized countermeasures for rumor spreading in online social networks. In: IEEE ICDCS, pp. 205–214 (2015)
Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Duke University, Technical Report (2000)
Wu, J., Wang, Y.: Social feature-based multi-path routing in delay tolerant networks. In: Proceedings of the IEEE INFOCOM, pp. 1368–1376 (2012)
Erramilli, V., Crovella, M., Chaintreau, A., Diot, C.: Delegation forwarding. In: Proceedings of the MobiHoc, pp. 251–260 (2008)
Spyropoulos, T., Psounis, K., Raghavendra, C.: Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Trans. Networking 16(1), 77–90 (2008)
Ciobanu, R., Dobre, C., Cristea, V.: Sprint: Social prediction-based opportunistic routing. In: IEEE WoWMoM, pp. 1–7, June 2013
Moreira, W., Mendes, P., Sargento, S.: Opportunistic routing based on daily routines. In: IEEE WoWMoM, pp. 1–6, June 2012
Wang, S., Liu, M., Cheng, X., Li, Z., Huang, J., Chen, B.: HERO – a home based routing in pocket switched networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds.) WASA 2012. LNCS, vol. 7405, pp. 20–30. Springer, Heidelberg (2012)
Wu, J., Xiao, M., Huang, L.: Homing spread: Community home-based multi-copy routing in mobile social networks. In: Proceedings of the IEEE INFOCOM, pp. 2319–2327 (2013)
Kim, S.K., Yoon, J.H., Lee, J.Y., Jang, G.Y., Yang, S.B.: A cooperative forwarding scheme for social preference-based selfishness in mobile social networks. Wirel. Netw. 22(2), 537–552 (2015)
Xing, X., Jing, T., Zhou, W., Cheng, X., Huo, Y., Liu, H.: Routing in user-centric networks. IEEE Commun. Mag. 52(9), 44–51 (2014)
Wang, Y., Cai, Z., Yin, G., Gao, Y., Tong, X., Wu, G.: An incentive mechanism with privacy protection in mobile crowdsourcing systems. Comput. Netw. 102, 157–171 (2016)
Cheng, W., Wu, D., Cheng, X., Chen, D.: Routing for information leakage reduction in multi-channel multi-hop ad-hoc social networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds.) WASA 2012. LNCS, vol. 7405, pp. 31–42. Springer, Heidelberg (2012)
Li, W., Cheng, X., Jing, T., Xing, X.: Cooperative multi-hop relaying via network formation games in cognitive radio networks. In: IEEE INFOCOM (2013)
Jackson, M.O.: A survey of models of network formation: Stability and efficiency (2003)
Muchnik, L., Pei, S., Parra, L.C., Reis, S.D.S., Andrade, J.S., Havlin, S., Makse, H.A.: Origins of power-law degree distribution in the heterogeneity of human activity in social networks. Sci. Rep. 3, 1783 (2013)
Parris, I., Abdesslem, B.: Crawdad trace/social network analysis/st_andrews/locshare/2010/sta1. Downloaded from http://crawdad.org//download/st_andrews/locshare/locshare-StA1.tar.gz
Acknowledgment
The authors would like to thank the support from the Provincial Key Laboratory for Computer Information Processing Technology, Soochow University (Grant No. KJS1521 and KJS1522), the National Science Foundation of the US (Grant No. AST-1443858, ECCS-1407986, CNS-1162057 and CNS-1265311), and the National Natural Science Foundation of China (Grant No. 61300186).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Xing, X., Cheng, X., Dai, H., Gong, S., Zhao, F., Qiu, H. (2016). ESRS: An Efficient and Secure Relay Selection Algorithm for Mobile Social Networks. In: Yang, Q., Yu, W., Challal, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2016. Lecture Notes in Computer Science(), vol 9798. Springer, Cham. https://doi.org/10.1007/978-3-319-42836-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-42836-9_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42835-2
Online ISBN: 978-3-319-42836-9
eBook Packages: Computer ScienceComputer Science (R0)