Investigating a Junction-Based Multipath Source Routing Algorithm for VANETs

Sermpezis, Pavlos; Koltsidas, Georgios; Pavlidou, Fotini‐Niovi

doi:10.1109/lcomm.2013.011513.122045

Cited by 39 publications

(34 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, since the broadcasting to multiple coordinators for generating multiple paths is prohibited to reduce the experienced delay, the probability of local optimum and packet drop increases in their work. To overcome this problem, a junction-based multi-path source routing algorithm is proposed in [12]. Its performance evaluations show that multi-path routing is much beneficial for VANETs, in case the distances between two nodes are medium or long, or the traffic loads are medium to high.…”

Section: Related Workmentioning

confidence: 99%

ASGR: An Artificial Spider-Web-Based Geographic Routing in Heterogeneous Vehicular Networks

Chen

Liu

Qiu

et al. 2019

IEEE Trans. Intell. Transport. Syst.

102

View full text Add to dashboard Cite

Recently, vehicular ad hoc networks (VANETs) have been attracting significant attention for their potential for guaranteeing road safety and improving traffic comfort. Due to high mobility and frequent link disconnections, it becomes quite challenging to establish a reliable route for delivering packets in VANETs. To deal with these challenges, an artificial spider geographic routing in urban VAENTs (ASGR) is proposed in this paper. First, from the point of bionic view, we construct the spider web based on the network topology to initially select the feasible paths to the destination using artificial spiders. Next, the connection-quality model and transmission-latency model are established to generate the routing selection metric to choose the best route from all the feasible paths. At last, a selective forwarding scheme is presented to effectively forward the packets in the selected route, by taking into account the nodal movement and signal propagation characteristics. Finally, we implement our protocol on NS2 with different complexity maps and simulation parameters. Numerical results demonstrate that, compared with the existing schemes, when the packets generate speed, the number of vehicles and number of connections are varying, our proposed ASGR still performs best in terms of packet delivery ratio and average transmission delay with an up to 15% and 94% improvement, respectively.Index Terms-Vehicular ad hoc networks, routing protocol, artificial spider-web, connection quality, latency model, selective forwarding.

show abstract

Section: Related Workmentioning

confidence: 99%

ASGR: An Artificial Spider-Web-Based Geographic Routing in Heterogeneous Vehicular Networks

Chen

Liu

Qiu

et al. 2019

IEEE Trans. Intell. Transport. Syst.

102

View full text Add to dashboard Cite

show abstract

“…Huang and Fang [13] have explored the efficiency of node-disjoint multi-path routing in VANETs. Li et al [14] have introduced a geographic multi-path routing protocol, where the alternative paths are as disjoint as possible. Although multipath routing approaches can improve the packet delivery ratio, they also increase the communication overhead if the selected multiple paths are not interference-disjoint, resulting in an increase of MAC layer contention time in the vicinity.…”

Section: Opportunistic Routing and Multi-path Routingmentioning

confidence: 99%

“…Since the next forwarder node could be different for different frames, frame aggregation (one of the most important techniques supporting high throughput transmissions in 802.11n) is very difficult if not impossible. There have been some multi-path routing protocols [13], [14]. However, finding interferencedisjoint paths is difficult and therefore the throughput improvement is limited.…”

Section: Introductionmentioning

confidence: 99%

Toward Practical and Intelligent Routing in Vehicular Ad Hoc Networks

Liu

et al. 2015

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Besides the vehicle mobility, the data rate (bitrate) and multi-hop data transmission efficiency (including route length) have significant impact on the performance of a routing protocol for vehicular ad hoc networks (VANETs). Existing routing protocols do not seriously address all these issues, and are not evaluated for a real VANET environment. Therefore, it is difficult for these protocols to attain a high performance and work properly in various scenarios. In this paper, we first discuss the challenges of routing in VANETs based on the data acquired from real-world experiments, and then propose a routing protocol which is able to learn the best transmission parameters by interacting with the environment. The protocol takes into account multiple metrics specifically data transmission rate, vehicle movement and route length. We use both real-world experiments and computer simulations to evaluate the proposed protocol.Index Terms-Vehicular ad hoc networks, routing protocol, rate estimation algorithm, fuzzy logic, Q-Learning.

show abstract

“…However, since broadcasting to multiple coordinators to generate multiple paths is prohibited to reduce the experienced delay, the probability of local optimum and packet drop increases. To alleviate this issue, a junction-based multipath source routing algorithm [11] was proposed. Its performance evaluations show that multipath is beneficial for VANETs, in case the source-destination distances are medium or long (six hops away or more) or traffic loads are medium to high, conditions that real-world VANETs will probably face.…”

Section: Related Workmentioning

confidence: 99%

A connectivity-aware intersection-based routing in VANETs

Chen

Jin

Pei

et al. 2014

J Wireless Com Network

View full text Add to dashboard Cite

Vehicular ad hoc networks (VANETs) are going to be an important communication infrastructure in our moving life. The design of routing protocols in VANETs is a significant and necessary issue for supporting VANET-based applications. However, due to high mobility, frequent link disconnection, and uneven distribution of vehicles, it becomes quite challenging to establish a robust route for delivering packets. This paper presents a connectivity-aware intersectionbased routing (CAIR) protocol to address these problems by selecting an optimal route with higher probability of connectivity and lower experienced delay; then, geographical forwarding based on position prediction is used to transfer packets between any two intersections along the route. Simulation results show that the proposed protocol outperforms existing routing protocols in terms of data delivery ratio and average transmission delay in typical urban scenarios.

show abstract

Investigating a Junction-Based Multipath Source Routing Algorithm for VANETs

Cited by 39 publications

References 14 publications

ASGR: An Artificial Spider-Web-Based Geographic Routing in Heterogeneous Vehicular Networks

ASGR: An Artificial Spider-Web-Based Geographic Routing in Heterogeneous Vehicular Networks

Toward Practical and Intelligent Routing in Vehicular Ad Hoc Networks

A connectivity-aware intersection-based routing in VANETs

Contact Info

Product

Resources

About