Research On Virtual Backbone Network Construction In WSN For Internet Of Things

In recent years,the Internet of Things has been widely used in many fields and has become one of the hotly debated and focused research issues at home and abroad.And many countries have elevated the Internet of Things to the height of national strategy.As an important technology form of the underlying network of the Internet of Things,Wirless Sensor Networks(WSNs)bear the burden of linking traditional networks.Numerous sensor nodes are part of the WSNs.As the sensor node fails or sudden accident will cause the information transmission to fail,the network is less resistant to damage.In order to improve the network invulnerability and guarantee the effective transmission of information,a Virtual Backbone Network is usually constructed in WSNs.Existing research work does not consider network life and the size of the virtual backbone network.Therefore,this paper focuses on constructing a virtual backbone network from three aspects: reducing communication overhead,extending network lifetime,and minimizing the size of the virtual backbone network.For some WSNs with central management nodes,they can grasp the global network topology information.This article is based on the network average energy index and aims to extend the life of the network.On the basis of the D-MCDS algorithm,a centralized minimum-connected dominating set construction algorithm based on node weights is proposed.The algorithm first selects nodes with larger weights to construct an initial connected dominating set.Then,under the condition of ensuring VBN connectivity,redundant nodes are removed according to certain rules to construct a minimum connected dominating set.The simulation results show that this algorithm can obtain approximate optimal solution compared with the typical centralized and distributed algorithms.Compared with the D-MCDS algorithm,the average energy of nodes is higher and the network lifetime is extended by nearly 10.3%.For the centralized construction algorithm,it is necessary to obtain the global network information,the process is complicated,and the overhead is large.A distributed minimum connected dominating set construction algorithm based on node forwarding factor and energy consumption is proposed.The algorithm first randomly selects a node as the initial backbone node.Then use the dyeing method to build a maximal independent set;Secondly,the node priority is determined according to the timer set by the node,and the node with the larger weight is selected as the connection node to constitute the connected dominating set.Finally,a small loop pruning algorithm is used to remove redundancy and minimize the size of VBN.The simulation results show that compared with the typical distributed algorithm,this algorithm not only prolongs the network lifetime,but also approximates the minimum connected dominating set.With the increase of the number of network nodes,the number of messages sent by the algorithm is on the rise,but the increase is smaller and smaller.It further explains that this algorithm is suitable for larger networks.During the execution of the algorithm,only the local node information of the network needs to be obtained,so it has a strong distribution.