Vehicular Ad Hoc Networks (VANETs): Challenges and Perspectives

Yousefi, Saleh; Mousavi, Mahmoud; Fathy, Mahmood

doi:10.1109/itst.2006.289012

Cited by 448 publications

(176 citation statements)

References 32 publications

Supporting

Mentioning

169

Contrasting

Unclassified

Order By: Relevance

“…can be accessed by the vehicles and moreover be shared or transferred even to other vehicles [9] 5.2.5. Value added advertisements: the services provides which may be shopping malls, petrol pumps, gas station or highways restaurants can proclaim their services to all the drivers or passengers within range even in absence of internet.…”

Section: Real Time Video Relaymentioning

confidence: 99%

Security Challenges, Authentication, Application and Trust Models for Vehicular Ad Hoc Network- A Survey

Vaibhav¹,

Shukla²,

Das³

et al. 2017

IJWMT

View full text Add to dashboard Cite

Vehicular Ad hoc Network could manage the various critical issues of road transport. That is why it is the most crucial field of research for most of the researchers. This survey paper discusses various issues related to Security Challenges, Security Architecture actors, Security Authentication, Application Constraints, various trust models etc. this paper encourages you to think about various fields of work need to be carried out in this field for the better VANET environment. Various schemes have been mentioned which could be improved further as per considering various real time conditions.

show abstract

Section: Real Time Video Relaymentioning

confidence: 99%

Security Challenges, Authentication, Application and Trust Models for Vehicular Ad Hoc Network- A Survey

Vaibhav¹,

Shukla²,

Das³

et al. 2017

IJWMT

View full text Add to dashboard Cite

show abstract

“…Typically, applications are categorized as safety, traffic efficiency, and infotainment (Hartenstein and Laberteaux, 2008;Toor et al, 2008;Yousefi et al, 2006). In this section, some of these applications and their requirements are briefly discussed.…”

Section: Applications and Their Technical Requirementsmentioning

confidence: 99%

Scheduling in green vehicular infrastructure with multiple roadside units

Khezrian

Hammad

Todd

et al. 2013

2013 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

In this thesis we consider low complexity downlink traffic scheduling for green vehicular roadside infrastructure. In multiple roadside unit (RSU) deployments, the energy provisioning of the RSUs may differ, and it is therefore desirable to balance RSU usage from a normalized energy viewpoint. We consider both splittable and unsplittable RSU assignment scheduling (SRA and URA). We first derive an offline integer linear programming bound for the normalized min-max RSU energy usage, which can be solved for a given input sample function. We then show that in the SRA case there is a polynomial complexity 2-approximation bound for the normalized min-max energy schedule. These bounds are used for comparisons with several proposed online scheduling algorithms. The first scheduler is a low complexity Greedy Online Algorithm (GOA) that makes greedy RSU selections followed by minimum energy time slot assignments. A normalized min-max online algorithm is then proposed (TOAA) which is an online version of the 2-approximation bound for SRA scheduling.Then, the Greedy Flow Graph Algorithm (GFGA), which makes greedy RSU selections followed by time slots reassignment whenever a new vehicle is assigned to the same RSU. This is done using a locally optimum integer linear program that can be efficiently solved using a minimum cost flow graph. Two low complexity algorithms iv are then introduced based on a potential function scheduling approach. The OneObjective algorithm, uses a primary objective based on normalized min-max energy.The second, the Bi-Objective algorithm, uses the same primary objective combined with a total energy secondary objective. These algorithms have provable performance guarantees, in that their worse-case competitive ratio performance is upper bounded.Results from a variety of experiments show that the proposed scheduling algorithms perform well. In particular, we find that in the SRA case, the TOAA and GFGA algorithms perform very close to the lower bound, but at the expense of having to reassign time slots whenever a new vehicle arrives. In the URA case, our low complexity One-Objective algorithm performs better than the others over a wide range of traffic conditions.

show abstract

“…However, this type of networks has to deal with challenging issues [5] (e.g., the high mobility of vehicles, the constant network topology changing, or even the network scale). To overcome the above-mentioned issues, several approaches are emerging, such as Vehicular Ad Hoc Networks (VANETs) [6,7], Delay-Tolerant Networks (DTNs) [8], and more recently, Vehicular Delay-Tolerant Networks (VDTNs) [9] that are considered in this study.…”

Section: Introductionmentioning

confidence: 99%

Performance assessment of fragmentation mechanisms for vehicular delay-tolerant networks

Dias

Rodrigues

Isento

et al. 2011

J Wireless Com Network

View full text Add to dashboard Cite

Vehicular Delay-Tolerant Networks (VDTNs) are a new approach for vehicular communications where vehicles cooperate with each other, acting as the communication infrastructure, to provide low-cost asynchronous opportunistic communications. These communication technologies assume variable delays and bandwidth constraints characterized by a non-transmission control protocol/internet protocol architecture but interacting with it at the edge of the network. VDTNs are based on the principle of asynchronous communications, bundle-oriented communication from the DTN architecture, employing a store-carry-and-forward routing paradigm. In this sense, VDTNs should use the tight network resources optimizing each opportunistic contact among nodes. Given the limited contact times among nodes, fragmentation appears as a possible solution to improve the overall network performance, increasing the bundle delivery probability. This article proposes the use of several fragmentation approaches (proactive, source, reactive, and toilet paper) for VDTNs. They are discussed and evaluated through a laboratory testbed. Reactive and toilet paper approaches present the best results. It was also shown that only the source fragmentation approach presents worst results when compared with non-fragmentation approaches.

show abstract

Vehicular Ad Hoc Networks (VANETs): Challenges and Perspectives

Cited by 448 publications

References 32 publications

Security Challenges, Authentication, Application and Trust Models for Vehicular Ad Hoc Network- A Survey

Security Challenges, Authentication, Application and Trust Models for Vehicular Ad Hoc Network- A Survey

Scheduling in green vehicular infrastructure with multiple roadside units

Performance assessment of fragmentation mechanisms for vehicular delay-tolerant networks

Contact Info

Product

Resources

About