Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/14606
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKUMAR, S.P.AJITH-
dc.date.accessioned2016-04-07T05:30:32Z-
dc.date.available2016-04-07T05:30:32Z-
dc.date.issued2016-04-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/14606-
dc.description.abstractABSTRACT Opportunistic networks are one of the most interesting evolutions of MANETs. Mobile nodes are enabled to communicate with each other in opportunistic networks even if there is no route to connect them. Also, nodes are not having knowledge about the network topology, which (instead) is necessary in MANET routing protocols. In this network routes are building dynamically, whenever messages are en route between the sender and the destination(s), and any potential node can be opportunistically used as the next hop, provided it is bringing the message nearer to the destination. These necessities make opportunistic networks a challenging and demanding research field. In this project, a new routing protocol named as Reduced Flooding Epidemic Protocol (RFEP) for infrastructure-less is proposed and is an existing Epidemic routing protocol improvement model. Its objective is to reduce the amount of flooding done in the Epidemic protocol. Therefore it reduces the resource consumption and network bandwidth and as well as power of nodes that helps in maximizing the network lifetime. Also a method for congestion control is proposed here for opportunistic networks. Congestion is an important problem in this network because some nodes having better connection comparing with other nodes and so the load is unfairly distributed towards them. Therefore, a threshold based packet forwarding scheme is proposed in this work to overcome this issue. Number of nodes is selected as the subsequent hop to forward the packets whose utility metric computed based on its social metrics, delay and packet dropping probability which is higher than the current host by the predefined threshold. The outcome shows that it generated very good results in terms of delivery probability, overhead ratio and reduced number of packets dropped.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesTD 2095;-
dc.subjectCONGESTION CONTROLen_US
dc.subjectOPPORTUNISTIC NETWORKen_US
dc.subjectAD-HOC NETWORKen_US
dc.subjectFLOODING CONTROL PROTOCOLen_US
dc.subjectDYNAMIC TOPOLOGYen_US
dc.subjectDYNAMIC ROUTING PROTOCOLen_US
dc.titleROUTING AND CONGESTION CONTROL IN OPPORTUNISTIC NETWORKSen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Computer Engineering

Files in This Item:
File Description SizeFormat 
First page to abstract (2 files merged).pdf1.28 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.