Message Complexity Analysis of Mobile Ad Hoc Network Address Autoconfiguration Protocols

This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs). The original publications on the AAPs had incomplete parts, making them insufficient to use on practical MANETs. Therefore, the first objective of the research was to complete the AAPs by filling in the missing gaps to make them operational. The missing procedures that were filled in have been developed based on the most logical procedures being accurate to the original protocol publications. The research in this paper finds applications in wireless networks that apply reduced addresses to achieve less memory usage, smaller overhead, and higher throughput (for example, the IPv6 low-power wireless personal address network (6LoWPAN)), but, as a result, possess a high address duplication probability. This research consists of two cases, where the first case deals with the message complexity analysis of the single-node joining case (SJC) and the second case deals with the complexity analysis of the MANET group merging case (GMC).

[1]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

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

[3]  Lionel M. Ni,et al.  Prophet address allocation for large scale MANETs , 2003, Ad Hoc Networks.

[4]  Elizabeth M. Belding-Royer,et al.  A study of dynamic addressing techniques in mobile ad hoc networks , 2004, Wirel. Commun. Mob. Comput..

[5]  Mario Gerla,et al.  Mobility management in hierarchical multi-hop mobile wireless networks , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

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

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

[8]  Xiaoyan Hong,et al.  LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

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

[10]  Xiaoyan Hong,et al.  LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility , 1988, MobiHoc.

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

[12]  Atsushi Iwata,et al.  Scalable routing strategies for ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..

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

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

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

[16]  David A. Maltz,et al.  The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4 , 2007, RFC.

[17]  Kilian Weniger,et al.  Passive duplicate address detection in mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[18]  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).

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

[20]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[21]  Fred L. Templin,et al.  Topology Broadcast based on Reverse-Path Forwarding (TBRPF) , 2000 .

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

[23]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[24]  Ram Ramanathan,et al.  Making link-state routing scale for ad hoc networks , 2001, MobiHoc '01.

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

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

[27]  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.

[28]  Mario Gerla,et al.  Fisheye State Routing in Mobile Ad Hoc Networks , 2000, ICDCS Workshop on Wireless Networks and Mobile Computing.

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

[30]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[31]  Richard G. Ogier,et al.  A reliable, efficient topology broadcast protocol for dynamic networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).