For The Wmsn The Node Adaptive Energy-sensitive Routing Algorithm

Wireless multimedia sensor network (WMSN) with the features such as self-organization, data center, resource limitations, poor safety and application-related has been so widely applied in-the military, industry, agriculture, transportation, health care, environmental protection, disaster prevention and other fields that it has became one of the major scientific technology in the 21st century. The earth-shaking changes of WMSN hardware technology are now happening and will make WMSN go through the development process from traditional sensors to intelligent sensors. Such changes are mainly displayed in intelligent sensing module, data storage expansion, energy supply supplement, low price sensors, large-scale networks and so on. Driven by the widely application of WMSN, the unique characteristic "miniature network" and their developing tendency had made designing special network communication protocol and routing algorithm be a research hot. Specifically, the transmission of multimedia data has put forward unprecedented challenges to the traditional wireless sensor network in network bandwidth, data transmission delay, reliability, accuracy and other network performance.In some applications of WSN, achieving energy efficiency is often more important than choosing shortest path. But. in order to meet QoS requirements in some special applications in WMSN. choosing shortest paths for data transmission is good for reducing data transmission delay and saving energy consumption in overall network. So we hope design a routing algorithm which can find approximate shortest paths and at the same time provide safeguard for energy equilibrium consumption. In order to achieving energy conservation and energy equilibrium consumption, this paper proposes a node-adaptive energy and location aware routing algorithm (AELAR) for WMSN. To improve the energy efficiency in WMSN and reduce the data transmission delay, this paper had done the works as follows:(1)This paper had firstly taken an overview presentation of the network model of WMSN, including the communication model of wireless network node, the assumptions and definitions of network model which are used in this paper.(2)The data collected by multimedia sensor nodes usually has great relevance, so we secondly proposed a method of "abstracted data source" to process the origin data collected by multimedia sensors. WMSN that has several sensors which are usually responsible for the same monitor task can get benefit from this data process method. Based on data fusion, the method not only saves the data transmission energy but also simplify the heterogeneous distribution of wireless multimedia sensor networks.(3)To divide the routing request zone suitably for the data relay nodes, this paper gives the new concepts of"the virtual coordinate system" and "elliptical routing request zone" for each node. The new elliptical routing request zone has the ability of self-adaptation which means that the nodes can adapt the area of the routing request zone automatically according to their geographic locations. So they can choose different number of neighboring nodes as candidates.(4)To help the nodes choose the best neighboring node as the next hop in the routing progress, this paper design a neighbor-evaluate function which considers neighboring nodes' geographic location, residual energy and energy consumption progress together for each node. The distance factor and energy factor in the function are also adaptive. That is, the nodes can give the factors different values according to their geographic locations so that the routing algorithm can balance energy consumption and find the shorter path as soon as possible. In addition, with the help of logarithm function, the algorithm in this paper also made the neighbor evaluation function of nodes had the ability to exaggerate residual energy difference between neighbors to protect the nodes that have little residual energy or have suffered excessive energy consumption.(5) Based on the abstracted data source, elliptical routing request zone and neighbor evaluation function, we illustrated AELAR routing find process and routing recovery mechanism. The algorithm takes different scheme for the source node and non-source node to avoid routing failure at source node in the routing find process. In the routing recovery mechanism, the algorithm use the principle of "failure-node's side first" to recover the routing, so that to avoid wasting energy and increasing data delay in retransmission process.(6) Finally, we compared the algorithm proposed in this paper with classic GPSR and GEAR and analyzed their performance by computer simulation to prove the validity of the algorithm while it is used for data transmission in high-density static WMSN. The simulation results show that the algorithm in this paper can provide better performance in terms of prolonging network lifetime, promoting energy utilization ratio, reducing average routing path, decreasing residual energy deviation and so on.