PACMAN: passive autoconfiguration for mobile ad hoc networks

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.     

RAA: a ring-based address autoconfiguration protocol in mobile ad hoc networks

The problem for dynamic IP address assignment is manifest in mobile ad hoc networks, especially in 4G all-IP-based heterogeneous networks. Existing solutions are mainly riveted to decentralized algorithms, applying a large number of broadcast messages to (1) maintain available IP address pools and (2) ensure no address duplication occurring. In this paper, we propose a ring-based address autoconfiguration protocol to configure node addresses. This work aims at the decentralized ring-based address autoconfiguration (DRAA) protocol, which has the advantage of low latency, low communication overhead and high uninterruptible connection. The DRAA protocol is a low-latency solution because each node independently allocates partial IP addresses and does not need to perform the duplicate addresses detection (DAD) during the node-join operation. Communication overhead is significantly lessened in that DRAA protocol uses the logical ring, thus utilizing fewer control messages solely by means of uni-cast messages to distribute address resources and to retrieve invalid addresses. Furthermore, if duplicate addresses are shown at network merging, the DRAA protocol checks the number of both TCP connections and of nodes to allow duplicate nodes to rejoin the smaller network so that lost connections are fast re-connected. To improve communication overhead and provide the evenness of address resources, the centralized ring-based address autoconfiguration (CRAA) protocol is discussed. The CRAA protocol reduces larger numbers of broadcast messages during network merging. The other contribution is that our CRAA protocol also has an even capability so that address resources can be evenly distributed in each node in networks; this accounts for the reason our solution is suitable for large-scale networks. Finally, the performance analysis illustrates performance achievements of RAA protocols. The simulation result shows that the DRAA protocol has the shortest latency, that the CRAA protocol has the capability to evenly distribute address resources and that both of DRAA and CRAA protocols are the good solutions which achieve low communication overhead and high uninterruptible connection.     

Name‐Based Autoconfiguration for Mobile Ad hoc Networks

In a mobile ad hoc network, difficulties exist in supporting address autoconfiguration and naming resolution due to the lack of centralized servers. This letter presents a novel approach, called name‐based autoconfiguration (NBA), which uses host names to determine IP addresses and provides address autoconfiguration and name resolution as a single protocol.     

ND++ – an extended IPv6 Neighbor Discovery protocol for enhanced stateless address autoconfiguration in MANETs

Recent trends in information and communications technologies are oriented toward the design of the Future Internet and the Internet of Things. While IPv6‐based mobile ad hoc networks (MANETs) are emerging as an important building block of these new technologies, it is necessary to come up with adequate self‐configuration capabilities allowing for seamless and automated configuration of addresses in mobile environment. The mechanisms of stateless address autoconfiguration proposed for IPv6 networks are supposed to automate some configuration steps; however, they would need to be aligned with the requirements imposed by MANET networks. Therefore, in this article, we present Neighbor Discovery ++ – an extended IPv6 Neighbor Discovery protocol for enhanced duplicate address detection in MANETs, which provides increased coverage of network nodes, while minimizing protocol overhead. It exploits efficient flooding mechanism on the basis of the multipoint relay concept, which makes it an interesting approach also for large‐scale networks. Trials performed on the designated real‐world testbed platform indicate that ND++ is a promising solution to support efficient address autoconfiguration in MANETs. Copyright © 2012 John Wiley & Sons, Ltd.     

ad hoc网络地址自动配置技术研究

针对ad hoc网络的地址自动配置问题,介绍了该领域研究现状和最新进展,以及有代表性的配置机制的配置思想和实施方法,比较了各配置机制的相关性能,在此基础上给出了结论.     

Active networks for efficient distributed network management

The emerging next generation of routers exhibit both high performance and rich functionality, such as support for virtual private networks and QoS. To achieve this, per-flow queuing and fast IP filtering are incorporated into the router hardware. The management of a network comprising such devices and efficient use of the new functionality introduce new challenges. A truly distributed network management system is an attractive candidate to address these challenges. We describe how active network techniques can be used to allow fast and easy deployment of distributed network management applications in IP networks. We describe a prototype system where legacy routers are enhanced with an adjunct active engine, which enables the safe execution and rapid deployment of new distributed management applications in the network layer. This system can gradually be integrated in today's IP network, and allows smooth migration from IP to programmable networks. This is done with an emphasis on efficient use of network resources, which is somewhat obscure by many of today's high-level solutions     

基于IPv6的网络传感器路由技术研究

