43 research outputs found
Distributed Space-Time Message Relaying for Uncoded/Coded Wireless Cooperative Communications
During wireless communications, nodes can overhear other transmissions through the wireless medium, suggested by the broadcast nature of plane wave propagation, and may help to provide extra observations of the source signals to the destination. Modern research in wireless communications pays more attention to these extra observations which were formerly neglected within networks. Cooperative communication processes this abundant information existing at the surrounding nodes and retransmits towards the destination in various forms to create spatial and/or coding diversity, thereby to obtain higher throughput and reliability. The aim of this work is to design cooperative communication systems with distributed space-time block codes (DSTBC) in different relaying protocols and theoretically derive the BER performance for each scenario. The amplify-and-forward (AF) protocol is one of the most commonly used protocols at the relays. It has a low implementation complexity but with a drawback of amplifying the noise as well. We establish the derivation of the exact one-integral expression of the average BER performance of this system, folloby a novel approximation method based on the series expansion. An emerging technology, soft decode-and-forward (SDF), has been presented to combine the desired features of AF and DF: soft signal representation in AF and channel coding gain in DF. In the SDF protocol, after decoding, relays transmit the soft-information, which represents the reliability of symbols passed by the decoder, to the destination. Instead of keeping the source node idling when the relays transmit as in the traditional SDF system, we let the source transmit hard information and cooperate with the relays using DSTBC. By theoretically deriving the detection performance at the destination by either using or not using the DSTBC, we make comparisons among three SDF systems. Interesting results have been shown, together with Monte-Carlo simulations, to illustrate that our proposed one-relay and two-relay SDF & DSTBC systems outperform traditional soft relaying for most of the cases. Finally, these analytic results also provide a way to implement the optimal power allocation between the source and the relay or between relays, which is illustrated in the line model
Performance analysis and algorithm design for distributed transmit beamforming
Wireless sensor networks has been one of the major research topics in recent years because
of its great potential for a wide range of applications. In some application scenarios, sensor
nodes intend to report the sensing data to a far-field destination, which cannot be realized by
traditional transmission techniques. Due to the energy limitations and the hardware constraints
of sensor nodes, distributed transmit beamforming is considered as an attractive candidate for
long-range communications in such scenarios as it can reduce energy requirement of each sensor
node and extend the communication range. However, unlike conventional beamforming,
which is performed by a centralized antenna array, distributed beamforming is performed by
a virtual antenna array composed of randomly located sensor nodes, each of which has an
independent oscillator. Sensor nodes have to coordinate with each other and adjust their transmitting
signals to collaboratively act as a distributed beamformer. The most crucial problem of
realizing distributed beamforming is to achieve carrier phase alignment at the destination. This
thesis will investigate distributed beamforming from both theoretical and practical aspects.
First, the bit error ratio performance of distributed beamforming with phase errors is analyzed,
which is a key metric to measure the system performance in practice. We derive two distinct
expressions to approximate the error probability over Rayleigh fading channels corresponding
to small numbers of nodes and large numbers of nodes respectively. The accuracy of both
expressions is demonstrated by simulation results. The impact of phase errors on the system
performance is examined for various numbers of nodes and different levels of transmit power.
Second, a novel iterative algorithm is proposed to achieve carrier phase alignment at the destination
in static channels, which only requires one-bit feedback from the destination. This
algorithm is obtained by combining two novel schemes, both of which can greatly improve the
convergence speed of phase alignment. The advantages in the convergence speed are obtained
by exploiting the feedback information more efficiently compared to existing solutions.
Third, the proposed phase alignment algorithm is modified to track time-varying channels. The
modified algorithm has the ability to detect channel amplitude and phase changes that arise over
time due to motion of the sensors or the destination. The algorithm can adjust key parameters
adaptively according to the changes, which makes it more robust in practical implementation
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Mathematical optimisation and signal processing techniques in wireless relay networks
With the growth of wireless networks such as sensor networks and mesh networks, the challenges of sustaining higher data rates and coverage, coupled with requirement for high quality of services, need to be addressed. The use of spatial diversity proves to be an attractive option due to its ability to significantly enhance network performance without additional bandwidth or transmission power. This thesis proposes the use of cooperative wireless relays to improvise spatial diversity in wireless sensor networks and wireless mesh networks. Cooperation in this context implies that the signals are exchanged between relays for optimal performance. The network gains realised using the proposed cooperative relays for signal forwarding are significantly large, advocating the utilisation of cooperation amongst relays. The work begins with proposing a minimum mean square error (MMSE) based relaying strategy that provides improvement in bit error rate. A simplified algorithm has been developed to calculate the roots of a polynomial equation. Following this work, a novel signal forwarding technique based on convex optimisation techniques is proposed which attains specific quality of services for end users with minimal transmission power at the relays. Quantisation of signals passed between relays has been considered in the optimisation framework. Finally, a reduced complexity scheme together with a more realistic algorithm incorporating per relay node power constraints is proposed. This optimisation framework is extended to a cognitive radio environment where relays in a secondary network forward signals without causing harmful interferences to primary network users.EThOS - Electronic Theses Online ServiceGBUnited Kingdo
Enabling wireless sensors localization in dynamic indoor environments
Wireless sensors networks localization is an important area that attracts significant research interest. Localization is a fundamental problem that must be solved in order to support location-aware applications. The growing demand of location-aware applications requires the development of application-oriented localization solutions with appropriate trade offs between accuracy and costs. The present thesis seeks to enhance the performance of simple and low-cost propagation based localization solutions in dynamic indoor environments.
First, an overview of the different approaches in wireless sensors networks localization is provided. Next, sources of received signal strength variability are investigated. Then, the problems of the distance-dependant path loss estimation caused by the radio channel of dynamic indoor situations are empirically analyzed. Based on these previous theoretical and empirical analysis, the solution uses spatial and frequency diversity techniques, in addition to time diversity, in order to create a better estimator of the distance-dependent path loss by counteracting the random multipath effect. Furthermore, the solution attempts to account for the random shadow fading by using "shadowing-independent" path loss estimations in order to deduce distances. In order to find the unknown sensor's positions based on the distance estimates, the solution implements a weighted least-squares algorithm that reduces the impact of the distance estimates errors in the location estimate