Abstract
Epidemic algorithm improves the delivery rate by generating a large number of copies of the message. It is easy to implement and obtain high delivery rate. However, DTN network is usually memory-and-bandwidth-limited. The copy and distribution of message without limitation lead to the decrease in network performance. The proposed ANEpidemic algorithm reduces the invalid replication of message by utilizing position and angle information of relay nodes. Simulation results show that the proposed algorithm has a better performance in delivery rate and end-to-end delay.
Highlights
Due to its characteristics such as long communication delay, high dynamic topology, sparse distribution of nodes and frequent link break, routing are the key issues of research in delay-tolerant networks (DTN)
We propose a routing protocol that uses angle and position information of local node to control the ineffective duplication messages
In order to observe performance variation of DTN routing protocol which was affected by memory size and number of nodes, we performed simulations in ONE 1.41 simulator
Summary
Due to its characteristics such as long communication delay, high dynamic topology, sparse distribution of nodes and frequent link break, routing are the key issues of research in delay-tolerant networks (DTN). The epidemic routing [8] has been proposed as an approach for routing in sparse and/or highly mobile networks in which there may not be a contemporaneous path from source to destination It adopts a so-called ‘‘store-carry-forward’’ paradigm – a node receives a packet buffers and carries that packet as it moves, passing the packet on to new nodes that it encounters. 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 This leads to link and/or storage congestion when the network is loaded.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have