The recent advances in mobile computing devices and wireless networking produced the technical platform for multimedia services over thin mobile devices. Nowadays, we are witnessing an important growth in applications using thin mobile devices, such as social networks, virtual walkthrough, media streaming, and augmented reality (AR), just to mention a few. Most of these applications are based on the client-server architecture, however several studies showed that the client-server architecture suffers from various issues, such as the server bottleneck, latency and the lack of scalability. This led most of the systems to switch to the peer-to-peer (P2P)-like environment for its scalability and potential cost saving. P2P multimedia streaming over thin mobile devices-based classes of applications has known a significant growth during the last years. Although P2P video streaming over thin mobile devices received a great deal of attention, the application of 3D streaming over mobile devices was challenging mainly due to the limited mobile resources and capabilities, as well as the wireless medium limitations. Having 3D streaming over Mobile Ad hoc Networks (MANET) is considered more challenging given that the 3D streaming-based system has to deal with a dynamic environment resulting from nodes mobility, which may lead to route breakages and connection loss. Therefore, one of the major difficulties in 3D streaming over MANET is related to the supplying partner's strategy that aims at determining the most suitable source holding the required 3D data to stream it quickly and efficiently to the requesters. In this thesis, we propose our P2P based 3D streaming system which we refer to as MOSAIC as well as a suite of supplying partner strategy protocols for P2P 3D streaming over thin mobile devices. Our proposed suite of protocols selects the potential sources that have the relevant 3D data, based on a set of criteria such as the source location, the mobile device's available resources as well as its residual energy. We also proposed a multihop supplying partner selection protocol that takes into account the signal strength and the nodes mobility when streaming the relevant 3D data. The performance evaluation obtained to evaluate our MOSAIC system as well as our suite of protocols using an extensive set of NS2 simulation experiments, is then reported.

Master of Philosophy / Wireless technology is experiencing spectacular developments, due to the emergence of interactive and digital multimedia applications as well as rapid advances in the highly integrated systems. For the next-generation mobile communication systems, one can expect wireless connectivity between any devices at any time and anywhere with a range of multimedia contents. A key requirement in such systems is the availability of high-speed and robust communication links. Unfortunately, communications over wireless channels inherently suffer from a number of fundamental physical limitations, such as multipath fading, scarce radio spectrum, and limited battery power supply for mobile devices. Cooperative diversity (CD) technology is a promising solution for future wireless communication systems to achieve broader coverage and to mitigate wireless channels’ impairments without the need to use high power at the transmitter. In general, cooperative relaying systems have a source node multicasting a message to a number of cooperative relays, which in turn resend a processed version message to an intended destination node. The destination node combines the signal received from the relays, and takes into account the source’s original signal to decode the message. The CD communication systems exploit two fundamental features of the wireless medium: its broadcast nature and its ability to achieve diversity through independent channels. A variety of relaying protocols have been considered and utilized in cooperative wireless networks. Amplify and forward (AAF) and decode and forward (DAF) are two popular protocols, frequently used in the cooperative systems. In the AAF mode, the relay amplifies the received signal prior to retransmission. In the DAF mode, the relay fully decodes the received signal, re-encodes and forwards it to the destination. Due to the retransmission without decoding, AAF has the shortcoming that noise accumulated in the received signal is amplified at the transmission. DAF suffers from decoding errors that can lead to severe error propagation. To further enhance the quality of service (QoS) of CD communication systems, hybrid Automatic Repeat-reQuest (HARQ) protocols have been proposed. Thus, if the destination requires an ARQ retransmission, it could come from one of relays rather than the source node. This thesis proposes an improved HARQ scheme with an adaptive relaying protocol (ARP). Focusing on the HARQ as a central theme, we start by introducing the concept of ARP. Then we use it as the basis for designing three types of HARQ schemes, denoted by HARQ I-ARP, HARQ II-ARP and HARQ III-ARP. We describe the relaying protocols, (both AAF and DAF), and their operations, including channel access between the source and relay, the feedback scheme, and the combining methods at the receivers. To investigate the benefits of the proposed HARQ scheme, we analyze its frame error rate (FER) and throughput performance over a quasi-static fading channel. We can compare these with the reference methods, HARQ with AAF (HARQ-AAF) and HARQ with perfect distributed turbo codes (DTC), for which correct decoding is always assumed at the relay (HARQ-perfect DTC). It is shown that the proposed HARQ-ARP scheme can always performs better than the HARQ-AAF scheme. As the signal-to-noise ratio (SNR) of the channel between the source and relay increases, the performance of the proposed HARQ-ARP scheme approaches that of the HARQ-perfect DTC scheme.

