Ergodic capacity of the exponentially correlated slotted amplify and forward relay channel

In this paper we analyze the performance degradation of slotted amplify-and-forward protocol in wireless environments with high node density where the number of relays grows asymptotically large. Channel gains between source-destination pairs in such networks can no longer be independent. We analyze the degradation of performance in such wireless environments where channel gains are exponentially correlated by looking at the capacity per channel use. Theoretical results for eigenvalue distribution and the capacity are derived and compared with the simulation results. Both analytical and simulated results show that the capacity given by the asymptotic mutual information decreases with the network density.

Opinions, attitudes and driving experiences of car and racing "enthusiasts" : results of the Ontario Car and Racing Club Survey

In recent years, car club and racing websites and forums have become an increasingly popular way for car enthusiasts to access racing and car club news, chat-rooms and message boards. However, no North American research has been found that has examined opinions and driving experiences of car and racing enthusiasts. The purpose of this study was to examine car club members’ opinions about and experiences with various aspects of driving, road safety and traffic legislation, with a particular focus on street racing. A web-based questionnaire (Survey Monkey) was developed using the expert panel method and was primarily based on validated instruments or questions that were developed from other surveys. The questionnaire included: 1) driver concerns regarding traffic safety issues and legislation; 2) attitudes regarding various driving activities; 3) leisure-time activities, including club activities; 4) driving experiences, including offences and collisions; and 5) socio-demographic questions. The survey was pre- tested and piloted. Electronic information letters were sent out to an identified list of car clubs and forums situated in southern Ontario. Car club participants were invited to fill out the questionnaire. This survey found that members of car clubs share similar concerns regarding various road safety issues with samples of Canadian drivers, although a smaller percentage of car club members are concerned about speeding-related driving. Car club members had varied opinions regarding Ontario’s Street Racers, Stunt and Aggressive Drivers Legislation. The respondents agreed the most with the new offences regarding not sitting in the driver’s seat, having a person in the trunk, or driving as close as possible to another vehicle, pedestrian or object on or near the highway without a reason. The majority disagreed with police powers of impoundment and on-the-spot licence suspensions. About three quarters of respondents reported no collisions or police stops for traffic offences in the past five years. Of those who had been stopped, the most common offence was reported as speeding. This study is the first in Canada to examine car club members’ opinions about and experiences with various aspects of driving, road safety and traffic legislation. Given the ubiquity of car clubs and fora in Canada, insights on members’ opinions and practices provide important information to road safety researchers.

Subcarrier pairing and relay assignment with improved user fairness in a multi-user cooperative OFDM system

We consider a joint relay selection and subcarrier allocation problem that minimizes the total system power for a multi-user, multi-relay and single source cooperative OFDM based two hop system. The system is constrained to all users having a specific subcarrier requirement (user fairness). However no specific fairness constraints for relays are considered. To ensure the optimum power allocation, the subcarriers in two hops are paired with each other. We obtain an optimal subcarrier allocation for the single user case using a similar method to what is described in [1] and modify the algorithm for multiuser scenario. Although the optimality is not achieved in multiuser case the probability of all users being served fairly is improved significantly with a relatively low cost trade off.

Ergodic capacity of the slotted amplify and forward relay channel with finite relays

Abstract—In this paper we investigate the capacity of a general class of the slotted amplify and forward (SAF) relaying protocol where multiple, though a finite number of relays may transmit in a given cooperative slot and the relay terminals being half-duplex have a finite slot memory capacity. We derive an expression for the capacity per channel use of this generalized SAF channel assuming all source to relay, relay to destination and source to destination channel gains are independent and modeled as complex Gaussian. We show through the analysis of eigenvalue distributions that the increase in limiting capacity per channel use is marginal with the increase of relay terminals.

Sequential slotted amplify-and-forward with partial relay isolation

In this paper, we propose a novel relay ordering and scheduling strategy for the sequential slotted amplify-and-forward (SAF) protocol and evaluate its performance in terms of diversity-multiplexing trade-off (DMT). The relays between the source and destination are grouped into two relay clusters based on their respective locations. The proposed strategy achieves partial relay isolation and decreases the decoding complexity at the destination. We show that the DMT upper bound of sequential-SAF with the proposed strategy outperforms other amplify and forward protocols and is more practical compared to the relay isolation assumption made in the original paper [1]. Simulation result shows that the sequential-SAF protocol with the proposed strategy has better outage performance compared to the existing AF and non-cooperative protocols in high SNR regime.

Slotted cooperative communication in half duplex relay networks

