• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.257-269
• /
• 2007

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 coflict probabilities are conducted.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.84-93
• /
• 2009

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, $P_e$. 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.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.897-904
• /
• 2006

In large-scale MANETs, the performance of MANET routing protocols is degraded significantly. To avoid this, zone-based hierarchical architecture is proposed. In this architecture, single large-scale MANET is divided into multiple small-scale MANETs. In this paper, we propose autoconfiguration-coupled MANET routing protocol to reduce routing overhead of mim user nodes. If MANET routing protocol utilizes the autoconfigured information of each user node, its overhead or procedure can be reduced. Proposed method shows the degradation of routing overhead of user nodes via simulation.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.809-816
• /
• 2005

MANET(mobile ad hoc network) cn be one of the access networks of BcN(broadband convergence network), and an user node requires address auto-configuration protocol for mu14i-hop environment. Some address auto-configuration protocols are proposed for independent MANET, but they don't consider BcN-accessable MANET environment. In this paper, new address auto-configuration protocol for wireless nodes is proposed. With this proposal, they ran configure their global addresses automatically in hybrid MANETs as BcN access networks. The autoconfiguration protocol modifies IPv6 NDP(neighbor discovery protocol) messages to deliver global prefix information to all wireless nodes, and avoids message boradcasting to minimize network overhead.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.282-291
• /
• 2008

This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1441-1451
• /
• 2015

As one of the most spotlighted research areas, these days, the Internet of Things (IoT) aims to provide users with various services through many devices. Since there exist so many devices in IoT environments, it is inefficient to manually configure the domain name system (DNS) names of such devices. Thus, for IPv6-based IoT environments, this paper proposes a scheme called the DNS Name Autoconfiguration (DNSNA) that autoconfigures an IoT device's DNS name and manages it. In the procedure for generating and registering an IoT device's DNS name, the standard protocols of the Internet Engineering Task Force (IETF) are used. Since the proposed scheme resolves an IoT device's DNS name into an IPv6 address in unicast through a DNS server, it generates less traffic than multicast-based mDNS (Multicast DNS) which is a legacy DNS application for the DNS name service in the smart home. Thus, the proposed scheme is more appropriate in multi-hop IoT networks than mDNS. This paper explains the design of the proposed scheme and its service scenarios, such as smart home and smart road. It also explains the implementation and testing of the proposed scheme in the smart grid.