A Greedy Geographic Routing Algorithm Based on 2-Hop Neighbors

WANG Jian-xin; ZHAO Xiang-ning; LIU Hui-yu

您当前的位置：

首页 >

文章列表页 >

A Greedy Geographic Routing Algorithm Based on 2-Hop Neighbors

更新时间：2025-07-16

- A Greedy Geographic Routing Algorithm Based on 2-Hop Neighbors
- Acta Electronica Sinica Vol. 36, Issue 10, Pages: 1903-1909(2008)
- 作者机构：
  
  中南大学信息科学与工程学院,湖南,长沙,410083
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393
- Published：2008
- 稿件说明：
移动端阅览
WANG Jian-xin, ZHAO Xiang-ning, LIU Hui-yu. A Greedy Geographic Routing Algorithm Based on 2-Hop Neighbors[J]. Acta Electronica Sinica, 2008, 36(10): 1903-1909.
DOI：

WANG Jian-xin, ZHAO Xiang-ning, LIU Hui-yu. A Greedy Geographic Routing Algorithm Based on 2-Hop Neighbors[J]. Acta Electronica Sinica, 2008, 36(10): 1903-1909. DOI：

摘要

基于地理信息的路由算法由于其高效、低路由开销和良好的可扩展性等特点

在无线传感器网络中得到比较广泛的应用.许多采用贪婪策略作为其基本数据转发机制的地理路由算法都不可避免会遇到路由空洞现象.针对这个问题

本文提出了一种基于掌握两跳邻居节点位置信息的贪婪地理路由算法——Greedy-2算法.该算法能够使节点提前意识到路由空洞的存在

从而尽可能使数据包及时绕开空洞边界节点

减少路由空洞发生的概率

提高分组到达率.对于Greedy-2算法仍然遭遇路由空洞现象的情况

文章提出了一种基于两跳邻居信息的平面化算法PATN

该算法不需要增加额外的平面化开销

即可将网络平面化以采取边缘恢复机制

在UDG网络中保证数据可靠传输.仿真结果表明

与基于一跳邻居节点位置信息的贪婪算法相比

Greedy-2算法可以明显减少路由空洞现象发生的次数

在分组到达率和数据传送的路由跳数方面都有着更好的性能.Greedy-2算法与PATN规则结合后的GPSR-2算法也比GPSR算法有着更优化的路由跳数.

Abstract

Geographic routing is widely used in wireless sensor networks due to its great efficiency

low routing overhead and good scalability.However

the problem that most of the geographic routing algorithms which adopt greedy algorithm as their basic routing strategies have to face is the 'routing void phenomena’.Aiming at this problem

this paper presents a new geographic routing algorithm

Greedy algorithm based on the geographic information of 2-hop neighbors (Greedy-2).Greedy-2 algorithm makes nodes be aware of the existence of voids before the packet reaches a region where the Greedy forwarding fails

so that the packet can bypass the dead-end node ahead of time to reduce the probability of encountering the routing voids.PATN

a Planarization Algorithm based on Two-hop Neighbors

is also introduced.PATN ensures the success of perimeter routing through the planarization without extra overhead

and guarantees delivery in UDG networks when Greedy-2 algorithm fails.Extensive simulation further shows that Greedy-2 algorithm can significantly decrease the routing void phenomena.It obtains better performance than Greedy algorithm based on 1-hop neighbors in aspects of the packet delivery rate and the length of routing path.GPSR-2

which combines Greedy-2 and PATN algorithms

has less average length of routing path than GPSR.

关键词

Keywords

references

Views

1540

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Signal Mechanism Based Energy-Aware Geographic Routing Algorithm

Research on UAV Path Planning Algorithm for Fairness Data Collection and Energy Supplement

A Cellular Perceptron Coverage Algorithm Based on Triangulation in WSNs

An Energy Saving Strategy Based on Coverage Optimization and Compression Cost Estimation for Wireless Multimedia Sensor Networks

Cross-Layer Congestion Control for Wireless Sensor Networks

Related Author

ZHAO Xiang-ning

GAO Si-hua

LI Jun-hui

LI Jian-fu

LIU Bao-yu

WANG Yi-jun

CHEN Zhong-ye

MIAO Rui-xin

Related Institution

College of Computer and Information Sciences, Fujian Agriculture and Forestry University

College of Computer and Information Sciences Fujian Agriculture and Forestry University Fuzhou Fujian China

School of Computer Science and Technology, Civil Aviation University of China

College of Electronic & Information Engineering, Changchun University of Science and Technology

College of Instrumentation & Electrical Engineering, Jilin University

⁰