Research On Routing Technology For Wireless Multimedia Sensor Networks

Wireless multimedia sensor networks(WMSNs)mainly realizes distributed monitoring and system control functions.Routing algorithm enables users to collect monitoring information timely and accurately by transmitting data collected in the target area.In the traditional Low Energy Adaptive Clustering Hierarchy(LEACH),the resources of nodes are not fully utilized because the process of building clusters is random,which speeds up the death of network and causes the network performance to be unstable.In addition,routing maintenance is cumbersome and takes up a lot of bandwidth.Routing protocols are required to make full use of the limited network resources and guarantee the performance of data quality of service in WMSNs.This thesis mainly studies the routing protocol of clustering structure in WMSNs,and proposes a clustering algorithm based on energy-efficient optimal cluster number and bisecting k-means.It combines energy,distance and cluster centralization to improve the cluster head election.It also adapts to the network conditions dynamically.The algorithm balances the network load,effectively improves the network lifetime with limited energy,and improves the performance of end-to-end delay and packet delivery ratio.The main work of this thesis includes the following:(a)Aiming at the node distribution and energy consumption model of sensor networks,the optimal number of clusters is determined to minimize the overall energy consumption of the network.(b)The clustering process decreases the energy caused by broadcasting cluster head information in traditional LEACH.Based on the minimum sum of squares for error of the distance of all clusters and the optimal number of clusters,the clustering phase is optimized.This can improve the distance similarity among nodes as much as possible in the same cluster and reduce the overall network overhead.(c)A cluster head rotation strategy based on the normalized energy of nodes within a cluster,the distance to the base station and the distance between a node and cluster center is proposed.It can improve the fairness and rationality of cluster head election.(d)The updating process is optimized.It can reduce unnecessary re-clustering process and timely update cluster heads.In the latter period of the network life,the clustering structure is adaptively adjusted,and the routing algorithm can better adapt to the network environment with worse condition.Finally,the performance of the proposed routing protocol is verified by NS2 simulation experiments.The results show that the routing algorithm greatly improves the network lifetime and the quality of data transmission.