Abstract
A wireless sensor network has unidirectional links because sensors can have di erent transmission ranges, sensors have unstable transmission ranges, and a hidden termi- nal problem exists. In this thesis, I introduce a pre-construction protocol to construct graphs based on the network topology to make face routing usable on the wireless sen- sor networks with unidirectional links, and I propose a geographic routing, Directed Greedy Face Greedy (D-GFG), which routes packets on these graphs. My routing protocol guarantee packet delivery without computation and storage of global topol- ogy features. Furthermore, the performance of D-GFG is excellent after applying the sampling procedure. Using the simulation, I evaluate the performance of the proposed routing protocol(D-GFG), Greedy Other Adaptive Face Routing (GOAFR+), Greedy Perimeter Stateless Routing (GPSR), Greedy Face Greedy Routing (GFG), and the greedy routing protocol based on Euclidean distance. The simulations demonstrate that our routing protocol ensures moderate routing path length.