| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
16 February 2025 |
|
| | | |
|
Article overview
| |
|
Dynamic Address Allocation Algorithm for Mobile Ad hoc Networks | Akshay Khatri
; Sankalp Kolhe
; Nupur Giri
; | Date: |
2 May 2016 | 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 protocols which use
topology information to route messages in the network. Our solution is designed
with scalability in mind such that the cost of address assignment to a new node
is independent of the number of nodes in the network. | Source: | arXiv, 1605.0398 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|