The Research Of Energy-Efficient Geographic Routing Algorithms For Wireless Sensor Networks

Wireless sensor network (WSN) is a new and hot research area, which is highly interdisciplinary and can widely be used for civil and military applications, for monitoring, sensing, collecting and processing information of interested objects. Although there are many invaluable applications for wireless sensor networks, there are a lot of problems which must be handled and many challenges that must be solved. It is a hottest and most difficult problem among research on sensor networks that how to efficiently use the nodes'stringent energy and geographic locations to correctly and quickly build a route to some destination area for data transmitting, and at the same time to achive longer network lifetime by reducing nodes'enegy dissipation. In other words, research on enegy-efficient routing based on nodes'gepgraphic information, which should be applicable to wireless sensor network, is one of the most important and challengeable work for WSN.Based on the selection of next hop in packet forwarding, this thesis classified currently popular routing protocols for wireless sensor network (WSN) into four categories which are flooding/limited flooding routing, hierarchical routing, data-centric routing and location-based routing respevtively. And the paper also classified currently popular geographic routing schemes for WSN into three categories, according to the means used for communication hole's bypassing and nodes'state control, which are respectively limited flooding based scheme (LF), traditional greedy forwarding based scheme (TGF) and greedy forwarding with balance of enegy dissipation based scheme (GFBED). Through theoretical analysis and simulation, we have made a basic performance evaluation on the typical algorithms of TGF and GFBED, such as GPSR and GEAR. By the way, GPSR is an algorithm based on the idea of TGF, and GEAR is an algorithm based on the idea of GFBED. The simulation results show that GEAR can more efficiently decrease energy consumption among a network than GPSR does, and hence GEAR can also prolong network lifetime much longer than GPSR. Based on the analysis of the two algorithms, to solve some problems of them, this thesis proposes a new geographic routing scheme which is based on geographic information and different states of nodes with network energy balance (GIDSNEB), and according to the new idea, we then proposes a specific algorithm, enegy efficient geographic routing (EEGR). The EEGR uses nodes'different states to conserve more energy and balance network energy consumption, provide better support for large-scale network with high density, and so achieve network energy efficiency. Finally, we add the EEGR module into NS-2 network simulator and...