Message complexity analysis of mobile ad hoc network address autoconfiguration protocols

Sang Chul Kim, Jong Moon Chung

Research output: Contribution to journalArticle

40 Citations (Scopus)

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). 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).

Original languageEnglish
Pages (from-to)358-371
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume7
Issue number3
DOIs
Publication statusPublished - 2008 Mar 1

Fingerprint

Mobile ad hoc networks
Network protocols
Merging
Joining
Wireless networks
Throughput
Data storage equipment
Chemical analysis

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{7df890a238544a3689a5bf580f520b95,
title = "Message complexity analysis of mobile ad hoc network address autoconfiguration protocols",
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). 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).",
author = "Kim, {Sang Chul} and Chung, {Jong Moon}",
year = "2008",
month = "3",
day = "1",
doi = "10.1109/TMC.2007.70730",
language = "English",
volume = "7",
pages = "358--371",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

Message complexity analysis of mobile ad hoc network address autoconfiguration protocols. / Kim, Sang Chul; Chung, Jong Moon.

In: IEEE Transactions on Mobile Computing, Vol. 7, No. 3, 01.03.2008, p. 358-371.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Message complexity analysis of mobile ad hoc network address autoconfiguration protocols

AU - Kim, Sang Chul

AU - Chung, Jong Moon

PY - 2008/3/1

Y1 - 2008/3/1

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=38549085586&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38549085586&partnerID=8YFLogxK

U2 - 10.1109/TMC.2007.70730

DO - 10.1109/TMC.2007.70730

M3 - Article

AN - SCOPUS:38549085586

VL - 7

SP - 358

EP - 371

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 3

ER -