Please use this identifier to cite or link to this item: http://drsr.daiict.ac.in//handle/123456789/344
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorSrivastava, Sanjay
dc.contributor.advisorDivakaran, Srikrishnan
dc.contributor.authorSati, Mohit
dc.date.accessioned2017-06-10T14:39:03Z
dc.date.available2017-06-10T14:39:03Z
dc.date.issued2011
dc.identifier.citationSati, Mohit (2011). Analysis of address allocation protocols for mobile ad hoc networks. Dhirubhai Ambani Institute of Information and Communication Technology, 73 p. (Acc.No: T00307)
dc.identifier.urihttp://drsr.daiict.ac.in/handle/123456789/344
dc.description.abstractIn almost all networks, it is necessary to have a unique identifier for each node. This identifier is used to find out route locating a particular node. So an address is must for any node for unicast communication. Addresses can be preconfigured manually or can be assigned dynamically using a server (e.g. DHCP server). Manual configuration of ad hoc network is not possible for large scale networks. And setting up a server is not possible due to lack of infrastructure in Ad Hoc Networks. So it is necessary to have a mechanism by which we can allocate addresses to the nodes dynamically without any prior setup. Lack of infrastructure and mobility of nodes makes address allocation a challenging task in MANET. We present worst case message complexity analysis of a number of proposed address allocation protocols, which can be useful for estimating upper bounds for overhead and latency involved in address allocation as well as partitioning and merging. We also show that the worst case analysis is not a useful indicator of real world performance of the protocols. Buddy approach [5] is one of the many proposed approaches for address allocation. We model DPDA (A Distributed Protocol for Dynamic Address assignment in mobile ado networks)[6], a protocol based on buddy approach, to estimate the overhead involved in address allocation. We conduct simulations in NS-2 and compare with analytical results to validate our model. We perform simplified simulations using Python script which also validates the proposed model. We also do a simulation based comparison of MANETconf (MANET configuration) [8] and DPDA[6] in term of overhead and latency in address allocation, which shows that DPDA causes lower communication overhead and latency than Manetconf.
dc.publisherDhirubhai Ambani Institute of Information and Communication Technology
dc.subjectTelecommunication
dc.subjectSwitching systems
dc.subjectAd-hoc networks
dc.subjectmobile networks
dc.subjectMobile ad-hoc networks
dc.subjectComputer network protocols
dc.subjectInternetworking
dc.subjectTelecommunication
dc.subjectData transmission systems
dc.subjectMobile computing
dc.subjectMobile communication systems
dc.classification.ddc621.38212 SAT
dc.titleAnalysis of address allocation protocols for mobile ad hoc networks
dc.typeDissertation
dc.degreeM. Tech
dc.student.id200911003
dc.accession.numberT00307
Appears in Collections:M Tech Dissertations

Files in This Item:
File Description SizeFormat 
200911003.pdf
  Restricted Access
494.95 kBAdobe PDFThumbnail
View/Open Request a copy


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