2010
DOI: 10.1155/2010/712525
|View full text |Cite
|
Sign up to set email alerts
|

A Cooperative Congestion Control Approach within VANETs: Formal Verification and Performance Evaluation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
20
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(20 citation statements)
references
References 8 publications
0
20
0
Order By: Relevance
“…Under the constraint of the fading channel, Ye et al [16] used probability theory to show that the congestion control model for vehicular network offered improvement in the energy efficiency and data packet transmission over adhocbased networks. Similar kind of work was carried out by Bouassida and Shawky [17] .They presented dynamic scheduling algorithm based on the priority of the messages. The focused on improving data reliability of real-time vehicular network.…”
Section: Related Workmentioning
confidence: 80%
“…Under the constraint of the fading channel, Ye et al [16] used probability theory to show that the congestion control model for vehicular network offered improvement in the energy efficiency and data packet transmission over adhocbased networks. Similar kind of work was carried out by Bouassida and Shawky [17] .They presented dynamic scheduling algorithm based on the priority of the messages. The focused on improving data reliability of real-time vehicular network.…”
Section: Related Workmentioning
confidence: 80%
“…Additionally, the algorithm compares the estimated collision rate with a threshold value to relate CW but does not discuss how this threshold value is calculated. The scheme proposed in [18] considers the priority of packets consisting of static and dynamic fields. The static priority field is defined according to the sender application and contents of the message.…”
Section: Related Workmentioning
confidence: 99%
“…This approach suffers from a lack of consideration toward synchronization, the appropriate choice of the next forwarders and the utility of the sent messages to the neighborhood [7,8]. Yet, it was proven in [9] that it is the most suitable approach for VANETs. We believe that enhancing the congestion control approach using hop by hop methods will be interesting if we let nodes decide dynamically of their state as for example to choose whether to accept packets or not as suggested in [10].…”
Section: Related Workmentioning
confidence: 99%
“…Here is presented the proposed congestion control, as described in [9], of which the basis is to define policies for message scheduling, it is carried out using priorities. The approach is divided in three steps: priority assignment, message scheduling and cooperative message transmission.…”
Section: B Hop By Hop Approachmentioning
confidence: 99%
See 1 more Smart Citation