ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Design of a backup network for catastrophe scenarios
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Research on IPv6 address configuration for wireless sensor networks
International Journal of Network Management
A lightweight stateful address autoconfiguration for 6LoWPAN
Wireless Networks
Hierarchical and low-power IPv6 address configuration for wireless sensor networks
International Journal of Communication Systems
Research on all-IP communication between wireless sensor networks and IPv6 networks
Computer Standards & Interfaces
| Hi-index | 0.00 |
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 (e.g., 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).