International Journal of Wireless Information Networks 

About: International Journal of Wireless Information Networks is an academic journal published by Springer Science+Business Media. The journal publishes majorly in the area(s): Wireless sensor network & Fading. It has an ISSN identifier of 1068-9605. Over the lifetime, 794 publications have been published receiving 10123 citations. The journal is also known as: Wireless information networks.

A Probabilistic Approach to WLAN User Location Estimation

Abstract: We estimate the location of a WLAN user based on radio signal strength measurements performed by the user’s mobile terminal. In our approach the physical properties of the signal propagation are not taken into account directly. Instead the location estimation is regarded as a machine learning problem in which the task is to model how the signal strengths are distributed in different geographical areas based on a sample of measurements collected at several known locations. We present a probabilistic framework for solving the location estimation problem. In the empirical part of the paper we demonstrate the feasibility of this approach by reporting results of field tests in which a probabilistic location estimation method is validated in a real-world indoor environment.

Two signaling schemes for improving the error performance of frequency division duplex (FDD) transmission systems using transmitter antenna diversity

Abstract: We propose two signaling schemes that exploit the availability of multiple (N) antennas at the transmitter to provide diversity benefit to the receiver. This is typical of cellular radio systems where a mobile is equipped with only one antenna while the base station is equipped with multiple antennas. We further assume that the mobile-to-base and base-to-mobile channel variations are statistically independent and that the base station has no knowledge of the base-to-mobile channel characteristics. In the first scheme, a channel code of lengthN and minimum Hamming distanced min≤N is used to encode a group ofK information bits. Channel code symbolc i is transmitted with thei th antenna. At the receiver, a maximum likelihood decoder for the channel code provides a diversity ofd min as long as each transmitted code symbol is subjected to independent fading. This can be achieved by spacing the transmit antennas several wavelengths apart. The second scheme introduces deliberate resolvable multipath distortion by transmitting the data-bearing signal with antenna 1, andN−1 delayed versions of it with antennas 2 throughN. The delays are unique to each antenna and are chosen to be multiples of the symbol interval. At the receiver, a maximum likelihood sequence estimator resolves the multipath in an optimal manner to realize a diversity benefit ofN. Both schemes can suppress co-channel interference. We provide code constructions and simulation results for scheme 1 to demonstrate its merit. We derive the receiver structure and provide a bound on the error probability for scheme 2 which we show to be tight, by means of simulations, for the nontrivial and perhaps the most interesting caseN=2 antennas. The second scheme is backward-compatible with two of the proposed digital cellular system standards, viz., GSM for Europe and IS-54 for North America.

Internet Connectivity for Ad Hoc Mobile Networks

Abstract: The growing deployment rate of wireless LANs indicates that wireless networking is rapidly becoming a prevalent form of communication. As users become more accustomed to the use of mobile devices, they increasingly want the additional benefit of roaming. The Mobile IP protocol has been developed as a solution for allowing users to roam outside of their home networks while still retaining network connectivity. The problem with this solution, however, is that the deployment of foreign agents is expensive because their coverage areas are limited due to fading and interference. To reduce the number of foreign agents needed while still maintaining the same coverage, ad hoc network functionality can cooperate with Mobile IP such that multihop routes between mobile nodes and foreign agents can be utilized. In this work, we present a method for enabling the cooperation of Mobile IP and the Ad hoc On-Demand Distance Vector (AODV) routing protocol, such that mobile nodes that are not within direct transmission range of a foreign agent can still obtain Internet connectivity. In addition, we describe how duplicate address detection can be used in these networks to obtain a unique co-located care-of address when a foreign agent is not available.

Multistage linear receivers for DS-CDMA systems

Abstract: A new family of multistage low-complexity linear receivers for direct sequence code division multiple access (DS-CDMA) communications is introduced. The objective of the proposed design is to mitigate the effect of multiple access interference (MAI), the most significant limiting factor of user capacity in the conventional DS-CDMA channel. The receivers presented here employ joint detection of multiple users and therefore require knowledge of all the signature codes and their timing. In addition, for a multipath environment, reliable estimates of the received powers and phases are assumed available for maximal ratio RAKE combining. Each stage of the underlying design recreates the overall modulation, noiseless channel, and demodulation process. The outputs of these stages are then linearly combined. The combining weights can be chosen to implement different linear detectors, including the decorrelating and minimum mean square error (MMSE) detectors. In this paper, we focus on implementing the MMSE detector. Simulation results illustrate that significant performance gains can be achieved in both synchronous and asynchronous systems.

The UMTS Turbo Code and an Efficient Decoder Implementation Suitable for Software-Defined Radios

Abstract: This paper provides a description of the turbo code used by the UMTS third-generation cellular standard, as standardized by the Third-Generation Partnership Project (3GPP), and proposes an efficient decoder suitable for insertion into software-defined radio architectures or for use in computer simulations. Because the decoder is implemented in software, rather than hardware, single-precision floating-point arithmetic is assumed and a variable number of decoder iterations is not only possible but desirable. Three twists on the well-known log-MAP decoding algorithm are proposed: (1) a linear approximation of the correction function used by the max* operator, which reduces complexity with only a negligible loss in BER performance; (2) a method for normalizing the backward recursion that yields a 12.5% savings in memory usage; and (3) a simple method for halting the decoder iterations based only on the log-likelihood ratios.