Abstract
In a mobile ad-hoc network (MANET), in order to route a packet between any nodes, nodes should have their unique IP address in the network. In our previous work, we introduced and compared three IP assignment mechanisms, namely RADA, LiA, and LiACR. In RADA, a randomly-selected IP address in a specified address space is assigned to a joining node, which results in poor utilization of the address space with a great deal of address conflict. LiA allows a joining node to be assigned to the current maximum address + 1, that is, linearly from the address space. Although LiA utilizes the address space better, it takes a long time to complete address assignments due to address conflict in case that several joining nodes require the same IP address. LiACR allows simultaneously joining nodes to have their IP addresses according to the node ID-based order. However, it relies on reliable exchange of control messages in the wireless network. Since broadcasting is inherently unreliable, we therefore propose an enhanced version of the LiACR protocol, called E-LiACR, which copes with the unreliable broadcasting through the help of neighbor nodes. Through ns-2 simulations, we show that E-LiACR performs better than LiACR in terms of IP address allocation time, number of address conflicts, and control message overhead.
This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2005-003-D00295).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Internet Engineering Task Force, Mobile Ad-hoc Networks (manet) Working Group Charter, http://www.ietf.org/html.charters/manet-charter.html
Perkins, C., Belding-Royer, E., Das, S.: Ad hoc On-demand Distance Vector (AODV) routing, RFC 3561, IETF (July 2003)
Clausen, T., Jaquet, P.: Optimized Link State Routing Protocol (OLSR), RFC 3626, IETF (October 2003)
Internet Engineering Task Force, Ad-hoc Network Autoconfiguration (autoconf) Working Group Charter, http://www.ietf.org/html.charters/autoconf-charter.html
Choi, N., Toh, C.-K., Seok, Y., Kim, D., Choi, Y.: Random and Linear Address Allocation for Mobile Ad Hoc Netwokrs. In: IEEE Wireless Communications and Networking Conference (WCNC 2005), New Orleans, USA (March 2005)
VINT Group, UCB/LBNL/VINT Network Simulator ns (version 2), http://www.isi.edu/nsnam/ns
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joung, U., Kim, D., Choi, N., Toh, C.K. (2008). An Efficient Address Assignment Mechanism for Mobile Ad-Hoc Networks. In: Vazão, T., Freire, M.M., Chong, I. (eds) Information Networking. Towards Ubiquitous Networking and Services. ICOIN 2007. Lecture Notes in Computer Science, vol 5200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89524-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-89524-4_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89523-7
Online ISBN: 978-3-540-89524-4
eBook Packages: Computer ScienceComputer Science (R0)