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

Abstract

SUMMARYBecause 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

A Routing Protocol for Delay-tolerant Networks

“…When the traffic load is very low, epidemic routing is able to achieve minimum delivery delay at the expense of increased use of resources such as buffer space, bandwidth, and transmission power [14]. However this also leads to link and/or storage congestion when the network is loaded [15].…”

The Effective Sleep Scheduling in Wireless Opportunistic Networks

“…And these devices are equipped short-range wireless communication module. Therefore it can provide the enhanced wireless communication ability for different application systems [1]. ONs are based on Delay Tolerant Networks (DTNs) technology.…”

Modeling and Performance Analysis of Marine DTN Networks with Nodes-cluster in an Ad Hoc Sub-net

“…The neighbor node repeats this step until each node receives the message. In order to reduce the network overhead, a hoplimited Epidemic routing algorithm is proposed in [13]. This algorithm can achieve better network performance by controlling the number of hops in the message.…”