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 language | English |
|---|---|
| Pages (from-to) | 358-371 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Mobile Computing |
| Volume | 7 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2008 Mar |
Bibliographical note
Funding Information:The authors appreciate the anonymous reviewers for their many helpful comments. This research was supported by the Ministry of Information and Communication (MIC), Korea, under the Information Technology Research Center (ITRC) program of the Institute of Information Technology
All Science Journal Classification (ASJC) codes
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering