Please use this identifier to cite or link to this item:
|Title:||Greedy face routing with face ID support in wireless networks||Authors:||Tao, S.
Path stretch factor
|Issue Date:||2007||Citation:||Tao, S.,Ananda, A.L.,Choon, C.M. (2007). Greedy face routing with face ID support in wireless networks. Proceedings - International Conference on Computer Communications and Networks, ICCCN : 625-630. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCCN.2007.4317887||Abstract:||Geographic face routing provides an attractive way for packet delivery in wireless networks due to its high reliability and low overhead. A good face routing protocol should provide guaranteed packet delivery and efficient routing paths. In this paper, we present a new face routing method named GFRIS that has both features by actively probing each face for the face size and the unique face identification sequence - face ID. Face switch occurs only if the outgoing edge intersects with the local minimum-destination line at a progressing location and the edge is shared between two different faces. To avoid the huge performance penalty when selecting an inefficient face traversal direction on a large face, GFRIS uses the face size to trigger the bounded face traversal procedure as proposed earlier in GOAFR+. Simulation results show that, by using face ID to assist face switch and adaptively applying the normal and bounded face traversal rules according to the face size, GFRIS achieves lower path stretch factor compared to GFG, GPSR, GFG2 and GOAFR+. The worst case performance of GFRIS is even better than that of GOAFR+ in critical node densities from 4 to 7.||Source Title:||Proceedings - International Conference on Computer Communications and Networks, ICCCN||URI:||http://scholarbank.nus.edu.sg/handle/10635/42085||ISBN:||9781424412518||ISSN:||10952055||DOI:||10.1109/ICCCN.2007.4317887|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 28, 2019
checked on Dec 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.