An Efficient Routing algorithm for Tolerant Systems based on Mobility

Author(s):

L. Manjunath , CVR College of Engineering

Keywords:

Delay & Disruption tolerant Systems, MANETs, Wireless communication, routing protocols, Mobile networks

Abstract:

The paper gives an efficient algorithm for routing based on the usage of the node mobility in the Disruptive Tolerant systems (DTS). DTS are featured by lack of a continuous path between the start node and the end node, which may be temporarily or permanently present. The information is conveyed by transmitting the information by intermediate nodes based on store-carry-forward mechanism. Our algorithm is based on the capability to use the information about mobility of nodes and respective contacts of the nodes. Our work is based on the assumption that higher node mobility will result in higher number of contacts with other nodes and higher probability in sending information to the destination. Our proposed algorithm was simulated using The One simulation tool. Finally we differentiate the performance parameters of our algorithm with other famous algorithms used for routing.

Other Details:

Manuscript Id	:	IJSTEV2I10165
Published in	:	Volume : 2, Issue : 10
Publication Date	:	01/05/2016
Page(s)	:	581-587

Download Article