Wireless ad hoc networks have been emerged to support applications, in which it is required/desired to have wireless ommunications among a variety of devices without relying on any infrastructure or central managements. In ad hoc networks, wireless devices, simply called nodes, have limited transmission range. Therefore, each node can directly communicate with only those within its transmission range and requires other nodes to act as routers in order to communicate with out-of-range estinations. One of the fundamental operations in ad hoc networks is broadcasting, where a node sends a message to all other nodes in the network. This can be achieved through flooding, in which every node transmits the first copy of the received message. However, flooding can impose a large number of redundant transmissions, which can result in significant waste of constrained resources such as bandwidth and battery power. One of the contributions of this work is to propose efficient broadcast algorithms which can significantly reduce the number of redundant transmissions. We also consider some of the security issues of ad hoc networks. In particular, we carefully analyze the effect of the wormhole attack, which is one of the most severe threats against ad hoc networks. We also propose a countermeasure, which is an improvement over the existing timing-based solutions against the wormhole attack. Finally, in the last chapter, we propose novel point compression techniques which can be used in Elliptic Curve Cryptography (ECC). ECC can provide the same level of security as other public key cryptosystems (such as RSA) with substantially smaller key sizes. Smaller keys can result in smaller system parameters, bandwidth savings, faster implementations and lower power consumption. These advantages make ECC interesting for ad hoc networks with restricted devices. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

Testimonies of “wireless catching up with wireline” have begun. However, the nonstationary and hostile nature of the wireless channel impose the greatest threat to reliable data transmission over wireless links. The performance of a digital modulation scheme is degraded by many transmission impairments including fading, delay spread, co-channel interference and noise. Two powerful techniques for improving the quality of service over the wireless network are investigated: diversity reception and adaptive error control schemes. Owing to the growing interest in wireless communications, the importance of exact theoretical analysis of such systems cannot be understated. In light of these considerations, this dissertation focuses on accurate and efficient analysis of wireless digital communication systems in multiuser and multipath fading environments. The evaluation of error probabilities in digital communication systems is often amenable to calculating a generic error probability of the form Pr {X ≤ 0}, where X is a random variable whose probability distribution is known. We advocate a simple numerical approach based on the Fourier or Laplace inversion formulas and Gauss-Chebychev quadratures (GCQ) for computing this error probability. Using this result, and by formulating the outage probability of cellular mobile radio networks in the framework of statistical decision theory, we can unify the outage performance analysis for cellular mobile radio systems in generalized fading channels without imposing any restrictions on the desired signal and interferers statistics. Next, we develop two unified analytical frameworks for evaluating the bit or symbol error probability (SER) of a broad class of coherent, differentially coherent and noncoherent digital communication systems with diversity reception in generalized fading channels. The exact SER is mostly expressed in terms of a single finite-range integral, and in some cases in the form of double finite-range integrals. Virtually “exact” closed-form expressions (in terms of a rapidly converging series) are also derived. This offers a convenient method to perform a comprehensive study of all common diversity combining techniques (maximal-ratio combining (MRC), equal-gain combining (EGC), selection combining (SDC) and switched combining (SWC)) with different modulation formats in a myriad of fading scenarios. In particular, our unified approach based on characteristic function (CHF) method allows us to unify the above problem in a single common framework. Nevertheless, the moment generating function (MGF) method often yields a more concise solution than the CHF approach in the analysis of MRC, SDC and SWC diversity systems. Subsequently, we examine the performance of a maximum amplitude selection diversity (MA/SD) rake receiver configuration in indoor wireless channels. The proposed low-complexity receiver structure is practically appealing because of its simplicity as well as its ability to operate effectively even at high signalling rates. We have also devised a robust packet combining mechanism to enhance the throughput and delay performance of spread-spectrum radio networks without incurring a substantial penalty in receiver complexity. A simple indirect method to estimate the channel state condition for successful implementation of a self-reconfigurable automatic repeat-request (ARQ) system, such as mixed-mode ARQ protocol or adaptive packet length strategy in a slowly varying mobile radio environment is also studied. / Graduate

