Rural Community Wireless Mesh Networks (WMN) can be great assets to rural communities, helping them connect to the rest of their region and beyond. However, they can be a liability in terms of security. Due to the ad-hoc nature of a WMN, and the wide variety of applications and systems that can be found in such a heterogeneous environment there are multiple points of intrusion for an attacker. An unsecured WMN can lead to privacy and legal problems for the users of the network. Due to the resource constrained environment, traditional Intrusion Detection Systems (IDS) have not been as successful in defending these wireless network environments, as they were in wired network deployments. This thesis proposes that an IDS made up of low cost, low power devices can be an acceptable base for a Wireless Mesh Network Intrusion Detection System. Because of the device's low power, cost and ease of use, such a device could be easily deployed and maintained in a rural setting such as a Community WMN. The proposed system was compared to a standard IDS solution that would not cover the entire network, but had much more computing power but also a higher capital cost as well as maintenance costs. By comparing the low cost low power IDS to a standard deployment of an open source IDS, based on network coverage and deployment costs, a determination can be made that a low power solution can be feasible in a rural deployment of a WMN.

Design and management decisions require an accurate prediction of the performance of the network. Network performance estimation techniques require accurate network traffic models. In this thesis we are concerned with the modelling of network traffic for the wireless mesh network (WMN) environment. Queueing theory has been used in the past to model the WMN environment and we found in this study that queueing theory was used in two main methods to model WMNs. The first method is to consider each node in the network in terms of the number of hops it is away from the gateway. Each node is then considered as a queueing station and the parameters for the station is derived from the number of hops each node is away from the gateway. These topologies can be very limiting in terms of the number of physical topologies they can model due to the fact that their parameters are only dependent on the number of hop-counts each node is away from the gateway. The second method is to consider a fixed topology with no gateways. This method simplifies analysis but once again is very limiting. In this dissertation we propose a queueing based network traffic model that uses a connection matrix to define the topology of the network. We then derive the parameters for our model from the connection matrix. The connection matrix allows us to model a wider variety of topologies without modifying our model. We verify our model by comparing results from our model to results from a discrete event simulator and we validate our model by comparing results from our model to results from models previously proposed by other authors. By comparing results from our model to results of other models we show that our model is indeed capable of modelling a wider variety of topologies. / Thesis (MIng (Computer and Electronic Engineering))--North-West University, Potchefstroom Campus, 2013.

Design and management decisions require an accurate prediction of the performance of the network. Network performance estimation techniques require accurate network traffic models. In this thesis we are concerned with the modelling of network traffic for the wireless mesh network (WMN) environment. Queueing theory has been used in the past to model the WMN environment and we found in this study that queueing theory was used in two main methods to model WMNs. The first method is to consider each node in the network in terms of the number of hops it is away from the gateway. Each node is then considered as a queueing station and the parameters for the station is derived from the number of hops each node is away from the gateway. These topologies can be very limiting in terms of the number of physical topologies they can model due to the fact that their parameters are only dependent on the number of hop-counts each node is away from the gateway. The second method is to consider a fixed topology with no gateways. This method simplifies analysis but once again is very limiting. In this dissertation we propose a queueing based network traffic model that uses a connection matrix to define the topology of the network. We then derive the parameters for our model from the connection matrix. The connection matrix allows us to model a wider variety of topologies without modifying our model. We verify our model by comparing results from our model to results from a discrete event simulator and we validate our model by comparing results from our model to results from models previously proposed by other authors. By comparing results from our model to results of other models we show that our model is indeed capable of modelling a wider variety of topologies. / Thesis (MIng (Computer and Electronic Engineering))--North-West University, Potchefstroom Campus, 2013.

