Please use this identifier to cite or link to this item: http://drsr.daiict.ac.in//handle/123456789/253
Title: Analysis of address allocation protocols for mobile ad hoc networks
Authors: Srivastava, Sanjay
Sheth, Kavan J.
Keywords: Telecommunication
Switching systems
Ad-hoc networks
mobile networks
Mobile ad-hoc networks
Computer network protocols
Internetworking
Telecommunication
Data transmission systems
Mobile computing
Mobile communication systems
Issue Date: 2009
Publisher: Dhirubhai Ambani Institute of Information and Communication Technology
Citation: Sheth, Kavan J. (2009). Analysis of address allocation protocols for mobile ad hoc networks. Dhirubhai Ambani Institute of Information and Communication Technology, viii, 71 p. (Acc.No: T00216)
Abstract: In 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.
URI: http://drsr.daiict.ac.in/handle/123456789/253
Appears in Collections:M Tech Dissertations

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


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