Hierarchical and low‐power IPv6 address configuration for wireless sensor networks

The paper proposes a hierarchical and low‐power IPv6‐address configuration scheme for wireless sensor networks based on the cluster‐tree architecture. In the scheme, a wireless sensor network is divided into multiple clusters and the generation algorithm of a cluster is proposed. A cluster‐tree architecture for wireless sensor networks is presented and a layered IPv6 address format for a cluster head and a cluster member is created. The stateless address configuration strategy and the stateful address configuration strategy are effectively combined to develop the IPv6 address configuration scheme. In the scheme, the duplicate address detection of the IPv6 address assigned for a cluster member is performed in the cluster where the cluster member locates, and the IPv6 address configuration for the cluster members in the different clusters can be carried out at the same time. The paper also addresses the mobility of sensor nodes and their failure. From the theoretical and simulative perspectives, the paper analyzes the performance parameters, including duplicate address detection cost, address configuration cost and address configuration delay time, of the proposed scheme, Strong DAD and MANETConf. Analytical and simulative results show that the performance of the proposed scheme is better. Copyright © 2011 John Wiley & Sons, Ltd.     

Research on IPv6 address configuration for wireless sensor networks

The paper proposes an IPv6 address configuration scheme for wireless sensor networks. In the scheme, one wireless sensor network is divided into multiple clusters and the scheme creates the IPv6 address formats for the cluster heads and the cluster members respectively. Based on the proposed IPv6 address format, the scheme proposes to adopt the division method of the hash function to allocate the IPv6 addresses for the cluster heads and cluster members and to utilize linear probing to deal with assigned address collision. From the perspectives of duplicate address detection cost, address configuration cost and address configuration delay time, the paper analyzes and compares the performances of Strong DAD, MANETConf and the proposed scheme. Analytical results demonstrate the effectiveness and efficiency of the proposed scheme. Copyright © 2010 John Wiley & Sons, Ltd.     

Dynamic and hierarchical IPv6 address configuration for a mobile ad hoc network

The paper proposes a dynamic and hierarchical IPv6 address configuration scheme for a mobile ad hoc network (MANET). The scheme proposes the hierarchical architecture and combines the distributed and centralized address configuration approaches. In the architecture, a central node assigns IPv6 addresses for cluster heads that are distributed around a MANET, and distributed cluster heads assign IPv6 addresses for cluster members. The generation algorithm of a cluster is proposed, and it uses the number of potential cluster members as a measurement unit and minimizes the number of cluster heads. Therefore, the address configuration cost for cluster heads is reduced. A central node/cluster head uses the unicast communication mode to achieve the real‐time address recovery in order to ensure that it has enough address resources for assignment. The paper also proposes the low‐cost MANET merging/partitioning algorithm that guarantees that no address collision happens during the MANET merging/partitioning process. This paper analyzes the performance parameters of the proposed scheme, including the address configuration cost, the address configuration delay, and the number of MANET merging. The analytical results show that the proposed scheme effectively reduces the address configuration cost, shortens the address configuration delay, and decreases the number of MANET merging. Copyright © 2013 John Wiley & Sons, Ltd.     

A hierarchical scheme on achieving all-IP communication between WSN and IPv6 networks

The paper proposes a hierarchical scheme on implementing all-IP communication between wireless sensor networks and IPv6 networks. The paper proposes the cluster-tree architecture for all-IP wireless sensor networks which is consistent with the IPv6 Internet architecture. Based on the cluster-tree architecture, the paper proposes the hierarchical IPv6 address configuration algorithm where the IPv6 configuration for cluster members in different clusters can be performed simultaneously, so the IPv6 configuration delay is shortened. Based on the proposed cluster-tree architecture and the IPv6 address configuration algorithm, the paper proposes the hierarchical routing scheme in the link layer where the intermediate nodes only need to deal with the frame header in the link layer without processing the headers in the above layers, so the routing delay is shortened and the power consumption is reduced. From both theoretical perspective and simulative perspectives, the paper analyze the performance parameters of the proposed scheme. And the data results show that the performance of the proposed scheme is better.     

