Opportunistic content dissemination in mobile social networks via adjustment of user selfishness. Issue 2 (1st March 2019)

• Record Type: Journal Article
• Authors: Moradi, Ashkan; Shah‐Mansouri, Vahid
• Is Part Of: IET networks. Volume 8:Issue 2(2019)
• Page Start: 126
• Page End: 137
• Publication Date: 2019-03-01
• Subjects: smart phones -- information dissemination -- mobile computing -- peer‐to‐peer computing -- optimisation -- approximation theory -- social networking (online) -- differential equations -- probability -- tree searching; information dissemination -- selfish users -- analytical model -- ordinary differential equations -- optimisation problem -- optimal forwarding probability -- relay users -- optimal selfishness vector -- network performance -- dissemination delay -- opportunistic content dissemination -- mobile social networks -- user selfishness -- smart phone penetration rate -- peer‐to‐peer opportunistic wireless connections -- selfish behaviours -- MSN -- battery‐powered device -- limited buffer space -- brand‐and‐bound‐outer approximation algorithm; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2018.5013
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : By increase in smart phone penetration rate, mobile social networks (MSNs) become more popular. In such networks, users can exchange and share information via peer‐to‐peer opportunistic wireless connections. Wireless connections are prone to failures, devices are battery‐powered, and the buffer space is limited. These lead to uncertainty in connections and selfish behaviours in dissemination processes. Hence, information dissemination in MSNs becomes a challenge. In this study, the authors analyse the information dissemination in MSNs with selfish users from different communities. They develop an analytical model through ordinary differential equations to analyse the dissemination process in MSNs. Then, they propose an optimisation problem to find the optimal forwarding probabilities of users. They employ the branch and bound‐outer approximation algorithm to analytically solve the optimisation problem. The analytical results represent that the optimal forwarding probability of users diminished by increasing the number of relay users, which accelerate the dissemination in the network. Also, these results represent that the proposed algorithm to find the optimal selfishness vector can improve the network performance by decreasing the dissemination delay.