Improving routing efficiency through intermediate target based geographic routing

Zongming Fei; Jianjun Yang; Hui Lu

doi:10.1016/j.dcan.2015.07.001

Improving routing efficiency through intermediate target based geographic routing

Zongming Fei, Jianjun Yang, Hui Lu

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR) to solve the long detour path problem. The basic idea is to use previous experience to determine the destination areas that are shaded by the holes. The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes. We design an efficient method for the source to find out whether a destination node belongs to a shaded area. The source then selects an intermediate node as the tentative target and greedily forwards packets to it, which in turn forwards the packet to the final destination by greedy routing. ITGR can combine multiple shaded areas to improve the efficiency of representation and routing. We perform simulations and demonstrate that ITGR significantly reduces the routing path length, compared with existing geographic routing protocols.

Original language	English
Pages (from-to)	204-212
Number of pages	9
Journal	Digital Communications and Networks
Volume	1
Issue number	3
DOIs	https://doi.org/10.1016/j.dcan.2015.07.001
State	Published - Aug 1 2015

Bibliographical note

Funding Information:
The work presented herein was funded in part by the U.S. Department of Energy, Energy Efficiency and Renewable Energy Program , under University of Central Florida Award Number DE-EE0006340 . The views and opinions of the authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof, nor of the University of Central Florida or any agency thereof.

Funding Information:
The work presented herein was funded in part by the U.S. Department of Energy, Energy Efficiency and Renewable Energy Program, under University of Central Florida Award Number DE-EE0006340. The views and opinions of the authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof, nor of the University of Central Florida or any agency thereof.

Publisher Copyright:
© 2015 The Authors

ASJC Scopus subject areas

Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1016/j.dcan.2015.07.001

Cite this

@article{86b2a353d2ad4da397d8821999aa2ba2,

title = "Improving routing efficiency through intermediate target based geographic routing",

abstract = "The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR) to solve the long detour path problem. The basic idea is to use previous experience to determine the destination areas that are shaded by the holes. The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes. We design an efficient method for the source to find out whether a destination node belongs to a shaded area. The source then selects an intermediate node as the tentative target and greedily forwards packets to it, which in turn forwards the packet to the final destination by greedy routing. ITGR can combine multiple shaded areas to improve the efficiency of representation and routing. We perform simulations and demonstrate that ITGR significantly reduces the routing path length, compared with existing geographic routing protocols.",

author = "Zongming Fei and Jianjun Yang and Hui Lu",

note = "Funding Information: The work presented herein was funded in part by the U.S. Department of Energy, Energy Efficiency and Renewable Energy Program , under University of Central Florida Award Number DE-EE0006340 . The views and opinions of the authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof, nor of the University of Central Florida or any agency thereof. Funding Information: The work presented herein was funded in part by the U.S. Department of Energy, Energy Efficiency and Renewable Energy Program, under University of Central Florida Award Number DE-EE0006340. The views and opinions of the authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof, nor of the University of Central Florida or any agency thereof. Publisher Copyright: {\textcopyright} 2015 The Authors",

year = "2015",

month = aug,

day = "1",

doi = "10.1016/j.dcan.2015.07.001",

language = "English",

volume = "1",

pages = "204--212",

number = "3",

}

TY - JOUR

T1 - Improving routing efficiency through intermediate target based geographic routing

AU - Fei, Zongming

AU - Yang, Jianjun

AU - Lu, Hui

N1 - Funding Information: The work presented herein was funded in part by the U.S. Department of Energy, Energy Efficiency and Renewable Energy Program , under University of Central Florida Award Number DE-EE0006340 . The views and opinions of the authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof, nor of the University of Central Florida or any agency thereof. Funding Information: The work presented herein was funded in part by the U.S. Department of Energy, Energy Efficiency and Renewable Energy Program, under University of Central Florida Award Number DE-EE0006340. The views and opinions of the authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof, nor of the University of Central Florida or any agency thereof. Publisher Copyright: © 2015 The Authors

PY - 2015/8/1

Y1 - 2015/8/1

N2 - The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR) to solve the long detour path problem. The basic idea is to use previous experience to determine the destination areas that are shaded by the holes. The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes. We design an efficient method for the source to find out whether a destination node belongs to a shaded area. The source then selects an intermediate node as the tentative target and greedily forwards packets to it, which in turn forwards the packet to the final destination by greedy routing. ITGR can combine multiple shaded areas to improve the efficiency of representation and routing. We perform simulations and demonstrate that ITGR significantly reduces the routing path length, compared with existing geographic routing protocols.

AB - The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR) to solve the long detour path problem. The basic idea is to use previous experience to determine the destination areas that are shaded by the holes. The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes. We design an efficient method for the source to find out whether a destination node belongs to a shaded area. The source then selects an intermediate node as the tentative target and greedily forwards packets to it, which in turn forwards the packet to the final destination by greedy routing. ITGR can combine multiple shaded areas to improve the efficiency of representation and routing. We perform simulations and demonstrate that ITGR significantly reduces the routing path length, compared with existing geographic routing protocols.

UR - http://www.scopus.com/inward/record.url?scp=85011855533&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85011855533&partnerID=8YFLogxK

U2 - 10.1016/j.dcan.2015.07.001

DO - 10.1016/j.dcan.2015.07.001

M3 - Article

AN - SCOPUS:85011855533

SN - 2468-5925

VL - 1

SP - 204

EP - 212

JO - Digital Communications and Networks

JF - Digital Communications and Networks

IS - 3

ER -

Improving routing efficiency through intermediate target based geographic routing

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this