| Wireless sensor networks(WSNs) consist of a number of low-cost, low-energy micro-sensor nodes. Sensor nodes can sense and deal with the physical information of monitoring area, which can be transferred to sink node through wireless communication to form a multi-hop ad hoc network. With the development of microelectronics technology, sensor technology,communications technology, embedded technology and other disciplines, wireless sensor networks have been widely used in military, aerospace, furniture, medical and many other fields in recent years. At the same time, since the sensor node’s energy is limited, the sensor network is also facing many unique challenges and constraints. How to reduce node’s power consumption and improve the network lifetime is a critical issue faced by the wireless sensor networks.Clustering routing protocol will divide the network area to reduce the redundancy of network information, which can effectively save the network energy, and is helpful to the application of the distributed algorithm. Data aggregation technology will aggregate the data that sensor node collected from other nodes, to eliminate redundant data and reduce the amount of data transmission in wireless sensor networks, which can reduce energy consumption of the whole network. It is applicable to networks which has large network size and large number of nodes.Therefore, how to carry out reasonable network clustering and design effective data transmission mechanism has a very important significance for improving network performance.In this paper, we take energy optimization as the main object of study, systematically examines the sensor network protocol and routing policy. The research content involves dynamic partitioning clusters routing algorithm and adaptive data aggregation, and other aspects.Firstly, aiming at problems such as unreasonable clustering and imbalance of energy consumption, which exist in traditional hierarchical network, a dynamic uneven partitioned clustering routing algorithm based on energy and density(DUPC-ED) was proposed. In DUPC-ED,the entire network is divided dynamically according to the distance between normal nodes and the sink node, making the regions closer to the sink node with smaller nodes to reduce the cluster heads’ burden and energy consumption. By considering factors such as residual energy and densityto optimize the clusters’ uneven partition and the selection of cluster heads, and information is transmitted with mode of multiple hops based on data aggregate. Simulation results show that compared with the classical routing algorithm LEACH, DUPC-ED can balance the nodes’ energy consumption and prolong lifetime of the network effectively.Then, aiming at wireless network which has enormous number of nodes and wide distribution range, an adaptive data aggregation routing algorithm based on load balance and aggregation tree of cluster heads(ADA-LBAT) was proposed, which can further optimize data aggregation mechanism between the heads in DUPC-ED. ADA-LBAT comprehensively considered the hop count between nodes and the sink node, node residual energy, node density and other factors to introduce the concept of weight, according the weight to build a tree network, in which sink node is the root node of the tree. Nodes in the tree network are all cluster heads. ADA-LBAT will maintain and update the tree network through load balance factor to achieve energy balance. At the same time, in the data transmission process, nodes will do data aggregation adaptively according to aggregation benefit, this can reduce the network data redundancy, improve the network energy use efficiency and prolong the network life.Finally, the paper carried out summary and prospects for the overall paper work, and pointed out problems to be solved and work needed for further development. |
PDF Full Text Request