Wireless Sensor Networks Based On Minimum Hop Field Controllable Topology And Routing Research

Wireless sensor network is composed of many micro-sensor nodes which densely deployed in observe environment and self-organization by wireless communication. These sensor nodes observe, perceive and collect data of environment in collaboration with each other, and send this information to terminal user by single hop or multi-hop.Because wireless sensor network has large numbers of nodes and these nodes supply with battery, limited by power. Therefore, the primary design principle of wireless sensor network is how to save energy and prolong network's lifetime. The network's topology structure and routing protocol are kernel of wireless sensor network, they influence network's lifetime directly. The good topology structure and routing protocol can serve network's transfer efficiency; data fuse and target locating and so on. So, the study of topology structure and routing protocol is not only the base of wireless sensor network but also the key point and nodus.To reduce the node's energy consume, provide flexible communication ways, improve the expansibility, usually we adopt distributed, hierarchical control method. The network is divided by cluster. Cluster make up by cluster heed and normal nodes. Under layer cluster heed can form upper layer cluster. Cluster heed not only entail collect information task itself, but also collect data from other nodes which belong to its scope and fuse these data. So, node close to Sink node entail more job, energy consume faster. This is "hot spot" problem.This dissertation describe wireless sensor network system framework, characteristic, and other knowledge, compared and analyzed some classic routing protocols, be aim at large scale of nodes energy consume unbalanced and "hot spot" , pose an asymmetry cluster topology structure control and routing protocol which base on minimal hop. This protocol form by four stages: the network initialization, cluster head chosen, cluster form stage and cluster to cluster routing. During the first stage, nodes get_ there least hop and other parameter. The second stage, nodes computer, the probability of be cluster head and competitive radius distributed. Communicate and compete head, finally form uneven cluster, after cluster head election, normal nodes join cluster according to minimal communicate cost. And cluster head chose next hop by minimal hop.From the simulation result, compare with other arithmetic, this protocol has better performance in control topology and cluster head distributing, and effectively balance the consumption among cluster heads, and achieves an obvious improvement on the network lifetime.