Cluster-Based and Distributed IPv6 Address Configuration Scheme for a MANET

In a Mobile Ad hoc Network (MANET), after a mobile node is configured with a unique IP address it can perform the unicast communications. In order to reduce the address configuration cost and shorten the latency, this paper proposes an IPv6 address configuration scheme for a MANET. In the scheme, the cluster-based architecture is proposed. In the architecture, the clustering mechanism is combined with the address configuration process in order to achieve the low-cost and low-latency address configuration for all nodes in a MANET. Based on the architecture, the distributed address configuration algorithm is proposed. In the algorithm, a cluster member acquires an address from a cluster head within one-hop scope, so the address configuration task is distributed around cluster heads. In this way, the address configuration in different clusters can be performed in parallel, so the address configuration delay is shortened and the network scalability is improved. The address reclamation/maintenance algorithm is also proposed so that the address resources released by failed nodes can be rapidly recovered for reuse. Finally, the merging/splitting algorithm is proposed in order to ensure that no address collision happens in a MANET. This paper analyzes the performance parameters of the proposed scheme, and the data results show that the proposed scheme effectively reduces the address configuration cost and shortens the delay.     

一种无线传感器网络异构分簇模型的簇头调度方案

将无线传感器网络划分成簇会有效利用系统资源,近来提出的基于异构分簇模型的无线传感器网络,是指网络中存在多种不同能力的节点,能力强的节点自动成为簇头,这种网络避免了复杂的簇头选举过程并有效降低了普通节点的硬件复杂性和成本。但是,固定簇头的方法会削弱系统的负载均衡以及健壮性。为了解决这个问题,提出了一种基于自适应退避策略的簇头调度方案,该方案通过适当增加冗余度实现传感节点的k覆盖,增强了网络的健壮性。同时,依赖于地理信息和剩余电池能量信息,簇头节点通过自主周期性睡眠来保证系统负载的均衡分配,延长网络生存期。     

A Secure IPv6 Address Configuration Protocol for Vehicular Networks

This paper proposes a secure address configuration protocol for IPv6-based vehicular networks. In this protocol, the network architecture is proposed. In this architecture, a vehicle obtains a unique address from a neighbor vehicle or an access point without DAD, and a leaving vehicle’s address space can be automatically reclaimed for reassignment. Based on this architecture, the address configuration algorithm is presented. In this algorithm, an access point or a vehicle owns the unique address space and assigns a unique address to a neighbor vehicle without DAD, so the address configuration cost and delay are lowered. The identification of a vehicle can be authenticated, so the security is achieved. This paper evaluates the performance of this protocol. The data results show that this protocol effectively improves the address configuration performance.     

Constructing a MANET Based on Clusters

This paper proposes a scheme for constructing a mobile ad hoc network (MANET) based on clusters. The proposed MANET architecture is made up of two hierarchies. One hierarchy is the backbone network which is made up of cluster heads and associate nodes, and the other hierarchy is the cluster which is made up of one cluster head and multiple cluster members. In the proposed cluster generation algorithm, the number of potential cluster members is used as a metric, and it is always the new node with the maximum number of potential cluster members that is elected as a cluster head. In this way, the number of cluster heads is minimized. In this scheme, only one associate node is used to achieve the communication between two cluster heads, so the number of nodes included in the backbone network is minimized. This scheme also proposes the cluster merging algorithm in order to maintain the minimum number of cluster heads. In the proposed cluster repair algorithm, if a cluster head fails/moves out of the cluster, then a new cluster head is elected to maintain the cluster stability. From the perspective of the cluster stability, this paper analyzes the performance parameters of the proposed scheme, and the data results show that the proposed scheme improves the MANET stability.     

