Research On Reliable Of Information Transmission In Wireless Sensor Network

Transmission the gathered information efficiently is a key functionality for wireless sensor networks (WSN). This paper systematically researches some key problems in reliable data transmission, which are closely related with each other, and may directly affect the transmission effectiveness and energy consumption efficiency. The main researches of this paper are as follows:(1)In general ,finding a path subject to multiple constraints such as delay and delay-jitter is a NP problem. Multiple const rained QoS routing optimization is an important problem in the curren WSN communication network research.in this paper ,we propose heuristic algorithm MCOPS for this problem , the algorithm first prunes all the links that cannot be on any feasible path from resource to destination ,it then uses a randomized search to find a feasible path ,in order to achieve efficient utilization of network resources ,the algorithm tries to select a path with minimum delay among all feasible paths.(2)Mobile Agent(MA) is more suitable for wireless sensor networks than the C/S model in data fusion. In MA based data fusion,the order of nodes visited along the route by MA has a significant impact on the algorithm efficiency and life time of wireless sensor networks.This paper proposes a mobile agent data fusion algorithm based on bayes estimation for wireless sensor networks. By designing data packet and data table with specific structure, and considers MA in multihop environments and adopts gradient of Bayes sequential estimation to dispatch MA.MA accounts for performing data processing and making data aggregation decisions at nodes rather than bring data back to a central processor, redundant sensory data will be eliminated.(3)Sensors route data by either sending the data directly to the sink or in a multi-hop fashion by delivering the data to a neighboring sensor. An abstract model of energy dissipation as a biased random walk is proposed. Specifically, we decompose the transmission range of sensors into concentric circular bands rings based on a minimum transmission distance between any pair of sensors. We also propose a data dissemination algorithm that exploits the above-mentioned decomposition to meet the specific requirements of a sensing application in terms of trade-off between energy and source-to-sink delay. Furthermore, this protocol is based on stochastic estimation methods and is adaptive to environmental changes.(4)Cooperative communication has been recognized as an effective and low-cost technique to combat multipath fading and enhance transmission reliability, network coding have each extensively been explored in the literature as a means to substantially improve the performance of wireless networks. The aim of this paper is to study the combination of network coding and cooperative communication.A novel cooperative transmission strategy is proposed. We analyze the end-to-end outage probability, evaluate the usefulness of relaying, and develop the data dissemination scheme based on the cooperative transmission policy. As shown in the paper, a distinguishing feature of the proposed scheme is that they allowing for a more efficient use of resources.(5)This paper investigates a kind of algorithm called splay tree based event region fault-tolerant detection algorithm for WSN. Since the algorithm is implemented over a splay tree in a distributed manner, a polynomial regression addressed these problems of event region detection by having a splay tree of sensor nodes. The sink can get attribute values in regions devoid of sensor nodes for attribute values that show smooth spatio-temporal correlation. Theoretical analysis and simulation results indicate that the proposed algorithm can attractively obtain the high event region detection accuracy and considerably reduce the false alarm probability even when fault nodes exist.(6)In the precondition of the communication connectivity of wireless sensor networks, how to solve the security haleness of the network is a very important problem in a large number of sensor nodes deployed.This paper focus on the possible epidemic breakout of such propagations where the whole network may fall victim to the attack. mostly existing approaches to solve this problem are to implement immunization strategy to compromised node.This paper present a immunization strategy based on local association feature(such as clustering coefficient,uniformity degree, cohesion degree)identifies immunization targets.analysis and simulation results show that the proposed algorithm enhance the ability of anti-deliberate attack of the network.This work is partially supported by The National Natural Science Foundation of China under Grant No. 61070169;The Opening Project of JiangSu Province Support Software Engineering R&D Center for Modern Information Technology Application in Enterprise No. SX200903; the Higher Education Graduate Research Innovation Program of Jiangsu Province in 2009 under grant No.CX09B₀25Z and Application foundation research of Suzhou of China(SYG201034).