Research And Optimization Of Context-Aware Routing Algorithm For Wsns Based On Unequal Clustering

The microelectronics technology, embedded computing technology, wireless communication technology and distributed information processing technology have promoted the rapid development of wireless sensor network(WSN) and make it become a hot spot of current day’s scientific research. Wireless sensor networks have the following characteristics, limited node energy, self-organized network,, low cost of power and consumption. The choice of the wireless sensor network protocol is associated with applications and data, so appropriate network communication protocols should be developed for different application requirements.The existing routing protocols can be divided into flat routing protocol and hierarchical routing protocol based on the status of nodes in the network and clustering routing protocol is representative of hierarchical routing protocol. This paper analyses several classic routing protocols, such as FLOODING, SPIN, LEACH, HEDD, UCR, etc., and analyze their deficiencies, then proposes a new Context-Aware Routing Algorithm for WSNs Based on Unequal Clustering(CAUCR).The clustering process and routing process are two separate and independent processes. The useful information in clustering process is not retained and the random selection of cluster head also led to a waste of energy. In response to these deficiencies CAUCR made the following optimization:(1).In clustering process, CAUCR uses Optimized Weighted Unequal-Clustering Algorithm (OWUCA). OWUCA takes the voting mechanisms to elect a local and optimum cluster head. Cluster member will take the distance to the cluster head, the number of nodes around the cluster head and the residual energy of cluster head into consideration to select the optimal cluster head to join. The unequal-clustering algorithm can generate more cluster heads near the station, which delayed the occurrence of empty energy.(2).The cluster head will retain the information received from other cluster head during clustering process, so the cluster head will have the information of cluster heads around this cluster head. And the probe information can be saved thanks to the information.(3). Routing process uses Reverse Minimum Energy (RME) multi-hop routing algorithm. RME starts routing construction based on the cluster head’s distance to the sink, and the cluster head closer to the sink forms the routing table earlier. By this way, the cluster head can get the information such as the remaining energy of the next hop, the hop and the energy consumption through the next hop which improves the flexibility of the network.(4). Cluster radius is limited during the clustering process. Limited cluster radius guarantees that in a certain range the cluster head there will be at least one another cluster head. This feature guarantees the connectivity and stability of the network and the connectivity and network stability.Simulation results show that CAUCR saves network energy consumption, significantly prolong the network lifetime compared to LEACH, HEED and UCR.