Dynamic Address Allocation Algorithm for Mobile Ad hoc Networks
Akshay Khatri, Sankalp Kolhe, Nupur Giri

TL;DR
This paper introduces a scalable, broadcast-free address allocation algorithm for MANETs that maintains a topology-like IP state, simplifying routing and reducing communication overhead in dynamic networks.
Contribution
It presents a novel address allocation method that avoids network-wide broadcasts and maintains a topology-like IP state, enhancing scalability and routing efficiency.
Findings
Reduces address assignment overhead in large networks
Maintains a topology-like IP state for easier routing
Scales independently of network size
Abstract
A Mobile Ad hoc network (MANET) consists of nodes which use multi-hop communication to establish connection between nodes. Traditional infrastructure based systems use a centralized architecture for address allocation. However, this is not possible in Ad hoc networks due to their dynamic structure. Many schemes have been proposed to solve this problem, but most of them use network-wide broadcasts to ensure the availability of a new address. This becomes extremely difficult as network size grows. In this paper, we propose an address allocation algorithm which avoids network-wide broadcasts to allocate address to a new node. Moreover, the algorithm allocates addresses dynamically such that the network maintains an "IP resembles topology" state. In such a state, routing becomes easier and the overall overhead in communication is reduced. This algorithm is particularly useful for routing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks · Cooperative Communication and Network Coding
