Opportunistic Localization Scheme Based on Linear Matrix Inequality

Enabling self-localization of mobile nodes is an important problem that has been widely studied in the literature. The general conclusions is that an accurate localization requires either sophisticated hardware (GPS, UWB, ultrasounds transceiver) or a dedicated infrastructure (GSM, WLAN). In this paper we tackle the problem from a different and rather new perspective: we investigate how localization performance can be improved by means of a cooperative and opportunistic data exchange among the nodes. We consider a target node, completely unaware of its own position, and a number of mobile nodes with some self-localization capabilities. When the opportunity occurs, the target node can exchange data with in-range mobile nodes. This opportunistic data exchange is then used by the target node to refine its position estimate by using a technique based on Linear Matrix Inequalities and barycentric algorithm. To investigate the performance of such an opportunistic localization algorithm, we define a simple mathematical model that describes the opportunistic interactions and, then, we run several computer simulations for analyzing the effect of the nodes duty-cycle and of the native self-localization error modeling considered. The results show that the opportunistic interactions can actually improve the self-localization accuracy of a strayed node in many different scenarios

Group behavior impact on an opportunistic localization scheme

In this paper we tackled the localization problem from an opportunistic perspective, according to which a node can infer its own spatial position by exchanging data with passing by nodes, called peers. We consider an opportunistic localization algorithm based on the linear matrix inequality (LMI) method coupled with a weighted barycenter algorithm. This scheme has been previously analyzed in scenarios with random deployment of peers, proving its effectiveness. In this paper, we extend the analysis by considering more realistic mobility models for peer nodes. More specifically, we consider two mobility models, namely the Group Random Waypoint Mobility Model and the Group Random Pedestrian Mobility Model, which is an improvement of the first one. Hence, we analyze by simulation the opportunistic localization algorithm for both the models, in order to gain insights on the impact of nodes mobility pattern onto the localization performance. The simulation results show that the mobility model has non-negligible effect on the final localization error, though the performance of the opportunistic localization scheme remains acceptable in all the considered scenarios

Energy Beamforming with One-Bit Feedback

Wireless energy transfer (WET) has attracted significant attention recently for providing energy supplies wirelessly to electrical devices without the need of wires or cables. Among different types of WET techniques, the radio frequency (RF) signal enabled far-field WET is most practically appealing to power energy constrained wireless networks in a broadcast manner. To overcome the significant path loss over wireless channels, multi-antenna or multiple-input multiple-output (MIMO) techniques have been proposed to enhance the transmission efficiency and distance for RF-based WET. However, in order to reap the large energy beamforming gain in MIMO WET, acquiring the channel state information (CSI) at the energy transmitter (ET) is an essential task. This task is particularly challenging for WET systems, since existing channel training and feedback methods used for communication receivers may not be implementable at the energy receiver (ER) due to its hardware limitation. To tackle this problem, in this paper we consider a multiuser MIMO system for WET, where a multiple-antenna ET broadcasts wireless energy to a group of multiple-antenna ERs concurrently via transmit energy beamforming. By taking into account the practical energy harvesting circuits at the ER, we propose a new channel learning method that requires only one feedback bit from each ER to the ET per feedback interval. The feedback bit indicates the increase or decrease of the harvested energy by each ER between the present and previous intervals, which can be measured without changing the existing hardware at the ER. Based on such feedback information, the ET adjusts transmit beamforming in different training intervals and at the same time obtains improved estimates of the MIMO channels to ERs by applying a new approach termed analytic center cutting plane method (ACCPM).Comment: This is the longer version of a paper to appear in IEEE Transactions on Signal Processin

Opportunistic Angle of Arrival Estimation in Impaired Scenarios

