High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Performance Analysis for Node Auto Addressing in Mobile Ad Hoc Networks


Mr.S. Mohanalingam , 2RatnaVel Subramaniam College of Engineering & Technology, Dindigul ; Mr.D.Bright Anand M.Tech., (Ph.D)., 2RatnaVel Subramaniam College of Engineering & Technology, Dindigul ; Mrs.S,Priya., M.Tech., , Assistant Professor .,G.Tech Engg College


Mobile Ad Hoc Networks, Dynamic Bloom Filters (DBF) , Auto Addressing , IPv6 , Proposed Approach.


The key challenge in ad hoc networks is the Address assignment, due to the lack of infrastructure. A distributed and self-managed mechanism, to avoid address collisions in a dynamic network with fading channels, joining/leaving of nodes, and frequent partitions, require in an autonomous addressing protocols. A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership queries. It has great potential for distributed applications where systems need to share information about what resources they have. The space efficiency is achieved at the cost of a small probability of false positive in membership queries. However, for many applications the space savings and short locating time consistently outweigh this drawback. This paper introduces Dynamic Bloom Filters (DBF) to support concise representation and approximate membership queries of dynamic sets, and study the false positive probability and union algebra operations. It proves that DBF can control the false positive probability at a low level by adjusting the number of standard bloom filters used according to the actual size of current dynamic set. The space complexity is also acceptable if the actual size of dynamic set does not deviate too much from the predefined threshold. Thus this paper propose and analyze a dynamic bloom filter based addressing that configures mobile ad hoc nodes based on a distributed address database stored in filters that reduces the control load and makes the proposal robust to packet losses and network partitions. And also it evaluates the performance of the protocol, considering joining nodes, partition merging events, and network initialization. Simulation results show that the Dynamic Bloom Filter resolves all the address collisions and also reduces the control traffic when compared to previously proposed protocols.

Other Details

Paper ID: IJSRDV2I4046
Published in: Volume : 2, Issue : 4
Publication Date: 01/07/2014
Page(s): 67-71

Article Preview

Download Article