The Experts below are selected from a list of 1158 Experts worldwide ranked by ideXlab platform
Yunze Cai - One of the best experts on this subject based on the ideXlab platform.
-
domain based Autoconfiguration framework for large scale manets
Communications and Mobile Computing, 2009Co-Authors: Yunze CaiAbstract:IP Autoconfiguration of the mobile node addresses is important in the practical usage of most mobile ad hoc networks (MANETs). This paper proposes domain-based Autoconfiguration framework (DACF), a novel approach for the efficient address Autoconfiguration of MANETs. To construct a hierarchy of addresses, this framework defines a loose domain structure where nodes in the same domain may roam to different locations after they are configured. This framework uses the passive Duplicate Address Detection(PDAD) but the proposed domain structure is able to reduce the initial conflict probability and accelerate the conflict resolution significantly. To evaluate the correctness and efficiency of the proposed framework, we also present an exemplified full-functioned implementation of the proposed framework. Through the detailed analysis and simulation, we believe the proposed scheme provides a promising Autoconfiguration framework for large-scale MANETs. Copyright © 2008 John Wiley & Sons, Ltd.
-
cluster based Autoconfiguration for mobile ad hoc networks
Wireless Personal Communications, 2009Co-Authors: Yunze CaiAbstract:IP address Autoconfiguration of mobile nodes is highly desirable in the practical usage of most mobile ad hoc networks (MANETs). This paper proposes cluster-based Autoconfiguration, a novel approach for the efficient address Autoconfiguration of MANETs. The cluster structure derived from clustering techniques is used to manage address assignment and conflict resolution. By introducing the concept of virtual address agents (AAs), the proposed approach can be applicable to many existing clustering protocols. Finally, analysis and simulation demonstrate that the proposed scheme outperforms the previous Autoconfiguration approaches.
-
spanning tree based Autoconfiguration for mobile ad hoc networks
Wireless Personal Communications, 2007Co-Authors: Yunze CaiAbstract:In order to allow truly spontaneous and infrastructureless networking, Autoconfiguration algorithm is needed in the practical usage of most mobile ad hoc networks (MANETs). This paper presents spanning-tree based Autoconfiguration for mobile ad hoc networks, a novel approach for the efficient distributed address Autoconfiguration. With the help of the spanning tree, the proposed scheme attempts to distribute address resources as balanced as possible at the first beginning. Since each node holds a block of free addresses, a newly joining node can obtain a free address almost immediately. Subnet partitioning and merging are well supported. Finally, analysis and simulation demonstrate that our algorithm outperforms the existing approaches in terms of both communication overhead and configuration latency.
-
agent based passive Autoconfiguration for large scale manets
Wireless Personal Communications, 2007Co-Authors: Yunze CaiAbstract:The Autoconfiguration algorithm of the mobile node addresses is important in the practical usage of most mobile ad hoc networks (MANETs). The passive Duplicate Address Detection (PDAD) protocols can detect address conflicts in a passive manner and thus have very low protocol overhead. However, the blindly random assignment algorithm used in PDAD leads to a high initial conflict probability. In this paper, we propose a novel concept of address agent, based on which arises a novel Autoconfiguration approach, to obtain the least address conflict probability. Most features of PDAD are inherited, e.g., address conflicts are still detected in a passive manner based on anomalies in routing protocol traffic. Analysis and simulation show that our algorithm outperforms existing methods.
-
gradient based Autoconfiguration for hybrid mobile ad hoc networks
Lecture Notes in Computer Science, 2006Co-Authors: Yunze CaiAbstract:Autoconfiguration for mobile nodes is an important problem in hybrid mobile ad hoc networks (MANETs) where pure MANETs are interconnected to the external Internet. The Dynamic Configuration and Distribution Protocol (DCDP) is an efficient approach, which extends DHCP to a stateless Autoconfiguration protocol for wired and wireless networks. However, the distribution randomness in the DCDP results in an unbalanced distribution of address resources, which wastes the limited network address space and, subsequently, incurs scalability problems. In this paper, we propose a new approach, which can implement a more balanced distribution of address resources than DCDP. As the address distribution process continues, almost every node holds address resources. Thus, a new node can obtain its address almost immediately, when it joins the network. Finally, the simulation shows that the proposed scheme outperforms the existing algorithms.
Zhong Fan - One of the best experts on this subject based on the ideXlab platform.
-
an address Autoconfiguration protocol for ipv6 hosts in a mobile ad hoc network
Computer Communications, 2005Co-Authors: Zhong Fan, Siva SubramaniAbstract:A mobile ad hoc network is an infrastructure-free wireless network that is built on the fly. Since central administration or configuration by the users is impractical in such networks, Autoconfiguration of network nodes is highly desirable. In this paper, we propose an approach to IPv6 address Autoconfiguration in ad hoc networks, where we apply the IPv6 Stateless Address Autoconfiguration Protocol and Neighbour Discovery Protocol to the context of ad hoc networks. It overcomes some of the limitations of existing protocols. In particular, we consider the scenarios of network partitioning and merging. A distributed scheme for duplicate address detection is also discussed. We evaluate the performance of our solution through simulation experiments.
-
ipv6 stateless address Autoconfiguration in ad hoc networks
Lecture Notes in Computer Science, 2003Co-Authors: Zhong FanAbstract:A mobile ad hoc network is an infrastructure-free wireless network that is built on the fly. Since central administration or configuration by the users is impractical in such networks, Autoconfiguration of network nodes is highly desirable. In this paper, we propose an approach to IPv6 address Autoconfiguration in ad hoc networks, where we apply the IPv6 Stateless Address Autoconfiguration Protocol and Neighbor Discovery Protocol to the context of ad hoc networks. It overcomes some of the limitations of existing protocols. In particular, we consider the scenarios of network partitioning and merging. A distributed scheme for duplicate address detection is also discussed.
Sangchul Kim - One of the best experts on this subject based on the ideXlab platform.
-
message complexity analysis of manet address Autoconfiguration algorithms in group merging case
International Conference on Conceptual Structures, 2007Co-Authors: Sangchul KimAbstract:This paper focuses on the derivation of the message complexity when two mobile ad hoc network (MANET) groups merge together, where the network groups already have been configured with IP addresses by using address Autoconfiguration protocols (AAPs). The message complexity of the MANET group merging case (GMC) in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived respectively. In order to verify the derived bounds, analytical simulations that quantify the message complexity of the address Autoconfiguration process based on the different conflict probabilities are conducted.
-
message complexity analysis of manet address Autoconfiguration single node joining case
The Journal of Korean Institute of Communications and Information Sciences, 2007Co-Authors: Sangchul KimAbstract: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.
Kilian Weniger - One of the best experts on this subject based on the ideXlab platform.
-
building an ip based community wireless mesh network assessment of pacman as an ip address Autoconfiguration protocol
Computer Networks, 2010Co-Authors: Carlos J Bernardos, Ignacio Soto, Maria Calderon, Ana Beatriz Solana, Kilian WenigerAbstract:Wireless mesh networks are experiencing rapid progress and inspiring numerous applications in different scenarios, due to features such as Autoconfiguration, self-healing, connectivity coverage extension and support for dynamic topologies. These particular characteristics make wireless mesh networks an appropriate architectural basis for the design of easy-to-deploy community or neighbourhood networks. One of the main challenges in building a community network using mesh networks is the minimisation of user intervention in the IP address configuration of the network nodes. In this paper we first consider the process of building an IP-based mesh network using typical residential routers, exploring the options for the configuration of their wireless interfaces. Then we focus on IP address Autoconfiguration, identifying the specific requirements for community mesh networks and analysing the applicability of existing solutions. As a result of that analysis, we select PACMAN, an efficient distributed address Autoconfiguration mechanism originally designed for ad-hoc networks, and we perform an experimental study - using off-the-shelf routers and assuming worst-case scenarios - analysing its behaviour as an IP address Autoconfiguration mechanism for community wireless mesh networks. The results of the conducted assessment show that PACMAN meets all the identified requirements of the community scenario.
-
pacman passive Autoconfiguration for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications, 2005Co-Authors: Kilian WenigerAbstract:Mobile ad hoc networks (MANETs) enable the communication between mobile nodes via multihop wireless routes without depending on a communication infrastructure. In contrast to infrastructure-based networks, MANET's support autonomous and spontaneous networking and, thus, should be capable of self-organization and -configuration. This paper presents passive Autoconfiguration for mobile ad hoc network (PACMAN), a novel approach for the efficient distributed address Autoconfiguration of mobile ad hoc networks. Special features of PACMAN are the support for frequent network partitioning and merging, and very low protocol overhead. This is accomplished by using cross-layer information derived from ongoing routing protocol traffic, e.g., address conflicts are detected in a passive manner based on anomalies in routing protocol traffic. Furthermore, PACMAN assigns Internet protocol (IP) addresses in a way that enables their compression, which can significantly reduce the routing protocol overhead. The performance of PACMAN is analyzed in detail based on various simulation results.
-
IPv6 Autoconfiguration in Large Scale Mobile Ad-Hoc Networks
2002Co-Authors: Kilian Weniger, Martina ZitterbartAbstract:Mobile ad-hoc networks are infrastructure-free, highly dynamic wireless networks, where central administration or configuration by the user is impractical. The Internet Protocol IPv6 defines mechanisms to autoconfigure interfaces of nodes in wired networks in a distributed manner. In this paper, the applicability of IPv6 Stateless Address Autoconfiguration and IPv6 Neighbor Discovery Protocol to large scale mobile ad-hoc networks is investigated. A hierarchical approach based on so-called leader nodes is proposed together with a leader election algorithm. Address Autoconfiguration with IPv6 in very dynamic ad-hoc networks requires special support as, for example, outlined within this paper. Extensions to the IPv6 Neighbor Discovery Protocol are proposed to enable an efficient and scalable usage in ad-hoc networks
Hojung Cha - One of the best experts on this subject based on the ideXlab platform.
-
Spectrum: Lightweight hybrid address Autoconfiguration protocol based on virtual coordinates for 6LoWPAN
IEEE Transactions on Mobile Computing, 2012Co-Authors: Hyojeong Shin, Elmurod Talipov, Hojung ChaAbstract:Stateless address Autoconfiguration protocols allow nodes to select addresses and validate the uniqueness of a selected address by duplicate address detection (DAD). The considerable cost of DAD results from the message complexity increase in multihop network topologies, such as wireless sensor networks. This paper proposes a lightweight, hybrid address Autoconfiguration protocol, called Spectrum, that deploys IPv6-compatible addresses into 6LoWPAN networks in a distributed manner. Spectrum creates the virtual coordinate system on the network and deploys addresses based on the location of the nodes. The deployment policy based on the virtual locations of the nodes reduces the DAD cost in the initial configuration as well as the cost for additional configurations of newly arrived nodes. The authors implemented and tested the proposed scheme in a real environment. Simulations and experiments confirmed a reasonable message cost for both stateful and stateless Autoconfigurations.
-
A lightweight stateful address Autoconfiguration for 6LoWPAN
Wireless Networks, 2011Co-Authors: Elmurod Talipov, Hyojeong Shin, Seungjae Han, Hojung ChaAbstract:Sensor networks have become increasingly important in various areas, and most current applications require connectivity between sensor networks and the Internet. By being seamlessly integrated into IP network infrastructure, sensor network applications would benefit from standardized and established technology, as well as from the plethora of readily available applications. Preparing sensor networks for IP communication and integrating them into the IP network, however, present new challenges on the architecture and its functional blocks, e.g., the adaptation of the respective link technology for IP support, development of security mechanisms, and Autoconfiguration to support ad hoc deployment. In this paper, we focus on the IPv6 address Autoconfiguration issue and propose a proxy-based Autoconfiguration protocol. The proposed protocol guarantees the assignment of a unique address to each node in the network. The protocol is simulated and implemented on off-the-shelf sensor network platforms. The experiment results show that our mechanism outperforms similar network address configuring mechanisms in terms of latency and overhead.
-
ipv6 lightweight stateless address Autoconfiguration for 6lowpan using color coordinators
IEEE International Conference on Pervasive Computing and Communications, 2009Co-Authors: Hyojeong Shin, Elmurod Talipov, Hojung ChaAbstract:As resource-constrained network technology develops, such as wireless sensor networks, connectivity to an IP-based network has become an important requirement. Assigning the global unique address to network nodes is a prerequisite to the connectivity to the IP-based networks. Since conventional address Autoconfiguration protocols require high network bandwidth and management cost, they are not suitable for wireless sensor networks. In this paper, we propose a lightweight address Autoconfiguration mechanism for resource-constrained networks. The proposed algorithm uses three coordinators that assign geometric information to the network to remove the assumption that each node has location information. Each node gathers the hop distance from the coordinators and generates a unique address based on the location information. The proposed algorithm is implemented with real hardware, and the performance is evaluated. The result shows that the mechanism efficiently assigns unique addresses to sensor nodes.