<p>In this thesis we study the handoff problem of mobile stations (MSs) jointly with the resource management at the access points (APs) for wireless mesh networks (WMNs), where the APs can dynamically adjust the transmission power and time to each of the associated MSs. Two objectives are considered, one is to balance the energy consumption of the APs, and the other is to achieve fair throughput among the MSs. Since the global optimum solutions are difficult to obtain, we propose heuristic schemes for achieving each of the objectives. The objective of balancing AP energy consumption is achieved in two steps. The optimum transmission power and rate is solved at each AP so that to minimize the energy consumption of the AP, assuming the MS-AP association is given. Two handoff schemes are then designed to find which MSs should be associated to which APs during each scheduling interval (SI). The schemes are based on energy consumption information exchanged among neighboring APs. The real-time energy balancing (REB) scheme tries to balance the energy consumption of the APs in each SI, while the long term energy balancing (LEB) scheme balances the AP energy consumption over a longer term. Our results indicate that the network lifetime can be significantly extended using the proposed handoff schemes, compared to the simple distance-based handoff scheme, and using LEB can achieve balanced AP energy consumption with a small number of handoffs. The second part of the thesis is to consider the MS handoff and AP resource allocations in order to achieve fair throughput among the MSs. An optimization problem is formulated and solved at each AP to achieve long term proportional fairness of the throughput among the MSs, assuming the MS-AP association is known. Two handoff schemes are proposed, one is utility-based, and the other is number-based, in order to determine which MSs should be associated to which APs. Our results show that both the schemes are good at achieving fair throughput among the MSs, and the schemes are not sensitive to MS moving speed or group mobility patterns. The number-based scheme is simpler than the utility-based one in terms of implementation.</p> / Master of Applied Science (MASc)

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal.

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

Each day, the dream of seamless networking and connectivity everywhere is getting closer to become a reality. In this regard, mobile Ad-Hoc networks (MANETs) have been a hot topic in the last decade; but the amount of MANET usage nowadays confines to a tiny percentage of all our network connectivity in our everyday life, which connectivity through infrastructured networks has the major share. On the other hand, we know that future of networking belongs to Ad-Hocing , so for now we try to give our everyday infrastructure network a taste of Ad-Hocing ability; these types of networks are called Wireless Mesh Networks (WMN) and routing features play a vital role in their functionality. In this thesis we examine the functionality of 3 Ad-Hoc routing protocols known as AODV, OLSR and GRP using simulation method in OPNET17.5. For this goal we set up 4 different scenarios to examine the performance of these routing protocols; these scenarios vary from each other in amount of nodes, background traffic and mobility of the nodes. Performance measurements of these protocols are done by network throughput, end-end delay of the transmitted packets and packet loss ratio as our performance metrics. After the simulation run and gathering the results we study them in a comparative view, first based on each scenario and then based on each protocol. For conclusion, as former studies suggest AODV, OLSR and DRP are among the best routing protocols for WMNs, so in this research we don’t introduce the best RP based on the obtained functionality results, instead we discuss the network conditions that each of these protocols show their best functionality in them and suggest the best routing mechanism for different networks based on the analysis from the former part.

The thesis aims to find issues that may affect the performance of meshed wireless networks. There is no denying the fact that out of the wireless technologies being used in today’s environment, the wireless meshed technology is one of the most advanced and can be viewed as the technology of the future. This thesis deals closely with aspects like throughput, security and performance as these metrics have a direct influence on the performance of the wireless mesh.The thesis is subdivided into various categories explaining the primary structure of wireless mesh networks. Performance of the network has always been a key issue and reliability is the core metric of evaluating the quality of a network. Routing protocols for these networks and which help in improving the performance are examined and the best routing protocol is suggested. This helps to improve the throughput which is the main aspect for maintaining a good performance. The main problem with wireless networks is making them security. This area is also considered as it improves the performance of the whole network. Also the network should be scalable to properly utilize the frequency and get optimal performance. This is required for the successful delivery of data packets. Thus, this area is also investigated together with some other factors that influence the behaviour of these networks. Last, but not least, we provide a discussion about possible future work as well as specifying a system that will help to increase the performance.

