Location-based Clustering Routing Protocol For Wireless Sensor Networks

In WSN, the nodes are the large-scale deployment and energy-constrained. Designing energy-efficient routing to improve the network load balancing and to prolong the network survival lifetime, is a central issue in WSN research. Clustering Routing has better scalability and robustness, and is the foucs of research in routing protocols at present. Clustering protocol commonly use mulit-hop communicaiton, so the cluster closed to Base Station (BS) need to consume more energy to forward more data from other cluster. It results in uneven network load. In the designing of clustering routing protocol, there is necessary to conside the network of energy-constrained and energy imbalance.Introducing geographic information in node deployment of clustering routing can optimize the number of nodes, the distribution forms of nodes, or the energy distribution of nodes; considing geographic location information in the designing of routing protocols, can control the number and location of cluster heads, reduce the communication cost of inter-cluster, and enhance the efficiency of the routing forwarding. Both approaches can reduce node energy consumption, increase the energy load balancing, and extend the network lifetime.In this thesis, we make WSN's own characteristics and the unique design requirements for routing protocols as the prerequisite, and make the clustering routing as a basic starting point, focus on geographic location-based clustering routing protocols to study WSN. Main tasks are summarized as follows:(1) Energy-Efficient Nodes Deployment strategy (EEND). In the one dimensional linear network topology, considing the node data compression ratio and analysing the impact among inter-cluster spacing, node density and node energy consumption, non-uniform optimal spacing between clusters and optimal density is proposed to optimize the node deployment and improve the efficiency of energy utilization.(2) Optimal Number of Cluster Heads (ONCH). Study the energy dissipation model of classical clustering routing protocol LEACH. From the perspective of operation in an integrited "round", analyse energy consumption of cluster heads and member nodes at all stages of the algorithm implementation process. A new optimization formula for calculating the cluster heads is proposed. It provides a theoretical basis for the calculation of the optimization number of cluster heads in LEACH protocol.(3) Uneven Virtual Grid-based Clustering Routing Protocol (UVGCR). In the network topology structure of concentric rings, use the optimization formula of cluster heads to calculate the number of cluaters in each ring, and divide rings into virtual grids. According to residual energy and the inter-cluster communication cost, the cluster heads are elected in virtual grids. Make base station as the center to establish a routing tree to communicate between the cluster heads and BS in multi-hop. At last, transform the nodes location within clusters through the rotation of clusters to make more nodes have opportunity to become cluster heads. VGUCR improve the energy load balancing and prolong the network survival time.