W-GPCR Routing Method for Vehicular Ad Hoc Networks
The high-speed dynamics of nodes and rapid change of network topology in vehicular ad hoc networks (VANETs) pose significant challenges for the design of routing protocols. Because of the unpredictability of VANETs, selecting the appropriate next-hop relay node, which is related to the performance o...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-06-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1424-8220/20/12/3406 |
| _version_ | 1797565087000559616 |
|---|---|
| author | Min Li Zhiru Gu Yonghong Long Xiaohua Shu Qing Rong Ziji Ma Xun Shao |
| author_facet | Min Li Zhiru Gu Yonghong Long Xiaohua Shu Qing Rong Ziji Ma Xun Shao |
| author_sort | Min Li |
| collection | DOAJ |
| description | The high-speed dynamics of nodes and rapid change of network topology in vehicular ad hoc networks (VANETs) pose significant challenges for the design of routing protocols. Because of the unpredictability of VANETs, selecting the appropriate next-hop relay node, which is related to the performance of the routing protocol, is a difficult task. As an effective solution for VANETs, geographic routing has received extensive attention in recent years. The Greedy Perimeter Coordinator Routing (GPCR) protocol is a widely adopted position-based routing protocol. In this paper, to improve the performance in sparse networks, the local optimum, and the routing loop in the GPCR protocol, the Weighted-GPCR (W-GPCR) protocol is proposed. Firstly, the relationship between vehicle node routing and other parameters, such as the Euclidean distance between node pairs, driving direction, and density, is analyzed. Secondly, the composite parameter weighted model is established and the calculation method is designed for the existing routing problems; the weighted parameter ratio is 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 is compared with existing methods, such as the traditional Geographic Perimeter Stateless Routing (GPSR) protocol and GPCR. Results show that this method is superior in terms of the package delivery ratio, end-to-end delay, and average hop count. |
| first_indexed | 2024-03-10T19:06:59Z |
| format | Article |
| id | doaj.art-4e8d8caec244416baeeee6732dd9ec6a |
| institution | Directory Open Access Journal |
| issn | 1424-8220 |
| language | English |
| last_indexed | 2024-03-10T19:06:59Z |
| publishDate | 2020-06-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Sensors |
| spelling | doaj.art-4e8d8caec244416baeeee6732dd9ec6a2023-11-20T04:02:44ZengMDPI AGSensors1424-82202020-06-012012340610.3390/s20123406W-GPCR Routing Method for Vehicular Ad Hoc NetworksMin Li0Zhiru Gu1Yonghong Long2Xiaohua Shu3Qing Rong4Ziji Ma5Xun Shao6College of Traffic Engineering, Hunan University of Technology, Zhuzhou 412007, ChinaCollege of Traffic Engineering, Hunan University of Technology, Zhuzhou 412007, ChinaCollege of Traffic Engineering, Hunan University of Technology, Zhuzhou 412007, ChinaCollege of Traffic Engineering, Hunan University of Technology, Zhuzhou 412007, ChinaCollege of Traffic Engineering, Hunan University of Technology, Zhuzhou 412007, ChinaCollege of Electrical and Information Engineering, Hunan University, Changsha 410082, ChinaDivision of Information and Communication Engineering, Kitami Institute of Technology, Hokkaido 090-8507, JapanThe high-speed dynamics of nodes and rapid change of network topology in vehicular ad hoc networks (VANETs) pose significant challenges for the design of routing protocols. Because of the unpredictability of VANETs, selecting the appropriate next-hop relay node, which is related to the performance of the routing protocol, is a difficult task. As an effective solution for VANETs, geographic routing has received extensive attention in recent years. The Greedy Perimeter Coordinator Routing (GPCR) protocol is a widely adopted position-based routing protocol. In this paper, to improve the performance in sparse networks, the local optimum, and the routing loop in the GPCR protocol, the Weighted-GPCR (W-GPCR) protocol is proposed. Firstly, the relationship between vehicle node routing and other parameters, such as the Euclidean distance between node pairs, driving direction, and density, is analyzed. Secondly, the composite parameter weighted model is established and the calculation method is designed for the existing routing problems; the weighted parameter ratio is 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 is compared with existing methods, such as the traditional Geographic Perimeter Stateless Routing (GPSR) protocol and GPCR. Results show that this method is superior in terms of the package delivery ratio, end-to-end delay, and average hop count.https://www.mdpi.com/1424-8220/20/12/3406VANETweight choiceGPSRGPCR |
| spellingShingle | Min Li Zhiru Gu Yonghong Long Xiaohua Shu Qing Rong Ziji Ma Xun Shao W-GPCR Routing Method for Vehicular Ad Hoc Networks Sensors VANET weight choice GPSR GPCR |
| title | W-GPCR Routing Method for Vehicular Ad Hoc Networks |
| title_full | W-GPCR Routing Method for Vehicular Ad Hoc Networks |
| title_fullStr | W-GPCR Routing Method for Vehicular Ad Hoc Networks |
| title_full_unstemmed | W-GPCR Routing Method for Vehicular Ad Hoc Networks |
| title_short | W-GPCR Routing Method for Vehicular Ad Hoc Networks |
| title_sort | w gpcr routing method for vehicular ad hoc networks |
| topic | VANET weight choice GPSR GPCR |
| url | https://www.mdpi.com/1424-8220/20/12/3406 |
| work_keys_str_mv | AT minli wgpcrroutingmethodforvehicularadhocnetworks AT zhirugu wgpcrroutingmethodforvehicularadhocnetworks AT yonghonglong wgpcrroutingmethodforvehicularadhocnetworks AT xiaohuashu wgpcrroutingmethodforvehicularadhocnetworks AT qingrong wgpcrroutingmethodforvehicularadhocnetworks AT zijima wgpcrroutingmethodforvehicularadhocnetworks AT xunshao wgpcrroutingmethodforvehicularadhocnetworks |