在IPv6（Internet Protocol vision6）的地址结构中定义了一段新的IP地址,将这些IP地址作为每个传感器的标识IP地址。在mobile IPv6的基础上,提出了传感器的转交地址配置方法,即手动配置方法和mobile IPv6中的无状态自动地址配置方法,通过转交地址和标识地址的“完全绑定”来实现数据报的路由。最后给出了基于IPv6的传感器网络的网络结构。解决了传感器在计算机网络中相互区别的问题,并通过转交地址在传感器与计算机之间建立无缝连接,使计算机和传感器之间的数据报实现最优的直接传递。     

通讯网的演进

在光纤高速传输技术、光交换与智能光网等与宽带接入、多媒体、3G等网络应用技术的推动下，建设基于IPv6协议的IP基础电信网成为可能。现在IP网正在朝着有序的、可管理的、有QoS保障的、可以支持各类业务的综合业务基础网演进。电信网也正在从网络接入层上、从长途网络层面上、从本地网络层面上、从固定网向含3G在内的移动网络等方面向支持IP技术及其综合业务的方面全面推进。     

无线传感器网络上轻量化的IPv6协议栈

传感器网络集成了传感器、微机电系统和网络三大技术是当今的热门研究领域之一,在农业领域控制、城市管理、环境监测等领域有重要的实用价值,具有十分广泛的应用前景。IPv6作为下一代IP协议正在逐步替代IPv4。无线传感器网络和IPv6的结合是当前研究的热点。本文基于轻量化IPv6协议栈为目的,通过分析IPv6报文以及无线传感器网络的特点,采用理论分析合理地提出了WSN中IPv6协议栈核心功能的剪裁方案。在试验中使用压缩的IPv6地址进行通信,得出一种适应于无线传感器网络运行的IPv6协议剪裁方案。     

Design and Experimental Evaluation of a Route Optimization Solution for NEMO

An important requirement for Internet protocol (IP) networks to achieve the aim of ubiquitous connectivity is network mobility (NEMO). With NEMO support we can provide Internet access from mobile platforms, such as public transportation vehicles, to normal nodes that do not need to implement any special mobility protocol. The NEMO basic support protocol has been proposed in the IETF as a first solution to this problem, but this solution has severe performance limitations. This paper presents MIRON: Mobile IPv6 route optimization for NEMO, an approach to the problem of NEMO support that overcomes the limitations of the basic solution by combining two different modes of operation: a Proxy-MR and an address delegation with built-in routing mechanisms. This paper describes the design and rationale of the solution, with an experimental validation and performance evaluation based on an implementation.     

Cluster-Based Autoconfiguration for Mobile Ad hoc Networks

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.

Energy-aware on-demand scatternet formation and routing for Bluetooth-based wireless sensor networks

Bluetooth is a promising short-range wireless communication technology with the characteristics of interference resilience and power efficiency, both desirable for wireless sensor networks. The new Intel Mote sensor devices have Bluetooth technology incorporated as the standard wireless communications interface. When using Bluetooth in applications where multihop routing is required, groups of Bluetooth piconets combine together to form a scatternet. However, most of the existing scatternet formation protocols are designed to facilitate communications between any two pairs of devices, regardless of the actual traffic demand pattern. For wireless sensor network applications with low-duty-cycle traffic patterns, an on-demand scatternet formation protocol can achieve significant power saving by avoiding unnecessary network connectivity. To that end, we introduce an on-demand scatternet and route formation protocol designed specifically for Bluetooth-based wireless sensor networks. Our protocol builds a scatternet on demand, and is able to cope with multiple sources initiating traffic simultaneously. In addition, our energy-aware forwarding nodes selection scheme is based on local information only, and results in more uniform network resource utilization and improved network lifetime. Simulation results show that our protocol can provide scatternet formation with reasonable delay and good load balance, which results in prolonged network lifetime for Bluetooth-based wireless sensor networks.     

Agent-Based Passive Autoconfiguration for Large Scale MANETs

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.     

Congestion control in wireless sensor and 6LoWPAN networks: toward the Internet of Things

