An Efficient Interest-aware Data Dissemination Approach in Opportunistic Networks

作     者：Sui Yu Lichen Zhang Lixia Li Bin Yan Zhipeng Cai Lizong Zhang 

作者机构：Key Laboratory of Modern Teaching Technology Ministry of Education Xi’an 710062 China School of Computer Science Shaanxi Normal University Xi’an 710062 China Department of Computer Science Georgia State University Atlanta 30303 USA School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China 

出 版 物：《Procedia Computer Science》 

年 卷 期：2019年第147卷

页      面：394-399页

主　　题：Interest-aware Social feature Data dissemination Opportunistic networks 

摘      要：Due to the high mobility of humans and resource limitation of smart mobile devices, the design of efficient data dissemination schemes faces great challenges in opportunistic networks (OppNets). The current data dissemination schemes generally concentrate on the similarity among nodes while ignoring the similarity between nodes and data packets, which leads to that data packets move back and forth among the nodes with similar social features instead of reaching to the subscribers directly. In this paper, an efficient interest-aware data dissemination (EIAD) approach is proposed, in which the similarity between nodes and data packets is used to determine whether a node is a potential destination. Moreover, both the social feature and the residual energy are considered to choose an appropriate relay node and then determine the number of packet’s replicas. Furthermore, the broadcast characteristic of wireless data transfer is exploited to reduce unnecessary transmissions and energy consumption. The evaluations towards a real-world dataset reveal that the proposed algorithm outperforms the existing results.