Généralement, les problèmes de conception de réseaux consistent à sélectionner les arcs et les sommets d’un graphe G de sorte que la fonction coût est optimisée et l’ensemble de contraintes impliquant les liens et les sommets dans G sont respectées. Une modification dans le critère d’optimisation et/ou dans l’ensemble de contraintes mène à une nouvelle représentation d’un problème différent. Dans cette thèse, nous nous intéressons au problème de conception d’infrastructure de réseaux maillés sans fil (WMN- Wireless Mesh Network en Anglais) où nous montrons que la conception de tels réseaux se transforme d’un problème d’optimisation standard (la fonction coût est optimisée) à un problème d’optimisation à plusieurs objectifs, pour tenir en compte de nombreux aspects, souvent contradictoires, mais néanmoins incontournables dans la réalité. Cette thèse, composée de trois volets, propose de nouveaux modèles et algorithmes pour la conception de WMNs où rien n’est connu à l’ avance. Le premiervolet est consacré à l’optimisation simultanée de deux objectifs équitablement importants : le coût et la performance du réseau en termes de débit. Trois modèles bi-objectifs qui se différent principalement par l’approche utilisée pour maximiser la performance du réseau sont proposés, résolus et comparés. Le deuxième volet traite le problème de placement de passerelles vu son impact sur la performance et l’extensibilité du réseau. La notion de contraintes de sauts (hop constraints) est introduite dans la conception du réseau pour limiter le délai de transmission. Un nouvel algorithme basé sur une approche de groupage est proposé afin de trouver les positions stratégiques des passerelles qui favorisent l’extensibilité du réseau et augmentent sa performance sans augmenter considérablement le coût total de son installation. Le dernier volet adresse le problème de fiabilité du réseau dans la présence de pannes simples. Prévoir l’installation des composants redondants lors de la phase de conception peut garantir des communications fiables, mais au détriment du coût et de la performance du réseau. Un nouvel algorithme, basé sur l’approche théorique de décomposition en oreilles afin d’installer le minimum nombre de routeurs additionnels pour tolérer les pannes simples, est développé. Afin de résoudre les modèles proposés pour des réseaux de taille réelle, un algorithme évolutionnaire (méta-heuristique), inspiré de la nature, est développé. Finalement, les méthodes et modèles proposés on été évalués par des simulations empiriques et d’événements discrets. / Generally, network design problems consist of selecting links and vertices of a graph G so that a cost function is optimized and all constraints involving links and the vertices in G are met. A change in the criterion of optimization and/or the set of constraints leads to a new representation of a different problem. In this thesis, we consider the problem of designing infrastructure Wireless Mesh Networks (WMNs) where we show that the design of such networks becomes an optimization problem with multiple objectives instead of a standard optimization problem (a cost function is optimized) to take into account many aspects, often contradictory, but nevertheless essential in the reality. This thesis, composed of three parts, introduces new models and algorithms for designing WMNs from scratch. The first part is devoted to the simultaneous optimization of two equally important objectives: cost and network performance in terms of throughput. Three bi-objective models which differ mainly by the approach used to maximize network performance are proposed, solved and compared. The second part deals with the problem of gateways placement, given its impact on network performance and scalability. The concept of hop constraints is introduced into the network design to reduce the transmission delay. A novel algorithm based on a clustering approach is also proposed to find the strategic positions of gateways that support network scalability and increase its performance without significantly increasing the cost of installation. The final section addresses the problem of reliability in the presence of single failures. Allowing the installation of redundant components in the design phase can ensure reliable communications, but at the expense of cost and network performance. A new algorithm is developed based on the theoretical approach of "ear decomposition" to install the minimum number of additional routers to tolerate single failures. In order to solve the proposed models for real-size networks, an evolutionary algorithm (meta-heuristics), inspired from nature, is developed. Finally, the proposed models and methods have been evaluated through empirical and discrete events based simulations.

