Performance Analysis of an Autoconfiguration Addressing Protocol for Ad Hoc Networks


Autoconfiguration protocols are important in maintaining mobile ad hoc networks (MANETs). In this paper, we present an autoconfiguration protocol called the one-step addressing (OSA) protocol characterized by its simplicity. Mathematical model is developed to evaluate the performance of the proposed protocol. The results of the model, which are validated by the simulation results, show that the OSA protocol outperforms the well-known token-based protocol in terms of both latency and communications overhead.

Share and Cite:

Al-Mahdi, H. , Nassar, H. and El-Aziz, S. (2013) Performance Analysis of an Autoconfiguration Addressing Protocol for Ad Hoc Networks. Journal of Computer and Communications, 1, 33-40. doi: 10.4236/jcc.2013.14006.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] C., Perkins, “Ad Hoc Networking,” Addison-Wesley, Upper Saddle River, 2001.
[2] S. Nesargi and R. Prakash, “MANET Conference: Configuration of Hosts in a Mobile Ad Hoc Network,” Proceedings of the 21st Annual Joint Conference of IEEE Conference on Computer Communication (INFOCOM’ 02), New York, June 2002, pp. 206-216.
[3] A. Yousef, H. Al-Mahdi, M. Kalil, and A. Mitschele-Thiel, “LHA: Logical Hierarchical Addressing Protocol for Mobile Ad-Hoc Networks,” 10th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2007), Chania, 22-26 October 2007.
[4] S. Kim, J. Lee and I. Yeom, “Modeling and Performance Analysis of Address Allocation Schemes for Mobile Ad Hoc Networks,” IEEE Transactions on Vehicular Technology, Vol. 57, No. 11, 2007, pp. 490-501.
[5] H. Zhou, L. Ni and M. Mutka, “Prophet Address Allocation for Large Scale MANETs,” Infocom, 2003.
[6] C. Perkins, J. Malinen, R. Wakikawa, E. Royer and Y. Sun, “IP Address Auto-configuration for Ad Hoc Networks,” IETF Internet Draft, 2001.
[7] N. H. Vaidya, “Weak duplicate address detection in mobile ad hoc networks,” ACM International Symposium on Mobile Ad Hoc Networking and Computing, Boston-Massachusetts, 9-11 June 2002, pp. 206-216.
[8] K. Weniger, “Passive Duplicate Address Detection in Mobile Ad Hoc Networks,” Proceedings of IEEE WCNC 2003, New Orleans, March 2003.
[9] C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile Computers,” Proceedings of the SIGCOM’94 Conference on Communications Architecture, Protocols and Applications, London, August 1994, pp. 234-244.
[10] C. Perkinsand and E. Royer, “Ad-hoc On-Demand Distance Vector Routing,” Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA’99), New Orleans, February 1999, pp. 90-100.
[11] D. Johnson and D. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” In: T. Imielinski and H. F. Korth, Eds., Mobile Computing, Chapter 5, Kluwer Academic Publishers, New York, 1996, pp. 153,181,
[12] A. M. Law and W. D. Kelton, “Simulation Modeling and Analysis,” Third Edition, Mc. Graw Hill, New York, 2002.
[13] H. Nassar and H. Al Mahdi, “Queueing Analysis of an ATM Multimedia Multiplexer with Nonpreemptive Priority,” IEEE Proceedings on Communications, Vol. 150, No. 3, 2003, pp. 189-196.
[14] M. G. Giri, “Introduction to Probability and Statistics,” 2nd Edition, Marcel Dekker, New York, 1993.
[15] G. Gross and C. Harris, “Fundamentals of Queueing Theory,” John Wiley, New York, 1985.

Copyright © 2023 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.