Research On Several Key Routing Techniques For Wireless Sensor Networks

Routing is a key technology for wireless sensor networks (WSNs), which affects network performance greatly. A good routing algorithm can build an energy-efficient routing, enhance fault tolerance capability, form reliable data forwarding scheme, and maximum network life cycle. Evaluating a routing protocol mainly bases on network life cycle, transmission delay, routing fault tolerance capability, routing safety and expansibility. It equipoises energy consumption via optimizing route. We discuss the routing problem for wireless sensor networks through considering energy consumption, transmission delay, network topology and route safety. The main contributions are generalized as follows:(1) We models a system mathematically to nodes route scheduling problem of global delay and energy consumption, proposes a node scheduling scheme using the immune clone algorithm. The proposed scheme can not only avoid the collision among sensor nodes when forwarding data packets, but also solve the global optimization problem of power consumption and delay with fast convergence speed. The simulation results show that the proposed algorithm have higher performance compared with LEACH.(2) To overcome the deficiency of existing cluster routing methods in cluster head selecting, we proposes a clustering model based on cellular topology (CHCT) for WSNs, in which the position of sensor nodes and remaining energy are simultaneously considered during the cluster structure construction, and the desired cluster structure is generated even in the case of nodes without locating device. The formed cellular cluster structure can balance the energy consumption, optimize the coverage area of clusters, and improve the operation efficiency. The experimental results show that CHCT can perform with higher efficiency in large-scale network deployment compared with the existing hierarchy.(3) We propose a DHT trust overlay network (DHTON) to model the network structure and the storage of reputation information. We also design a robust and distributing reputation system, DHTrust, which takes full advantage of the Distributed Hash Table (DHT) to distribute local reputation to trade off the damage of fake reputation information by genuine reputation information. The proposed system inspires us a lot in solving route selecting truth problem in wireless sensor networks. Simulation experiments show that our system makes significant performance gains in convergence speed and aggregation accuracy, and the most important, is robust to malicious peers.