This work if focused on the analysis and the development of Angle of Arrival (AoA) radio localization methods. The radio positioning system considered is constituted by a radio source and by a receiving array of antennas. The positioning algorithms treated in this work are designed to have a passive and opportunistic approach. The opportunistic attribute implies that the radio localization algorithms are designed to provide the AoA estimation with nearly-zero information on the transmitted signals. No training sequences or waveforms custom designed for localization are taken into account. The localization is termed passive since there is no collaboration between the transmitter and the receiver during the localization process. Then, the algorithms treated in this work are designed to eavesdrop already existing communication signals and to locate their radio source with nearly-zero knowledge of the signal and without the collaboration of the transmitting node. First of all, AoA radio localization algorithms can be classified in terms of involved signals (narrowband or broadband), antenna array pattern (L-shaped, circular, etc.), signal structure (sinusoidal, training sequences, etc.), Differential Time of Arrival (D-ToA) / Differential Phase of Arrival (D-PoA) and collaborative/non collaborative. Than, the most detrimental effects for radio communications are treated: the multipath (MP) channels and the impaired hardware. A geometric model for the MP is analysed and implemented to test the robustness of the proposed methods. The effects of MP on the received signals statistics from the AoA estimation point-of-view are discussed. The hardware impairments for the most common components are introduced and their effects in the AoA estimation process are analysed. Two novel algorithms that exploits the AoA from signal snapshots acquired sequentially with a time division approach are presented. The acquired signals are QAM waveforms eavesdropped from a pre-existing communication. The proposed methods, namely Constellation Statistical Pattern IDentification and Overlap (CSP-IDO) and Bidimensional CSP-IDO (BCID), exploit the probability density function (pdf) of the received signals to obtain the D-PoA. Both CSP-IDO and BCID use the statistical pattern of received signals exploiting the transmitter statistical signature. Since the presence of hardware impairments modify the statistical pattern of the received signals, CSP-IDO and BCID are able to exploit it to improve the performance with respect to (w.r.t.) the ideal case. Since the proposed methods can be used with a switched antenna architecture they are implementable with a reduced hardware contrariwise to synchronous methods like MUltiple SIgnal Classification (MUSIC) that are not applicable. Then, two iterative AoA estimation algorithms for the dynamic tracking of moving radio sources are implemented. Statistical methods, namely PF, are used to implement the iterative tracking of the AoA from D-PoA measures in two different scenarios: automotive and Unmanned Aerial Vehicle (UAV). The AoA tracking of an electric car signalling with a IEEE 802.11p-like standard is implemented using a test-bed and real measures elaborated with a the proposed Particle Swarm Adaptive Scattering (PSAS) algorithm. The tracking of a UAV moving in the 3D space is investigated emulating the UAV trajectory using the proposed Confined Area Random Aerial Trajectory Emulator (CARATE) algorithm

Information Technology

The new millennium has been labeled as the century of the personal communications revolution or more specifically, the digital wireless communications revolution. The introduction of new multimedia services has created higher loads on available radio resources. These services can be presented in different levels of quality of service. Namely, the task of the radio resource manager is to provide these levels. Radio resources are scarce and need to be shared by many users. The sharing has to be carried out in an efficient way avoiding as much as possible any waste of resources. The main contribution focus of this work is on radio resource management in opportunistic systems. In opportunistic communications dynamic rate and power allocation may be performed over the dimensions of time, frequency and space in a wireless system. In this work a number of these allocation schemes are proposed. A downlink scheduler is introduced in this work that controls the activity of the users. The scheduler is a simple integral controller that controls the activity of users, increasing or decreasing it depending on the degree of proximity to a requested quality of service level. The scheduler is designed to be a best effort scheduler; that is, in the event the requested quality of service (QoS) cannot be attained, users are always guaranteed the basic QoS level provided by a proportional fair scheduler. In a proportional fair scheduler, the user with the best rate quality factor is selected. The rate quality here is the instantaneous achievable rate divided by the average throughput Uplink scheduling is more challenging than its downlink counterpart due to signalling restrictions and additional constraints on resource allocations. For instance, in long term evolution systems, single carrier FDMA is to be utilized which requires the frequency domain resource allocation to be done in such a way that a user could only be allocated subsequent bands. We suggest for the uplink a scheduler that follows a heuristic approach in its decision. The scheduler is mainly based on the gradient algorithm that maximizes the gradient of a certain utility. The utility could be a function of any QoS. In addition, an optimal uplink scheduler for the same system is presented. This optimal scheduler is valid in theory only, nevertheless, it provides a considerable benchmark for evaluation of performance for the heuristic scheduler as well as other algorithms of the same system. A study is also made for the feedback information in a multi-carrier system. In a multi-carrier system, reporting the channel state information (CSI) of every subcarrier will result in huge overhead and consequent waste in bandwidth. In this work the subcarriers are grouped into subbands which are in turn grouped into blocks and a study is made to find the minimum amount of information for the adaptive modulation and coding (AMC) of the blocks. The thesis also deals with admission control and proposes an opportunistic admission controller. The controller gradually integrates a new user requesting admission into the system. The system is probed to examine the effect of the new user on existing connections. The user is finally fully admitted if by the end of the probing, the quality of service (QoS) of existing connections did not drop below a certain threshold. It is imperative to mention that the research work of this thesis is mainly focused on non-real time applications.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

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