Achieving weighted-fairnessin message rate-based congestion control for DSRC systems
Controlling channel congestion is one of the major challenges in achieving scalability for DSRC safety systems. Message rate-based congestion control schemes, like LInear MEssage Rate Integrated Control (LIMERIC), generally aim to produce unweighted fair outcomes, e.g. equal message rate allocation...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Controlling channel congestion is one of the major challenges in achieving scalability for DSRC safety systems. Message rate-based congestion control schemes, like LInear MEssage Rate Integrated Control (LIMERIC), generally aim to produce unweighted fair outcomes, e.g. equal message rate allocation among nodes in a given area. However, there are practical scenarios where it may be desirable for various vehicles participating in congestion control to converge at weighted fair rates. These situations may reflect relatively static distinctions among vehicles, e.g. allocating higher rates to more accident-prone drivers, or more dynamic factors, e.g. temporary aggressive driving patterns. In this paper we propose a method that achieves weighted fair message rate allocation using a variation of the LIMERIC algorithm for DSRC systems. We provide a mathematical proof which shows the convergence and stability of the proposed technique. We also present NS-2 simulation results that demonstrate the weighted fair rates achieved by several nodes participating in congestion control. |
---|---|
DOI: | 10.1109/wivec.2013.6698225 |