Auto-Configuration Protocols in Mobile Ad Hoc Networks

The TCP/IP protocol allows the different nodes in a network to communicate by associating a different IP address to each node. In wired or wireless networks with infrastructure, we have a server or node acting as such which correctly assigns IP addresses, but in mobile ad hoc networks there is no such centralized entity capable of carrying out this function. Therefore, a protocol is needed to perform the network configuration automatically and in a dynamic way, which will use all nodes in the network (or part thereof) as if they were servers that manage IP addresses. This article reviews the major proposed auto-configuration protocols for mobile ad hoc networks, with particular emphasis on one of the most recent: D2HCP. This work also includes a comparison of auto-configuration protocols for mobile ad hoc networks by specifying the most relevant metrics, such as a guarantee of uniqueness, overhead, latency, dependency on the routing protocol and uniformity

Ad Hoc Networking in the Internet: A Deeper Problem Than It Seems

Self-organized networks, also known as ad hoc networks or MANETs, are expected to soon become important components in the Internet architecture. Numerous efforts currently focus on the accomplishment of scalable and efficient mobile ad hoc routing, an essential piece in order to fully integrate ad hoc networks in the Internet. However, an orthogonal and yet as important issue lies with ad hoc IP autoconfiguration. Indeed, prior to participation in IP communication and routing, a node must acquire IP addresse(s) to configure its interface(s). These IP addresses may be required to be unique within a certain scope and/or topologically "correct". Since nodes may be mobile and neither the set of nodes in the MANET nor their connections to each other is pre-determined, the proper configuration must be detected and acquired automatically. This paper reviews the applicability, in the particular context of MANETs, of standard automatic address configuration and prefix allocation protocols, and identifies the different categories of issues that are not solved by these protocols. The paper then elaborates further on why these issues are more profound than they seem, as they pertain to graph theory and are in fact real scalability and architectural issues for the Internet of tomorrow

Accelerating Service Discovery in Ad-Hoc Zero Configuration Networking

Zero Configuration Networking (Zeroconf) assigns IP addresses and host names, and discovers service without a central server. Zeroconf can be used in wireless mobile ad-hoc networks which are based on IEEE 802.11 and IP. However, Zeroconf has problems in mobile ad-hoc networks as it cannot detect changes in the network topology. In highly mobile networks, Zeroconf causes network overhead while discovering new services. In this paper, we propose an algorithm to accelerate service discovery for mobile ad-hoc networks. Our algorithm involves the monitoring of network interface changes that occur when a device with IEEE 802.11 enabled joins a new network area. This algorithm allows users to discover network topology changes and new services in real-time while minimizing network overhead

IDHOCNET-A Novel Protocol Stack and Architecture for Ad hoc Networks

Presently employed Internet Protocol (IP) stack possesses number of architectural problems. The issues like Dual/Overriding role of IP addresses, mobility, multi-homing etc are the limitations for the infrastructure oriented networks which even have support of Dynamic Host Configuration Protocol (DHCP), Domain Name System (DNS), Network Address Translation (NAT) servers, etc. Such issues are extremely complex to handle in the case of multi-hop wireless ad hoc networks which lack the support of any infrastructure component. The contemporary research direction for the improvement of present Internet architecture mainly focuses on the use of real identifiers instead of IP addresses for host identification in the network. However, the proposed architectures mostly discuss the infrastructure oriented network models and minimal research has been conducted in the direction of proposals for ad hoc networks.  In this paper we provide a thorough discussion on the practical usage issues of IP based ad hoc network implementation. In order to resolve the present limitations of ad hoc networks, we describe an implementation of a novel identifier based ad hoc network protocol stack and architecture known as IDHOCNET (Identifier based ad hoc network). The architecture proposes a novel paradigm of identifier based applications for multi-hop wireless ad hoc environment. The proposed system further provides backward compatibility to support co-existence with IP based applications. As a proof of concept, the architecture has been implemented on Linux platform with WiFi interfaces. Various practical scenarios with architectural insight are presented to demonstrate the practicability of the proposed approach

Duplicate address detection and autoconfiguration in OLSR

Mobile Ad hoc NETworks (MANETs) are infrastructure-free, highly dynamic wireless networks, where central administration or configuration by the user is very difficult. In hardwired networks nodes usually rely on a centralized server and use a dynamic host configuration protocol, like DHCP , to acquire an IP address. Such a solution cannot be deployed in MANETs due to the unavailability of any centralized DHCP server. For small scale MANETs, it may be possible to allocate free IP addresses manually. However, the procedure becomes impractical for a large-scale or open system where mobile nodes are free to join and leave. Most of the autoconfiguration algorithms proposed for ad hoc networks are independent of the routing protocols and therefore, generate a significant overhead. Using the genuine optimization of the underlying routing protocol can significantly reduce the autoconfiguration overhead. One of the MANET protocols which have been recently promoted to RFC is the OLSR routing protocol , on which this article focuses. This article aims at complementing the OLSR routing protocol specifications to handle autoconfiguration. The corner stone of this autoconfiguration protocol is an advanced duplicate address detection algorithm. Under well defined assumptions, we prove the correctness of the the proposed autoconfiguration protocol

An Advanced Configuration and Duplicate Address Detection mechanism for a multi-interface OLSR Network