Master of Philosophy / Wireless technology is experiencing spectacular developments, due to the emergence of interactive and digital multimedia applications as well as rapid advances in the highly integrated systems. For the next-generation mobile communication systems, one can expect wireless connectivity between any devices at any time and anywhere with a range of multimedia contents. A key requirement in such systems is the availability of high-speed and robust communication links. Unfortunately, communications over wireless channels inherently suffer from a number of fundamental physical limitations, such as multipath fading, scarce radio spectrum, and limited battery power supply for mobile devices. Cooperative diversity (CD) technology is a promising solution for future wireless communication systems to achieve broader coverage and to mitigate wireless channels’ impairments without the need to use high power at the transmitter. In general, cooperative relaying systems have a source node multicasting a message to a number of cooperative relays, which in turn resend a processed version message to an intended destination node. The destination node combines the signal received from the relays, and takes into account the source’s original signal to decode the message. The CD communication systems exploit two fundamental features of the wireless medium: its broadcast nature and its ability to achieve diversity through independent channels. A variety of relaying protocols have been considered and utilized in cooperative wireless networks. Amplify and forward (AAF) and decode and forward (DAF) are two popular protocols, frequently used in the cooperative systems. In the AAF mode, the relay amplifies the received signal prior to retransmission. In the DAF mode, the relay fully decodes the received signal, re-encodes and forwards it to the destination. Due to the retransmission without decoding, AAF has the shortcoming that noise accumulated in the received signal is amplified at the transmission. DAF suffers from decoding errors that can lead to severe error propagation. To further enhance the quality of service (QoS) of CD communication systems, hybrid Automatic Repeat-reQuest (HARQ) protocols have been proposed. Thus, if the destination requires an ARQ retransmission, it could come from one of relays rather than the source node. This thesis proposes an improved HARQ scheme with an adaptive relaying protocol (ARP). Focusing on the HARQ as a central theme, we start by introducing the concept of ARP. Then we use it as the basis for designing three types of HARQ schemes, denoted by HARQ I-ARP, HARQ II-ARP and HARQ III-ARP. We describe the relaying protocols, (both AAF and DAF), and their operations, including channel access between the source and relay, the feedback scheme, and the combining methods at the receivers. To investigate the benefits of the proposed HARQ scheme, we analyze its frame error rate (FER) and throughput performance over a quasi-static fading channel. We can compare these with the reference methods, HARQ with AAF (HARQ-AAF) and HARQ with perfect distributed turbo codes (DTC), for which correct decoding is always assumed at the relay (HARQ-perfect DTC). It is shown that the proposed HARQ-ARP scheme can always performs better than the HARQ-AAF scheme. As the signal-to-noise ratio (SNR) of the channel between the source and relay increases, the performance of the proposed HARQ-ARP scheme approaches that of the HARQ-perfect DTC scheme.

We propose a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our design is rooted in the theory of network coding. In contrast to prior work on network coding, which is mainly theoretical and focuses on multicast traffic, ours is practical and solves the common case of unicast traffic. We present the first implementation of network coding in a wireless network. Our system introduces a coding layer between the IP and MAC layers. It works with UDP and TCP traffic, and hence seamlessly integrates with existing applications. We evaluate our design on a 34-node wireless testbed and show that it delivers a 3-4x increase in the throughput ofwireless mesh networks.

abstract: Majority of the Sensor networks consist of low-cost autonomously powered devices, and are used to collect data in physical world. Today's sensor network deployments are mostly application specific & owned by a particular entity. Because of this application specific nature & the ownership boundaries, this modus operandi hinders large scale sensing & overall network operational capacity. The main goal of this research work is to create a mechanism to dynamically form personal area networks based on mote class devices spanning ownership boundaries. When coupled with an overlay based control system, this architecture can be conveniently used by a remote client to dynamically create sensor networks (personal area network based) even when the client does not own a network. The nodes here are "borrowed" from existing host networks & the application related to the newly formed network will co-exist with the native applications thanks to concurrency. The result allows users to embed a single collection tree onto spatially distant networks as if they were within communication range. This implementation consists of core operating system & various other external components that support injection maintenance & dissolution sensor network applications at client's request. A large object data dissemination protocol was designed for reliable application injection. The ability of this system to remotely reconfigure a network is useful given the high failure rate of real-world sensor network deployments. Collaborative sensing, various physical phenomenon monitoring also be considered as applications of this architecture. / Dissertation/Thesis / M.S. Computer Science 2013

