No description available.

In multiuser wireless networks, the base stations (BSs) rely on the channel state information (CSI) of the users to in order to perform user scheduling and downlink transmission. While the downlink channels can be easily estimated at all user terminals via a single broadcast, several key challenges are faced during uplink (feedback) transmission. Firstly, the noisy and fading feedback channels are usually unknown at the base station, and therefore, channel training is usually required from all users. Secondly, the amount of air-time required for feedback transmission grows linearly with the number of users. This domination of the network resources by feedback information leads to increased scheduling delay and outdated CSI at the BS. In this thesis, we tackle the above challenges and propose feedback reduction algorithms based on the theory of compressive sensing (CS). The proposed algorithms encompass both single and dual hop wireless networks, and; i) permit the BS to obtain CSI with acceptable recovery guarantees under substantially reduced feedback overhead, ii) are agnostic to the statistics of the feedback channels, and iii) utilize the apriori statistics of the additive noise to identify strong users. Numerical results show that the proposed algorithms are able to reduce the feedback overhead, improve detection at the BS, and achieve a sum-rate close to that obtained by noiseless dedicated feedback algorithms.

Broadcasting is an essential and effective data propagation mechanism with several important applications, such as route discovery, address resolution and many other network services. Though data broadcasting has many advantages, it can also cause a high degree of contention, collision and congestion, leading to what is known as ¿broadcast storm problems¿. Broadcasting has traditionally been based on the flooding protocol, which simply overflows the network with a high number of rebroadcast messages until these reach all the network nodes. A good probabilistic broadcast protocol can achieve high saved rebroadcast (SRB), low collision and a lower number of relays. When a node is in a sparse region of the network, rebroadcasting is relatively more important while the potential redundancy of rebroadcast is low because there are few neighbours which might rebroadcast the packet unnecessarily. Further, in such a situation, contention over the wireless medium resulting from Redundant broadcasts is not as serious as in scenarios with medium or high density node populations. This research proposes a dynamic probabilistic approach that dynamically fine-tunes the rebroadcast probability according to the number of neighbouring nodes distributed in the ad-hoc network for routing request packets (RREQs) without requiring the assistance of distance measurements or location-determination devices. The main goal of this approach is to reduce the number of rebroadcast packets and collisions in the network. The performance of the proposed approach is investigated and compared with simple AODV, fixed-probabilistic and adjusted-probabilistic flooding [1] schemes using the GloMoSim network simulator and a number of important MANET parameters, including node speed, traffic load and node density under a Random Waypoint (RWP) mobility model. Performance results reveal that the proposed approach is able to achieve higher SRB and less collision as well as a lower number of relays than fixed probabilistic, simple AODV and adjusted-probabilistic flooding. In this research, extensive simulation experiments have been conducted in order to study and analyse the proposed dynamic probabilistic approach under different mobility models. The mobility model is designed to describe the movement pattern of mobile customers, and how their position, velocity and acceleration change over time. In this study, a new enhanced dynamic probabilistic flooding scheme is presented. The rebroadcast probability p will be calculated dynamically and the rebroadcasting decision will be based on the average number of nodes in the ad-hoc networks. The performance of the new enhanced algorithm is evaluated and compared to the simple AODV, fixed-probabilistic, adjusted-probabilistic and dynamic-probabilistic flooding schemes. It is demonstrated that the new algorithm has superior performance characteristics in terms of collision, relays and SRB. Finally, the proposed schemes are tested and evaluated through a set of experiments under different mobility models to demonstrate the relative merits and capabilities of these schemes.

Modern power substations continue to use hardware that is dated and resistant to modernization. This document discusses the basics of substations, identifies their weaknesses, and suggests a method of improvement. This suggestion implements a centralized protection and control system to make the overall system more robust and flexible to the ever changing power system landscape. / Master of Science

No description available.

In this thesis, we consider a cooperative relay-assisted communication system that uses rateless codes. When multiple relays are present, the relay with the highest channel gain to the source is the first to successfully decode a message from the source and forward it to the destination. Thus, the unique properties of rateless codes ensure that both rate adaptation and relay selection occur without the transmitting source or relays acquiring instantaneous channel knowledge. We show that in such cooperative systems, buffering messages at relays significantly increases throughput. We develop a novel analysis of these systems that combines the communication-theoretic aspects of cooperation over fading channels with the queuing-theoretic aspects associated with buffering. Closed-form expressions are derived for the throughput and end-to-end delay for the general case in which the channels between various nodes are not statistically identical. Results are also shown for the benchmark system that does not buffer messages. Though relay selection combined with buffering of messages at the relays substantially increases the throughput of a cooperative network, it also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In order to overcome this, we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a message from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the message is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times. Next we combine the single relay selection scheme at the source with physical layer power control at the relays (due to the diversity provided by the rateless codes, power control at the source is not needed). We derive an optimal power control policy that minimizes the relay to destination transmission time. Due to its computational and implementation complexity, we develop another heuristic easily implementable near optimal policy. In this policy, power allocated turns out to be inversely proportional to the square root of channel gain. We also see that this policy performs better than the channel inversion policy. Our power control solution substantially decreases the mean end-to-end delays with a marginal increase in throughput also. Finally, we combine bit dropping with power control at the relays which further improves the system performance.

