Greedy Routing Algorithm Based On Geographical Location Information In Wireless Ad Hoc Network

Traditional ad hoc network protocols are based on network topology, whilethey make no use of geographical location of nodes. Nodes in practical network caneasily access geographical location with methods such as GPS and demand ofoverall information disables the scalability. Routing protocols based ongeographical location without overall network topology make significant sense.This paper firstly clarifies and analyzes the performance on packet deliveryratio and routing load of traditional routing protocols with experimental simulation;then, this paper clarifies routing decision with greedy algorithm based on directionor progress or distance nearest, and prove in theory that progress or distance nearestgreedy routing can avoid routing loops while the directional one cannot, and withexperimental simulation, direction greedy routing performs worse than the others inpacket delivery ratio and average path length and distance greedy routing p erformsa little better than the progress one; at last, this paper clarifies problem of routingvoid, analyzes the performance of all-traversing and single-traversing face routing,face routing can guarantee delivery and get perfect packet delivery ratio, whileresults in longer average path length, and single-traversing face routing performsshorter average path length than the all-traversing one.This paper combines the greedy routing with face routing, and proposes thegreedy routing algorithm with guaranteed delivery which can overcome theproblem of local maximum. Greedy routing algorithm with guaranteed deliveryperforms better in packet delivery ratio, but the average path length becomes longerbecause of face routing. This paper also optimizes the greedy routing based on locallink quality, and the local operation does not damage the scalability of greedyrouting algorithm. And compared with traditional routing protocol, greedy routingwith guaranteed delivery performs better in higher packet delivery ratio and lessrouting load and performs scalable. The optimized greedy routing algorithm basedon link quality performs better than the original one in packet delivery ratioespecially in networks whose nodes moves sharply.