[PDF] Top 20 Mobility based routing algorithm in delay tolerant networks

... proposed algorithm is based on the characteristics of mobility of nodes and contacts be- tween ...nodes. Algorithm selects nodes, which have a higher mobility, thus increasing the ... See full document

... bundles based on nodes’ encounters, which is highly inaccurate in this mobility ...of delay, Fig. 11b shows that QM-EBRP has a delay of 5050, 5400 and 5500 s when nodes’ buffer size is 30, 90 ... See full document

... of routing in delay tolerant networks (DTNs). Delay tolerant networks are wireless networks where disconnections occur frequently due to mobility of nodes, ... See full document

... The Delay Tolerant Network is the network that establishes connection in network in dynamic environment and bundle of messages are sending by sender to more than one ...DTN routing should naturally ... See full document

... Such routing type will result in inefficient use of a network resources such as power due to forwarding of multiple copies of a same message, bandwidth and costly in terms of energy consumption and ...Epidemic ... See full document

... In this paper we conclude that pure epidemic has problems and to overcome that we need to enhance the protocol. The techniques can be implemented are the Anti-packets that manages the buffer level when the buffer size is ... See full document

... Wait routing protocol a fixed number of copies of message are sprayed to equal number of nodes in the network and then wait till any node meets the ...the algorithm namely spray phase, source nodes sprays L ... See full document

... rithm based on Dijkstra’s shortest path algorithm, with customizations to meet the requirements of this simple connection ...This algorithm guarantees the earli- est delivery (ED), and therefore, is ... See full document

... Epidemic routing [7] tries to limit number of replicas in the way similar to disease ...a routing protocol which can deliver more messages than epidemic routing with limited ...effective ... See full document

... Network coding-based routing is an adaptation of the traditional store and forward mechanism. In network coding relay nodes combine and encode received packets before forwarding them. Network Coding ... See full document

... the routing algorithm depends much on the intermediate nodes [5] and the messages arriving to the destination cost much more time (The delay of the network is ...the delay-tolerant ... See full document

... Genetic algorithm (GA) [15] is one of such EA approaches which requires knowledge of entire network and the initial ...is based on the concept that established solutions to a problem get reinforced by ... See full document

... those routing protocols, end-to-end connection between the source and the destination node is basic ...opportunistic networks is how to route messages from their source to their destination, with the ... See full document

... multiple-copy routing schemes may be defined as a scheme in which multiple copies of message is spread throughout the network for the purpose of increasing efficiency as well as ...copy routing scheme may ... See full document

... This routing is the first among the replication based concepts where total replicas are very ...This routing exhibits much more overhead for its replication process ... See full document

... Epidemic Routing performs well if network resources are ...leverage mobility and use scarce resources efficiently, Lindgren et ...Probabilistic Routing Protocol using History of Encounters and ... See full document

... GSR routing was introduced to solve the problems of GPSR like high mobility and topological structure in city environment ...position based routing is used in ...position based ... See full document

... is based on the concept zone routing protocol ...Zone Routing Protocol (ZRP) as described in aims at addressing these limitations by combining the best properties of both proactive and reactive ... See full document

... of routing is also called as opportunistic routing where no information is known about connectivity and mobility of the ...of routing strategies proposed in such type of network such as ... See full document

... 2-hop based sociability indicators still show few best ...the algorithm, the latter will automatically exclude from the list of potential next-hop relays all its peers ...delivery delay with respect ... See full document