Domain‐based autoconfiguration framework for large‐scale MANETs

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.     

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.     

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.     

Spanning-tree based autoconfiguration for mobile ad hoc networks

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.     

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.

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.     

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

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.     

Autoconfiguration Management für Feldbusse — PROFIBUS Plug & Play

This article presents an autoconfiguration (ACFG) management framework for the realization of self-configuring fieldbus systems. After an introduction and a discussion of the requirements, an overview of the functions is given. The ACFG management framework contains proposals for protocol functions which, for example, realize an automatic solution for address conflicts or the automatic setting of the system’s bus parameters. Positive practical experience has already been gained during laboratory tests with PROFIBUS-DP.     

A lightweight stateful address autoconfiguration for 6LoWPAN

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.     

Learning automata-based receiver conflict avoidance algorithms forWDM broadcast-and-select star networks

The increasing bandwidth demands of the emerging new generation of computer communication networks have led to the utilization of optical fiber as a transmission medium. A new receiver conflict avoidance algorithm for wavelength-division multiplexing (WDM) broadcast-and-select star networks is introduced. The proposed algorithm is based on the use of learning automata in order to reduce the number of receiver conflicts and, consequently, improve the performance of the network. According to the proposed scheme, each node of the network is provided with a learning automaton; the learning automaton decides which of the packets waiting for transmission will be transmitted at the beginning of the next time slot. The asymptotic behavior of the system, which consists of the automata and the network, is analyzed and it is proved that the probability of choosing each packet asymptotically tends to be proportional to the probability that no receiver conflict will appear at the destination node of this packet. Furthermore, extensive simulation results are presented, which indicate that significant performance improvement is achieved when the proposed algorithm is applied on the basic DT-WDMA protocol     

Mobile ad hoc networks - current approaches and future directions

Most research efforts in the area of MANETs focus on developing efficient routing protocols. Although routing protocols assume unique node addresses, the question of how to provide them remains open. In order to allow truly spontaneous and infrastructureless networking, a protocol for dynamic allocation of unique addresses is needed. Recently, various address autoconfiguration protocols for MANETs have been proposed. This article gives an overview of the challenges of address autoconfiguration in MANETs, presents current approaches, and discusses their advantages and drawbacks.     

OBS基于回退和信道分级的冲突解决算法

解决突发包的冲突问题是光突发交换网络的关键技术之一。为了降低突发包冲突时丢包率,提出了一种新型的基于信道分级和回退机制的冲突解决算法,该算法考虑突发业务优先级,将信道分成两个级别,有区别地对待高低优先级两种业务类型,并且增加了一部分回退信道作为保护和重发冲突数据包,能够有效地保证高优先级业务的传输可靠性。结果表明,当冲突发生时,网络能根据此时高低优先级业务量的比重配比,自适应地调节两个级别信道的数量,兼顾到低优先级业务的低丢包率,保证了较低的延时率。此算法相比以往的冲突解决算法具有较低的丢包率和相对小的延时率。     

对IPv6网络安全接入问题的研究

本文提出了一种新的IPv6网络安全接入方案.文中首先介绍了IPv6网络安全接入所要解决的问题以及现有解决方案,然后在详细分析IPv6地址自动配置过程的基础上,提出了一种新的基于认证的IPv6地址自动配置方案,以解决IPv6网络安全接入问题,并对其中涉及到的关键问题进行了详细讨论,提出了一些切实可行的方法.接着,论述了本方案的突出优点,证实了本方案是能够从源头上解决IPv6网络安全接入问题的轻量级方案,非常适合应用于未来的无线网络中.最后,对本方案的应用前景进行了展望.     

预测位置空间离散化的多航路中期冲突探测算法

为了解决高飞行密度空域中具有多段航路的飞机中期冲突探测算法的精度较低和效率不高的问题,本文提出了一种新的中期冲突探测算法。将两飞机的航路重新划分为一系列航路片段,使得在每一个航路片段中没有航向和速度的变化。基于Prandini瞬时冲突概率的思想,计算所有航路片段的最大瞬时冲突概率,并取冲突概率中的最大者作为两架飞机整个航路冲突发生可能性的一个极端情况的度量。其中提出了基于预测位置空间离散化的新算法来求航路片段的瞬时冲突概率,对两飞机预测位置空间进行离散,然后根据位置预测误差概率密度函数以及两飞机的相遇几何来求瞬时冲突概率。仿真结果表明,相对于Prandini随机化算法,本文的冲突探测算法计算效率和计算精度更高,能够满足高密度飞行下条件下具有多段航路飞机的实时冲突探测的要求。      

