Greedy face routing with face identification support in wireless networks |
| |
| Authors: | Shao Tao AL Ananda Mun Choon Chan |
| |
| Affiliation: | 1. School of Interdisciplinary Informatics, University of Nebraska at Omaha, Omaha, NE, United States;2. School of Computing Science, University of South Alabama, Mobile, AL, United States;3. School of Computing Science, University of Glasgow, Glasgow, Scotland, United Kingdom;1. Mobile Cloud Computing Research Lab, Faculty of Computer Science & Information Technology, University of Malaya, 50603 Kuala Lumpur, Malaysia;2. Department of Computing and Information Systems, The University of Melbourne, Doug McDonell Building, Parkville Campus, Melbourne, Vic. 3010, Australia;1. Research Scholar, Department of Instrumentation and Control Systems Engineering, PSG College of Technology, Coimbatore, India-641004;2. Professor, Department of Instrumentation and Control Systems Engineering, PSG College of Technology, Coimbatore, India-641004;1. Technion-Israel Institute of Technology, Faculty of Education in Technology and Science, Technion City, Haifa, Israel;2. Technion-Israel Institute of Technology, Faculty of Industrial Engineering and Management Technion City, Haifa, Israel;3. Massachusetts Institute of Technology, Cambridge, MA, USA;1. Graduate Program in Industrial Engineering (PPGEP), Federal University of Rio Grande do Sul (UFRGS), Av. Osvaldo Aranha, 99, 5° Andar, Porto Alegre, RS 90035-190, Brazil;2. Department of Industrial and Systems Engineering, Federal University of Santa Maria (UFSM), Av. Roraima, 1000, Prédio 7, Sala 306, Santa Maria, RS 97105-900, Brazil |
| |
| Abstract: | 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, we 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. In GFRIS, face switch occurs only if the outgoing edge intersects the local minimum-destination line at a progressive location and the crossing edge is shared between two different faces. To avoid the severe performance penalty when an inefficient face traversal direction is selected on large faces, GFRIS uses the face size to trigger the bounded face traversal procedure as proposed earlier in GOAFR+. As multiple local minimum locations on a face will trigger bounded search repetitively, GFRIS employs a fast forward mode to bypass bidirectional search on the face, which leads to significantly improved path stretch performance. This paper provides a detailed performance comparison between GFRIS and the existing face routing algorithms including GFG, GPSR, GOAFR+ and GFG2. 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 can achieve better routing efficiency with low control overhead compared to other protocols evaluated across a wide node density range. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
