Priority based data scheduling in VANETs
| Autor: | Kunwar Singh Vaisla, S. D. Sudarsan, Vishal Kumar |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Rate-monotonic scheduling
Earliest deadline first scheduling Computer science business.industry 020206 networking & telecommunications 02 engineering and technology Dynamic priority scheduling Round-robin scheduling Deadline-monotonic scheduling Priority inversion Priority inheritance 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Priority ceiling protocol business Computer network |
| Zdroj: | 2016 International Conference on Advances in Computing and Communication Engineering (ICACCE). |
| DOI: | 10.1109/icacce.2016.8073717 |
| Popis: | In this paper, our work aims in fair queuing with priority to consider scheduling of various requests received at the RSU; an important issue for desired data access in vehicular ad-hoc networks. As thousands of requests may arrive at the data center, so scheduling these requests in a proper and efficient way is a challenge. Many scheduling algorithms have been proposed in the literature. In this paper, we are summarizing schemes that categorize requests based on the priority associated with it. The high priority request is served in comparison to the other requests. Data scheduling through roadside units (RSUs) has been done at the application layer by considering the message priority. However, without consideration of such priorities, emergency messages can be treated as general and can be delayed, blocked and dropped by lower-priority messages, which are not urgent and can wait for later transmission. The proposed work aims in fair queuing with priority. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|