基于总体冲突概率和三维布朗运动的冲突探测算法

随着空中交通流量的增加,冲突探测在空中交通管理系统中的作用越来越重要。该文提出了一种概率型冲突探测算法,计算向前看时间内的总体冲突概率。基于飞机3维布朗运动模型,飞机的预测航迹可以表示为确定航迹外加布朗运动扰动。对于两飞机速度为常值的运动情况,冲突概率可以表示为做布朗运动的飞机进入运动的飞机保护区的概率,使用坐标变换和Bachelier-Levy定理进行估计;对于两飞机运动为非匀速运动情况,预测航迹则可以使用足够多速度为分段常值的片段来近似,计算出每一片段内的冲突概率,并给出了向前看时间内总体冲突概率的上下界。与蒙特卡罗仿真结果比较,算法满足冲突探测精度要求,对及时发现冲突和冲突解决具有重要意义。     

MANET主机安全自配置协议研究

提出一种基于IPv6的安全地址自配置方案SMAAC(Security MANET Address Auto-Configuration),新节点以口令方式通过节点验证服务器的验证后,由该服务器发放节点授权票据,由邻居节点进行授权票据检验并根据相关硬件信息产生IPv6地址,并完成地址冲突检测,保证网络内节点身份合法性.最后对该方案进行了安全及性能分析与仿真.     

P&;P: an asynchronous and distributed protocol for mobile sensor deployment

The use of wireless mobile sensors is of great relevance for a number of strategic applications devoted to monitoring critical areas where sensors can not be deployed manually. Mobile sensors can adapt their position on the basis of a local evaluation of coverage, thus permitting an autonomous deployment. Several algorithms have been proposed to deploy mobile sensors over an area of interest. The applicability of these approaches largely depends on a proper formalization of rigorous rules to coordinate sensor movements, solve local conflicts and manage possible failures of communications and devices. In this paper we introduce P&P, a communication protocol that permits a correct and efficient coordination of sensor movements in agreement with the Push & Pull algorithm. We deeply investigate and solve the problems that may occur when coordinating asynchronous local decisions in the presence of an unreliable transmission medium and possibly faulty devices such as in the typical working scenario of mobile sensor networks. Simulation results show the performance of our protocol under a range of operative settings, including conflict situations and irregularly shaped target areas. Furthermore, a performance comparison between the P&P protocol and one of the best solutions based on the virtual force approach, shows the superiority of our proposal in terms of deployment time, message exchanges and energy consumption.     

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

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

基于6LoWPAN的物联网寻址策略研究

在6LoWPAN (IPv6 over Low-power Wireless Personal Area Network)的基础上,该文提出应用于物联网的寻址策略,实现基于IEEE 802.15.4协议的底层异构网络与互联网的实时通信。寻址策略包括IPv6地址自动配置和报头压缩。采用的分层地址自动配置策略,首先在底层网络内部允许节点使用16位短地址导出的链路本地地址进行数据分组传输,该链路本地地址需通过执行基于分簇的重复地址检测机制保证唯一性;其次,每个底层网络中的Sink节点通过上层IP路由器获取全球路由前缀,并与接口标识符相结合,形成Sink节点的全球地址,实现底层网络与互联网的数据交换。同时,通过在报头压缩编码中植入链路本地地址和全球地址控制位,提出了一种适用于物联网应用的报头压缩方案IIPHC (IoTs IPv6 Header Compression)。如果地址类型为链路本地地址,则采用简单灵活的IIPHC1方案,如果地址类型为全球地址,则采用相对复杂但有效的IIPHC2方案。仿真及测试结果表明,基于6LoWPAN的物联网寻址策略在网络开销、时延、吞吐量、能耗等性能方面存在一定的优越性。