Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/127644
Full metadata record
DC FieldValueLanguage
dc.coverage.spatial
dc.date.accessioned2017-01-25T10:43:19Z-
dc.date.available2017-01-25T10:43:19Z-
dc.identifier.urihttp://hdl.handle.net/10603/127644-
dc.description.abstractMobile Ad hoc Network (MANET) is the assortment of cooperative wireless nodes newlinewithout physical existence of any access network point or infrastructure. This thesis newlineaddresses issues pertaining to mobile adhoc networks due to lack of infrastructure and newlinedynamic mobility. MANETs are gaining attention in the increasing real life newlineapplications such as military, conference management system, search and rescue newlineapplications. Consequently, these are beneficial in classrooms, conventions where newlinestudents share their views dynamically through mobile devices. In these networks, newlineeach node in the network must be able to take care of routing of the data and this is newlinethe domain of ad-hoc routing. Requirement of efficient routing algorithm is a major newlinerequirement in mobile adhoc networks. Fulfillment of this requirement has been a newlinecomplex problem due to lack of fixed infrastructure and rapid movement of nodes. newlineThe mobility of these nodes imposes issues in terms of mobility management, energy newlineconsumption, battery life and security. The main contributions of the thesis are in the newlineareas of mobility management, random scenarios, battery life and processing activity newlineand security. In the thesis, comprehensive review of existing routing protocols and newlinetheir issues have been studied in detail. To provide secure routing in adhoc networks, newlineit is essential to authenticate each node. The presence of malicious nodes in an adhoc newlinenetwork deteriorates the network performance. In this thesis, two new algorithms newlinehave been proposed by enhancing the AODV (Adhoc On Demand Distance Vector). newlineEnhanced AODV provides a solution against threatening attacks in mobile adhoc newlinenetwork. Enhanced AODV method requests its next hop to send a confirmation newlinemessage to originating node by maintaining ECC (Elliptic Curve Cryptography) table. newlineAfter acquiring Route Reply (RREP) and confirmation message, the source node newlinedetermines the validity of paths. newline
dc.format.extent
dc.languageEnglish
dc.relation
dc.rightsuniversity
dc.titleOptimization of Routing Protocol in Mobile Adhoc Networks
dc.title.alternative
dc.creator.researcherUmang
dc.description.note
dc.contributor.guideB.V.R.Reddy and M.N. Hoda
dc.publisher.placeDelhi
dc.publisher.universityGuru Gobind Singh Indraprastha University
dc.publisher.institutionUniversity School of Information and Communication Technology
dc.date.registered2006
dc.date.completed02/2014
dc.date.awarded26/03/2015
dc.format.dimensions
dc.format.accompanyingmaterialCD
dc.source.universityUniversity
dc.type.degreePh.D.
Appears in Departments:University School of Information and Communication Technology

Files in This Item:
File Description SizeFormat 
01.0_title_certificate.pdfAttached File566.88 kBAdobe PDFView/Open
01.1_abstract.pdf13.35 kBAdobe PDFView/Open
02_acknowledgement.pdf11.1 kBAdobe PDFView/Open
03_toc.pdf14.16 kBAdobe PDFView/Open
04_abbreviations.pdf14.99 kBAdobe PDFView/Open
05_figures.pdf13.02 kBAdobe PDFView/Open
06_tables.pdf10.31 kBAdobe PDFView/Open
07_chapter_01.pdf39.81 kBAdobe PDFView/Open
08_chapter_02.pdf121.49 kBAdobe PDFView/Open
09_chapter_03.pdf414.08 kBAdobe PDFView/Open
10_chapter_04.pdf179.84 kBAdobe PDFView/Open
11_chapter_05.pdf70.22 kBAdobe PDFView/Open
12_chapter_06.pdf73.8 kBAdobe PDFView/Open
13_chapter_07.pdf15.5 kBAdobe PDFView/Open
14_chapter_08.pdf18.89 kBAdobe PDFView/Open
15_bibliography.pdf47.77 kBAdobe PDFView/Open
16_appendix.pdf45.24 kBAdobe PDFView/Open
17_publications.pdf14.24 kBAdobe PDFView/Open
18_resume.pdf10.36 kBAdobe PDFView/Open


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: