Contention-based forwarding with multi-hop connectivity awareness in vehicular ad-hoc networks

Rondinone, Michele; Gozálvez, Javier

doi:10.1016/j.comnet.2013.02.019

Cited by 23 publications

(23 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are two thresholds T hrs 1 A SBM has five attributes as-V ehicle id : position; velocity; PS zone radius, and time. Authors in [49] have also used a similar method where they have exchanged report which has parameters: vid, loc x , loc y , vel x , vel y , t. It is different from the proposed approach as [50,51] did not use PS Zone radius into consideration while transmitting report. This PS zone radius is important in calculating the number of vehicles in communicating radius in future as described here.…”

Section: Construction Phasementioning

confidence: 89%

An Intelligent Context-aware Congestion Resolution Protocol for Data Dissemination in Vehicular Ad Hoc Networks

et al. 2015

View full text Add to dashboard Cite

With high velocity, and sparse distribution of vehicles on the road, routing a packet to its destination is one of the major challenges in Vehicular Ad Hoc Networks (VANETs). To reduce the complexity of transmissions, only context-aware data is required for successful transfer of alerts to the passengers as unnecessary information may cause a performance bottleneck at some point in VANETs. To address this issue, in this paper, we propose a new context-aware congestion resolution protocol called as-minimum calculated desired time (MCDT) for Intelligent Data Dissemination in VANETs. In the proposed scheme, first the link stability is computed and then, a peak stable zone is constructed which is used to estimate the virtual connectivity of the nodes. A module for recovery of lost link using minimum angle method is also proposed. The proposed scheme can be used for vast industrial applications, where there is a need of contextual-aware information dissemination with less delay, and higher accuracy. The proposed scheme is evaluated in different network scenarios by varying the parameters such as velocity, and density of the vehicles. The results obtained yield an improvement of more than 90 % in end-to-end delay (E2ED), 11.75 % in download speed, 7 % enhanced resource utilization, and a decrease of 16 % in overhead in the proposed scheme as compared to other state-of-the-art existing schemes.

show abstract

Section: Construction Phasementioning

confidence: 89%

An Intelligent Context-aware Congestion Resolution Protocol for Data Dissemination in Vehicular Ad Hoc Networks

et al. 2015

View full text Add to dashboard Cite

show abstract

“…8 indicates that after clustering the nodes in the network with 20 network nodes, CCMR successfully builds the path {2, 7, 12, 3, 20, 6, 17} from source node 2 to destination node 17. Nodes 19,18,8,9,4,13,16,11 and 14 are collaborative ones that cooperate with transmission nodes 2, 7, 12, 3, 20, and 6. From Fig.…”

Section: Collaborative Multi-hop Pathmentioning

confidence: 99%

“…Ong et al studied the routing in cooperative multiple-terminal wireless networks and proposed an algorithm to construct optimal routes [17]. Rondinone et al exploited a multihop connectivity metric to estimate the capability of forwarding paths and proposed a contention-based broadcast forwarding protocol to select forwarding paths [18]. Wong et al proposed a distributed greedy algorithm to attain maximum gain cost ratio for each node [19].…”

Section: Introductionmentioning

confidence: 99%

A collaborative multi-hop routing algorithm for maximum achievable rate

Jiang

Wang

et al. 2015

Journal of Network and Computer Applications

View full text Add to dashboard Cite

“…In this paper, we use a greedy forwarding scheme based on unicast approach, where the forwarder node is selected according to its capability to provide a higher progress towards the final destination (i.e. RSU) [14]. This scheme also uses Store-and-Forward (SNF) mechanism, which has the ability to store the information and forwards it periodically until it finds the next neighbor or the final destination.…”

Section: Network Architecture Of Services-oriented Vanetsmentioning

confidence: 99%

An Efficient and Lightweight Intrusion Detection Mechanism for Service-Oriented Vehicular Networks

Sedjelmaci

Senouci

Abu-Rgheff

2014

IEEE Internet Things J.

117

View full text Add to dashboard Cite

Vehicle Ad-Hoc Networks (VANETs) are wireless networks that provide high rate data communication among moving vehicles and between the vehicles and the road-side units. VANETs are considered as the main wireless communication platforms for the intelligent transportation systems (ITS). Service-oriented vehicular networks are special categories for VANETs that support diverse infrastructure-based commercial infotainment services including for instance Internet access, realtime traffic monitoring and management, video streaming. Security is a fundamental issue for these service-networks due to the relevant business information handled in these networks. In this paper we design and implement an efficient and lightweight intrusion detection mechanism, called ELIDV that aims to protect the network against three kinds of attacks: DoS (Denial of Service), Integrity target and false alert's generation. ELIDV is based on a set of rules that detects malicious vehicles promptly and with high accuracy. We present the performances analysis of our detection mechanism using NS-3 simulator. Our simulation results show that ELIDV exhibits a high-level security in terms of highly accurate detection rate (detection rate more than 97 %), low false positive rate (close to 1%), and exhibits a lower overhead compared to contemporary frameworks.

show abstract

Contention-based forwarding with multi-hop connectivity awareness in vehicular ad-hoc networks

Cited by 23 publications

References 21 publications

An Intelligent Context-aware Congestion Resolution Protocol for Data Dissemination in Vehicular Ad Hoc Networks

An Intelligent Context-aware Congestion Resolution Protocol for Data Dissemination in Vehicular Ad Hoc Networks

A collaborative multi-hop routing algorithm for maximum achievable rate

An Efficient and Lightweight Intrusion Detection Mechanism for Service-Oriented Vehicular Networks

Contact Info

Product

Resources

About