Research On Overlap Area Routing Algorithm Of The Internet Of Things

The architecture of Internet of things(Io T) is including perception layer, network layer and application layer. The perception layer obtains a variety of heterogeneous data; The network layer is composed of a variety of heterogeneous networks; The application layer involves a wide range of applications. The perception layer is an important part of the Io T and the foundation of realizing objects connected to each other in the Io T. It provides technical support for the Internet of things to implement the intelligent of the objects. With the extensive application of the Io T, the perceptual nodes deployed more widely, a lot of networks can appear the phenomenon of crossing cover, the density of nodes in the overlap area or not in the overlap area are different, the density of nodes are heterogeneous. The residual energy, communication ability and storage capacity of the node in perception layer of the Io T are different, the performance of the nodes are heterogeneous. The perceptual nodes in Io T are often deployed in harsh environments, which are easily damaged, in order to reduce the losses at the moment when the node is damaged, the data that the damaged node collected must be captured, which set a high goal for the real-time when transmit data. Based on the questions above, this paper will solve that through two approaches:1) In order to solve the problem of the performance of heterogeneous nodes, according to the requirements of different application of Io T, set different weight for communication ability and storage ability of the node, choose the nodes with greater residual energy than the threshold and large communication and storage capacity as the cluster head, improve the utilization rate of the node. For the phenomenon that multiple heterogeneous networks cross cover, when choosing cluster heads, calculating separately the density of nodes in overlap area or not in overlap, preferred the nodes with large density as cluster heads, in order to balance the node with heterogeneous density, ensure the node comprehensive perception of the information and avoid empty perception. The ordinary nodes in the overlap area choose the cluster according to the distance to more than one cluster head, the comprehensive performance of and the residual energy of the cluster head to avoid data redundancy and reduce the network load.2) As multiple networks cross cover, in order to improve the real-time when the node transmits data, we improved the Directed Diffusion routing algorithm and designed two optimal routing paths for nodes in the overlap area. When one path failure the node can choose another path, this avoids the time consumption to rebuild path, improves the real-time of data transmission and meets the demand of the application that has a high requirement for real-time in the Io T. At the same time, in order to balance the network load and prolong the network life cycle when choosing the next hop, given full consideration of three factors energy, load, distance of the next hop.This paper uses NS2 simulation platform to simulate the improved algorithm. The experimental results show that the improved algorithm can balance the heterogeneous density and performance of heterogeneous of the node, improve the real-time when network transmit data, prolong the life cycle of the network.