Ultra-Wideband (UWB) wireless communication systems employ large bandwidths and low transmitted power spectral densities, and are suitable for operation as underlay systems which reuse allocated spectrum. The subject of this dissertation is Multiband Orthogonal Frequency Division Multiplexing (MB-OFDM) UWB for high data-rate communication. We address four main questions: (1) What are the theoretical performance limits and practical system performance of MB-OFDM? (2) What extensions can be used to increase the system power efficiency and range? (3) Is it possible to estimate the system error rate without resorting to time-consuming simulations? and (4) What is the effect of interference from narrowband systems on MB-OFDM, and can this interference be mitigated? As for questions 1 and 2, we investigate the MB-OFDM performance, and propose system enhancements consisting of advanced error correcting codes and OFDM bit-loading. Our methodology includes the development of information-theoretic performance measures and the comparison of these measures with performance results for MB-OFDM and our proposed extensions, which improve the power efficiency by over 6 dB at a data rate of 480 Mbps. To address question 3, we develop novel analytical methods for bit error rate (BER) estimation for a general class of coded multicarrier systems (of which MB-OFDM is one example) operating over quasi-static fading channels. One method calculates system performance for each channel realization. The other method assumes Rayleigh distributed subcarrier channel gains, and leads directly to the average BER. Both methods are also able to account for sum-of-tones narrowband interference. As for question 4, we first present an exact analysis of the uncoded BER of MB-OFDM in the presence of interference from incumbent systems such as IEEE 802.16 ("WiMAX"). We also present a Gaussian approximation for WiMAX interference, and establish its accuracy through comparison with exact analysis and simulations. We then propose a two-stage interference mitigation technique for coded MB-OFDM, consisting of interference estimation during silent periods, followed by metric weighting during decoding, which provides substantial gains in performance in return for modest increases in complexity, and without requiring any modifications to the MB-OFDM transmitter. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

Cognitive Radio (CR) is considered to be a novel approach to improve the underutilization of precious radio resources by exploiting the unused licensed spectrum in dynamically changing environments. Designing efficient resource allocation algorithms for dynamic spectrum sharing and for power allocation in OFDM-CR networks is still a challenging problem. In this thesis, we specifically deal with these two problems. Dynamic spectrum sharing for the unlicensed secondary users (SU)s with device coordination could minimize the wastage of the spectrum. But this is a feasible approach only if the network considers the fairness criterion. We study the dynamic spectrum sharing problem for device coordinated cognitive radio networks with respect to fairness. We propose a simple modified proportional fair algorithm for a dynamic spectrum sharing scenario with two constraints, time and utility. Utility is measured by the amount of data processed and time is measured as the duration of a slot. This algorithm could result in variable or fixed length time slots. We will discuss the several controls possible on the algorithm and the possible extension of this algorithm for multicarrier OFDM based CR systems. Traditional water-filling algorithm is inefficient for OFDM-CR networks due to the interaction with primary users (PU)s. We consider reliability/availability of subcarriers or primary user activity for power allocation. We model this aspect mathematically with a risk-return model by defining a general rate loss function. We then propose optimal and suboptimal algorithms to allocate power under a fixed power budget for such a system with linear rate loss. These algorithms as we will see allocate more power to more reliable subcarriers in a water-filling fashion with different water levels. We compare the performance of these algorithms for our model with respect to water-filling solutions. Simulations show that suboptimal schemes perform closer to optimal scheme although they could be implemented with same complexity as water-filling algorithm. We discuss the linearity of loss function and guidelines to choose its coefficients by obtaining upper bounds on them. Finally we extend this model for interference-limited OFDM-CR systems. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

Various wireless networks are widely deployed world wide. Current technologies employed in these networks vary widely in terms of bandwidths, latencies, frequencies, and media access methods. Most existing wireless network technologies can be divided into two categories: those that provide a low-bandwidth service over a wide geographic area, for example UMTS, and those that provide a high bandwidth service over a narrow geographic area, for example 802.11. Although it would be desirable to provide a high- bandwidth service over a wide coverage region to mobile users all the time, no single wireless network technology simultaneously satisfies these require- ments. Wireless Overlay Networks, a hierarchical structure of wireless personal area, local area, and wide area data networks, is considered as an efficient and scalable way to solve this problem. Due to the wide deployment of UMTS and 802.11 WLAN, this study attempts to combine them to implement the concept of Wireless Overlay Net- works. Furthermore, the information transmitted over this Wireless Overlay Networks is protected in terms of authentication, integrity and confidentiality. To achieve this goal, this study aims to combine GPRS, Mobile IP and IPSec to propose a framework for secure mobility in Wireless Overlay Networks. The framework is developed in three steps: Firstly, this study addresses the problem of combining GPRS and Mo- bile IP, so that GPRS users are provided with Mobile IP service. This results in presenting a uniform Mobile IP interface to peers regardless of whether mobile users use UMTS or 802.11 WLAN. Secondly, this study discovers the existing problem when combining Mobile IP and IPSec, and proposes a Dual Home Agent Architecture to achieve secure mobility. Finally, based on the output of the previous two steps, a complete framework is proposed, which achieves secure mobility in Wireless Overlay Networks, specifically, in UMTS and 802.11 WLAN. The framework also implements seamless handover when mobile users switch between UMTS and 802.11. This results in UMTS and 802.11 WLAN looking like a single network when participating in this framework, and presents seamless and secure mobility.

