Magister Scientiae - MSc / This thesis presents an analysis of the impact of node mobility on the quality of service for voice over Internet Protocol in wireless mesh networks. Voice traffic was simulated on such a mesh network to analyze the following performance metrics: delay, jitter, packet loss and throughput. Wireless mesh networks present interesting characteristics such as multi-hop routing, node mobility, and variable coverage that can impact on quality of service. A reasonable deployment scenario for a small organizational network, for either urban or rural deployment, is considered with three wireless mesh network scenarios, each with 26 mesh nodes. In the first scenario, all mesh nodes are stationary. In the second scenario, 10 nodes are mobile and 16 nodes are stationary. Finally, in the third scenario, all mesh nodes are mobile. The mesh nodes are simulated to move at a walking speed of 1.3m per second. The results show that node mobility can increase packet loss, delay, and jitter. However, the results also show that wireless mesh networks can provide acceptable quality of service, providing that there is little or no background traffic generated by other applications. In particular, the results demonstrate that jitter across all scenarios remains within humanacceptable tolerances. It is therefore recommended that voice over Internet Protocol implementations on wireless mesh networks with background traffic be supported by quality of service standards; otherwise they can lead to service delivery failures. On the other hand, voice-only esh networks, even with mobile nodes, offer an attractive alternative voice over Internet Protocol platform. / South Africa

<p>The present development of the demography of elderly people in the western world will generate a shortage of caregiver’s for elderly people in the near future. There are major risk that the lack of qualified caregivers will result in deterioration in the quality of elderly care. One possible </p><p>solution is the use of modern information and communication technology (ICT) to enable staff to work more efficiently. However, if ICT system is introduced into the elderly care it must done in a way which is acceptable from a humane perspective while at the same time increasing the efficiency of the personal that working in elderly care centers. This thesis investigates the </p><p>technical feasibility of using a wireless mesh network for a social alarm system, in the elderly care. The System as such is not intended to replace the staff at an elderly care center but instead is intended to reduce staff workloads while providing more time for elderly care.</p>

<p>Voice over IP (VoIP) traffic in a multi-hop wireless mesh network (WMN) suffers from a large overhead due to mac/IP/UDP/RTP headers and time collisions. A consequence of the large overhead is that only a small number of concurrent VoIP calls can be supported in a WMN[17]. Hop-to-hop packet aggregation can reduce network overhead and increase the capacity. Packet aggregation is a concept which combines several small packets, destined to a common next-hop destination, to one large packet. The goal of this thesis was to implement packet aggregation on a Linux distribution and to increase the number of concurrent VoIP calls. We use as testbed a two-hop WMN with a fixed data rate of 2Mbit/s. Traffic was generated between nodes using MGEN[20] to simulate VoIP behavior. The results from the tests show that the number of supported concurrent flows in the testbed is increased by 135% compared to unaggregated traffic.</p>

<p>Wireless mesh networks has rapid development over the last few years. However, due to properties such as distributed infrastructure and interference, which strongly affect the performance of wireless mesh networks, developing technology has to face the challenge of architecture and protocol design issues. Traditional layered protocols do not function efficiently in multi-hop wireless environments. To get deeper understanding on interaction of the layered protocols and optimize the performance of wireless mesh network, more recent researches are focusing on cross-layer measurement schemes and cross-layer protocol design. The goal of this project is to implement a distributed monitoring mechanism for IEEE802.11 based wireless mesh networks. This module is event-based and has modular structure that makes it flexible to be extended. This project results a novel Cross-Layer Monitoring Module, CLMM, which is a prototype that monitors each layer of the nodes locally and dynamically, calculates the average values of the metrics, compares these values with thresholds and handles the cross-layer messages of each node. The CLMM also has a routing module structure that can be extended to distribute the metrics to its neighbors.</p>

<p>Increasing capacity in wireless mesh networks can be achieved by using multiple channels and radios. By using different channels, two nodes can send packets at the same time without interfering with each other. To utilize diversity of available frequency, typically cards use channel-switching, which implies significant overhead in terms of delay. Assignment of which channels to use needs to be coupled with routing decisions as routing influences topology and traffic demands, which in turn impacts the channel assignment.</p><p>Routing algorithms for wireless mesh networks differ from routing algorithms that are used in wired networks. In wired networks, the number of hops is usually the only metric that matters. Wireless networks, on the other hand, must consider the quality of different links, as it is possible for a path with a larger amount of hops to be better than a path with fewer hops.</p><p>Typical routing protocols for wireless mesh networks such as Optimized Link State Routing (OLSR) use a single path to send packets from source to destination. This path is precomputed based on link state information received through control packets. The consideration of more information than hop-count in the routing process has shown to be beneficial as for example link quality and physical layer data rate determines the quality of the end-to-end path. In multi-channel mesh networks, also channel switching overhead and channel diversity need to be considered as a routing metric. However, a major drawback of current approaches is that a path is precomputed and used as long as the path is available and shows a good enough metric. As a result, short term variations on link quality or channel switching are not considered.</p><p>In this thesis, a new routing protocol is designed that provides a set of alternative forwarding candidates for each destination. To minimize delay (from both transmission and channel switching), a forwarding mechanism is developed to select one of the available forwarding candidates for each packet. The implementation was tested on an ARM based multi-radio platform, of which the results show that in a simple evaluation scenario the average delay was reduced by 22 % when compared to single path routing.</p>

