Homing spread: Community home-based multi-copy routing in mobile social networks

Abstract

Abstract-A mobile social network (MSN) is a special delay tolerant network (DTN) composed of mobile nodes with social characteristics. Mobile nodes in MSNs generally visit community homes frequently, while other locations are visited less frequently. We propose a novel zero-knowledge MSN routing algorithm, homing spread (HS). The community homes have a higher priority to spread messages into the network. Theoretical analysis shows that the proposed algorithm can spread a given number of message copies in an optimal way when the inter-meeting times between any two nodes and between a node and a community home follow exponential distributions. We also calculate the expected delivery delay of HS. In addition, extensive simulations are conducted. Results show that community homes are important factors in efficient message spreading. By using homes to spread messages faster, HS achieves a better performance than existing zero-knowledge MSN routing algorithms, including Epidemic, with a given number of copies, and Spray&Wait.

Packet-Forwarding Algorithm in DTN Based on the Pheromone of Destination Node

“…A community can be classified into two types according to whether social features are to be used in the process of selecting relay nodes. The first type uses social features in the packet-forwarding process [2,5,[7][8][9][10][11], whereas the second type does not consider these features [12][13][14][15]. Vahdat et al [13] proposed the epidemic algorithm for DTN, which was a typical algorithm belonging to the second type.…”

Dynamic Groups Based Adaptive DTN Routing Algorithms in Social Networks

“…HS [16] is a zero-knowledge assisted mobile social network routing algorithm proposed by Wu et al, which spreads a given number of message copies in an optimal strategy by theoretical analysis when assuming that the intermeeting times between any two nodes and between a node and a community follow exponential distribution. In addition, by constructing a Markov chain, HS can also calculate the expected delivery delay and derive an upper bound, thus getting a better routing performance.…”

“…Aiming to further control network overhead ratio, we propose to set MR threshold to a small value. SG ← the target social group of dest (4) For node in neigh list (5) EG ← the ego group of node (6) If node = dest OR node ∈ SG OR dest ∈ EG (7) replicatemessage to node (8) Else if ∈ SG (9) If (node, dest) > SG ( , dest) AND MR ( , node) < MR (10) replicate message to node (11) End if (12) Else (13) If (node, dest) > ( , dest) AND MR ( , node) < MR (14) replicate message to node (15) End if (16) End if (17) End for (18) End for Algorithm 2: DGA routing algorithm on node .…”

Reform ID-Achieving Proximate Node Anonymity in MOSNs

“…MOSNs (Mobile Opportunistic Social Networks [1][2] are a special type of Delay Tolerant Networks(DTNs) [3] where communication between different nodes is done when the nodes are present in proximity or neighbourhood region. In MOSNs, mobile devices carried by people communicate with each other directly without the support of infrastructures when they meet (i.e., within the communication range of each other) opportunistically.…”