The recent advances in mobile computing devices and wireless networking produced the technical platform for multimedia services over thin mobile devices. Nowadays, we are witnessing an important growth in applications using thin mobile devices, such as social networks, virtual walkthrough, media streaming, and augmented reality (AR), just to mention a few. Most of these applications are based on the client-server architecture, however several studies showed that the client-server architecture suffers from various issues, such as the server bottleneck, latency and the lack of scalability. This led most of the systems to switch to the peer-to-peer (P2P)-like environment for its scalability and potential cost saving. P2P multimedia streaming over thin mobile devices-based classes of applications has known a significant growth during the last years. Although P2P video streaming over thin mobile devices received a great deal of attention, the application of 3D streaming over mobile devices was challenging mainly due to the limited mobile resources and capabilities, as well as the wireless medium limitations. Having 3D streaming over Mobile Ad hoc Networks (MANET) is considered more challenging given that the 3D streaming-based system has to deal with a dynamic environment resulting from nodes mobility, which may lead to route breakages and connection loss. Therefore, one of the major difficulties in 3D streaming over MANET is related to the supplying partner's strategy that aims at determining the most suitable source holding the required 3D data to stream it quickly and efficiently to the requesters. In this thesis, we propose our P2P based 3D streaming system which we refer to as MOSAIC as well as a suite of supplying partner strategy protocols for P2P 3D streaming over thin mobile devices. Our proposed suite of protocols selects the potential sources that have the relevant 3D data, based on a set of criteria such as the source location, the mobile device's available resources as well as its residual energy. We also proposed a multihop supplying partner selection protocol that takes into account the signal strength and the nodes mobility when streaming the relevant 3D data. The performance evaluation obtained to evaluate our MOSAIC system as well as our suite of protocols using an extensive set of NS2 simulation experiments, is then reported.

In this dissertation, we discuss various aspects of scheduling and resource allocation in multi-user wireless systems. This work starts from how to utilize advanced physical-layer technology to improve the system performance in a multi-user environment. We show that by using superposition coding (SPC) and successive interference cancellation, the system performance can be greatly improved with utility-based scheduling. Several observations are made as the design guideline for such system. Scheduling algorithms are designed for a system with hierarchical modulation which is a practical implementation of SPC. However, when the utility-based scheduling is designed, it is based on the assumption that the system is saturated, {\em i.e.}, users in the system always have data to transmit. It is pointed out in the literature that in a system with stochastic traffic, even if the arrival rate lies inside the capacity region, the system in terms of queue might not be stable with the utility-based scheduling. Motivated by this, we have studied the stability region of a general utility-based scheduling in a multi-user system with stochastic traffic. We show that the stability region is generally less than the capacity region, depends on how to interpret an intermediate control variable, and the resultant stability region may be even non-convex and exhibits undesirable properties which should be avoided. As the utility-based scheduling cannot achieve throughput-optimal, we turn our attentions to the throughput-optimal scheduling algorithms, whose stability region is identical to the capacity region. The limiting properties of an overloaded wireless system with throughput-optimal scheduling algorithms are studied. The results show that the queue length is unstable however the scheduling function of the queue length is stable, and the average throughput of the system converges. Finally we study how to schedule users in a multi-user wireless system with information-theoretic security support, which is focused on the secrecy outage probability. The problem is essentially about how to schedule users, and allocate resources to stabilize the system and minimize the secrecy outage probability. We show that there is a tradeoff between the arrival rate of the traffic and the secrecy outage probability. The relative channel condition of the eavesdropper also plays an important role to the secrecy outage probability. In summary, we showed utility-based scheduling using SPC can improve the system performance greatly, but the utility-based scheduling has limitations: the stability region might not have desired properties. On the contrary throughput-optimal scheduling has its own drawbacks: the traffic cannot be handled properly if the system is overloaded. The further study on the secrecy outage probability gives guideline on how to design a scheduler in a system with information-theoretic security support. / Graduate

