A Data Forwarding Algorithm Based on Nodal Activities in Opportunistic Networks

In opportunistic networks such as social networks, the mobile nodes usually encounter others irregularly and frequently, so the data dissemination can be assisted by evaluating the nodal activities in the historical contacts with other nodes. Specially, in this paper the nodal activity is calculated according to the number of encountered nodes during a period. Generally, the higher activity will be obtained when the node has encountered more other nodes. Thus, we propose a Data Dissemination Algorithm based on Nodal Activities (DDANA), where the correlations between nodes and the destination is exploited for the data dissemination as well. Experimental results show that DDANA can improve the delivery ratio and shorten the delivery time.