In cooperative communication systems, several wireless communication terminals collaborate to form a virtual-multiple antenna array system and exploit the spatial diversity to achieve a better performance. This thesis proposes a practical slotted protocol for cooperative communication systems with half-duplex single antennas. The performance of the proposed slotted cooperative communication protocol is evaluated in terms of the pairwise error probability and the bit error rate. The proposed protocol achieves the multiple-input single-output performance bound with a novel relay ordering and scheduling strategy.

Acute hamstring strain injury in track and field athletes : a 3-year observational study at the Penn Relay Carnival

Purpose To observe the incidence rates of hamstring strain injuries (HSIs) across different competition levels and ages during the Penn Relays Carnival. Methods Over a 3-year period all injuries treated by the medical staff were recorded. The type of injury, anatomic location, event in which the injury occurred, competition level and demographic data were documented. Absolute and relative HSI (per 1000 participants) were determined and odds ratios (OR) were calculated between genders, competition levels and events. Results Throughout the study period 48,473 athletes registered to participate in the Penn Relays Carnival, with 118 HSIs treated by the medical team. High school females displayed lesser risk of HSI than high school males (OR = 0.55, p = 0.021), and masters athletes were more likely than high school (OR = 4.26, p < 0.001) and college (OR = 3.55, p = 0.001) level athletes to suffer a HSI. The 4x400m relay displayed a greater likelihood of HSI compared to the 4x100m relay (OR = 1.77, p = 0.008). Conclusions High school males and masters levels athletes are most likely to suffer HSI, and there is higher risk in 400m events compared to 100m events.

Efficient multiple relay selection for cooperative communication using alamouti-coded virtual transmit antenna systems

An opportunistic relay selection scheme improving cooperative diversity is devised using the concept of a virtual SIMO-MISO antenna array. By incorporating multiple users as a virtual distributed antenna, not only helps combat fading but also provides significant advantage in terms of energy consumption. The proposed efficient multiple relay selection uses the concept of the distributed Alamouti scheme in a time varying environment to realize cooperative networking in wireless relay networks and provides the platform for outage, Diversiy-Multiplexing Tradeoff (DMT) and Bit-Error-Rate (BER) analysis to conclude that it is capable of achieving promising diversity gains by operating at much lower SNR when compared with conventional relay selection methods. It also has the added advantage of conserving energy for the relays that are reachable but not selected for the cooperative communication.

Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

For point to point multiple input multiple output systems, Dayal-Brehler-Varanasi have proved that training codes achieve the same diversity order as that of the underlying coherent space time block code (STBC) if a simple minimum mean squared error estimate of the channel formed using the training part is employed for coherent detection of the underlying STBC. In this letter, a similar strategy involving a combination of training, channel estimation and detection in conjunction with existing coherent distributed STBCs is proposed for noncoherent communication in Amplify-and-Forward (AF) relay networks. Simulation results show that the proposed simple strategy outperforms distributed differential space-time coding for AF relay networks. Finally, the proposed strategy is extended to asynchronous relay networks using orthogonal frequency division multiplexing.

Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for number of relays N >= 2.

Distance Relay Co-ordination Using Support Vector Machines in Power Transmission System

In this paper, a new approach to enhance the transmission system distance relay co-ordination is presented. The approach depends on the apparent impedance loci seen by the distance relay during all possible disturbances. In a distance relay, the impedance loci seen at the relay location is obtained by extensive transient stability studies. Support vector machines (SVMs), a class of patterns classifiers are used in discriminating zone settings (zone-1, zone-2 and zone-3) using the signals to be used by the relay. Studies on a sample 9-bus are presented for illustrating the proposed scheme.

Delay Optimal Scheduling in a Two-Hop Vehicular Relay Network

We study a scheduling problem in a wireless network where vehicles are used as store-and-forward relays, a situation that might arise, for example, in practical rural communication networks. A fixed source node wants to transfer a file to a fixed destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, we consider the possibility of communication using vehicles passing by. Vehicles arrive at the source node at renewal instants and are known to travel towards the destination node with average speed v sampled from a given probability distribution. Th source node communicates data packets (or fragments) of the file to the destination node using these vehicles as relays. We assume that the vehicles communicate with the source node and the destination node only, and hence, every packet communication involves two hops. In this setup, we study the source node's sequential decision problem of transferring packets of the file to vehicles as they pass by, with the objective of minimizing delay in the network. We study both the finite file size case and the infinite file size case. In the finite file size case, we aim to minimize the expected file transfer delay, i.e. expected value of the maximum of the packet sojourn times. In the infinite file size case, we study the average packet delay minimization problem as well as the optimal tradeoff achievable between the average queueing delay at the source node buffer and the average transit delay in the relay vehicle.