No description available.

The coverage and energy issues are the fundamental problems which prevent the development of wireless sensor networks. In order to accurately evaluate the monitoring quality (coverage), one needs to model the interactive of sensors, phenomenons and the environment. Furthermore, in collaborative with scheduling algorithm and computer optimization, protocols can improve the overall monitoring quality and prolong the lifetime of network. This thesis is an investigation of coverage problem and its relative applications in the wireless sensor networks. We first discuss the realistic of current boolean sensing model and propose an irregular sensing model used to determine the coverage in the area with obstacles. We then investigate a joint problem of maintaining the monitoring quality and extending the lifetime of network by using scheduling schemes. Since the scheduling problem is NP hard, genetic algorithm and Markov decision process are used to determine an achievable optimal result for the joint problem of coverage-preserving and lifetime-prolong. In order to avoid the cost of centralized or distributed scheduling algorithms, a localized coverage-preserving scheduling algorithm is proposed by exploring the construction process of Voronoi diagram. Besides exploring the coverage characteristic in a static wireless sensor network, we investigate the coverage problem when the mobile elements are introduced into network. We consider the single-hop mobile data gathering problem with the energy efficiency and data freshness concerns in a wireless sensor network where the connectivity cannot be maintained. We first investigate the upper/lower bound of the covering time for a single collector to cover the monitoring area. Through our investigation we show that for a bounded rectangle area a hexagon walk could explore the area more efficiently than a random walk when the edges of area are known. We then propose a virtual force mobile model (VFM) in which the energy consumption for data transmission is modeled as a virtual elastic force and used to guide of mobile collectors to move to optimal positions for energy saving.

In today’s era of the Internet of Things, it is crucial to study the real-time dependencies of the web, its failures and time delays. Today, smart grids, sensible homes, wise water networks, intelligent transportation, infrastructure systems that connect our world over are developing fast. The shared vision of such systems is typically associated with one single conception Internet of Things (IoT), where through the deployment of sensors, the entire physical infrastructure is firmly fastened with information and communication technologies; where intelligent observation and management is achieved via the usage of networked embedded devices. The performance of a real-time control depends not only on the reliability of the hardware and software used but also on the time delay in estimating the output, because of the effects of computing time delay on the control system performance. For a given fixed sampling interval, the delay and loss issues are the consequences of computing time delay. The delay problem occurs when the computing time delay is non-zero but smaller than the sampling interval, while the loss problem occurs when the computing time delay is greater than, or equal to, the sampling interval, i.e., loss of the control output. These two queries are analyzed as a means of evaluating real-time control systems. First, a general analysis of the effects of computing time delay is presented along with necessary conditions for system stability. In this thesis, we will focus on the experimental study of the closed loop control system in the internet of things to determine the cycle time constraints in case of link failure.

Video surveillance systems have been commonly used in transportation systems to support traffic monitoring, speed estimation, and incident detection. However, there are several challenges in developing and deploying such systems, including high development and maintenance costs, bandwidth bottleneck for long range link, and lack of advanced analytics. In this thesis, I leverage current wireless, video camera, and analytics technologies, and present a wireless traffic monitoring system. I first present an overview of the system. Then I describe the site investigation and several test links with different hardware/software configurations to demonstrate the effectiveness of the system. The system development process was documented to provide guidelines for future development. Furthermore, I propose a novel speed-estimation analytics algorithm that takes into consideration roads with slope angles. I prove the correctness of the algorithm theoretically, and validate the effectiveness of the algorithm experimentally. The experimental results on both synthetic and real dataset show that the algorithm is more accurate than the baseline algorithm 80% of the time. On average the accuracy improvement of speed estimation is over 3.7% even for very small slope angles.

The first of the main objectives of this work was to examine and study the different types of attacks on wireless networks. This work is focused on the most commonly occurring types of attacks such as WEP/WPA/WPA2 cracking, a Man in the Middle attack (MIM), Dictionary attacks, MAC spoofing and finally Denial of Service attacks. Description of individual attacks is also accompanied by detailed instructions on how to carry out these attacks on the Windows platform. It is described how to detect various attacks and identified. It is then implemented software that is able to identify possible risk of selected types of attacks. This software belongs to a group of wireless intrusion prevention system (WIDS). It focuses on attacks WEP/WPA/WPA2 type of cracking, Dictionary attacks and MAC spoofing. For the implementation of defense against attack by a Man in the Middle (MIM) and Denial of Service attack would need special monitoring equipment.