Analysis of link error effects in MANET address autoconfiguration protocols

This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, Pe. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed by WDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

[1]  Kevin C. Almeroth,et al.  Real-world environment models for mobile network evaluation , 2005, IEEE Journal on Selected Areas in Communications.

[2]  Jorma T. Virtamo,et al.  Spatial node distribution of the random waypoint mobility model with applications , 2006, IEEE Transactions on Mobile Computing.

[3]  Martina Zitterbart,et al.  Mobile ad hoc networks - current approaches and future directions , 2004, IEEE Network.

[4]  Zygmunt J. Haas,et al.  Ad Hoc mobility management with uniform quorum systems , 1999, TNET.

[5]  Anthony G. Constantinides,et al.  A fast recursive shortest spanning tree for image segmentation and edge detection , 1997, IEEE Trans. Image Process..

[6]  Azzedine Boukerche,et al.  An Efficient Synchronization Scheme of Multimedia Streams in Wireless and Mobile Systems , 2002, IEEE Trans. Parallel Distributed Syst..

[7]  Xiaoyan Hong,et al.  Scalable routing protocols for mobile ad hoc networks , 2002, IEEE Netw..

[8]  K. Sohraby,et al.  A Generalized Random Mobility Model for Wireless Ad Hoc Networks and Its Analysis: One-Dimensional Case , 2007, IEEE/ACM Transactions on Networking.

[9]  Stuart Cheshire,et al.  Dynamic Configuration of IPv4 Link-Local Addresses , 2005, RFC.

[10]  Chien-Chung Shen,et al.  CLTC: a cluster-based topology control for ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[11]  Thomas Narten,et al.  IPv6 Stateless Address Autoconfiguration , 1996, RFC.

[12]  Jong-Moon Chung,et al.  Message Complexity Analysis of Mobile Ad Hoc Network Address Autoconfiguration Protocols , 2008, IEEE Transactions on Mobile Computing.

[13]  Byung-Jae Kwak,et al.  A mobility measure for mobile ad hoc networks , 2003, IEEE Communications Letters.

[14]  Charles E. Perkins,et al.  IP Address Autoconfiguration for Ad Hoc Networks , 2001 .

[15]  Jung-Soo Park,et al.  Auto-Networking Technologies for IPv6 Mobile Ad Hoc Networks , 2004, ICOIN.

[16]  Nitin H. Vaidya,et al.  Weak duplicate address detection in mobile ad hoc networks , 2002, MobiHoc '02.

[17]  Kilian Weniger,et al.  PACMAN: passive autoconfiguration for mobile ad hoc networks , 2005, IEEE Journal on Selected Areas in Communications.

[18]  Ravi Prakash,et al.  IP address assignment in a mobile ad hoc network , 2002, MILCOM 2002. Proceedings.

[19]  Yan Shi,et al.  Relative degree adaptive flooding broadcast algorithm for ad hoc networks , 2005, IEEE Transactions on Broadcasting.

[20]  Mukesh Singhal,et al.  A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems , 2001, IEEE Trans. Parallel Distributed Syst..

[21]  Bernard Harris,et al.  Graph theory and its applications , 1970 .

[22]  Ravi Prakash,et al.  MANETconf: configuration of hosts in a mobile ad hoc network , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[23]  Lionel M. Ni,et al.  Prophet address allocation for large scale MANETs , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[24]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..