Authors: Jang-Ping Sheu, Shin-Chih Tu, Li-Hsiang Chan
Addresses: Department of Computer Science, National Tsing Hua University, Hsinchu, 30013, Taiwan, ROC. ' Department of Computer Science and Information Engineering, National Central University, Jhongli, 32054, Taiwan, ROC. ' Department of Computer Science and Information Engineering, National Central University, Jhongli, 32054, Taiwan, ROC
Abstract: In this paper, we present a scheme to assign IP address to each newly-joined node. First, some nodes are selected as coordinators. Then a new node will use the exchanged hello messages to find the closest coordinator and obtain a new IP address from that coordinator. In order to efficiently maintain the IP-address pools, the distributed coordinators are organised in a tree topology by exchanging hello messages. Simulation results show that our proposed scheme has a low latency for obtaining a new IP address and that it can efficiently maintain consistent IP-address pools.
Keywords: wireless networks; ad hoc networks; IP address assignment; distributed assignment; simulation.
International Journal of Ad Hoc and Ubiquitous Computing, 2008 Vol.3 No.1, pp.10 - 20
Published online: 08 Dec 2007 *Full-text access for editors Access for subscribers Purchase this article Comment on this article