Design and Analysis of an Efficient and Reliable Mac Protocol for Vanets
Notice bibliographique
Résumé
The increase number of vehicles on roads and the immense number of fatal accidents they cause have driven the research and development of new generation technologies to help drivers travel more safely. One major cause of traffic accidents is that drivers cannot consistently respond to the changing road conditions appropriately. In fact, most accidents could be avoided if drivers could obtain and use relevant information of the traffic that is beyond their vision using wireless communications technology. Recently, the IEEE community adopted the IEEE 802.11p standard as a main technology for VANETs. To test the feasibility of this technology, most researchers use simulations to evaluate its new applications and protocols due to the prohibitive cost of implementing real VANET setup. Therefore, we first analyze VANET’s wireless channel analytically and by simulations to predict its most appropriate propagation model and the communication range that minimizes the impact of the hidden terminal problem. Second, we derive a new mobility model that takes into account the vehicle’s follow-on safety rule, to accurately derive the relationship between vehicle’s speed and network density. It is expected that broadcasting and multi hop communications will be dominant in VANETs safety applications and protocols. Therefore, a Network Topology p-Persistence (NTPP) scheme is proposed to alleviate the impact of the broadcast storm problem. NTPP is based on vehicles’ knowledge of their neighbors in their range and traffic parameters to reduce the channel contention, redundant re-broadcasts and message travel time and to increase the emergency message reception rate. We analyze the reliability of the IEEE 802.11p in VANETs safety and warning applications scope taking into consideration different factors. It is shown analytically and by extensive simulations that the current DSRC specifications may lead to undesirable performance under harsh vehicular environments. Therefore, a novel Distributed Multichannel and Mobility Aware Cluster-based MAC Protocol (DMCMAC) is proposed to alleviate the impact of the hidden terminal problem, increase the network capacity and reliability. Cluster heads in DMCMAC are elected and re-elected in a distributed manner according to their relative speed and distance from their cluster members. The high stability of DMCMAC results from its adaptability to drivers’ behavior on the road and its learning process to predict the future speed and position of all cluster members using the fuzzy logic inference system. The reliability of DMCMAC is analyzed and compared with other protocols. It is shown by simulations that DMCMAC has high stability, its performance exceeds other protocols and can achieve a timely and reliable delivery of emergency messages to their intended recipients which make it more suitable for VANETs. iv
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,002 | 0,005 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,001 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,001 | 0,001 |
| Communication savante | 0,002 | 0,002 |
| Science ouverte | 0,002 | 0,001 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,002 | 0,001 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».