Enhancing the Spatial Reusability Offered by Smart Beamforming Antennas in Multi-hop Wireless Networks
Notice bibliographique
Résumé
The increasing use of multi-hop wireless networks and the growing demand of bandwidth-intensive multimedia applications are the driving force to explore innovative techniques that can enhance the capacity of multi-hop wireless networks. The commonly used omni-directional antennas limit the spatial reusability of the wireless channel and hence reduce the available capacity of wireless networks. On the contrary, bandforming antennas, that enable directional transmissions and receptions, can overcome the aforementioned limitation. With the recent advances in signed processing and antenna technologies, smart beamforming antennas have become feasible in compact sizes and suitable prices and hence pertinent to multi-hop wireless networks. However, lack of appropriate control over the antenna beamforming may deteriorate the overall performance even below the level achieved by omni-directional antennas. Moreover, beamforming antennas introduce unprecedented challenges including deafness and directional hidden terminal problems. Hence, it is important to design efficient mechanisms for both Medium Access Control (MAC) and routing to deal with these challenges that hinder the full exploitation of spatial reusability offered by smart beamforming antennas. In this dissertation, we develop an analytical framework for modeling directional contention-based MAC protocols, which is, up to our knowledge, the first model to include deafness in the analysis. We show that deafness can severely limit the network capacity. Based on the insights gained from our analysis of the limitations of the existing solutions, we propose a novel opportunistic directional MAC protocol for multi-hop wireless networks with beamforming antennas. The proposed MAC protocol employs a new backoff mechanism that aims at minimizing the unnecessary idle waiting time, which is a key factor in leveraging the spatial reuse. Through extensive simulations, we demonstrate that the proposed MAC protocol enhances the performance in terms of throughput, delay, packet delivery ratio and fairness. We have also addressed the question about the theoretical capacity gain achieved by beamforming antennas. We derive a generic interference model that can accommodate any antenna radiation pattern and show that the capacity gain is significant even when realistic antenna radiation patterns are used. Since smart beamforming antennas can significantly spare the network resources, they can be utilized to provide Quality of Service (QoS) guarantees. We study the bandwidth-guaranteed routing problem in contention-based multi-hop wireless networks with beamforming antennas. We first present an analysis for the wireless links interdependencies in a contention-based environment in the presence of beamforming, which helps in our formulation of the QoS routing problem as a mixed-integer non-linear optimization problem. We then propose a routing and admission control algorithm for its solution. Our simulation results demonstrate the accuracy of our analysis and the ability of our proposed algorithm to find bandwidth-guaranteed routes. In summary, the analysis and design approaches, adopted in this dissertation, enhance the throughput of multi-hop wireless networks by grasping the transmission opportunities offered by smart beamforming antennas while dealing with the beamforming-related challenges at the MAC and network layers, which otherwise limit the spatial reusability of the wireless channel.
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,001 | 0,002 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,001 |
| Communication savante | 0,001 | 0,001 |
| Science ouverte | 0,001 | 0,001 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
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 ».