Greedy Face Routing With Face Identification Support in Wireless Networks

Geographic face routing protocols planarize the connectivity graph of a wireless network in a distributed manner and forward packets on the resulted planar topology with high reliability and low overhead. A preferable face routing protocol should provide both guaranteed packet delivery and efficient routing paths, which requires a flexible face switch algorithm adaptive to the network complexity. In this paper, the authors present a new face routing algorithm named GFRIS that offers both features by performing active probe to measure the face size and generate a unique face identification sequence - face ID.

Provided by: Reed Elsevier Topic: Mobility Date Added: Jul 2010 Format: PDF

Download Now

Find By Topic