Optimistic dynamic address allocation for large scale MANETs

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In order to allow truly spontaneous and infrastructureless networking, the autoconfiguration algorithm of the mobile node addresses is important in the practical usage of most MANETs, The traditional methods such as DHCP can not be extended to MANETs because MANETs may operate in a stand-alone fashion and their topologies may change rapidly and unpredictably, The diversified schemes have been proposed to solve this problem, Some of them apply Duplicate Address Detection (DAD) algorithms to autoconfigure the address for each node in a MANET, However, the multi-hop broadcast used by DAD results in high communication overhead. Therefore, a new autoconfiguration algorithm is proposed in this article, which combines the enhanced binary split idea of Dynamic Address Allocation Protocol (DAAP) and the pseudo-random algorithm to construct the interface ID of IPv6 address. The allocation process is distributed and do not rely on the multi-hop broadcast, so our algorithm can be suitable for large scale MANETs through our simulation study. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Li, L., & Xu, X. (2005). Optimistic dynamic address allocation for large scale MANETs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3794 LNCS, pp. 794–803). https://doi.org/10.1007/11599463_77

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free