Research On Network Flow-Based Path Optimization Of Wireless Image Sensor Network

This paper first briefly discusses the background knowledge of the wireless sensor network,such as the characteristics of the wireless sensor network,the network architecture and the performance of evaluation about wireless sensor network.we analyze the feature of the wireless image sensor network which is special in wireless sensor network.Being based on the Wireless Image Sensor Network(WISN),the acquisition of the characteristics of image and video files,higher requirements for the link bandwidth of sensor network transmission are put forward.In addition,because the wireless sensor network node energy is limited,and large number of sensor nodes which are deployed randomly are hard to supplement energy,so the lifetime of sensor network is limited.In the wireless image sensor networks,ensuring the entire network transmission bandwidth and the longest network lifetime are the most important problems need to solve.This paper studies the transmission link bandwidth of the sensor network and network lifetime,analyzes the relationship of the different routing planning and transmission link bandwidth.Being based on maximum flow problem of transformation of graph which is transformed from the wireless sensor network,a new decomposition algorithm is proposed in this paper.Algorithm allocates the transmission path for multi-objective problems optimally.After transforming the graph corresponding to the sensor network into the flow network,we get the maximum flow of the network.On the basis of the maximum flow,we decompose the maximum flow into a set of paths that all the paths can cover the target with the flow decomposition,this can ensure the bandwidth requirements for data transmission.In addition,we prove flow network is k-balance and then a k-balance flow decomposition algorithm is given to a set of single flow,so we can ensure the maximum lifetime of the whole sensor network.At the end of this article,we do some experiment,after we compare with traditional algorithm,we can prove the availability of our algorithm which is provided in the article.The main work of this article is as follows:1?Analyzing network structure,characteristics of the existing wireless sensor network and the current problems in sensor networks.It also analyzes the specific characteristics of image sensor which is a sensor devices of particular type.Including data analysis and the analysis of the sensor lifetime.2?Directing to the characteristics of the image sensor network which has large quantities of data and large number of monitoring target,this paper transform the problem of network link bandwidth into the network flow problem in graph theory.on the basis of network maximum flow,there provide a flow decomposition algorithm.So we can decompose the flow into a set of paths that all the path can cover the target to ensure the available bandwidth of each target.3?Directing to the problem that the lifetime of the wireless sensor network is limited,we transform the problem of maximum network lifetime into the problem of k-balance flow.On the basic of k-balance flow,we provide a k-balance flow decomposition algorithm to decompose the k-balance flow and then transform the flow into a set of node disjoint path.Each set of paths can monitor the target and transfer the data to the sink node.Through the result of experiment,our k-balance flow decomposition algorithm can decompose the flow completely,this can prove the feasibility of the algorithm.