Design And Realization Of Routing Algorithm With A Feature Of Virtual Optimized Hop

In recent years, with the explosive growth and more and more powerfulperformance of wireless/mobile devices, the geographic routing is proposed foradapting the modern wireless sensor networks’ topology with the robustness, flexible,and high scalability features. Due to the high efficiency and instantaneity of datatransmitting method, greedy forwarding is widely used in geographic routings. However,the void problem is always around us in algorithms which adopt the greedy forwardingas their primary data transmitting algorithm. The significant research topic is to resolvethis puzzle within own interior structure of node.Based on greedy forwarding, a novel routing algorithm is proposed in this thesis.By generating certain virtual optimized hop nodes, void problem caused by greedyforwarding is solved efficiently for avoiding the application of Planarized algorithmsand flooding schemes (both of them will lead to many redundant hops) which are usedin some conventional approaches. In the estimation stage of the algorithmperformance, we build a simulation platform for the wireless network which is based ongeographic information. The virtual optimized hop algorithm, together with other twoclassical routing algorithms which are also based on greedy forwarding, is simulated inthis platform. The simulation experiment mainly focus on the lifetime of the threealgorithms (number of remain nodes in the network) when facing routing void problem,and data transmission efficiency (number of hop achieving certain amount oftransmission). The results of the three algorithms are compared with each other.