The Internet of Things (IoT) is the next big challenge for the research community where the IPv6 over low power wireless personal area network (6LoWPAN) protocol stack is a key part of the IoT. Recently, the IETF ROLL and 6LoWPAN working groups have developed new IP based protocols for 6LoWPAN networks to alleviate the challenges of connecting low memory, limited processing capability, and constrained power supply sensor nodes to the Internet. In 6LoWPAN networks, heavy network traffic causes congestion which significantly degrades network performance and impacts on quality of service aspects such as throughput, latency, energy consumption, reliability, and packet delivery. In this paper, we overview the protocol stack of 6LoWPAN networks and summarize a set of its protocols and standards. Also, we review and compare a number of popular congestion control mechanisms in wireless sensor networks (WSNs) and classify them into traffic control, resource control, and hybrid algorithms based on the congestion control strategy used. We present a comparative review of all existing congestion control approaches in 6LoWPAN networks. This paper highlights and discusses the differences between congestion control mechanisms for WSNs and 6LoWPAN networks as well as explaining the suitability and validity of WSN congestion control schemes for 6LoWPAN networks. Finally, this paper gives some potential directions for designing a novel congestion control protocol, which supports the IoT application requirements, in future work.

     

Message Complexity Analysis of Mobile Ad Hoc Network Address Autoconfiguration Protocols

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).     

Dynamically selecting protocols for socket applications

An application enablement method that enables communications applications to run on protocols for which they were not written is discussed. The focus is on a subset of networks and communications application programming interfaces. The communications interface chosen is Berkeley sockets. The network protocols used are SNA (Systems Network Architecture) and TCP/IP (Transmission Control Protocol/Internet Protocol). The running of existing socket applications over SNA networks, which requires support for transparently masking the differences between TCP/IP and SNA from the applications, is described. Protocol selection, address mapping, and connection management are also described     

IPv6的地址结构特点与管理机制分析

本文主要介绍了有关IPv6互联网的网络地址结构及其管理机制。与现行的IPv4地址相比,IPv6在地址的长度、分类方法、表示方法和类型等方面均不同相同。它可有效地解决IP地址枯竭与路由效率低下的问题,同时具有地址聚类性、多播性、任播性和接口多址性等特点;而在IPv6地址管理方面则采用层次化路由选择策略,支持QoS路由协议,将地址解析通过领导发现协议来实现,新增了无态地址的自动配置,使得网络地址的重新编号变得更加简单快速。最后通过模拟仿真的方法,进一步分析说明了IPv6网络的性能。     

IDSDDIP: a secure distributed dynamic IP configuration scheme for mobile ad hoc networks

In IP‐based networks, IP address uniqueness is one of the most important requirements since a node has to participate in unicast communications and routing. Often nodes are assumed to have unique IP addresses configured a priori. However, this is not the case and cannot be achieved easily in mobile ad hoc networks (MANETs). Most of the existing dynamic address allocation schemes of MANET rely on network‐wide flooding for address solicitation and/or duplicate address detection. As a result, several types of security threats can be seen at the time of address allocation. In this paper, we present an ID‐based distributed dynamic IP configuration scheme that securely allocates IP addresses to the authorized nodes without flooding the entire network. Here each node acquires capability of generating unique IP addresses from its own IP address and can assign those addresses to the new nodes. The proposed scheme provides security against the associated threats with dynamic IP allocation protocol without the help of a trusted third party. It also efficiently handles the network partitioning and merging and reduces the chance of address conflicts. Performance analysis and simulation results are present to show that the proposed addressing scheme has low communication overhead and fairly low addressing latency with added security mechanisms compared to the similar existing dynamic address allocation schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

NewIP:开拓未来数据网络的新连接和新能力

互联网应用深刻地影响着人们的工作与生活,纷至沓来的新应用对数据网络提出了新的挑战。基于未来应用对数据网络提出的需求,剖析了数据网络需要基于IP进行继承式发展,提出了一种新型的网络协议体系——NewIP,并介绍了 5 种关键使能技术,包括确定性 IP、内生安全、面向万网互联的新寻址与控制机制、用户可定义、新传输层等。     

Home agent placement and IP address management for integrating WLANs with cellular networks

Seamless roaming between cellular networks (3G or upcoming 4G) and wireless local area networks can be provided using Mobile IP. However, GPRS/UMTS and 802.11-based WLAN networks have no native support for mobile IP. Mobile IP requires the deployment of home agents and a protocol between the mobile nodes, home agent, and corresponding nodes. We address the home agent placement and home address assignment issues for supporting mobile IP for heterogeneous roaming. Placement techniques for mobile IP home agents are presented including dynamic HA assignment in either WLAN or cellular network domains using the diameter mobile IP application. Next, we present several IPv4 home address assignment schemes for mobile nodes visiting in the WLAN domain such as NAT/NAPT traversal, reverse tunneling, and mobile VPNs. It is shown that HA placement and address management are orthogonal, and any combination is possible. Various architectures for both issues are evaluated against the optimal solutions