In high-speed single-carrier digital communication systems, processing blocks of signals using Fast Fourier Transforms is an efficient way to equalize (compensate) for interference between transmitted symbols.

No abstract

This paper addresses target localization problems in both noncooperative and cooperative 3-D wireless sensor networks (WSNs), for both cases of known and unknown sensor transmit power, i.e., P T. We employ a hybrid system that fuses distance and angle measurements, extracted from the received signal strength and angle-of-arrival information, respectively. Based on range and angle measurement models, we derive a novel nonconvex estimator based on the least squares criterion. The derived nonconvex estimator tightly approximates the maximum-likelihood estimator for small noise. We then show that the developed estimator can be transformed into a generalized trust region subproblem framework, by following the squared range approach, for noncooperative WSNs. For cooperative WSNs, we show that the estimator can be transformed into a convex problem by applying appropriate semidefinite programming relaxation techniques. Moreover, we show that the generalization of the proposed estimators for known P T is straightforward to the case where P T is not known. Our simulation results show that the new estimators have excellent performance and are robust to not knowing P T. The new estimators for noncooperative localization significantly outperform the existing estimators, and our estimators for cooperative localization show exceptional performance in all considered settings.

No abstract

This letter addresses the problem of target localization in a 3-D space, utilizing combined measurements of received signal strength and angle of arrival (AoA). By using the spherical coordinate conversion and available AoA observations to establish new relationships between the measurements and the unknown target location, we derive a simple closed-form solution method. We then show that the proposed method has straightforward adaptation to the case where the target's transmit power is also not known. Simulation results validate the outstanding performance of the proposed method. IndexTerms-Wireless localization, received signal strength (RSS), angle of arrival (AoA), weighted least squares (WLS), wireless sensor network (WSN).

In this letter we consider the design of multidimensional compact constellations that minimize the average symbol energy for a given minimum Euclidian distance between constellation points. We formulate the constellation design as a non-convex quadratically constrained quadratic programming. We propose a simple and efficient optimization method, which offers good solutions for small to medium sized constellations.

This letter addresses the problem of target localization in harsh indoor environments based on range measurements. To mitigate the non-line-of-sight (NLOS) bias, we propose a novel robust estimator by transforming the localization problem into a generalized trust region sub-problem framework. Although still non-convex in general, this class of problems can be readily solved exactly by means of bisection procedure. The new approach does not require to make any assumptions about the statistics of NLOS bias, nor to try to distinguish which links are NLOS and which are not. Unlike the existing algorithms, the computational complexity of the proposed algorithm is linear in the number of reference nodes. Our simulation results corroborate the effectiveness of the new algorithm in terms of NLOS bias mitigation and show that the performance of our estimator is highly competitive with the performance of the stateof-the-art algorithms. In fact, they show that the novel estimator outperforms slightly the existing ones in general, and that it always provides a feasible solution.

Abstract-This letter addresses the hybrid range/angle-based target localization problem in a cooperative 3-D wireless sensor network where no central processor is available. Due to battery exhaust over time, sensors' transmit powers are assumed different and unknown. Range and angle measurements are drawn from the received signal strength and angle-of-arrival models, respectively. By exploiting the measurement models, we derive a novel local-estimator by which each target updates its own estimate, based on the least squares criterion. Second-order cone relaxation technique is then applied to approximately solve the attained problem due to its non-convex nature. Our simulation results show that the proposed algorithm efficiently solves the localization problem.Index Terms-Wireless localization, distributed localization, received signal strength (RSS), angle-of-arrival (AoA), second-order cone programming (SOCP), wireless sensor network (WSN).