Design And Simulation Of Routing Protocol For Wireless Sensor Networks

Recent technological advances have enabled distributed micro-sensing for large scale information gathering through a network of tiny, low power devices or nodes equipped with programmable computing, multiple sensing and communication capabilities. This network of sensor nodes is known as a wireless sensor network (WSN) because of its ease of deployment, ad hoc connectivity and cost-effectiveness. Wireless Sensor network, which is made by the convergence of sensor, nested computation, networks and wireless communication technologies, is a novel technology about acquiring and processing information. It is a late-model wireless networks of infrastructureless network and can be used for testing, sensing, collecting and processing information of monitored objects. WSN is a new research area and has a wide application future. Both academia and industries are very interested in it.Designing routing protocol of WSN is the main part of this dissertation. The number of sensor nodes in WSN is numerous and single node is extraordinarily limited in resource. The all-important aim of designing routing protocol of WSN is to reduce the overall energy dissipated in the network and to maximize the network lifetime. The paper analyzes the hardware framework, the network protocol structure, different taxonomy and some routing protocols that proposed by oversea researcher, and assimilates excellent ideas among them to propose a new routing protocol, Energy-Efficient Clustering Routing Protocol (EECRP).The EECRP is derived from the classic routing algorithm LEACH, and divides the routing procedure into three steps: Clustering, Data Transmission, and Intra-clustering Head Rotating. The Clustering takes advantage of geographic information of all nodes to adapt its cluster number, and forms the k clusters based on Minimum Spanning Tree and Kruskal Algorithm. During the Data Transmission, the sink node partition the procedure into several Rounds, and the cluster head assign a time slot to each cluster member. In the end of each Round, the cluster head initiates an intra-cluster head rotating to disperse the overload of heads, which is based on node energy and the distance to sink node.In the process of simulation, four related routing protocols, Direct Communication (DC), Static Clustering (SC), Low-Energy Adaptive Clustering Hierarchy (LEACH) and EECRP, are compared. The simulation result shows that the proposed protocol EECRP has better performance than LEACH and other algorithms in terms of network lifetime.