LLA: A New Anypath Routing Scheme Providing Long Path Lifetime in VANETs

Rak, Jacek

doi:10.1109/lcomm.2013.120413.132285

Cited by 55 publications

(28 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…22 In this process, between any pair of nodes there will not be multiple edges and node will have self loops. [23][24][25] Theorem 1. For large enough size N, the clustering coefficient of the small world network model is given by…”

Section: V2v Network Simulations and Discussionmentioning

confidence: 99%

Modeling and dynamical topology properties of VANET based on complex networks theory

Zhang

2015

AIP Advances

View full text Add to dashboard Cite

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.

show abstract

Section: V2v Network Simulations and Discussionmentioning

confidence: 99%

Modeling and dynamical topology properties of VANET based on complex networks theory

Zhang

2015

AIP Advances

View full text Add to dashboard Cite

show abstract

“…In this algorithm, the time variation of the cluster structure (include the cluster membership change and the cluster overlap state change rate) is taken into account. In [21], for improving the reliability of VANETs, the authors introduce the any-path into the routing design and propose a long lifetime any-path algorithm to improve the link stability of the VANETs. Similar to [21], in [22], the authors propose the PFQ-AODV algorithm to improve the reliability of the routing algorithm in VANETs.…”

Section: Related Workmentioning

confidence: 99%

“…In [21], for improving the reliability of VANETs, the authors introduce the any-path into the routing design and propose a long lifetime any-path algorithm to improve the link stability of the VANETs. Similar to [21], in [22], the authors propose the PFQ-AODV algorithm to improve the reliability of the routing algorithm in VANETs. In PFQ-AODV, the fuzzy constraint Q-learning algorithm has been introduced into the AODV algorithm to improve the routing performance.…”

Section: Related Workmentioning

confidence: 99%

Probability Prediction-Based Reliable and Efficient Opportunistic Routing Algorithm for VANETs

Martínez-Ortega

Díaz

et al. 2018

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

AbstractIn the Vehicular ad hoc networks (VANETs), due to the high mobility of vehicles, the network parameters change frequently and the information which the sender maintains may outdate when it wants to transmit data packet to the receiver, so for improving the routing effective, we propose the probability prediction based reliable (PRO) opportunistic routing for VANETs. The PRO routing algorithm can predict the variation of Signal to Interference plus Noise Ratio (SINR) and packet queue length (PQL) in the receiver. The prediction results are used to determine the utility of each relaying vehicle in the candidate set. The calculation of the vehicle utility is weight based algorithm and the weights are the variances of SINR and PQL of the candidate relaying vehicles. The relaying priority of each relaying vehicle is determined by the value of the utility. By these innovations, the PRO can achieve better routing performance (such as the packet delivery ratio, the end-to-end delay, and the network throughput) than the SRPE, ExOR (street-centric), and GPSR routing algorithms.Index TermsOpportunistic routing, Vehicular ad hoc networks, SINR, Packet queue length, Probability prediction. I. INTRODUCTIONVehicular ad hoc network (VANETs) is a kind of network which combines the wireless communication with the vehicles to enable the vehicles to communicate with each other [1] [2]. Due to the specific characteristics of VANETs, the VANETs are quite different with the traditional mobile ad hoc networks (MANETs). For instance, the speed of vehicles in VANETs is much higher than that in MANETs; the moving directions of vehicles in VANETs are limited by the urban streets; higher probability of network partition in VANETs than that in MANETs due to the traffic light [3]; due to the different structures of the streets (for instance, one-/two-way street, two-/four-lanes street), the network topologies are quite different with different streets [4], which is called topology diversity. Therefore, the routing algorithms in VANETs are different with that in traditional MANETs. The routing algorithms which are effective in MANETs may have poor performance in VANETs.There are two routing strategies for the VANETs: deterministic routing and opportunistic routing [5]. In deterministic routing, the sender sends data packet to one neighbor vehicle which is chosen based on the optimal algorithms. In opportunistic routing, the sender sends the data packet to a set of relaying vehicles rather than only one relaying vehicle to improve the packet delivery ratio between sender and receiver. In this paper, we mainly focus on the opportunistic routing. A. MotivationThe main advantage of opportunistic routing compared with

show abstract

“…Xu et al [42] presented an analytical approach that takes cross-layer factors into account and propose a new routing metric based on optimizing a queueing model that considers local loads, interferences and packet droppings. Rak et al [43] addressed the problem of the stability of any-path communications in vehicular networks in the presence of inter-vehicle link failures. However, the dynamically-changing network topology will generate high packet transmission overhead, which motivates the adoption of beacon-less schemes.…”

Section: Related Workmentioning

confidence: 99%

Design and Analysis of A Beacon-Less Routing Protocol for Large Volume Content Dissemination in Vehicular Ad Hoc Networks

Zhang

et al. 2016

Sensors

View full text Add to dashboard Cite

Large volume content dissemination is pursued by the growing number of high quality applications for Vehicular Ad hoc NETworks(VANETs), e.g., the live road surveillance service and the video-based overtaking assistant service. For the highly dynamical vehicular network topology, beacon-less routing protocols have been proven to be efficient in achieving a balance between the system performance and the control overhead. However, to the authors’ best knowledge, the routing design for large volume content has not been well considered in the previous work, which will introduce new challenges, e.g., the enhanced connectivity requirement for a radio link. In this paper, a link Lifetime-aware Beacon-less Routing Protocol (LBRP) is designed for large volume content delivery in VANETs. Each vehicle makes the forwarding decision based on the message header information and its current state, including the speed and position information. A semi-Markov process analytical model is proposed to evaluate the expected delay in constructing one routing path for LBRP. Simulations show that the proposed LBRP scheme outperforms the traditional dissemination protocols in providing a low end-to-end delay. The analytical model is shown to exhibit a good match on the delay estimation with Monte Carlo simulations, as well.

show abstract

LLA: A New Anypath Routing Scheme Providing Long Path Lifetime in VANETs

Cited by 55 publications

References 18 publications

Modeling and dynamical topology properties of VANET based on complex networks theory

Modeling and dynamical topology properties of VANET based on complex networks theory

Probability Prediction-Based Reliable and Efficient Opportunistic Routing Algorithm for VANETs

Design and Analysis of A Beacon-Less Routing Protocol for Large Volume Content Dissemination in Vehicular Ad Hoc Networks

Contact Info

Product

Resources

About