Généralement, les problèmes de conception de réseaux consistent à sélectionner les arcs et les sommets d’un graphe G de sorte que la fonction coût est optimisée et l’ensemble de contraintes impliquant les liens et les sommets dans G sont respectées. Une modification dans le critère d’optimisation et/ou dans l’ensemble de contraintes mène à une nouvelle représentation d’un problème différent. Dans cette thèse, nous nous intéressons au problème de conception d’infrastructure de réseaux maillés sans fil (WMN- Wireless Mesh Network en Anglais) où nous montrons que la conception de tels réseaux se transforme d’un problème d’optimisation standard (la fonction coût est optimisée) à un problème d’optimisation à plusieurs objectifs, pour tenir en compte de nombreux aspects, souvent contradictoires, mais néanmoins incontournables dans la réalité. Cette thèse, composée de trois volets, propose de nouveaux modèles et algorithmes pour la conception de WMNs où rien n’est connu à l’ avance. Le premiervolet est consacré à l’optimisation simultanée de deux objectifs équitablement importants : le coût et la performance du réseau en termes de débit. Trois modèles bi-objectifs qui se différent principalement par l’approche utilisée pour maximiser la performance du réseau sont proposés, résolus et comparés. Le deuxième volet traite le problème de placement de passerelles vu son impact sur la performance et l’extensibilité du réseau. La notion de contraintes de sauts (hop constraints) est introduite dans la conception du réseau pour limiter le délai de transmission. Un nouvel algorithme basé sur une approche de groupage est proposé afin de trouver les positions stratégiques des passerelles qui favorisent l’extensibilité du réseau et augmentent sa performance sans augmenter considérablement le coût total de son installation. Le dernier volet adresse le problème de fiabilité du réseau dans la présence de pannes simples. Prévoir l’installation des composants redondants lors de la phase de conception peut garantir des communications fiables, mais au détriment du coût et de la performance du réseau. Un nouvel algorithme, basé sur l’approche théorique de décomposition en oreilles afin d’installer le minimum nombre de routeurs additionnels pour tolérer les pannes simples, est développé. Afin de résoudre les modèles proposés pour des réseaux de taille réelle, un algorithme évolutionnaire (méta-heuristique), inspiré de la nature, est développé. Finalement, les méthodes et modèles proposés on été évalués par des simulations empiriques et d’événements discrets. / Generally, network design problems consist of selecting links and vertices of a graph G so that a cost function is optimized and all constraints involving links and the vertices in G are met. A change in the criterion of optimization and/or the set of constraints leads to a new representation of a different problem. In this thesis, we consider the problem of designing infrastructure Wireless Mesh Networks (WMNs) where we show that the design of such networks becomes an optimization problem with multiple objectives instead of a standard optimization problem (a cost function is optimized) to take into account many aspects, often contradictory, but nevertheless essential in the reality. This thesis, composed of three parts, introduces new models and algorithms for designing WMNs from scratch. The first part is devoted to the simultaneous optimization of two equally important objectives: cost and network performance in terms of throughput. Three bi-objective models which differ mainly by the approach used to maximize network performance are proposed, solved and compared. The second part deals with the problem of gateways placement, given its impact on network performance and scalability. The concept of hop constraints is introduced into the network design to reduce the transmission delay. A novel algorithm based on a clustering approach is also proposed to find the strategic positions of gateways that support network scalability and increase its performance without significantly increasing the cost of installation. The final section addresses the problem of reliability in the presence of single failures. Allowing the installation of redundant components in the design phase can ensure reliable communications, but at the expense of cost and network performance. A new algorithm is developed based on the theoretical approach of "ear decomposition" to install the minimum number of additional routers to tolerate single failures. In order to solve the proposed models for real-size networks, an evolutionary algorithm (meta-heuristics), inspired from nature, is developed. Finally, the proposed models and methods have been evaluated through empirical and discrete events based simulations.