Message Complexity Analysis of MANET Address Autoconfiguration-Single Node Joining Case 


Vol. 32,  No. 5, pp. 257-269, May  2007


PDF
  Abstract

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). To obtain the upper bound of the message complexity of the protocols, the O-notation of a MANET group of N nodes has been applied. The message complexity of the single node joining case in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived as n(mO(N)+O(t)), n(O(N)+O(t)), n(O(N)+2O(t)), and nO((t+1)N)+O(N)+O(2) respectively. In order to verify the bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different conflict probabilities are conducted.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Kim, "Message Complexity Analysis of MANET Address Autoconfiguration-Single Node Joining Case," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 5, pp. 257-269, 2007. DOI: .

[ACM Style]

Sang-Chul Kim. 2007. Message Complexity Analysis of MANET Address Autoconfiguration-Single Node Joining Case. The Journal of Korean Institute of Communications and Information Sciences, 32, 5, (2007), 257-269. DOI: .

[KICS Style]

Sang-Chul Kim, "Message Complexity Analysis of MANET Address Autoconfiguration-Single Node Joining Case," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 5, pp. 257-269, 5. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880