Thesis (M.Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2009.

This thesis proposes a potential solution for future ubiquitous broadband wireless access networks, called a cellular wireless mesh network (CMESH), and investigates a number of its performance issues. A CMESH is organized in multi-radio, multi-channel, multi-rate and multi-hop radio cells. It can operate on abundant high radio frequencies, such as 5-50 GHz, and thus may satisfy the bandwidth requirements of future ubiquitous wireless applications.<p> Each CMESH cell has a single Internet-connected gateway and serves up to hundreds of mesh nodes within its coverage area. This thesis studies performance issues in a CMESH, focusing on cell capacity, expressed in terms of the max-min throughput. In addition to introducing the concept of a CMESH, this thesis makes the following contributions.<p> The first contribution is a new method for analyzing theoretical cell capacity. This new method is based on a new concept called Channel Transport Capacity (CTC), and derives new analytic expressions for capacity bounds for carrier-sense-based CMESH cells.<p> The second contribution is a new algorithm called the Maximum Channel Collision Time (MCCT) algorithm and an expression for the nominal capacity of CMESH cells. This thesis proves that the nominal cell capacity is achievable and is the exact cell capacity for small cells within the abstract models.<p> Finally, based on the MCCT algorithm, this thesis proposes a series of greedy algorithms for channel assignment and routing in CMESH cells. Simulation results show that these greedy algorithms can significantly improve the capacity of CMESH cells, compared with algorithms proposed by other researchers.

The use of 802.11-based wireless mesh networks (WMNs) as an alternative network backbone technology is growing rapidly. The primary advantages of this approach are ease of deployment and lower cost. However, such networks typically exhibit poor fairness properties, often starving nodes if they are too many hops distant from the gateway. Researchers have shown a growing interest in this problem in recent years. Many solutions proposed amount to some level of source rate control, either by policing directly at the source, or via TCP congestion control reacting to a gateway-enforced rate limit. However, there has been limited study on the effectiveness of source rate control. In this thesis we first demonstrate that source rate control can only partially solve the fairness issue in 802.11-based WMNs, with some routers experiencing an undesirable degree of unfairness, which we call structural unfairness. We then identify the four necessary factors that cause structural unfairness. If we can eliminate or reduce any one of these conditions, we can eliminate or ameliorate the unfairness problem. We first investigate two techniques to improve 802.11 MAC scheduling: fixing the contention window and packet spacing at every router node, both means achievable with commodity 802.11 hardware. We show that the combination of these mechanisms provides a significant gain in fairness. We also perform case studies using another three techniques, channel re-assignment, routing changes, and careful router placement, to remove or reduce other necessary conditions. We demonstrate that these techniques, whenever applicable, can eliminate the unfairness problem entirely at times, or at least improve the situation.

In this thesis we propose a multi-channel wireless network based on nodes that use multiple 802. 11 radio interfaces. The proposed system is singular, as it does not require new hardware or a new MAC, but instead leverages commodity 802. 11-based products. With this system, we target scenarios where the nodes are stationary and where their location can often be controlled. We evaluate the performance in this setup using an ad-hoc network approach whereby nodes generate as well as forward data. We also present and appraise a purely-wireless multi-channel infrastructure, which operates like the WLAN infrastructure-based networks in existence today, but without any fixed-line support. In such an infrastructure nodes dedicated for routing purposes provide wireless connectivity to users. We show that a multi-interface system provide significantly higher capacity in many scenarios. Our work puts forward various challenges, points to various anomalies in the operation of the 802. 11 MAC protocol, and shows the need to tackle unfairness issues. Our experiments demonstrate that the mere use of more dual-interface nodes does not necessarily create higher capacity. We also show that traffic differentiation significantly increases aggregate throughput in realistic scenarios. Finally, we provide an example of how simple channel-allocation algorithms in controlled random topologies can allow us to take advantage of a multi-interface system.

The use of 802.11-based wireless mesh networks (WMNs) as an alternative network backbone technology is growing rapidly. The primary advantages of this approach are ease of deployment and lower cost. However, such networks typically exhibit poor fairness properties, often starving nodes if they are too many hops distant from the gateway. Researchers have shown a growing interest in this problem in recent years. Many solutions proposed amount to some level of source rate control, either by policing directly at the source, or via TCP congestion control reacting to a gateway-enforced rate limit. However, there has been limited study on the effectiveness of source rate control. In this thesis we first demonstrate that source rate control can only partially solve the fairness issue in 802.11-based WMNs, with some routers experiencing an undesirable degree of unfairness, which we call structural unfairness. We then identify the four necessary factors that cause structural unfairness. If we can eliminate or reduce any one of these conditions, we can eliminate or ameliorate the unfairness problem. We first investigate two techniques to improve 802.11 MAC scheduling: fixing the contention window and packet spacing at every router node, both means achievable with commodity 802.11 hardware. We show that the combination of these mechanisms provides a significant gain in fairness. We also perform case studies using another three techniques, channel re-assignment, routing changes, and careful router placement, to remove or reduce other necessary conditions. We demonstrate that these techniques, whenever applicable, can eliminate the unfairness problem entirely at times, or at least improve the situation.