Master of Science / Department of Electrical and Computer Engineering / Noel Schulz / Transmission networks are an important part of an electric power system. They help transfer power from the point of generation (power plants) to the substation. In order to minimize losses during power transfer, the lines are operated at high voltages. The high voltage lines not only have a high power transmission capacity, but they are also prone to faults of larger magnitudes. Thus the occurrence of such faults results in a need for the faults to be cleared quickly in order to limit damage caused to the system. Hence, relays are installed at the Buses to provide protection to the lines. Transmission lines in a power system are most commonly protected by distance relays that use directional comparison schemes. However, due to the simplicity of line differential schemes, there has been an increase in the use of differential relays for complex networks. Moreover, since the relays require only current as the operating parameter, their settings can be determined easily. This report discusses the design of a line current differential protection scheme for a transmission line using SEL 311L relays. The relay settings have been determined and then tested for seven fault scenarios, three internal fault points and four external fault points. To set and test the relays, AcSELerator Quickset, SEL 5030 and PowerWorld programs have been used. Real life power system is simulated with the help of SEL AMS (Adaptive Multichannel Source) that acts as the source to provide the required data to the relays. The relays trip and open the breaker contacts for an internal fault. During an external fault, the relays do not trip and the breaker contacts remain closed. The response of the relays in case of communication failures has been discussed.

Published Article / A company in South Africa is a three-phase induction motor protection relay manufacturer. The function of the protection relay is to capture running data, to provide protection against possible damage, to control an electric motor and to communicate this data to the System Control and Data Acquisition (SCADA) system in a control room. In the case of remote sites e.g. a pump station, the protection relays are used as standalone units. The protection relays are equipped with communication facilities to be used in an instrumentation environment. If a trip occurs or settings need to be changed a technician has to visit the remote site and address the problem. The ideal cost and time effective solution is to perform these tasks remotely via a reliable wireless network. A study was conducted to ascertain the viability of using the standard GSM cellular networks in South Africa to effectively control electric motors and to communicate with the Motor Protection Relays (MPRs) controlling the electric motors in order to determine the status of a motor, settings of the motor, trips that occurred and time of occurrence. It was shown that a node controller could be used to store all the data from various electric motors at a single location. It was also shown that the data from the different electric motors could be analysed at the node controller and that communication can then be initiated from the controller to a responsible person via the GSM network. It was further illustrated that, by making use of the GSM networks in South Africa together with the short message service (SMS), communication and control can be effectively established. SMSs proved to be a reliable means of communication between cellular phones, an embedded network and MPRs. It was shown that software protocols, although slower in communication speed, proved to be reliable and effective for the purpose of transferring information between the node controller and the motor protection relays connected to the electric motors.

Spam emails are flooding the Internet. Research to prevent spam is an ongoing concern. SMTP traffic was collected from different sources in real networks and analyzed to determine the difference regarding SMTP traffic characteristics of legitimate email clients, legitimate email servers and spam relays. It is found that SMTP traffic from legitimate sites and non-legitimate sites are different and could be distinguished from each other. Some methods, which are based on analyzing SMTP traffic characteristics, were purposed to identify spam relays in the network in this thesis. An autonomous combination system, in which machine learning technologies were employed, was developed to identify spam relays in this thesis. This system identifies spam relays in real time before spam emails get to an end user by using SMTP traffic characteristics never involving email real content. A series of tests were conducted to evaluate the performance of this system. And results show that the system can identify spam relays with a high spam relay detection rate and an acceptable ratio of false positive errors.

Over time, wireless technology advancements in the field of communications have been attracting every individual to turn into a wireless user. To accommodate the increasing number of users and to avoid the problem of spectrum scarcity, the concept of Cognitive Radio Network (CRN) has been developed. Cognitive Radio (CR) is an intelligent radio which efficiently detects and allocates the spectrums of primary licensed users (PUs) to the secondary unlicensed users (SUs). The SUs can utilize these spectrums as long as they do not cause harmful interfere to the PUs. Interference may occur because of the following reasons: misdetection of spectrum availability, the high transmission power of SU when both SU and PU are present in the same channel at the same time. In order to avoid interference, the radio has to have a very accurate spectrum sensing method, transmit power at SU should be constrained by the peak interference power of PU and the CR should continuously sense the presence of PUs. To increase the wireless coverage area and reliability of CRN, a new technology called Cooperative Cognitive Radio Network (CCRN), which is a combination of CRN and cooperative communications was developed. A CCRN not only increases the reliability and wireless coverage area of CR but also improves the overall performance of the system. In this context, the main objective of this research work is to evaluate the outage performance of a CCRN in an environment where fading and shadowing also come into the picture and to study the importance of relay networks in CRN. To fulfill the objectives of this research work, a two-hop decode-and-forward CCRN is considered. The recently introduced κ − µ shadowed fading channel is employed over the CCRN to generate a realistic environment.  In order to implement such system as a whole, a deep literature study is performed beforehand. Analytical expressions for the Probability Density Function (PDF) and Cumulative Distribution Function (CDF) of the Signal-to-Noise Ratio (SNR) are obtained. The analytical expressions and simulation results for Outage Probability (OP) are obtained and compared under different fading parameters. The importance of a multiple-relay system in CRN is presented. From the results obtained in this research work, we can conclude that the OP decreases with increase in allowable peak interference power at the PU. The transmit power at SU should always be constrained by the peak interference power at the PU to avoid interference. The overall system performance increases with increasing number of relays.