Address Configuration Research And Routing Ootimization For IPv6-based All-IP WSN

With the rapid development and large-scale application of Wireless Sensor Network(WSN)and the continuous popularization and improvement of the IPv6 Internet,the realization of all-IP communications between the WSN and the IPv6 Internet has become an inevitable trend.IPv6 over Low Power Wireless Personal Area Networks(6L0WPAN)provides feasibility for introducing the IPv6 protocol to the low-power wireless personal area network,and it is an ideal solution for implementing all-IP communication between WSN and IPv6 Internet.The IPv6-based all-IP WSN(hereinafter referred to as all-IP WSN)configures each sensor node with a globally unique IPv6 address,and it can implement all-IP communications with the IPv6 Internet.Before the WSN establishes all-IP communication with the IPv6 Internet,the address configuration and routing path issues must be addressed.Due to the limitations of WSN resources,it is significant for efficient address configuration and route establishment.This paper studies the address configuration and routing optimization issues for all-IP WSN,and the main research contents include the following three aspects:(1)In this paper,a network construction algorithm based on clusters is proposed.In the algorithm,the sensor nodes are divided into four categories,the access point,the fixed cluster head node,the mobile cluster head node and the cluster member node,which allows the all-IP WSN architecture to fully integrate with the IPv6 network architecture.The algorithi divides the network into two levels,the access-point dynamic tree consisting of the access point and the fixed cluster head node,the cluster consisting of the cluster head node and the cluster member node.This architecture reduces the number of nodes involved in the tree and decreases the cost and latency of network construction.(2)Based on the network construction algorithm,a hierarchical IPv6 address structure and a distributed IPv6 address configuration algorithm are proposed.The algorithm combines the stateful address configuration with the stateless address configuration.The cluster heads employ the stateful strategy to achieve the addressing whereas the cluster member uses the stateless strategy to perform the addressing.This algorithm achieves the goal of the cluster head node assigning addresses to cluster member nodes and multiple clusters performing address configuration in parallel,so the cost and delay of address configuration are reduced.(3)Based on the network construction and address configuration algorithms,a routing optimization algorithm based on the access-point dynamic tree is proposed.The routing is established during the address configuration,so no additional route establishment is needed,which reduces the cost and delay of the routing.Also,the routing maintenance and repair algorithm is proposed to effectively ensure the stability of the network topology and guarantee the correctness of the routing.