Algorithm Design On Energy-based Geographic Routing In WSN

Wireless sensor network (WSN) is a kind of self-organized network systems in which massivesensor nodes are deployed to collect the interesting data and establish wireless communication linkswith each other. Nodes in WSN are limited in power. Nodes’early death will badly affect theperformance of WSN. Having a good routing protocol is one of the crucial techniques which have agreat effect in saving energy and prolonging lifetime of network. Among numerous routingalgorithms, geographic routing is an attractive localized routing scheme for wireless sensornetworks. So how to employ a proper energy-based geographic routing protocol is our goal. Themain achievements of this thesis are listed as follows:1. In this thesis, an energy-saving geographic routing protocol (ESGR) is proposed afteranalyzing the relationship between distance and energy. Then a balance-aware energy-efficientgeographic routing protocol BEGR is proposed. This algorithm can balance the energy consumptionof the network on the foundation of saving energy. It can avoid the emergence of holes caused bysome nodes dying early. We prove that our protocol is loop-free and can adapt to dynamic scenarios.Simulation results demonstrate that BEGR is better than other protocols in prolonging networklifetime.2. In order to save more energy, sleep scheduling is considered. According to BEGR, a newsleep scheduling algorithm (BSS) is designed using the information of residual energy of sensornodes. This algorithm matches BEGR very well. In BSS, the node which has little chance to be nexthop has great probability to go into sleeping state. This can reduce the number of routing pathswhich will be calculated so that it optimizes BEGR routing algorithm. Simulations are performed tocompare BSS with Randomized Independent Sleeping. The results demonstrate that our scheme canenhance network lifetime greatly.