Routing optimization method based on GPCR for vehicular Ad Hoc network
To improve the performance in sparse networks,local optimum,and routing loop in the greedy perimeter coordinator routing (GPCR) protocol,the weighted-GPCR (W-GPCR) protocol was proposed.The relationship between vehicle node routing and other parameters such as the Euclidean distance between node pai...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2020-07-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020144/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | To improve the performance in sparse networks,local optimum,and routing loop in the greedy perimeter coordinator routing (GPCR) protocol,the weighted-GPCR (W-GPCR) protocol was proposed.The relationship between vehicle node routing and other parameters such as the Euclidean distance between node pairs,moving direction and density was profoundly analyzed,the composite parameter weighted model was established and the calculation method was designed for the existing routing problems,the weighted parameter ratio was selected adaptively in different scenarios,so as to obtain the optimal next-hop relay node.In order to verify the performance of the W-GPCR method,the proposed method was compared with the existing methods such as the traditional geographic perimeter stateless routing (GPSR) protocol,GPCR and so on,and the results show that the proposed method is superior to the package delivery ratio,end-to-end delay,and average hop count. |
|---|---|
| ISSN: | 1000-436X |