SFQ: Social Features Based Quota Routing in Mobile Social Networks

2018 ◽  
Vol 104 (3) ◽  
pp. 1109-1120 ◽  
Author(s):  
Sepideh Tahouri Asl ◽  
Nahideh Derakhshanfard
Author(s):  
Zhenzhen Zhao ◽  
Christine Balagué

Digital marketing has put mobile and social into the center of the vision. Mobile and social interactions have transformed marketing activities and imposed a new paradigm on consumer behaviors based on real-time customer relationship management, peer-to-peer social influence and idea co-creation with consumers. Extensive research has been conducted in both mobile and social media domain, however few research has led a systematic approach by illustrating the marketing evolution and identifying mobile and social features. In this chapter, we fill this research gap through a literature review approach by first presenting the new marketing paradigm created by social networks, and then analyzing the marketing evolution from web-based social networks to mobile social networks. The mobile and social features are identified to guide marketers for application design. Finally, four case studies are presented to show how these features are distributed in applications to lead a better consumer experience. This chapter brings both theoretical and practical implications in this new trends.


2016 ◽  
Vol 111 ◽  
pp. 71-81 ◽  
Author(s):  
Xiao Chen ◽  
Charles Shang ◽  
Britney Wong ◽  
Wenzhong Li ◽  
Suho Oh

2014 ◽  
Vol 36 (3) ◽  
pp. 613-625 ◽  
Author(s):  
Hai-Yang HU ◽  
Zhong-Jin LI ◽  
Hua HU ◽  
Ge-Hua ZHAO

Author(s):  
Seyyed Mohammad Safi ◽  
Ali Movaghar ◽  
Komeil Safikhani Mahmoodzadeh

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 3994
Author(s):  
Yuxi Li ◽  
Fucai Zhou ◽  
Yue Ge ◽  
Zifeng Xu

Focusing on the diversified demands of location privacy in mobile social networks (MSNs), we propose a privacy-enhancing k-nearest neighbors search scheme over MSNs. First, we construct a dual-server architecture that incorporates location privacy and fine-grained access control. Under the above architecture, we design a lightweight location encryption algorithm to achieve a minimal cost to the user. We also propose a location re-encryption protocol and an encrypted location search protocol based on secure multi-party computation and homomorphic encryption mechanism, which achieve accurate and secure k-nearest friends retrieval. Moreover, to satisfy fine-grained access control requirements, we propose a dynamic friends management mechanism based on public-key broadcast encryption. It enables users to grant/revoke others’ search right without updating their friends’ keys, realizing constant-time authentication. Security analysis shows that the proposed scheme satisfies adaptive L-semantic security and revocation security under a random oracle model. In terms of performance, compared with the related works with single server architecture, the proposed scheme reduces the leakage of the location information, search pattern and the user–server communication cost. Our results show that a decentralized and end-to-end encrypted k-nearest neighbors search over MSNs is not only possible in theory, but also feasible in real-world MSNs collaboration deployment with resource-constrained mobile devices and highly iterative location update demands.


2020 ◽  
Vol 5 (1) ◽  
pp. 1-29 ◽  
Author(s):  
Gabriela Suntaxi ◽  
Aboubakr Achraf El Ghazi ◽  
Klemens Böhm

2012 ◽  
Vol 61 (7) ◽  
pp. 3209-3222 ◽  
Author(s):  
Xiaohui Liang ◽  
Xu Li ◽  
Tom H. Luan ◽  
Rongxing Lu ◽  
Xiaodong Lin ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document