A Tree-Based Data Collecting Network Structure for Wireless Sensor Networks

In a sensor network with a large number of densely populated sensor nodes, a single target of interest may be detected by multiple sensor nodes simultaneously. Data collected from the sensor nodes are usually highly correlated, and hence energy saving using in-network data fusion becomes possible. A traditional data fusion scheme starts with dividing the network into clusters, followed by electing a sensor node as cluster head in each cluster. A cluster head is responsible for collecting data from all its cluster members, performing data fusion on these data and transmitting the fused data to the base station. Assuming that a sensor node is only capable of handling a single node-to-node transmission at a time and each transmission takes T time-slots, a cluster head with n cluster members will take at least nT time-slots to collect data from all its cluster members. In this paper, a tree-based network structure and its formation algorithms are proposed. Simulation results show that the proposed network structure can greatly reduce the delay in data collection.     

基于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的物联网寻址策略在网络开销、时延、吞吐量、能耗等性能方面存在一定的优越性。     

Fast Duplicate Address Detection for Seamless Inter-Domain Handoff in All-IPv6 Mobile Networks

In All-IP networks, each computer or communication equipment needs an IP address. To supply enough IP addresses, the new Internet protocol IPv6 will be used in next generation mobile communication. Although IPv6 improves the existing Internet protocol (IPv4), Duplicate Address Detection (DAD) mechanism may consume resources and suffer from long delay. DAD is used to make sure whether the IP address is unique or not. When a mobile node performs an inter-domain handoff, it will first generate a new IP and perform a DAD procedure. The DAD procedure not only wastes time but also increases the signaling load on Internet. In this paper, we propose a new DAD mechanism to speed up the DAD procedure. We create a DAD table in access or mobility routers in All-IP networks and record all IP addresses of the area. When a new IP address needs to perform DAD, it can just search in the DAD table to confirm the uniqueness of the address. Furthermore, we propose a new method, Fast Duplicate Address Detection (Fast DAD), to reduce data search time. Simulation results show that our method outperforms the existing DAD methods.     

A conflict-insensitive NATed roaming framework using NAToD for proxy mobile IPv4 in WLANs

Providing efficient mobility management in the current Internet is increasingly important due to the quick growth of wireless mobile users. The emerging Proxy Mobile IPv4 (PMIPv4) technique brings a possible solution for that purpose. Since NAT function is widely adopted in IPv4 environment nowadays because of lacking IPv4 addresses, the PMIPv4 interoperating with NAT must be considered. Unfortunately, owing to the possible conflict of private IP address, we encounter a problem in broadcasted point-to-multipoint wireless networks such as IEEE 802.11 networks. To address this issue, we proposed a novel Network Address Translation on Demand (NAToD) scheme, which can well interoperate with the PMIPv4 solution. With our scheme, single public IPv4 addresses can be shared by multiple mobile nodes in both home and foreign networks, low-latency handoff can be achieved, deployment cost can be reduced, and software upgrade can be avoided for mobile nodes in wireless LANs. Our work allows mobile users in WLAN to access Internet based on the advantages of both PMIPv4 and NAT.     

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.     

一种用于水声传感网的MAC层协议

针对分簇的水声传感网,提出了一种基于时分多址（TDMA）的MAC层协议——Cluster-TDMA。该协议主要由规划阶段和传输阶段组成。规划阶段,首先由网关节点规划能造成簇间干扰的子节点的传输,其次由各簇头节点分别规划本簇内其他子节点的传输;传输阶段,子节点根据规划表周期性地向簇头节点发送数据,这些数据最终汇聚到网关节点。该协议简单有效地解决了引起簇间干扰子结点的传输规划问题。C++仿真实验表明,该协议具有良好的吞吐率和能量效率性能。     

Dual head static clustering algorithm for wireless sensor networks

