Forwarding methods in data dissemination and routing protocols for vehicular Ad Hoc networks

Daraghmi, Yousef‐Awwad; Yi, Chih‐Wei; Stojmenović, Ivan

doi:10.1109/mnet.2013.6678930

Cited by 53 publications

(25 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The closest work for SDN in vehicular networks are several implementations in wireless sensor network and mesh networks [19], [20]. Moreover, B. Zhou et al studied adaptive traffic light control for smoothing vehicles' travel and maximizing the traffic throughout for both single and multiple lanes [21], [22].…”

Section: B Similar Workmentioning

confidence: 99%

The Fog Computing Paradigm: Scenarios and Security Issues

Stojmenović¹,

Wen²

2014

Annals of Computer Science and Information Systems

Self Cite

793

441

View full text Add to dashboard Cite

Abstract-Fog Computing is a paradigm that extends Cloud computing and services to the edge of the network. Similar to Cloud, Fog provides data, compute, storage, and application services to end-users. In this article, we elaborate the motivation and advantages of Fog computing, and analyse its applications in a series of real scenarios, such as Smart Grid, smart traffic lights in vehicular networks and software defined networks. We discuss the state-of-the-art of Fog computing and similar work under the same umbrella. Security and privacy issues are further disclosed according to current Fog computing paradigm. As an example, we study a typical attack, man-in-the-middle attack, for the discussion of security in Fog computing. We investigate the stealthy features of this attack by examining its CPU and memory consumption on Fog device.

show abstract

Section: B Similar Workmentioning

confidence: 99%

The Fog Computing Paradigm: Scenarios and Security Issues

Stojmenović¹,

Wen²

2014

Annals of Computer Science and Information Systems

Self Cite

793

441

View full text Add to dashboard Cite

show abstract

“…Since, the average hop length is between 700 and 800 m for DBF and is equal to 500 m for TBN, no more than ten hops are required to reach the edge of the road from the RSU, which is placed in the mid point of the road's span. 10 The highest value noted for a hop delay is around 40 ms, so that the propagation delay of a message from the RSU to the edge does not exceed around 400 ms. This is a rather low time latency, as compared to the vehicular movement time scale.…”

Section: Model Validationmentioning

confidence: 99%

Understanding Spurious Message Forwarding in VANET Beaconless Dissemination Protocols: An Analytical Approach

Baiocchi

Salvo

Cuomo

et al. 2016

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Message dissemination is a key component of Vehicular Ad hoc Networks (VANETs). It enables the capability of Intelligent Transportation Systems to support safety and infotainment services for vehicles and people on travel. Dissemination in VANETs typically relies on the intelligent election of selected vehicles to act as relay nodes, a critical element that serves to avoid broadcasting storm issues. This paper presents an analytical model for evaluating the performance of a class of distributed, beacon-less, dissemination protocols in a linear VANET (e.g., a highway). NS-2 based simulations are employed to validate the model. The results are used to gain insight into the spurious forwarding problem, which accompanies the use of timer-based VANET networking protocols. We characterize the impact of this phenomenon on the achievable level of the system's broadcast throughput capacity rate. Resolution approaches are proposed and analyzed.

show abstract

“…A recent survey of data dissemination schemes in vehicular networks is given in [14]. Although there have been a few studies on cooperative I2V and V2V communications, they are dedicated to designing MAC protocols and routing strategies.…”

Section: Related Workmentioning

confidence: 99%

Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network

Liu

Lee

et al. 2016

IEEE/ACM Trans. Networking

Self Cite

255

107

View full text Add to dashboard Cite

This paper presents the first study on scheduling for cooperative data dissemination in a hybrid infrastructure-to-vehicle (I2V) and vehicle-to-vehicle (V2V) communication environment. We formulate the novel problem of cooperative data scheduling (CDS). Each vehicle informs the road-side unit (RSU) the list of its current neighboring vehicles and the identifiers of the retrieved and newly requested data. The RSU then selects sender and receiver vehicles and corresponding data for V2V communication, while it simultaneously broadcasts a data item to vehicles that are instructed to tune into the I2V channel. The goal is to maximize the number of vehicles that retrieve their requested data. We prove that CDS is NP-hard by constructing a polynomial-time reduction from the Maximum Weighted Independent Set (MWIS) problem. Scheduling decisions are made by transforming CDS to MWIS and using a greedy method to approximately solve MWIS. We build a simulation model based on realistic traffic and communication characteristics and demonstrate the superiority and scalability of the proposed solution. The proposed model and solution, which are based on the centralized scheduler at the RSU, represent the first known vehicular ad hoc network (VANET) implementation of software defined network (SDN) concept.Index Terms-Cooperative data dissemination, scheduling, software defined network, vehicular ad hoc networks.

show abstract

Forwarding methods in data dissemination and routing protocols for vehicular Ad Hoc networks

Cited by 53 publications

References 14 publications

The Fog Computing Paradigm: Scenarios and Security Issues

The Fog Computing Paradigm: Scenarios and Security Issues

Understanding Spurious Message Forwarding in VANET Beaconless Dissemination Protocols: An Analytical Approach

Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network

Contact Info

Product

Resources

About