Gossip Based Random Routing In Ad Hoc Networks Latest CSE Seminar Topic with Report

Introduction to Gossip Based Random Routing In Ad Hoc Networks  Seminar Topic:

Most of the Adhoc routing protocols experience variant of the flooding.  Because of this many messages which are used in the routing are forwarded unnecessarily. In this paper we come up with a gossiping based approach which allows each node for forwarding message with some probability, so that this problem can be reduced. 

In this paper we implement gossiping, i.e. we decide randomly to forward or not to forward the message so that it can minimize the number of the messages being routed significantly. From the percolation theory we can conclude that this feature of the Gossiping exhibits the feature of the bimodal.  

The nodes are used for joining in a dynamic manner and also can quit the networks depending on the situation. Moreover, the limitations on power consumption in a node transmission range are typically small when compared to the span of the network. This limits the propagation range of a mobile node. The main challenges involving in the design of the Adhoc networks include the dynamic routing protocol development where routes can be determined more efficiently. 

Our protocol is simple and also easy to implement into the existing routing protocols. Even when we add this feature of gossiping to the AODV, there is a significant performance increase in all the metrics which are considered also in the situations in network which are as small as with around 150 nodes. This approach of Gossiping has lot of advantages when compared to that of other approaches. A further limit exists for the amount of the non-local traffic which is being sent over the large networks. In spite of this problem the gossiping feature is still useful for the non-local messages which are being sent on the large networks.

Download Gossip Based Random Routing In Ad Hoc Networks Latest CSE Seminar Topic with Report.

Leave a Reply

Your email address will not be published. Required fields are marked *