Yahui Wu

Performance analysis of hop-limited epidemic routing in DTN with limited forwarding times

Because of the uncertainty of transmission opportunity in delay tolerant networks DTN, routing algorithms in DTN often need nodes to serve as relays for others to carry and forward messages. One classic policy is the Epidemic routing ER algorithm. To reduce the overhead, the hop-limited ER protocol is proposed. This method can get better performance through controlling the message hop count. However, because of the energy constraint or other factors, each node may forward only limited times, that is, both the message hop count and the forwarding times may be limited. This paper proposes a unifying framework to evaluate the performance of ER with the aforementioned constraints. Simulations based on both synthetic and real motion traces show the accuracy of the framework. In addition, we explore the impact of many parameters e.g., message hop count through extensive numerical results. For example, numerical results show that both the message hop count and the forwarding times can have certain impact on the routing performance, but their impact is related with many other factors e.g., the number of nodes. Copyright

On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks

Transmission opportunity in delay tolerant network (DTN) is uncertain. To improve the routing performance, DTN tries to use every contact between nodes, and one classic policy is epidemic routing algorithm (ER). Due to much energy consumption, L-hop limited ER algorithm is proposed. However, such method does not consider the energy constraint for a specific node. To overcome this problem, we propose the L-count limited ER algorithm, in which each node forwards at most

Optimal Routing Control in Disconnected Machine-to-Machine Networks

L

Evaluating the impact of selfish behaviors on epidemic forwarding in mobile social networks

times. Numerical results show that this new algorithm can get better performance. Both of above algorithms need nodes to work in a cooperative way. However, due to selfish nature of nodes (individual selfishness and social selfishness), they may not be willing to help others. This paper proposes an accurate theoretical framework to evaluate the impact of these behaviors based on nonlinear differential equations (ODE). Simulations based on both synthetic and real motion traces show the accuracy of our theoretical model. Numerical results show that selfish nature can decrease the flooding performance in both algorithms. Under the same selfish behaviors, the performance is decreasing with the number of communities. The deviation of the performance between two algorithms is decreasing with the value of

Optimal Control Of Two-Hop Routing In Dtns With Time-Varying Selfish Behavior

L

Evaluate the Impact of Mutual Friends and Load Distribution on Epidemic Routing in Delay Tolerant Networks

.