Mobile Ad hoc NETworks (MANETs) are infrastructure-free, highly dynamic wireless networks, where central administration or configuration by the user is very difficult. In hardwired networks nodes usually rely on a centralized server and use a dynamic host configuration protocol, like DHCP, to acquire an IP address. Such a solution cannot be deployed in MANETs due to the unavailability of any centralized DHCP server. For small scale MANETs, it may be possible to allocate free IP addresses manually. However, the procedure becomes impractical for a large-scale or open system where mobile nodes are free to join and leave. Numerous dynamic addressing schemes for ad hoc networks have been proposed. These approaches differ in a wide range of aspects, such as the usage of centralized servers or full decentralization, hierarchical structure or flat network organization, and explicit or implicit duplicate address detection. In this paper we will present a complete and optimized version of the auto-configuration solutions for OLSR , that we have already proposed in and . This solution works in the case of a nodes having multiple interfaces, and is based on an efficient Duplicate Address Detection(DAD) algorithm which takes advantage of the genuine optimization of the OLSR routing protocol. A proof of the correct operation of the proposed solution is given and the communication overhead induced is evaluated

Design and Implementation of ID Based MANET Autoconfiguration Protocol

Auto-configuration protocols are used for assignment of unique IP addresses to nodes in Mobile ad hoc networks. Without the assignment of unique IP addresses, service provisioning between the nodes is not possible. Such protocols use various heuristics to ensure the uniqueness in IP address assignment; such aspects increase the overall complexity in MANET system design. Moreover the overriding role of IP address as an ID in Application layer and Locator in routing space is a bottleneck in future wireless network (FWN) design. Contemporary FWN research is focusing on ID/Locator split concept designs. In this paper we propose an ID/Locator based architecture for MANETs which also solves               auto-configuration requirements for MANETs. Our proposed architecture is an adaptation from available ID/Locator split concepts for infrastructure oriented networks for usage in MANET context. The designed protocol uses identifiers for node identification, node discovery and traffic flow between end points. The protocol support provision for running contemporary IP oriented services. We have also verified various use cases of our proposed protocol through Linux based implementation

Building an IP-based community wireless mesh network: Assessment

Wireless mesh networks are experiencing rapid progress and inspiring numerous applica tions in different scenarios, due to features such as autoconfiguration, self healing, connec tivity 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 chal lenges 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 rou ters, 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 origi nally 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.European Community´s Seventh Framework ProgramPublicad

Duplicate address detection and autoconfiguration in OLSR

Mobile Ad hoc NETworks (MANETs) are infrastructure-free, highly dynamic wireless networks, where central administration or configuration by the user is very difficult. In hardwired networks nodes usually rely on a centralized server and use a dynamic host configuration protocol, like DHCP , to acquire an IP address. Such a solution cannot be deployed in MANETs due to the unavailability of any centralized DHCP server. For small scale MANETs, it may be possible to allocate free IP addresses manually. However, the procedure becomes impractical for a large-scale or open system where mobile nodes are free to join and leave. Most of the autoconfiguration algorithms proposed for ad hoc networks are independent of the routing protocols and therefore, generate a significant overhead. Using the genuine optimization of the underlying routing protocol can significantly reduce the autoconfiguration overhead. One of the MANET protocols which have been recently promoted to RFC is the OLSR routing protocol , on which this article focuses. This article aims at complementing the OLSR routing protocol specifications to handle autoconfiguration. The corner stone of this autoconfiguration protocol is an advanced duplicate address detection algorithm. Under well defined assumptions, we prove the correctness of the the proposed autoconfiguration protocol

Effective bootstrapping of Peer-to Peer networks over Mobile Ad-hoc networks

Mobile Ad-hoc Networks (MANETs) and Peer-to-Peer (P2P) networks are vigorous, revolutionary communication technologies in the 21st century. They lead the trend of decentralization. Decentralization will ultimately win clients over client/server model, because it gives ordinary network users more control, and stimulates their active participation. It is a determinant factor in shaping the future of networking. MANETs and P2P networks are very similar in nature. Both are dynamic, distributed. Both use multi-hop broadcast or multicast as major pattern of traffic. Both set up connection by self-organizing and maintain connection by self-healing. Embodying the slogan networking without networks, both abandoned traditional client/server model and disclaimed pre-existing infrastructure. However, their status quo levels of real world application are widely divergent. P2P networks are now accountable for about 50 ~ 70% internet traffic, while MANETs are still primarily in the laboratory. The interesting and confusing phenomenon has sparked considerable research effort to transplant successful approaches from P2P networks into MANETs. While most research in the synergy of P2P networks and MANETs focuses on routing, the network bootstrapping problem remains indispensable for any such transplantation to be realized. The most pivotal problems in bootstrapping are: (1) automatic configuration of nodes addresses and IDs, (2) topology discovery and transformation in different layers and name spaces. In this dissertation research, we have found novel solutions for these problems. The contributions of this dissertation are: (1) a non-IP, flat address automatic configuration scheme, which integrates lower layer addresses and P2P IDs in application layer and makes simple cryptographical assignment possible. A related paper entitled Pastry over Ad-Hoc Networks with Automatic Flat Address Configuration was submitted to Elsevier Journal of Ad Hoc Networks in May. (2) an effective ring topology construction algorithm which builds perfect ring in P2P ID space using only simplest multi-hop unicast or multicast. Upon this ring, popular structured P2P networks like Chord, Pastry could be built with great ease. A related paper entitled Chord Bootstrapping on MANETs - All Roads lead to Rome will be ready for submission after defense of the dissertation