EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS

EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS

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 mobil...

Full description

Bibliographic Details
Main Author: Sun, Yan
Format: Others
Published: UKnowledge 2012
Subjects:
Geographic routing
greedy routing
face routing
unit-disk graph
concave nodes
Computer Sciences
OS and Networks
Online Access:http://uknowledge.uky.edu/cs_etds/3
http://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1002&context=cs_etds

Internet

http://uknowledge.uky.edu/cs_etds/3
http://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1002&context=cs_etds

Similar Items