Analysis of Link Error Effects in MANET Address Autoconfiguration Protocols

다국어 초록 (Multilingual Abstract)

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
byWDO, 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.

참고문헌 (Reference)

1 N. H. Vaidya, "Weak duplicate address detection in mobile ad hoc networks" 206-216,

2 E. Hyytia, "Spatial node distribution of therandom waypoint mobility model with applications" 5 (5): 18-32, 2006

3 X. Hong, "Scalable routing protocol for mobile adhoc networks" 16 (16): 11-21, 2002

4 M. Sheng, "Relative degree adaptive flooding broadcastalgorithm for ad hoc networks" 51 (51): 216-222, 2005

5 A. P. Jardosh, "Realworldenvironment models for mobile network evaluation" 23 (23): 622-632, 2005

6 H. Zhou, "Prophet address allocation for largescale MANETs" 1 (1): 423-434, 2003

7 K. Weniger, "PACMAN: Passive autoconfiguration for mobile ad hoc networks" 23 (23): 507-519, 2005

8 S.-C. Kim, "Message complexity analysis of mobile adhoc network address autoconfiguration protocols" 7 (7): 358-371, 2008

9 S. Nesargi, "MANETconf: Configuration of hosts in amobile ad hoc network" 2002

10 S. Thomson, "IPv6 stateless address autoconfiguration" IETF 1998

11 C. E. Perkins, "IPaddress autoconfiguration for ad hoc networks" IETF draft 2001

12 M. Moshin, "IP address assignment in a mobile ad hocnetwork" 856-861, 2002

13 J. Gross, "Graph Theory and Its Applications" CRC 1998

14 S. Cheshire, "Dynamic configuration of IPv4 link-local address" The Internet Society 2005

15 C.-C. Shen, "CLTC: A cluster-based topology control framework for ad hocnetworks" 3 (3): 18-32, 2004

16 J. Jeong, "Auto-networking technologies for IPv6mobile ad hoc networks" 257-267, 2004

17 A. Boukerche, "An efficient synchronizationscheme of multimedia streams in wireless and mobile systems" 13 (13): 911-923, 2002

18 K. Weniger, "Address autoconfiguration in mobile adhoc networks: Current approaches and future directions" 18 (18): 6-11, 2004

19 Z. J. Haas, "Ad hoc mobility management with uniform quorumsystems" 7 (7): 228-240, 1999

20 A. B. McDonald, "A mobility-based framework for adaptiveclustering in wireless ad hoc networks" 17 (17): 1466-1487, 1999

21 B.-J.Kwak, "A mobility measure for mobilead hoc networks" 7 (7): 379-381, 2003

22 D. N. Alparslan, "A generalized random mobility modelfor wireless ad hoc networks and its analysis one-dimensional case" 15 (15): 602-615, 2007

23 S. H. Kwok, "A fast recursive shortest spanningtree for image segmentation and edge detection" 6 (6): 328-332, 1997

24 G. Cao, "A delay-optimal quorum-based mutual executionalgorithm for distributed systems" 12 (12): 1256-1268, 2001