Energy-efficiency Routing Protocol In Wireless Sensor Networks

Wireless Sensor Networks(WSNs) is a new infrastructureless wireless network, it is the integration of sensing, embedded computation, distributed information process and wireless communication techniques. Wireless Sensor Networks can be used for monitoring, sensing, collecting and processing information of environment and monitored objects, it is a new research area for communication and computer science and technology. Research of wireless sensor networks will propose many new challenges to network research.Design of routing protocol in wireless sensor networks is the main part of this dissertation. In traditional wireless networks such Ad-hoc networks the main purpose of network protocol design is to provide high Qos and efficient utilization of bandwidth, but the first priority task for routing protocol design in wireless sensor networks is to increase the energy efficiency of sensor nodes and prolong lifetime of the whole network because of the limited energy, communication and computation capability of sensor nodes. Wireless sensor networks has large amount of nodes and these sensor nodes distribute widely in the network area, so routing protocols in wireless sensor networks also need to have the ability to find a path from source node to its destination even if each sensor node can only get local information of the network topology. Based on the research of wireless sensor networks, we propose GBHHR-a Geographical-based Heterogeneous Hierarchy Routing protocol in wireless sensor networks.In this dissertation we first introduced the basic network structure of wireless sensor networks, then we discussed some standard routing protocols. The principles and design of GBHHR are elaborated as the main part of this dissertation. GBHHR protocol divides region into virtual grids and selects heterogeneous node to be clusterhead and sensor node to be cluster member. Sensor nodes send data to their cluster heads and these data are transferred between cluster heads until they reach the Sink node. Such a hierarchical network structure can increase scalability of the network, and it also incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the sink node. In addition, GBHHR uses heterogeneous node to predigest the cluster head election algorithm and data are routed by HFR algorithm which is a new proposed routing algorithm. At last, in this dissertation GBHHR is simulated and the simulation results is analysed in detailed.