Severity-Based Prioritized Processing of Packets with Application in VANETs
<p dir="ltr">To fully realize the potential of vehicular networks, several obstacles and challenges need to be addressed. Chief among the obstacles are strict QoS requirements of applications and differentiated service requirements in different situations. Although DSRC and WAVE have...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| منشور في: |
2019
|
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513561210912768 |
|---|---|
| author | Ala Al-Fuqaha (4434340) |
| author2 | Ihab Mohammed (16864203) Sayed Jahed Hussini (16864206) Sameh Sorour (16864209) |
| author2_role | author author author |
| author_facet | Ala Al-Fuqaha (4434340) Ihab Mohammed (16864203) Sayed Jahed Hussini (16864206) Sameh Sorour (16864209) |
| author_role | author |
| dc.creator.none.fl_str_mv | Ala Al-Fuqaha (4434340) Ihab Mohammed (16864203) Sayed Jahed Hussini (16864206) Sameh Sorour (16864209) |
| dc.date.none.fl_str_mv | 2019-01-18T00:00:00Z |
| dc.identifier.none.fl_str_mv | 10.1109/tmc.2019.2892980 |
| dc.relation.none.fl_str_mv | https://figshare.com/articles/journal_contribution/Severity-Based_Prioritized_Processing_of_Packets_with_Application_in_VANETs/24006759 |
| dc.rights.none.fl_str_mv | CC BY 4.0 info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Information and computing sciences Cybersecurity and privacy Distributed computing and systems software Quality of service Cryptography Delays Safety Receivers Context severity Prioritized processing Network calculus VANETs |
| dc.title.none.fl_str_mv | Severity-Based Prioritized Processing of Packets with Application in VANETs |
| dc.type.none.fl_str_mv | Text Journal contribution info:eu-repo/semantics/publishedVersion text contribution to journal |
| description | <p dir="ltr">To fully realize the potential of vehicular networks, several obstacles and challenges need to be addressed. Chief among the obstacles are strict QoS requirements of applications and differentiated service requirements in different situations. Although DSRC and WAVE have been adopted as the de facto standards, they do not address all the problems and there is room for improvements. In this study, we propose a generic prioritization and resource management algorithm that can be used to prioritize processing of received packets in vehicular networks. We formulate the generic severity-based prioritized packet processing problem as Penalized Multiple Knapsack Problem (PMKP) and prove that it is an NP-Hard problem. We thus develop a real-time heuristic that utilizes a relaxed version of the formulation. The relaxed formulation executes in polynomial time and guarantees a minimum delay per severity-level while respecting the processing rate constraint. To measure the performance of the proposed heuristic, real traffic data is used in a small-scale experiment. The proposed heuristic is tested against the PMKP solution and results show a small degradation of up to 4 percent in profit for the heuristic compared to the PMKP solution. Also, the proposed heuristic is tested against a non-prioritized processing algorithm that works using first come first served policy. Results show that the proposed heuristic gains 9 to 67 percent more profit than the non-prioritized processing algorithm in moderate and high congestion scenarios.</p><h2>Other Information</h2><p dir="ltr">Published in: IEEE Transactions on Mobile Computing<br>License: <a href="https://creativecommons.org/licenses/by/4.0/legalcode" target="_blank">https://creativecommons.org/licenses/by/4.0/</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1109/tmc.2019.2892980" target="_blank">https://dx.doi.org/10.1109/tmc.2019.2892980</a></p> |
| eu_rights_str_mv | openAccess |
| id | Manara2_81fe9de19977ec876a3c5a85220c30f8 |
| identifier_str_mv | 10.1109/tmc.2019.2892980 |
| network_acronym_str | Manara2 |
| network_name_str | Manara2 |
| oai_identifier_str | oai:figshare.com:article/24006759 |
| publishDate | 2019 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| rights_invalid_str_mv | CC BY 4.0 |
| spelling | Severity-Based Prioritized Processing of Packets with Application in VANETsAla Al-Fuqaha (4434340)Ihab Mohammed (16864203)Sayed Jahed Hussini (16864206)Sameh Sorour (16864209)Information and computing sciencesCybersecurity and privacyDistributed computing and systems softwareQuality of serviceCryptographyDelaysSafetyReceiversContext severityPrioritized processingNetwork calculusVANETs<p dir="ltr">To fully realize the potential of vehicular networks, several obstacles and challenges need to be addressed. Chief among the obstacles are strict QoS requirements of applications and differentiated service requirements in different situations. Although DSRC and WAVE have been adopted as the de facto standards, they do not address all the problems and there is room for improvements. In this study, we propose a generic prioritization and resource management algorithm that can be used to prioritize processing of received packets in vehicular networks. We formulate the generic severity-based prioritized packet processing problem as Penalized Multiple Knapsack Problem (PMKP) and prove that it is an NP-Hard problem. We thus develop a real-time heuristic that utilizes a relaxed version of the formulation. The relaxed formulation executes in polynomial time and guarantees a minimum delay per severity-level while respecting the processing rate constraint. To measure the performance of the proposed heuristic, real traffic data is used in a small-scale experiment. The proposed heuristic is tested against the PMKP solution and results show a small degradation of up to 4 percent in profit for the heuristic compared to the PMKP solution. Also, the proposed heuristic is tested against a non-prioritized processing algorithm that works using first come first served policy. Results show that the proposed heuristic gains 9 to 67 percent more profit than the non-prioritized processing algorithm in moderate and high congestion scenarios.</p><h2>Other Information</h2><p dir="ltr">Published in: IEEE Transactions on Mobile Computing<br>License: <a href="https://creativecommons.org/licenses/by/4.0/legalcode" target="_blank">https://creativecommons.org/licenses/by/4.0/</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1109/tmc.2019.2892980" target="_blank">https://dx.doi.org/10.1109/tmc.2019.2892980</a></p>2019-01-18T00:00:00ZTextJournal contributioninfo:eu-repo/semantics/publishedVersiontextcontribution to journal10.1109/tmc.2019.2892980https://figshare.com/articles/journal_contribution/Severity-Based_Prioritized_Processing_of_Packets_with_Application_in_VANETs/24006759CC BY 4.0info:eu-repo/semantics/openAccessoai:figshare.com:article/240067592019-01-18T00:00:00Z |
| spellingShingle | Severity-Based Prioritized Processing of Packets with Application in VANETs Ala Al-Fuqaha (4434340) Information and computing sciences Cybersecurity and privacy Distributed computing and systems software Quality of service Cryptography Delays Safety Receivers Context severity Prioritized processing Network calculus VANETs |
| status_str | publishedVersion |
| title | Severity-Based Prioritized Processing of Packets with Application in VANETs |
| title_full | Severity-Based Prioritized Processing of Packets with Application in VANETs |
| title_fullStr | Severity-Based Prioritized Processing of Packets with Application in VANETs |
| title_full_unstemmed | Severity-Based Prioritized Processing of Packets with Application in VANETs |
| title_short | Severity-Based Prioritized Processing of Packets with Application in VANETs |
| title_sort | Severity-Based Prioritized Processing of Packets with Application in VANETs |
| topic | Information and computing sciences Cybersecurity and privacy Distributed computing and systems software Quality of service Cryptography Delays Safety Receivers Context severity Prioritized processing Network calculus VANETs |