Submitted in accordance with the requirements for the degree of Master of Arts in Communication Science at the University of Zululand, South Africa, 2012. / It is everyone’s dream to have network connectivity all the time. This dream can only be realised provided there are feasible solutions that are put in place for the next generation of wireless works. Wireless Mesh Networking (WMN) is therefore seen as a solution to the next generation of wireless networks because of the fact that WMNs configures itself and it is also self healing. A new standard for WMNs called the IEEE 802.11s is still under development. The protocol that is used by the IEEE 802.11s for routing is called Hybrid Wireless Mesh Protocol (HWMP). The main purpose of HWMP is to perform routing at layer-2 of the OSI model also referred to as the data link layer (DLL). Layer-2 routing is also referred to as the mesh path selection and forwarding. Devices that are compliant to the IEEE 802.11s standard will be able to use this path selection protocol. Devices that are manufactured by different vendors will therefore be interoperable. Even though significant efforts have gone into improving the performance of HWMP, the protocol still faces a lot of limitations and the most limiting factor is the small or restricted energy of the batteries in a wireless network. This is because of the assumption that mesh nodes that are deployed in urban areas tend to have no energy constraints while WMN nodes deployed in rural faces serious energy challenges. The latter relies on batteries and not on electricity supply which powers the WMN nodes in urban areas. This work, therefore, explores further the current trends towards maximising the network lifetime for the energy constrained networks. Hence the goal of this study is to design a path selection algorithm that is energyaware and optimising for the IEEE 802.11s based HWMP. The main idea is that paths with enough energy for transmission must be selected when transmitting packets in the network. Therefore, a simulation using NS-2 was carried out to assess the network performance of the proposed EAPM metric with the other metrics that have been analysed in literature including ETX. ETX has been used in WMNs but was not developed specifically for mesh. In conclusion, EAPM conserves more energy than the Multimetric, airtime link metric and lastly ETX. The simulation experiments show that EAPM optimises the energy used in the network and as a result EAPM has a prolonged network lifespan when comparing it to the rest of the metrics evaluated in this study. The results also revealed that the newly proposed EAPM exhibits superior performance characteristics even with regard to issues like end-to-end delay and packet delivery ratio. / CSIR Meraka Institute

In this dissertation, we study an important problem of security in wireless networks. We study different attacks and defense strategies in general and more specifically jamming attacks. We begin the dissertation by providing a tutorial introducing the operations research community to the various types of attacks and defense strategies in wireless networks. In this tutorial, we give examples of mathematical programming models to model jamming attacks and defense against jamming attacks in wireless networks. Later we provide a comprehensive taxonomic classification of the various types of jamming attacks and defense against jamming attacks. The classification scheme will provide a one stop location for future researchers on various jamming attack and defense strategies studied in literature. This classification scheme also highlights the areas of research in jamming attack and defense against jamming attacks which have received less attention and could be a good area of focus for future research. In the next chapter, we provide a bi-level mathematical programming model to study jamming attack and defense strategy. We solve this using a game-theoretic approach and also study the impact of power level, location of jamming device, and the number of transmission channels available to transmit data on the attack and defense against jamming attacks. We show that by increasing the number of jamming devices the throughput of the network drops by at least 7%. Finally we study a special type of jamming attack, flow-jamming attack. We provide a mathematical programming model to solve the location of jamming devices to increase the impact of flow-jamming attacks on wireless networks. We provide a Benders decomposition algorithm along with some acceleration techniques to solve large problem instances in reasonable amount of time. We draw some insights about the impact of power, location and size of the network on the impact of flow-jamming attacks in wireless networks.

No / The complementary features of various wireless access technologies in heterogeneous wireless networks make it attractive and challenging to offer users an always best connected (ABC) service. To achieve this goal, the dynamic network selection has received many research efforts. However, most of the existing work have focused on the network layer performance and ignored the consideration of energy efficiency. To fill this gap, an energy-efficient network selection scheme is proposed in this paper to improve the energy efficiency of wireless network access in heterogeneous wireless networks environment. The dynamics of network selection is formulated as the process of an evolutionary game. The users in different service areas complete for the data rate from different wireless networks (i.e., WMAN, cellular networks, and WLAN), and the network selection made by a user is based on its payoff that is a function of the data rate and power consumption. The addressed problem is then modelled by the replicator dynamics. Simulation results are presented to demonstrate the significant performance improvement compared to the existing scheme.