In this paper, we consider the cooperative spectrum sensing problem for a cognitive radio (CR) mesh network, where secondary users (SUs) are allowed to share the spectrum band which is originally allocated to a primary users' (PUs) network. We propose two new cooperative spectrum sensing strategies, called amplify-and-relay (AR) and detect-and-relay (DR), aiming at improving the detection performance with the help of other eligible SUs so as to agilely vacate the channel to the primary network when the neighboring PUs switch to active state. AR and DR strategies are periodically executed during the spectrum sensing phase which is arranged at the beginning of each MAC frame. Based on AR and DR strategies, we derive the closed-form expressions of false alarm probability and detection probability for both single-relay and multi-relay models, with or without channel state information (CSI). Simulation results show that our proposed strategies achieve better performance than a non-cooperative (or non-relay) spectrum sensing method and an existing cooperative detection method. As expected, we observe that the detection performance improves as the number of eligible relay SUs increases, and furthermore, it is better for the known-CSI case than that of the unknown-CSI case.
Indoor positioning plays an important role in a variety of applications under Internet of things (IoT). Conventional WiFi fingerprinting-based indoor positioning systems (IPSs) usually require extensive manual calibrations to construct radio maps. This process severely limits the system scalability and adaptiveness. Pedestrian dead reckoning (PDR) is a popular method that can avoid the calibration process. However, PDR-based IPSs typically suffer from accumulated errors. To tackle this problem, many refinement methods require map information or floorplans which may not be available or up-to-date in practice. With the development of IoT, various types of crowdsourced data become available. In this work, we propose GraphIPS, a calibration-free and map-free IPS which dynamically generates accurate radio maps by utilizing smartphone crowdsourced WiFi and inertial measurement unit (IMU) data. GraphIPS fuses the crowdsourced data into a graph-based formulation and applies the multidimensional scaling (MDS) algorithm to compute the positions of user’s steps. Experimental results show that GraphIPS achieves comparable accuracy to the calibration-based method in a significantly shorter run time than optimization-based methods. In addition to smartphones, GraphIPS is also potentially applicable for the smart wearables with embedded WiFi modules and IMUs.
8 May 2012 in IEEE Transactions on Mobile Computing
Existing approaches to indoor tracking have various limitations. Location-fingerprinting approaches are labor intensive and vulnerable to environmental changes. Trilateration approaches require at least three line-of-sight beacons for coverage at any point in the service area, which results in heavy infrastructure cost. Dead reckoning (DR) approaches rely on knowledge of the initial location and suffer from tracking error accumulation. Despite this, we adopt DR for location tracking because of the recent emergence of affordable hand-held devices equipped with low-cost DR-enabling sensors. In this paper, we propose an indoor pedestrian tracking system that comprises of a DR subsystem implemented on a mobile phone and a ranging subsystem with a sparse infrastructure. A particle-filter-based fusion scheme is applied to bound the accumulated tracking error by fusing DR with sparse range measurements. Experimental results show that the proposed system is able to track users much better than DR alone. The system is robust even when: 1) the initial user location is not available; 2) range updates are noisy; and 3) range updates are intermittent, both temporally and spatially.
Step counting-based dead-reckoning has been widely accepted as a cheap and effective solution for indoor pedestrian tracking using a hand-held device equipped with motion sensors. To compensate for the accumulating error in a dead-reckoning tracking system, extra techniques are always fused together to form a hybrid system. In this paper, we first propose a map matching (MM) enhanced particle filter (PF) as a robust localization solution, in which MM utilizes the corridor information to calibrate the step direction estimation and PF is applied to filter out impossible locations. To overcome the dependency on manually input corridor information in the MM algorithm, as well as the computational complexity in combining two such algorithms, an improved PF is proposed. By better modelling of the location error, the improved PF calibrates the location estimation, as well as step direction estimation when the map information is available, while keeping the computational complexity the same as the original PF. Experimental results show that in a quite dense map constraint environment with corridors, the proposed methods have similar accuracy, but outperform the original PF in terms of accuracy. When only partial map constraints are applied to simulate a new testbed, the improved PF obtains the most robust and accurate results. Therefore, the improved PF is the recommended DR solution, which is adaptive to various indoor environments.
In this paper, we derive the theoretical error Probability Density Function (PDF) and Region of Confidence (RoC) conditioned on the on-line signal parameter vector, for a generalized fingerprint-based localization system. As the computations of these terms require the exact expression of the joint PDF for both the device location and the on-line signal parameter vector, which is often not available practically, we propose to approximate this joint PDF by Nonparametric Kernel Density Estimation techniques using the training fingerprints.