Spelling suggestions: "subject:"aireless mesh etworks"" "subject:"aireless mesh enetworks""
81 |
Routage adaptatif et stabilité dans les réseaux maillés sans filBoushaba, Mustapha 03 1900 (has links)
Grâce à leur flexibilité et à leur facilité d’installation, les réseaux maillés sans fil (WMNs) permettent un déploiement d’une infrastructure à faible coût. Ces réseaux étendent la couverture des réseaux filaires permettant, ainsi, une connexion n’importe quand et n’importe où. Toutefois, leur performance est dégradée par les interférences et la congestion. Ces derniers causent des pertes de paquets et une augmentation du délai de transmission d’une façon drastique. Dans cette thèse, nous nous intéressons au routage adaptatif et à la stabilité dans ce type de réseaux.
Dans une première partie de la thèse, nous nous intéressons à la conception d’une métrique de routage et à la sélection des passerelles permettant d’améliorer la performance des WMNs. Dans ce contexte nous proposons un protocole de routage à la source basé sur une nouvelle métrique. Cette métrique permet non seulement de capturer certaines caractéristiques des liens tels que les interférences inter-flux et intra-flux, le taux de perte des paquets mais également la surcharge des passerelles. Les résultats numériques montrent que la performance de cette métrique est meilleure que celle des solutions proposées dans la littérature.
Dans une deuxième partie de la thèse, nous nous intéressons à certaines zones critiques dans les WMNs. Ces zones se trouvent autour des passerelles qui connaissent une concentration plus élevé du trafic ; elles risquent de provoquer des interférences et des congestions. À cet égard, nous proposons un protocole de routage proactif et adaptatif basé sur l’apprentissage par renforcement et qui pénalise les liens de mauvaise qualité lorsqu’on s’approche des passerelles. Un chemin dont la qualité des liens autour d’une passerelle est meilleure sera plus favorisé que les autres chemins de moindre qualité. Nous utilisons l’algorithme de Q-learning pour mettre à jour dynamiquement les coûts des chemins, sélectionner les prochains nœuds pour faire suivre les paquets vers les passerelles choisies et explorer d’autres nœuds voisins. Les résultats numériques montrent que notre protocole distribué, présente de meilleurs résultats comparativement aux protocoles présentés dans la littérature.
Dans une troisième partie de cette thèse, nous nous intéressons aux problèmes d’instabilité des réseaux maillés sans fil. En effet, l’instabilité se produit à cause des changements fréquents des routes qui sont causés par les variations instantanées des qualités des liens dues à la présence des interférences et de la congestion. Ainsi, après une analyse de l’instabilité, nous proposons d’utiliser le nombre de variations des chemins dans une table de routage comme indicateur de perturbation des réseaux et nous utilisons la fonction d’entropie, connue dans les mesures de l’incertitude et du désordre des systèmes, pour sélectionner les routes stables. Les résultats numériques montrent de meilleures performances de notre protocole en comparaison avec d’autres protocoles dans la littérature en termes de débit, délai, taux de perte des paquets et l’indice de Gini. / Thanks to their flexibility and their simplicity of installation, Wireless Mesh Networks (WMNs) allow a low cost deployment of network infrastructure. They can be used to extend wired networks coverage allowing connectivity anytime and anywhere. However, WMNs may suffer from drastic performance degradation (e.g., increased packet loss ratio and delay) because of interferences and congestion. In this thesis, we are interested in adaptive routing and stability in WMNs.
In the first part of the thesis, we focus on defining new routing metric and gateway selection scheme to improve WMNs performance. In this context, we propose a source routing protocol based on a new metric which takes into account packet losses, intra-flow interferences, inter-flow interferences and load at gateways together to select best paths to best gateways. Simulation results show that the proposed metric improves the network performance and outperforms existing metrics in the literature.
In the second part of the thesis, we focus on critical zones, in WMNs, that consist of mesh routers which are located in neighborhoods of gateways where traffic concentration may occur. This traffic concentration may increase congestion and interferences excessively on wireless channels around the gateways. Thus, we propose a proactive and adaptive routing protocol based on reinforcement learning which increasingly penalizes links with bad quality as we get closer to gateways. We use Q-learning algorithm to dynamically update path costs and to select the next hop each time a packet is forwarded toward a given gateway; learning agents in each mesh router learn the best link to forward an incoming packet and explore new alternatives in the future. Simulation results show that our distributed routing protocol is less sensitive to interferences and outperforms existing protocols in the literature.
In the third part of this thesis, we focus on the problems of instability in WMNs. Instability occurs when routes flapping are frequent. Routes flapping are caused by the variations of link quality due to interferences and congestion. Thus, after analyzing factors that may cause network instability, we propose to use the number of path variations in routing tables as an indicator of network instability. Also, we use entropy function, usually used to measure uncertainty and disorder in systems, to define node stability, and thus, select the most stable routes in the WMNs. Simulation results show that our stability-based routing protocol outperforms existing routing protocols in the literature in terms of throughput, delay, loss rate, and Gini index.
|
82 |
Métriques de routage dans les réseaux maillés sans filSarr, Yaye 04 1900 (has links)
Ces dernières années, les technologies sans fil ont connu un essor
fulgurant. Elles ont permis la mise en place de réseaux sans fil à hautes
performances. Les réseaux maillées sans fil (RMSF) sont une nouvelle génération
de réseaux sans fil qui offrent des débits élevés par rapport aux réseaux Wi-Fi
(Wireless Fidelity) classiques et aux réseaux ad-hoc. Ils présentent de nombreux
avantages telles que leur forte tolérance aux pannes, leur robustesse, leur faible
coût etc. Les routeurs des RMSF peuvent disposer de plusieurs interfaces radio et
chaque interface peut opérer sur plusieurs canaux distincts, c’est des RMSF
multiples-radios, multiples-canaux. Ce type de réseau peut accroître de manière
considérable les performances des RMSF. Cependant plusieurs problèmes
subsistent et doivent être résolus notamment celui du routage.
Le routage dans les RMSF demeure un défi majeur. Le but des protocoles
de routage est de trouver les meilleures routes i.e. des routes qui maximisent les
débits et minimisent les délais, lors de l’acheminement du trafic. La qualité des
routes dans les RMSF peut être fortement affectée par les interférences, les
collisions, les congestions etc. Alors les protocoles doivent être en mesure de
détecter ces problèmes pour pouvoir en tenir compte lors de la sélection des
routes. Plusieurs études ont été dédiées aux métriques et aux protocoles de routage
dans les RMSF afin de maximiser les performances de celles ci. Mais la plupart ne
prennent pas en considération toutes les contraintes telles que les interférences, le
problème des stations cachées etc. Ce mémoire propose une nouvelle métrique de
routage pour RMSF.
Nous avons mis en place une nouvelle métrique de routage pour RMSF
appelée MBP (Metric Based on Probabilities). Cette métrique est destinée aux
RMSF mono-radio ou multiples-radios. Elle permet d’éviter les routes à forte
ii
interférence. Les résultats des simulations ont montré que MBP présente des
améliorations par rapport à certaines métriques : ETT, WCETT et iAWARE qui
sont connues dans le domaine. / In recent years, wireless technologies have developed sharply. They allow
the establishment of high performance wireless networks. Wireless Mesh
Networks (WMNs) is a new generation of wireless networks that offer high
throughput compared to classical Wi-Fi (Wireless Fidelity) or ad-hoc networks.
WMNs have attracted significant research due to their features that include
dynamic self organization, self configuration, easy maintenance and low cost.
WMNs nodes can be equipped with multiples-radios and multiples-channels. This
type of network can increase significantly the performance of WMNs. However,
several problems must be solved including routing in WMNs.
Routing in WMNs is a great challenge. The main goal of routing protocols
is to find best paths i.e. paths that maximize throughputs and minimize delays
when transmitting packets. Route quality can be strongly affected by interference,
collisions, congestions etc. Then protocols should be able to detect these problems
and take them into account during route selection.
We propose a new routing metric for WMNs, called MBP that captures the
impact of intra-flow and inter-flow interference in multi-radio, multi-channel
networks. Results show that MBP has better performances than some existing and
popular metrics like ETT, WCETT and iAWARE.
|
83 |
Routage adaptatif et stabilité dans les réseaux maillés sans filBoushaba, Mustapha 03 1900 (has links)
Grâce à leur flexibilité et à leur facilité d’installation, les réseaux maillés sans fil (WMNs) permettent un déploiement d’une infrastructure à faible coût. Ces réseaux étendent la couverture des réseaux filaires permettant, ainsi, une connexion n’importe quand et n’importe où. Toutefois, leur performance est dégradée par les interférences et la congestion. Ces derniers causent des pertes de paquets et une augmentation du délai de transmission d’une façon drastique. Dans cette thèse, nous nous intéressons au routage adaptatif et à la stabilité dans ce type de réseaux.
Dans une première partie de la thèse, nous nous intéressons à la conception d’une métrique de routage et à la sélection des passerelles permettant d’améliorer la performance des WMNs. Dans ce contexte nous proposons un protocole de routage à la source basé sur une nouvelle métrique. Cette métrique permet non seulement de capturer certaines caractéristiques des liens tels que les interférences inter-flux et intra-flux, le taux de perte des paquets mais également la surcharge des passerelles. Les résultats numériques montrent que la performance de cette métrique est meilleure que celle des solutions proposées dans la littérature.
Dans une deuxième partie de la thèse, nous nous intéressons à certaines zones critiques dans les WMNs. Ces zones se trouvent autour des passerelles qui connaissent une concentration plus élevé du trafic ; elles risquent de provoquer des interférences et des congestions. À cet égard, nous proposons un protocole de routage proactif et adaptatif basé sur l’apprentissage par renforcement et qui pénalise les liens de mauvaise qualité lorsqu’on s’approche des passerelles. Un chemin dont la qualité des liens autour d’une passerelle est meilleure sera plus favorisé que les autres chemins de moindre qualité. Nous utilisons l’algorithme de Q-learning pour mettre à jour dynamiquement les coûts des chemins, sélectionner les prochains nœuds pour faire suivre les paquets vers les passerelles choisies et explorer d’autres nœuds voisins. Les résultats numériques montrent que notre protocole distribué, présente de meilleurs résultats comparativement aux protocoles présentés dans la littérature.
Dans une troisième partie de cette thèse, nous nous intéressons aux problèmes d’instabilité des réseaux maillés sans fil. En effet, l’instabilité se produit à cause des changements fréquents des routes qui sont causés par les variations instantanées des qualités des liens dues à la présence des interférences et de la congestion. Ainsi, après une analyse de l’instabilité, nous proposons d’utiliser le nombre de variations des chemins dans une table de routage comme indicateur de perturbation des réseaux et nous utilisons la fonction d’entropie, connue dans les mesures de l’incertitude et du désordre des systèmes, pour sélectionner les routes stables. Les résultats numériques montrent de meilleures performances de notre protocole en comparaison avec d’autres protocoles dans la littérature en termes de débit, délai, taux de perte des paquets et l’indice de Gini. / Thanks to their flexibility and their simplicity of installation, Wireless Mesh Networks (WMNs) allow a low cost deployment of network infrastructure. They can be used to extend wired networks coverage allowing connectivity anytime and anywhere. However, WMNs may suffer from drastic performance degradation (e.g., increased packet loss ratio and delay) because of interferences and congestion. In this thesis, we are interested in adaptive routing and stability in WMNs.
In the first part of the thesis, we focus on defining new routing metric and gateway selection scheme to improve WMNs performance. In this context, we propose a source routing protocol based on a new metric which takes into account packet losses, intra-flow interferences, inter-flow interferences and load at gateways together to select best paths to best gateways. Simulation results show that the proposed metric improves the network performance and outperforms existing metrics in the literature.
In the second part of the thesis, we focus on critical zones, in WMNs, that consist of mesh routers which are located in neighborhoods of gateways where traffic concentration may occur. This traffic concentration may increase congestion and interferences excessively on wireless channels around the gateways. Thus, we propose a proactive and adaptive routing protocol based on reinforcement learning which increasingly penalizes links with bad quality as we get closer to gateways. We use Q-learning algorithm to dynamically update path costs and to select the next hop each time a packet is forwarded toward a given gateway; learning agents in each mesh router learn the best link to forward an incoming packet and explore new alternatives in the future. Simulation results show that our distributed routing protocol is less sensitive to interferences and outperforms existing protocols in the literature.
In the third part of this thesis, we focus on the problems of instability in WMNs. Instability occurs when routes flapping are frequent. Routes flapping are caused by the variations of link quality due to interferences and congestion. Thus, after analyzing factors that may cause network instability, we propose to use the number of path variations in routing tables as an indicator of network instability. Also, we use entropy function, usually used to measure uncertainty and disorder in systems, to define node stability, and thus, select the most stable routes in the WMNs. Simulation results show that our stability-based routing protocol outperforms existing routing protocols in the literature in terms of throughput, delay, loss rate, and Gini index.
|
84 |
Distributed channel assignment for interference-aware wireless mesh networksShzu-Juraschek, Felix 15 May 2014 (has links)
Die Besonderheit der drahtlosen Kommunikation gegenüber den drahtgebundenen Netzwerken liegt im drahtlosen Übertragungsmedium. Aufgrund der Broadcast-Eigenschaft des Übertragungsmediums werden Nachrichten potentiell von allen Netzwerkstationen empfangen, welche sich in der Übertragungsreichweite des Senders aufhalten. Als Konsequenz können bei einem unsynchronisierten Medienzugriff mehrere Nachrichten beim Empfänger kollidieren und nicht korrekt empfangen werden. Dieses Phänomen wird auch als Interferenz bezeichnet. Um solche Interferenzen zu vermeiden, wurden spezielle Protokolle für den Medienzugriff in drahtlosen Netzen entwickelt. Ein solcher Ansatz für drahtlose Maschennetze ist die verteilte Kanalzuweisung. Bei der verteilten Kanalzuweisung werden sich nicht-überlappende Kanäle im verfügbaren Frequenzspektrum für Übertragungen verwendet, die auf dem gleichen Kanal Interferenzen erzeugen würden. Dieser Ansatz ist möglich, da die verwendeten Funktechnologien, wie zum Beispiel IEEE 802.11 (WLAN), mehrere nicht-überlappende Kanäle bereitstellen. Aufgrund der großen Verbreitung von IEEE 802.11, ist eine hohe Dichte von privaten wie kommerziellen Netzen im urbanen Raum die Norm. Diese räumlich überlappenden Netze konkurrieren um den Medienzugriff. Daher ist es für die Leistung von Kanalzuweisungsalgorithmen von großer Bedeutung, die Aktivität der externen Netze mit einzubeziehen. Die Leistung der vorgelegten Arbeit umfasst das Design, die Implementierung und Validierung von Modellen und Algorithmen zur Reduzierung von Interferenzen in drahtlosen Maschennetzen. Die Arbeit beinhaltet die Entwicklung eines Messungs-basierten Interferenzmodells, mit dem Interferenzabhängigkeiten der Maschenrouter untereinander effizient bestimmt werden können. Weiterhin wurde ein Algorithmus für die verteilte Kanalzuweisung entwickelt, der die Aktivität von externen Netzen berücksichtigt. Die Gesamtlösung wurde in einem großen drahtlosen Maschennetz experimentell validiert. / Due to the broadcast nature of the shared medium, wireless transmissions are potentially received by all network stations in the communication range of the sender. With an unsynchronized medium access, multiple transmissions may be active at the same time and thus interfere with each other. In consequence, multiple transmissions may collide at the receiver side and cannot be properly decoded. For this reason, protocols have been developed on the MAC layer to synchronize the medium access and thus reduce interference effects. One of these approaches in wireless mesh networks is channel assignment. The idea of channel assignment is to minimize the network-wide interference by utilizing non-overlapping channels for otherwise interfering wireless transmissions. This is feasible, since wireless mesh routers are usually equipped with multiple radios and commonly used wireless network technologies, such as IEEE 802.11, provide multiple non-overlapping channels. Since IEEE 802.11 operates in the unlicensed frequency spectrum, the dense distribution of private and commercial network deployments of WLANs in urban areas poses a new challenge. Co-located networks compete for the wireless medium, thus decreasing the achievable network performance in terms of throughput and latency. Therefore, an important issue for efficient channel assignment is to also address external interference The contributions of this dissertation comprise the design, implementation, and validation of models and algorithms to enable wireless multi-hop networks to become interference-aware. This includes a measurement-based interference model suitable for large-scale network deployments. A distributed channel assignment algorithm has been developed that considers external sources of interference. The overall solution has been experimentally validated in a large-scale wireless multi-hop multi-radio testbed and has significantly increased the network performance with regard to the network capacity.
|
85 |
Collision guided routing for ad hoc mobile wireless networksBa Surra, Shadi Saleh Ali January 2013 (has links)
Ad hoc mobile wireless networks are self-configuring infrastructureless networks of mobile devices connected via wireless links. Each device can send and receive data, but it should also forward traffic unrelated to its own use. All need to maintain their autonomy, and effectively preserve their resources (e.g. battery power). Moreover, they can leave the network at any time. Their intrinsic dynamicity and fault tolerance makes them suitable for applications, such as emergency response and disaster relief, when infrastructure is nonexistent or damaged due to natural disasters, such as earthquakes and flooding, as well as more mundane, day-to-day, uses where their flexibility would be advantageous. Routing is the fundamental research issue for such networks and refers to finding and maintaining routes between nodes. Moreover, it involves selecting the best route where many may be available. However, due to the freedom of movement of nodes, new routes need to be constantly recalculated. Most routing protocols use pure broadcasting to discover new routes, which takes up a substantial amount of bandwidth. Intelligent rebroadcasting reduces these overheads by calculating the usefulness of a rebroadcast, and the likelihood of message collisions. Unfortunately, this introduces latency and parts of the network may become unreachable. This dissertation presents a routing protocol that uses a new parallel and distributed guided broadcasting technique to reduce redundant broadcasting and to accelerate the path discovery process, while maintaining a high reachability ratio as well as keeping node energy consumption low. This broadcasting scheme is implemented in a Mobile Ad Hoc Network (MANET) and a Wireless Mesh Network (WMN). To reduce overheads further, a Zone based Routing with Parallel Collision Guided Broadcasting Protocol (ZCG) in MANET is introduced. This uses a one hop clustering algorithm that splits the network into zones led by reliable leaders that are mostly static and have plentiful battery resources. For WMN, a Social-aware Routing Protocol (SCG) is designed that draws upon social network theory to associate longstanding social ties between nodes, using their communication patterns to divide the network into conceptual social groups, which allows cluster members to protect each other from redundant broadcasts by using intelligent rebroadcasting. The performance characteristics of the new protocols are established through simulations that measure their behaviour and by comparing them to other well-known routing protocols, namely the: AODV, DSR, TORA and the OLSR, as appropriate, it emerges that two new protocols, the ZCG and SCG, perform better in certain conditions, with the latter doing consistently well under most circumstances.
|
86 |
Interference-aware adaptive spectrum management for wireless networks using unlicensed frequency bandsPediaditaki, Sofia January 2012 (has links)
The growing demand for ubiquitous broadband network connectivity and continuously falling prices in hardware operating on the unlicensed bands have put Wi-Fi technology in a position to lead the way in rapid innovation towards high performance wireless for the future. The success story of Wi-Fi contributed to the development of widespread variety of options for unlicensed access (e.g., Bluetooth, Zigbee) and has even sparked regulatory bodies in several countries to permit access to unlicensed devices in portions of the spectrum initially licensed to TV services. In this thesis we present novel spectrum management algorithms for networks employing 802.11 and TV white spaces broadly aimed at efficient use of spectrum under consideration, lower contention (interference) and high performance. One of the target scenarios of this thesis is neighbourhood or citywide wireless access. For this, we propose the use of IEEE 802.11-based multi-radio wireless mesh network using omnidirectional antennae. We develop a novel scalable protocol termed LCAP for efficient and adaptive distributed multi-radio channel allocation. In LCAP, nodes autonomously learn their channel allocation based on neighbourhood and channel usage information. This information is obtained via a novel neighbour discovery protocol, which is effective even when nodes do not share a common channel. Extensive simulation-based evaluation of LCAP relative to the state-of-the-art Asynchronous Distributed Colouring (ADC) protocol demonstrates that LCAP is able to achieve its stated objectives. These objectives include efficient channel utilisation across diverse traffic patterns, protocol scalability and adaptivity to factors such as external interference. Motivated by the non-stationary nature of the network scenario and the resulting difficulty of establishing convergence of LCAP, we consider a deterministic alternative. This approach employs a novel distributed priority-based mechanism where nodes decide on their channel allocations based on only local information. Key enabler of this approach is our neighbour discovery mechanism. We show via simulations that this mechanism exhibits similar performance to LCAP. Another application scenario considered in this thesis is broadband access to rural areas. For such scenarios, we consider the use of long-distance 802.11 mesh networks and present a novel mechanism to address the channel allocation problem in a traffic-aware manner. The proposed approach employs a multi-radio architecture using directional antennae. Under this architecture, we exploit the capability of the 802.11 hardware to use different channel widths and assign widths to links based on their relative traffic volume such that side-lobe interference is mitigated. We show that this problem is NP-complete and propose a polynomial time, greedy channel allocation algorithm that guarantees valid channel allocations for each node. Evaluation of the proposed algorithm via simulations of real network topologies shows that it consistently outperforms fixed width allocation due to its ability to adapt to spatio-temporal variations in traffic demands. Finally, we consider the use of TV-white-spaces to increase throughput for in-home wireless networking and relieve the already congested unlicensed bands. To the best of our knowledge, our work is the first to develop a scalable micro auctioning mechanism for sharing of TV white space spectrum through a geolocation database. The goal of our approach is to minimise contention among secondary users, while not interfering with primary users of TV white space spectrum (TV receivers and microphone users). It enables interference-free and dynamic sharing of TVWS among home networks with heterogeneous spectrum demands, while resulting in revenue generation for database and broadband providers. Using white space availability maps from the UK, we validate our approach in real rural, urban and dense-urban residential scenarios. Our results show that our mechanism is able to achieve its stated objectives of attractiveness to both the database provider and spectrum requesters, scalability and efficiency for dynamic spectrum distribution in an interference-free manner.
|
87 |
Classificação dinâmica de nós em redes em malha sem fioGuedes, Diego Américo 11 September 2014 (has links)
Submitted by Cássia Santos (cassia.bcufg@gmail.com) on 2014-09-11T11:50:01Z
No. of bitstreams: 2
Dissertacao Diego Americo Guedes.pdf: 971567 bytes, checksum: a39a61e190ff600e318da0dd24eb108c (MD5)
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2014-09-11T11:50:01Z (GMT). No. of bitstreams: 2
Dissertacao Diego Americo Guedes.pdf: 971567 bytes, checksum: a39a61e190ff600e318da0dd24eb108c (MD5)
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this work we present and evaluate a modeling methodology that describes the creation
of a topology for wireless mesh networks, and how this topology changes over time. The
modeling methodology is based on network science, which is a multidisciplinary research
area that has a lot of tools to help in the study and analysis of networks. In wireless mesh
networks, the relative importance of the nodes is often related to the topological aspects,
and data flow. However, due to the dynamics of the network, the relative importance of
the nodes may vary in time. In the context of network science, the concept of centrality
metric represents the relative importance of a node in the network. In this work we show
also that the current centrality metrics are not able to rank properly the nodes in wireless
mesh networks. Then we propose a new metric of centrality that ranks the most important
nodes in a wireless mesh network over time. We evaluate our proposal using data from
a case study of the proposed modeling methodology and also from real wireless mesh
networks, achieving satisfactory performance. The characteristics of our metric make it a
useful tool for monitoring dynamic networks. / Neste trabalho, apresentamos e avaliamos uma modelagem que descreve a criação de uma
topologia para redes em malha sem fio e como essa se altera no tempo. A modelagem é
baseada em ciência das redes (network science), uma área multidisciplinar de pesquisa
que possui uma grande quantidade de ferramentas para auxiliar no estudo e análise de
redes. Em redes em malha sem fio, a importância relativa dos nós é frequentemente
relacionada a aspectos topológicos e ao fluxo de dados. Entretanto, devido à dinamicidade
da rede, a importância relativa de um nó pode variar no tempo. No contexto de ciência de
redes, o conceito de métricas de centralidade reflete a importância relativa de um nó na
rede. Neste trabalho, mostramos também que as métricas atuais de centralidade não são
capazes de classificar de maneira adequada os nós em redes em malha sem fio. Propomos
então uma nova métrica de centralidade que classifica os nós mais importantes em uma
rede em malha sem fio ao longo do tempo. Avaliamos nossa proposta com dados obtidos
de um estudo de caso da modelagem proposta e de redes em malha sem fio reais, obtendo
desempenho satisfatório. As características da nossa métrica a tornam uma ferramenta útil
para monitoramento de redes dinâmicas.
|
88 |
Distributed and cooperative intrusion detection in wireless mesh networks / Détection d'intrusion distribuée et coopérative dans les réseaux maillés sans filMorais, Anderson 28 November 2012 (has links)
Les réseaux maillés sans fil (WMNs - Wireless Mesh Networks) sont une technologie émergente qui prend de l'importance parmi les traditionnels systèmes de communication sans fil. Toutefois, WMNs sont particulièrement vulnérables à des attaques externes et internes en raison de leurs attributs inhérents tels que le moyen de communication ouverte et l'architecture décentralisée. Dans cette recherche, nous proposons un système complet de détection d'intrusion distribué et coopératif qui détecte efficacement et effectivement des attaques au WMN en temps réel. Notre mécanisme de détection d'intrusion est basé sur l'échange fiable des événements du réseau et la coopération active entre les nœuds participants. Dans notre approche distribuée, systèmes de détection d'intrusion (IDS - Intrusion Detection System,) sont indépendamment installé dans chaque nœud mesh pour surveiller passivement le comportement de routage du nœud et en même temps surveiller le comportement de son voisinage. Sur cette base, nous avons d'abord développé un Analyseur de Protocole de Routage (APR) qui génère avec précision des événements de routage à partir du trafic observée, qui sont ensuite traités par le propre nœud et échangés entre les nœuds voisins. Deuxièmement, nous proposons un Mécanisme de Détection d'Intrusion Distribué (MDID) pratique, qui calcule périodiquement des Métriques de mal comportement précises en faisant usage des événements de routage générés et des Contraintes de Routage prédéfinies qui sont extraites à partir du comportement du protocole. Troisièmement, nous proposons un Mécanisme de Consensus Coopérative, qui est déclenché parmi les nœuds voisins si tout comportement malveillant est détecté. Le Mécanisme de Consensus Coopérative analyse les Métriques de mal comportement et partage les Résultats de Détection d'Intrusion parmi les voisins pour traquer la source de l'intrusion. Pour valider notre recherche, nous avons mis en œuvre la solution de détection d'intrusion distribuée en utilisant une plate-forme de réseau mesh virtualisée composé de machines virtuelles (VM - Virtual Machines) interconnectés. Nous avons également implémenté plusieurs attaques de routage pour évaluer la performance des mécanismes de détection d'intrusion / Wireless Mesh Network (WMN) is an emerging technology that is gaining importance among traditional wireless communication systems. However, WMNs are particularly vulnerable to external and insider attacks due to their inherent attributes such as open communication medium and decentralized architecture. In this research, we propose a complete distributed and cooperative intrusion detection system for efficient and effective detection of WMN attacks in real-time. Our intrusion detection mechanism is based on reliable exchange of network events and active cooperation between the participating nodes. In our distributed approach, Intrusion Detection Systems (IDSs) are independently placed at each mesh node to passively monitor the node routing behavior and concurrently monitor the neighborhood behavior. Based on that, we first implement a Routing Protocol Analyzer (RPA) that accuracy generates Routing Events from the observed traffic, which are then processed by the own node and exchanged between neighboring nodes. Second, we propose a practical Distributed Intrusion Detection Engine (DIDE) component, which periodically calculates accurate Misbehaving Metrics by making use of the generated Routing Events and pre-defined Routing Constraints that are extracted from the protocol behavior. Third, we propose a Cooperative Consensus Mechanism (CCM), which is triggered among the neighboring nodes if any malicious behavior is detected. The CCM module analyzes the Misbehaving Metrics and shares Intrusion Detection Results among the neighbors to track down the source of intrusion. To validate our research, we implemented the distributed intrusion detection solution using a virtualized mesh network platform composed of virtual machines (VMs) interconnected. We also implemented several routing attacks to evaluate the performance of the intrusion detection mechanisms
|
89 |
Enabling Multimedia Services over Wireless Multi-Hop NetworksCavalcanti de Castro, Marcel January 2009 (has links)
<p>With the constant development of wireless technologies, the usageof wireless devices tends to increase even more in the future.Wireless multi-hop networks (WMNs) have emerged as a keytechnology to numerous potential scenarios, ranging from disasterrecovery to wireless broadband internet access. The distributedarchitecture of WMNs enables nodes to cooperatively relay othernode's packets. Because of their advantages over other wirelessnetworks, WMNs are undergoing rapid progress and inspiringnumerous applications. However, many technical issues still existin this field. In this thesis we investigate how Voice over IP(VoIP) and peer-to-peer (P2P) application are influenced bywireless multi-hop network characteristics and how to optimizethem in order to provide scalable communication.We first consider the deployment of VoIP service in wirelessmulti-hop networks, by using the Session Initiation Protocol (SIP)architecture. Our investigation shows that the centralized SIParchitecture imposes several challenges when deployed in thedecentralized wireless multi-hop environment. We find that VoIPquality metrics are severely degraded as the traffic and number ofmultiple hops to the gateway increase. In the context ofscalability, we further propose four alternative approaches whichavoid current limitations.In the second part of this thesis we tackle the network capacityproblem while providing scalable VoIP service over wirelessmulti-hop networks. The performance evaluation shows the influenceof intra and inter-flow interference in channel utilization, whichdirect impacts the VoIP capacity. In order to avoid the small VoIPpacket overhead, we propose a new adaptive hop-by-hop packetaggregation scheme based on wireless link characteristics. Ourperformance evaluation shows that the proposed scheme can increasethe VoIP capacity by a two-fold gain.The study of peer-to-peer applicability over wireless multi-hopnetworks is another important contribution. A resource lookupapplication is realized through structured P2P overlay. We showthat due to several reasons, such as characteristics of wirelesslinks, multi-hop forwarding operation, and structured P2Pmanagement traffic aggressiveness the performance of traditionalP2P applications is rather low in wireless multi-hop environments.Therefore, we suggested that a trade-off between the P2P lookupefficiency and the P2P management traffic overhead can be achievedwhile maintaining the overlay network consistency in wirelessmulti-hop networks.</p>
|
90 |
Transport-Layer Performance in Wireless Multi-Hop NetworksKarlsson, Jonas January 2013 (has links)
Wireless communication has seen a tremendous growth in the last decades. Continuing on this trend, wireless multi-hop networks are nowadays used or planned for use in a multitude of contexts, spanning from Internet access at home to emergency situations. The Transmission Control Protocol (TCP) provides reliable and ordered delivery of a data and is used by major Internet applications such as web browsers, email clients and file transfer programs. TCP traffic is also the dominating traffic type on the Internet. However, TCP performs less than optimal in wireless multi-hop networks due to packet reordering, low link capacity, packet loss and variable delay. In this thesis, we develop novel proposals for enhancing the network and transport layer to improve TCP performance in wireless multi-hop networks. As initial studies, we experimentally evaluate the performance of different TCP variants, with and without mobile nodes. We further evaluate the impact of multi-path routing on TCP performance and propose packet aggregation combined with aggregation aware multi-path forwarding as a means to better utilize the available bandwidth. The last contribution is a novel extension to multi-path TCP to enable single-homed hosts to fully utilize the network capacity. / <p>Opponent changed. Prof. C. Lindeman from the University of Leipzig was substituted by Prof. Zhang.</p>
|
Page generated in 0.0741 seconds