Clustering of nodes is often used in wireless sensor networks to achieve data aggregation and reduce the number of nodes transmitting the data to the sink. This paper proposes a novel dual head static clustering algorithm (DHSCA) to equalise energy consumption by the sensor nodes and increase the wireless sensor network lifetime. Nodes are divided into static clusters based on their location to avoid the overhead of cluster re-formation in dynamic clustering. Two nodes in each cluster, selected on the basis of the their residual energy and their distance from the sink and other nodes in the cluster, are designated as cluster heads, one for data aggregation and the other for data transmission. This reduces energy consumption during intra-cluster and inter-cluster communication. A multi-hop technique avoiding the hot-spot problem is used to transmit the data to the sink. Experiments to observe the energy consumption patterns of the nodes and the fraction of packets successfully delivered using the DHSCA suggest improvements in energy consumption equalisation, which, in turn, enhances the lifetime of the network. The algorithm is shown to outperform all the other static clustering algorithms, while being comparable with the performance of the best dynamic algorithm.     

DUCR: Distributed unequal cluster‐based routing algorithm for heterogeneous wireless sensor networks

Designing energy efficient communication protocols for wireless sensor networks (WSNs) to conserve the sensors' energy is one of the prime concerns. Clustering in WSNs significantly reduces the energy consumption in which the nodes are organized in clusters, each having a cluster head (CH). The CHs collect data from their cluster members and transmit it to the base station via a single or multihop communication. The main issue in such mechanism is how to associate the nodes to CHs and how to route the data of CHs so that the overall load on CHs are balanced. Since the sensor nodes operate autonomously, the methods designed for WSNs should be of distributed nature, i.e., each node should run it using its local information only. Considering these issues, we propose a distributed multiobjective‐based clustering method to assign a sensor node to appropriate CH so that the load is balanced. We also propose an energy‐efficient routing algorithm to balance the relay load among the CHs. In case any CH dies, we propose a recovery strategy for its cluster members. All our proposed methods are completely distributed in nature. Simulation results demonstrate the efficiency of the proposed algorithm in terms of energy consumption and hence prolonging the network lifetime. We compare the performance of the proposed algorithm with some existing algorithms in terms of number of alive nodes, network lifetime, energy efficiency, and energy population.     

基于动态分簇路由优化和分布式粒子滤波的传感器网络目标跟踪方法

针对无线传感器网络中节点通信能力及能量有限的情况,该文提出基于动态分簇路由优化和分布式粒子滤波的传感器网络目标跟踪方法。该方法以动态分簇的方式将监测区域内随机部署的传感器节点划分为若干个簇,并对簇内成员节点与簇首节点之间、簇首节点与基站之间的通信路由进行优化,确保网络能耗的均衡分布,在此基础上,被激活的簇内成员节点并行地执行分布式粒子滤波算法实现目标跟踪。仿真结果表明,该方法能有效地降低传感器网络中节点的总能耗,能在实现跟踪的同时保证目标跟踪的精度。     

一个无线传感器网络中的ipv6协议栈头部压缩方案

提出了一个无线传感器网络中的IPv6协议栈的头部压缩方案,包括IPv6头部、扩展头部和UDP头部的压缩.该方案易于实现,能够较大程度的减少无线传感器网络中报文的传输时间,从而降低能量消耗,延长节点寿命.     

基于6LoWPAN的IPv6传感器网络报头压缩方案的设计与实现

无线传感器网络节点的资源非常有限,如果能够对IPv6报头进行压缩可以在较大程度上减小数据传输量,提高IPv6传感器网络的整体性能。通过对6LoWPAN报头压缩方案的研究,并结合无线传感器网络的特点和实际需求,在已有无线传感器网络底层协议和基本IPv6协议栈基础上,设计并实现了一种支持对跳数限制压缩的IPv6报头压缩方法。实验结果表明,报头压缩可以有效节省网络能耗,降低丢包率,减小数据传输时延。