Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in OS and Networks
Efficient Greedy-Face-Greedy Geographic Routing Protocols In Mobile Ad Hoc And Sensor Networks, Yan Sun
Efficient Greedy-Face-Greedy Geographic Routing Protocols In Mobile Ad Hoc And Sensor Networks, Yan Sun
Theses and Dissertations--Computer Science
This thesis describes and develops two planarization algorithms for geographic routing and a geographic routing protocol for mobile ad hoc and sensor networks. As all nodes are mobile and there is no fixed infrastructure, the design of routing protocols is one of the most challenging issues in mobile ad hoc and sensor networks. In recent years, greedyface- greedy (GFG) geographic routing protocols have been widely used, which need nodes to construct planar graphs as the underlying graphs for face routing.
Two kinds of planarization algorithms have been developed, idealized and realistic planarization algorithms, respectively. The idealized planarization algorithms make the …