Search

A passenger is overcharged by the taxi driver is one common type of fraudulent trip, and it brings negative impacts to modern cities. Most existing fraudulent trip detection works rely on the assumption that the trip is correctly recorded by the taximeter. However, there are many taxi drivers in China carrying passengers without activating the taximeter, especially when the taxi driver is trying to overcharge the passengers. Hence, existing detection methods cannot be directly applied to such real-world scenario. In this article, we propose a system, called “FraudTrip,” which detects “unmetered” taxi trips based on a novel fraud detection algorithm and a heuristic maximum fraudulent trajectory construction algorithm. Based on the experiments on both synthetic and real-world trajectory data sets, FraudTrip can effectively and efficiently detect fraudulent trips without the help of taximeters.

Intelligent education systems have enabled personalized learning (PL). In PL, students are presented with educational contents that are consistent with their personal knowledge states (KS), and the critical task is accurately estimating these states through data. Knowledge tracing (KT) infers KS (latent) through historical student interactions (observed) with the knowledge components (KCs). A wide variety of KT techniques have been developed, from Bayesian Knowledge Tracing (BKT) to Deep Knowledge Tracing (DKT). However, in most of these methods, the KCs are represented as stand-alone entities, and the effect of representing KCs using contexts such as learning-related factors has been under-investigated. Also, KT needs to generate personalized results to facilitate tasks such as exercise recommendation. In this paper, we propose two approaches that use a contextualized representation of KCs, one with a content-based approach and another with a Long Short Term Memory (LSTM) network plus a personalization mechanism. By performing extensive experiments on two real-world datasets, results show not only a tangible improvement in prediction accuracy in the KT task compared to existing methods, but also its effectiveness in improving the recommendation precision.

A novel scheme of edge detection based on the physical law of diffusion is presented in this paper. Though the most current studies are using data based methods such as deep neural networks, these methods on machine learning need big data of labeled ground truth as well as a large amount of resources for training. On the other hand, the widely used traditional methods are based on the gradient of the grayscale or color of images with using different sorts of mathematical tools to accomplish the mission. Instead of treating the outline of an object in an image as a kind of gradient of grayscale or color, our scheme deals with the edge detection as a character of an energy diffusing in the space of media such as charge-coupled device. By using the characteristic function of diffusion, the information of the energy will be extracted. The scheme preserves the structural information of images very well. Because it comes from the inhere law of images' physical property, it has a unified mathematical framework for images' edge detection under different conditions, for example, multiscales, diferent light conditions, and so on. Moreover, it has low computational complexity.

Animation is a commonly used technique in information visualization for smooth transitions between different views. When observing animations of moving objects, people often need to track several specific objects while identify the major trend of movement simultaneously. In this paper, we propose a novel focus+context grouping technique to facilitate target tracking and trend identification. It divides objects into several groups based on a comprehensive tree cut algorithm and generates a staggering animation in which groups are animated sequentially. A balance between efficiency and accuracy is achieved for an effective animation planning. To evaluate the effectiveness of the proposed technique, a carefully designed user study is conducted. The results indicate that focus+context grouping is effective for users to track targets without losing context (i.e., major trend of movement). Based on the study, we discuss advantages and limitations of the proposed grouping technique and conclude with design implications.

The wireless network that integrates a heterogeneous cellular network and a WLAN is referred to as a WLAN/cellular integrated network (WCIN). In a fourth generation WCIN, in order to achieve collision-avoidance between the LTE-A and IEEE 802.11 family, some interference-free mechanisms, such as carrier sense adaptive transmission and listen-before-talk, are proposed. However, the interference-free medium access mechanisms leave some unexploited partially overlapped 802.11ac channels, which result in a waste of spectrum. In this paper, we propose an interference-tolerant medium access method to optimize the WCIN throughput by utilizing those partially overlapped channels (POCs). First, we show the feasibility of enhancing WLAN throughput by utilizing 802.11ac POCs in a WCIN. Second, we mathematically model the partial overlap when an 802.11ac channel is partially overlapping with an LTE-A component carrier. Third, we propose an interference-tolerant medium access mechanism to optimize the WCIN throughput. The interference-tolerant one ensures that the interference to LTE-A users is tolerable in a given WCIN. Finally, we construct a hardware-in-the-loop testbed to evaluate and compare our proposed mechanism with three other state-of-the-art mechanisms. The experimental results show that our approach achieves at most 39% more throughput than one of the state-of-the-art collision-avoidance mechanisms regarding the entire WCIN.

Wi-Fi, which enables convenient wireless access to Internet services, has become integral to our modern lives. With widely-deployed Wi-Fi infrastructure, modern people can enjoy a variety of online services such as web browsing, online shopping, social interaction, and e-commerce almost at any time and any place. Traditionally, the most significant functionality of Wi-Fi is to enable high-throughput data communication between terminal devices and the Internet. However, beyond that, we observe that a novel type of system based on commodity Wi-Fi is increasingly attracting intense academic interest. Without hardware modification and redeployment, researchers are exploiting channel state information output by commodity Wi-Fi and transforming existing Wi-Fi systems into radar-like ones that can recognize human behavior along with data communication. This fancy functionality is tremendously expanding the boundaries of Wi-Fi to a new realm and triggering revolutionary applications in the context of the Internet of Things. In this article, we provide a guide to and introduce the impressive landscape of this new realm.

In this work, we focus on two fundamental questions that are unprecedentedly important to urban planners to understand the functional characteristics of various urban regions throughout a city, namely, (i) how to identify regional weather-traffic sensitivity index throughout a city, that indicates the degree to which the region traffic in a city is impacted by weather changes; (ii) among complex regional features, such as road structure and population density, how to dissect the most influential regional features that drive the urban region traffic to be more vulnerable to weather changes. However, these two questions are nontrivial to answer, because urban traffic changes dynamically over time and is essentially affected by many other factors, which may dominate the overall impact. We make the first study on these questions, by developing a weather-traffic index (WTI) system. The system includes two main components: weather-traffic index establishment and key factor analysis. Using the proposed system, we conducted comprehensive empirical study in Shanghai, and the weather-traffic indices extracted have been validated to be surprisingly consistent with real world observations. Further regional key factor analysis yields interesting results. For example, house age has significant impact on the weather-traffic index, which sheds light on future urban planning and reconstruction.

Ocean and water basically cover the major parts of our planet. To obtain the best utilization of the underlying resources on these parts of the Earth, people have made some research advancements. Specifically, the research on underwater wireless acoustic sensor networks (UWA-SNs) has made great progress. However, wide deployment of UWA-SNs is far from a reality due to several reasons. One important reason is that offshore deployment and field-level experiments of ocean-centric applications are both expensive and labor intensive. Other alternatives to attain this objective are to conduct simulation or experimentation that can reduce cost and accelerate the research activities and their outcomes. However, designing efficient and reliable simulation and experimentation platforms have proven to be more challenging beyond the expectation. In this article, we explore the main techniques (including their pros and cons) and components to develop simulation and experimentation platforms and provide a comprehensive survey report in this area. We classify simulation and experimentation platforms based on some typical criteria and then provide useful guidelines for researchers on choosing suitable platforms in accordance with their requirements. Finally, we address some open and un-resolved issues in this context and provide some suggestions on future research.

Among various ranging techniques, Radio Signal Strength (RSS) based approaches attract intensive research interests because of its low cost and wide applicability. RSS-based ranging is prone to be affected by the multipath phenomenon which allows the radio signals to reach the destination through multiple propagation paths. To address this issue, previous works try to profile the environment and refer this profile during run-time. In a practical dynamic environment, however, the profile frequently changes and the painful retraining is needed. Rather than such static ways of profiling the environments, in this paper, we try to accommodate the environmental dynamics automatically in real-time. The key observation is that given a pair of nodes, the RSS at different spectrum channels will be different. This difference carries the valuable phase information of the radio signals. By analyzing these RSS values, we are able to identify the amplitude of signals solely from the Line-of-Sight (LOS) path. This LOS amplitude is a simple function of the path length (the physical distance). We find that the analysis is a typical non-linear curvature fitting problem that has no general routing algorithms. We prove that, this problem format is ill-conditioned which has no stable and trustable solutions. To deal with this issue, we further explore the practical considerations for the problem and modify it to a greatly improved conditioning shape. We solve the problem by numerical iterations and implement these ideas in a real-time indoor tracking system called MuD. MuD employs only three TelosB nodes as anchors. The experiment results show that in a dynamic environment where five people move around, the averaged localization error is about $1$ meter. Compared with the traditional RSS-based approaches in dynamic environments, the accuracy improves up to $10$ times.

Gesture recognition has emerged recently as a promising application in our daily lives. Owing to low cost, prevalent availability, and structural simplicity, RFID shall become a popular technology for gesture recognition. However, the performance of existing RFID-based gesture recognition systems is constrained by unfavorable intrusiveness to users, requiring users to attach tags on their bodies. To overcome this, we propose GRfid, a novel device-free gesture recognition system based on phase information output by COTS RFID devices. Our work stems from the key insight that the RFID phase information is capable of capturing the spatial features of various gestures with low-cost commodity hardware. In GRfid, after data are collected by hardware, we process the data by a sequence of functional blocks, namely data preprocessing, gesture detection, profiles training, and gesture recognition, all of which are well-designed to achieve high performance in gesture recognition. We have implemented GRfid with a commercial RFID reader and multiple tags, and conducted extensive experiments in different scenarios to evaluate its performance. The results demonstrate that GRfid can achieve an average recognition accuracy of $96.5$ and $92.8$ percent in the identical-position and diverse-positions scenario, respectively. Moreover, experiment results show that GRfid is robust against environmental interference and tag orientations.

Injuries that are caused by falls have been regarded as one of the major health threats to the independent living for the elderly. Conventional fall detection systems have various limitations. In this work, we first look for the correlations between different radio signal variations and activities by analyzing radio propagation model. Based on our observation, we propose WiFall, a truly unobtrusive fall detection system. WiFall employs physical layer Channel State Information (CSI) as the indicator of activities. It can detect fall of the human without hardware modification, extra environmental setup, or any wearable device. We implement WiFall on desktops equipped with commodity 802.11n NIC, and evaluate the performance in three typical indoor scenarios with several layouts of transmitter-receiver (Tx-Rx) links. In our area of interest, WiFall can achieve fall detection for a single person with high accuracy. As demonstrated by the experimental results, WiFall yields 90 percent detection precision with a false alarm rate of 15 percent on average using a one-class SVM classifier in all testing scenarios. It can also achieve average 94 percent fall detection precisions with 13 percent false alarm using Random Forest algorithm.

Nowadays, the increasing car accidents ask for the better driver behavior analysis and risk assessment for travel safety, auto insurance pricing and smart city applications. Traditional approaches largely use GPS data to assess drivers. However, it is difficult to fine-grained assess the time-varying driving behaviors. In this paper, we employ the increasingly popular On-Board Diagnostic (OBD) equipment, which measures semantic-rich vehicle information, to extract detailed trajectory and behavior data for analysis. We propose PBE system, which consists of Trajectory Profiling Model (PM), Driver Behavior Model (BM) and Risk Evaluation Model (EM). PM profiles trajectories for reminding drivers of danger in real-time. The labeled trajectories can be utilized to boost the training of BM and EM for driver risk assessment when data is incomplete. BM evaluates the driving risk using fine-grained driving behaviors on a trajectory level. Its output incorporated with the time-varying pattern, is combined with the driver-level demographic information for the final driver risk assessment in EM. Meanwhile, the whole PBE system also considers the real-world cost-sensitive application scenarios. Extensive experiments on the real-world dataset demonstrate that the performance of PBE in risk assessment outperforms the traditional systems by at least 21%.

The Big Data era and intelligent educational systems have empowered personalized learning. As one of the most effective personalized learning tools, Recommender Systems (RS) are applied for student performance prediction, and personalized content replenishment for learning remediation. A wide variety of context-aware RS for personalized learning have been devised and implemented, adherent with student's learning contexts such as location, time, and activity. Due to the physical constraints, today's education is still carried out at schools, making classes the indispensable and easily achievable context. Leveraging such information can be beneficial for performance improvement and effective learning recommendation in common classroom settings. In this work, we propose a novel approach, ‘Class Contextual Factor’ (CCF)-based RS that synthesizes students' personal and class-level factors for better performances. More specifically, we first derive the CCF from a weighted Q-matrix to estimate students' mastery levels over KCs using an attribute-based recommendation technique. Then, we ensemble an item-based collaborative filtering algorithm for remedial exercise recommendation. By using a real world dataset from an online intelligent tutoring system, evaluations show that our CCF -based method outperforms the popular counterparts (i.e., IRT, RS with collaborative filtering), and is able to provide interpretable results for traceable learning remediation.

Profiling driver behaviors and designing appropriate pricing models are essential for auto insurance companies to gain profits and attract customers (drivers). The existing approaches either rely on static demographic information like age, or model only coarse-grained driving behaviors. They are therefore ineffective to yield accurate risk predictions over time for appropriate pricing, resulting in profit decline or even financial loss. Moreover, existing pricing strategies seldom take profit maximization into consideration, especially under the enterprise constraints. The recent growth of vehicle telematics data (vehicle sensing data) brings new opportunities to auto insurance industry, because of its sheer size and fine-grained mobility for profiling drivers. But, how to fuse these sparse, inconsistent and heterogeneous data is still not well addressed. To tackle these problems, we propose a unified PPP (Profile-Price-Profit) framework, working on the real-world large-scale vehicle telematics data and insurance data. PPP profiles drivers’ fine-grained behaviors by considering various driving features from the trajectory perspective. Then, to predict drivers’ risk probabilities, PPP leverages the group-level insight and categorizes drivers’ different temporal risk change patterns into groups by ensemble learning. Next, the pricing model in PPP incorporates both the demographic analysis and the mobility factors of driving risk and mileage, to generate personalized insurance price for supporting flexible premium periods. Finally, the maximal profit problem proves to be NP-Complete. Then, an efficient heuristic-based dynamic programming is proposed. Extensive experimental results demonstrated that, PPP effectively predicts the driver’s risk and outperforms the current company’s pricing strategy (in industry) and the state-of-the-art approach. PPP also achieves near the maximal profit (difference by only 3%) for the company, and lowers the total price for the drivers.

Nowadays, various data collected in urban context provide unprecedented opportunities for building a smarter city through urban computing. However, due to heterogeneity, high complexity and large volumes of these urban data, analyzing them is not an easy task, which often requires integrating human perception in analytical process, triggering a broad use of visualization. In this survey, we first summarize frequently used data types in urban visual analytics, and then elaborate on existing visualization techniques for time, locations and other properties of urban data. Furthermore, we discuss how visualization can be combined with automated analytical approaches. Existing work on urban visual analytics is categorized into two classes based on different outputs of such combinations: 1) For data exploration and pattern interpretation , we describe representative visual analytics tools designed for better insights of different types of urban data. 2) For visual learning , we discuss how visualization can help in three major steps of automated analytical approaches (i.e., cohort construction; feature selection & model construction; result evaluation & tuning) for a more effective machine learning or data mining process, leading to sort of artificial intelligence, such as a classifier, a predictor or a regression model. Finally, we outlook the future of urban visual analytics, and conclude the survey with potential research directions.

With the marvelous development of wireless techniques and ubiquitous deployment of wireless systems indoors, myriad indoor location-based services (ILBSs) have permeated into numerous aspects of modern life. The most fundamental functionality is to pinpoint the location of the target via wireless devices. According to how wireless devices interact with the target, wireless indoor localization schemes roughly fall into two categories: device based and device free. In device-based localization, a wireless device (e.g., a smartphone) is attached to the target and computes its location through cooperation with other deployed wireless devices. In device-free localization, the target carries no wireless devices, while the wireless infrastructure deployed in the environment determines the target’s location by analyzing its impact on wireless signals. This article is intended to offer a comprehensive state-of-the-art survey on wireless indoor localization from the device perspective. In this survey, we review the recent advances in both modes by elaborating on the underlying wireless modalities, basic localization principles, and data fusion techniques, with special emphasis on emerging trends in (1) leveraging smartphones to integrate wireless and sensor capabilities and extend to the social context for device-based localization, and (2) extracting specific wireless features to trigger novel human-centric device-free localization. We comprehensively compare each scheme in terms of accuracy, cost, scalability, and energy efficiency. Furthermore, we take a first look at intrinsic technical challenges in both categories and identify several open research issues associated with these new challenges.

Wireless LANs, particularly WiFi, have been pervasively deployed and have fostered myriad wireless communication services and ubiquitous computing applications. A primary concern in designing these applications is to combat harsh indoor propagation environments, particularly Non-Line-Of-Sight (NLOS) propagation. The ability to identify the existence of the Line-Of-Sight (LOS) path acts as a key enabler for adaptive communication, cognitive radios, and robust localization. Enabling such capability on commodity WiFi infrastructure, however, is prohibitive due to the coarse multipath resolution with MAC-layer received signal strength. In this paper, we propose two PHY-layer channel-statistics-based features from both the time and frequency domains. To further break away from the intrinsic bandwidth limit of WiFi, we extend to the spatial domain and harness natural mobility to magnify the randomness of NLOS paths while retaining the deterministic nature of the LOS component. We propose LiFi, a statistical LOS identification scheme with commodity WiFi infrastructure, and evaluate it in typical indoor environments covering an area of 1500 m 2. Experimental results demonstrate that LiFi achieves an overall LOS detection rate of 90.42% with a false alarm rate of 9.34% for the temporal feature and an overall LOS detection rate of 93.09% with a false alarm rate of 7.29% for the spectral feature.

Taxis are a major means of public transportation in large cities, and speeding is a common problem among motor vehicles, including taxis. Unless caught by sensors or patrol officers, many speeding incidents go unnoticed, which pose potential threat to road safety. In this paper, we propose to detect speeding behaviors of individual taxis from taxi trajectory data. Such detection results are useful for driver risk analysis and road safety management. However, the taxi trajectory data are geographically sparse and the sample rate is low. Furthermore, existing methods mainly deal with the estimation of collective road speeds whereas we focus on the speeds of individual vehicles. As such, we propose to use a two-fold collective matrix factorization (CMF)-based model to estimate the individual vehicle speed. We have evaluated our method on real-world datasets, and the results show the effectiveness of our method in detecting taxi speeding behaviors.

Taxi fraud has become a serious problem in many large cities, where passengers are overcharged by taxi drivers in various ways. Researchers have developed a number of methods to detect taxi frauds with the assumption that fraudulent trips, among normal trips, are recorded by taximeters. In this paper, different from the previous work, we identify a new type of taxi fraud called unmetered taxi rides, where taxi drivers carry passengers without activating the taximeters. Since these fraudulent rides are not recorded by taximeters, previous detection approaches cannot directly apply to them. Hence, we propose a novel fraud detection system specifically designed for unmetered taxi rides. Our system uses a learning model to detect unmetered trajectory segments that are similar to metered rides, and introduces a heuristic algorithm to construct maximum fraudulent trajectories from the trajectory dataset. We have conducted detailed experiments on real-world datasets, and the results show that the proposed system can detect unmetered taxi rides effectively and efficiently.

Strategy design and analysis is important in team sports, such as basketball and soccer. In this paper, we take basketball as an example and study how to cluster movement trajectories in the games to identify the strategies. This problem is challenging in that the trajectories are diverse and that it is unknown how many or what strategies are employed in the games. As a result, traditional parametric clustering methods are not directly applicable to the raw trajectory data. Therefore, we propose to align trajectories around the basket and simplify them based on movement directions and game events, including dribbling, passing, and shooting. Furthermore, we propose a non-parametric density peak (NPDP) method to cluster these simplified event trajectories. Our experiments on an NBA game dataset of 50,000 offenses show that, without parameter tuning, NPDP clusters all trajectories into groups of high similarity and identifies distinguishing movement strategies.

Reliable people counting is crucial to many urban applications. However, most existing people counting systems are sensor-based and can only work in some fixed gateways or checkpoints where sensors have been installed. This high dependence on the exact locations of sensors leads to low accuracy. To overcome these limitations, in this paper, we propose a smartphone-based people counting system, Wi-Counter, by leveraging the pervasive Wi-Fi infrastructure. To collect comprehensive Wi-Fi signals and people count information based on crowdsource, Wi-Counter first adopts a preprocessor to overcome the noisy, discrepant, and fragile data based on the Wiener filter and Newton interpolation. It then makes use of the designated five-layer neural network to learn the relation model between the Wi-Fi signals and the number of people. By analyzing the received Wi-Fi signals, Wi-Counter can estimate the number of people based on the resulting model. We have conducted experiments by implementing a prototype of Wi-counter based on smartphones and evaluated the system in terms of accuracy and power consumption in an indoor testbed covering an area of 96 m $^2$ . Wi-Counter achieved a counting accuracy of up to 93% and exhibited reliable and robust performance resisting temporal environmental changes with negligible power usage.

Data collection is required to be safe and efficient considering both data privacy and system performance. In this paper, we study a new problem: distributed data sharing with privacy-preserving requirements. Given a data demander requesting data from multiple distributed data providers, the objective is to enable the data demander to access the distributed data without knowing the privacy of any individual provider. The problem is challenged by two questions: how to transmit the data safely and accurately; and how to efficiently handle data streams? As the first study, we propose a practical method, Shadow Coding, to preserve the privacy in data transmission and ensure the recovery in data collection, which achieves privacy preserving computation in a data-recoverable, efficient, and scalable way. We also provide practical techniques to make Shadow Coding efficient and safe in data streams. Extensive experimental study on a large-scale real-life dataset offers insight into the performance of our schema. The proposed schema is also implemented as a pilot system in a city to collect distributed mobile phone data.

Multicast is a crucial routine operation for vehicular networks, which underpins important functions such as message dissemination and group coordination. As vehicles may distribute over a vast area, the number of vehicles in a given region can be limited which results in sparse node distribution in part of the vehicular network. This poses several great challenges for efficient multicast, such as network disconnection, scarce communication opportunities and mobility uncertainty. Existing multicast schemes proposed for vehicular networks typically maintain a forwarding structure assuming the vehicles have a high density and move at low speed while these assumptions are often invalid in a practical vehicular network. As more and more vehicles are equipped with GPS enabled navigation systems, the trajectories of vehicles are becoming increasingly available. In this work, we propose an approach called TMC to exploit vehicle trajectories for efficient multicast in vehicular networks. The novelty of TMC includes a message forwarding metric that characterizes the capability of a vehicle to forward a given message to destination nodes, and a method of predicting the chance of inter-vehicle encounter between two vehicles based only on their trajectories without accurate timing information. TMC is designed to be a distributed approach. Vehicles make message forwarding decisions based on vehicle trajectories shared through inter-vehicle exchanges without the need of central information management. We have performed extensive simulations based on real vehicular GPS traces and compared our proposed TMC scheme with other existing approaches. The performance results demonstrate that our approach can achieve a delivery ratio close to that of the flooding-based approach while the cost is reduced by over 80 percent.

Geocast in vehicular networks aims to deliver a message to a target geographical region, which is useful for many applications such as geographic advertising. This is a highly challenging task in vehicular network environments due to the rare encounter opportunities and uncertainty caused by vehicular mobility. As more vehicles are equipped with on-board navigation systems, vehicle trajectories are ready for exploitation. We observe that a vehicle has a higher capability of delivering a message to the target region if its own future trajectory or trajectories of those vehicles to be encountered overlap the target region. Motivated by this observation, we develop a message forwarding metric, called coverage capability, to characterize the capability of a vehicle to successfully geocast the message. When calculating the coverage capability, we are facing the major challenge raised by the absence of accurate vehicle arrival time. Through an empirical study using real vehicular GPS traces of 2,600 taxis, we verify that the travel time of a vehicle, which is modeled as a random variable, follows the Gamma distribution. The travel time modeling helps us to make accurate predictions for inter-vehicle encounters. We perform extensive trace-driven simulations and the results show that our approach achieves 37.4 percent higher delivery ratio and 43.1 percent lower transmission overhead comparing with GPSR which is a representative geographic routing protocol.

Radio frequency (RF) based technologies play an important role in indoor localization, since Radio Signal Strength (RSS) can be easily measured by various wireless devices without additional cost. Among these, radio map based technologies (also referred as fingerprinting technologies) are attractive due to high accuracy and easy deployment. However, these technologies have not been extensively applied on real environment for two fatal limitations. First, it is hard to localize multiple objects. When the number of target objects is unknown, constructing a radio map of multiple objects is almost impossible. Second, environment changes will generate different multipath signals and severely disturb the RSS measurement, making laborious retraining inevitable. Motivated by these, in this paper, we propose a novel approach, called Line-of-sight radio map matching, which only reserves the LOS signal among nodes. It leverages frequency diversity to eliminate the multipath behavior, making RSS more reliable than before. We implement our system MODLoc based on TelosB sensor nodes and commercial 802.11 NICs with Channel State Information (CSI) as well. Through extensive experiments, it shows that the accuracy does not decrease when localizing multiple targets in a dynamic environment. Our work outperforms the traditional methods by about 60 percent. More importantly, no calibration is required in such environment. Furthermore, our approach presents attractive flexibility, making it more appropriate for general RF-based localization studies than just the radio map based localization.

Object differentiation plays a vital role in our daily life and such systems are widely deployed with RFID tags or bar codes attached on goods. In certain scenarios, however, attaching tags to objects may be impractical due to cost and protection issues. In this paper, we propose TagFree, a novel object differentiation scheme without attaching tags. Instead of relying on external tags, we exploit the inherent radiometric properties of different objects as their signatures. To improve the robustness and efficiency of TagFree, we empirically determine a spatial safe zone and harness successive cancellation to distinguish multiple objects simultaneously. We prototype TagFree on commercial WiFi infrastructure and evaluate its performance in various indoor scenarios. Experimental results demonstrate that TagFree achieves single object distinguishing accuracy of 96% measured at the same location, and over 80% within the safe zone range of up to 3m along a 7m link. TagFree can also differentiate up to 3 objects with acceptable accuracy.

Due to the inaccuracy of GPS devices, the location error of raw GPS points can be up to several hundred meters. Many applications using GPS-based vehicle location data require map-matching to pre-process GPS points by aligning them to a road network. However, existing map-matching algorithms can be limited in accuracy due to various factors including low sampling rates, abnormal GPS points, and dense road networks. In this paper, we propose the design and implementation of HIMM, an HMM-based Interactive Map-Matching system that produces accurate map-matching results through human interaction. The main idea is to involve human annotations in the matching process of some elaborately selected error-prone points and to let the system automatically adjust the matching of the remaining points. We use both real-world and synthetic datasets to evaluate the system. The results show that HIMM can significantly reduce human annotation costs comparing to the baseline methods.

Improving channel utilization is a well-known issue in wireless networks. In traditional point-to-point wireless communication, significant efforts had been made by the existing studies on enhancing the utilization of the channel access time. However, in the emerging wireless network using MU-MIMO, considering only the time domain in channel utilization is not sufficient. As multiple transmitters are allowed to transmit packets simultaneously to the same AP, allowing more antennas at AP would lead to higher channel utilization. Thus, the channel utilization in MU-MIMO should consider both time and spatial domains, i.e., the channel access time and the antenna usage, which have not been considered in the existing methods. In this paper, we point out that the fundamental problem is lacking of the antenna information of contention nodes in channel contention. To address this issue, we propose a new MAC-PHY architecture design, CUTS, to allow distributed nodes effectively contend for the channel and utilize the channel in both domains. Particularly, CUTS adopts interference nulling to attach the antenna information in channel contention. Meanwhile, techniques such as channel contention in frequency domain and ACK in frequency domain using self-jamming are adopted. Through the software defined radio-based real experiments and extensive simulations, we demonstrate the feasibility of our design and illustrate that CUTS provides better channel utilization with the gain over IEEE 802.11 reaching up to 470 percent.

In traditional radio-based localization methods, the target object has to carry a transmitter (e.g., active RFID), a receiver (e.g., 802.11 $\times$ detector), or a transceiver (e.g., sensor node). However, in some applications, such as safe guard systems, it is not possible to meet this precondition. In this paper, we propose a model of signal dynamics to allow the tracking of a transceiver-free object. Based on radio signal strength indicator (RSSI), which is readily available in wireless communication, three centralized tracking algorithms, and one distributed tracking algorithm are proposed to eliminate noise behaviors and improve accuracy. The midpoint and intersection algorithms can be applied to track a single object without calibration, while the best-cover algorithm has higher tracking accuracy but requires calibration. The probabilistic cover algorithm is based on distributed dynamic clustering. It can dramatically improve the localization accuracy when multiple objects are present. Our experimental test-bed is a grid sensor array based on MICA2 sensor nodes. The experimental results show that the localization accuracy for single object can reach about 0.8 m and for multiple objects is about 1 m.

Energy efficiency is the main concern in wireless sensor networks (WSNs) due to devices' limited battery power. Because the heavy burden of nodes that near the sink, this "energy hole problem" makes nodes near the sink have faster energy depletion than others. Because of this, the lifetime of WSNs, to some extent, is determined by the power consumption of communication between sink and sensing nodes that near the sink. To address this issue, we propose CSMA/SF (Shortest First) protocol to reduce power consumption of sink-node communication by minimizing energy cost in carrier sense during nodes' channel contention. CSMA/SF modifies existed CSMA/CA MAC protocol. Instead of complete contention-based, CSMA/SF ensures nodes remaining shorter message has higher priority in contention by implementing a distributed scheduling algorithm and incorporating Length Detection scheme. Further, CSMA/SF employs an Anti-Starvation mechanism to solve the starvation problem of shortest-first protocol. CSMA/SF also optimizes channel utilization by reducing the probability of collisions. We have implemented CSMA/SF into USRP2 platform and also conducted comprehensive simulations. The experimental results show that CSMA/SF can reduce overall energy consumption by around 20%. CSMA/SF can improve channel utilization up to 40%.

Nowadays movement patterns and people’s behavioral models are needed for traffic engineers and city planners. These observations could be used to reason about mobility and its sustainability and to support decision makers with reliable information. The very same knowledge about human diaspora and behavior extracted from these data is also valuable to the urban planner, so as to localize new services, organize logistics systems and to detect changes as they occur in the movement behavior. Moreover, it is interesting to investigate movement in places like a shopping area or a working district either for commercial purposes or for improving the service quality. These kinds of tracking data are made available by wireless and mobile communication technologies. It is now possible to record and collect a large amount of mobile phone calls in a city. Technologies for object tracking have recently become affordable and reliable and hence we were able to collect mobile phone data from a city in China from January 1, 2008 to December 31, 2008. The large amount of phone call records from mobile operators can be considered as life mates and sensors of persons to inform howmany people are present in any given area and how many are entering or leaving. Each phone call record usually contains the caller and callee IDs, date and time, and the base station where the phone calls are made. As mobile phones are widely used in our daily life, many human behaviors can be revealed by analyzing mobile phone data. Through mobile phones, we can learn the information about locations, communications between mobile phone users during their daily lives. In this work, we propose a comprehensive visual analysis system named as MViewer, Mobile phone spatiotemporal data Viewer, which is the first system to visualize and analyze the population’smobility patterns from millions of phone call records. Our system consists of three major components: 1) visual analysis of user groups in a base station; 2) visual analysis of the mobility patterns on different user groups making phone calls in certain base stations; 3) visual analysis of handoff phone call records. Some well-established visualization techniques such as parallel coordinates and pixelbased representations have been integrated into our system. We also develop a novel visualization schemes, Voronoidiagram-based visual encoding to reveal the unique features of mobile phone data. We have applied our system to real mobile phone datasets that are kindly provided by our project partners and obtained some interesting findings regarding people’s mobility patterns.

Taxi is a major transportation in the urban area, offering great benefits and convenience to our daily life. However, one of the major business fraud in taxis is the charging fraud, specifically overcharging for the actual distance. In practice, it is hard for us to always monitor taxis and detect such fraud. Due to the Global Positioning System (GPS) embedded in taxis, we can collect the GPS reports from the taxis' locations, and thus, it is possible for us to retrieve their traces. Intuitively, we can utilize such information to construct taxis' trajectories, compute the actual service distance on the city map, and detect fraudulent behaviors. However, in practice, due to the extremely limited reports, notable location errors, complex city map, and road networks, our task to detect taxi fraud faces significant challenges, and the previous methods cannot work well. In this paper, we have a critical and interesting observation that fraudulent taxis always play a secret trick, i.e., modifying the taximeter to a smaller scale. As a result, it not only makes the service distance larger but also makes the reported taxi speed larger. Fortunately, the speed information collected from the GPS reports is accurate. Hence, we utilize the speed information to design a system, which is called the Speed-based Fraud Detection System (SFDS), to model taxi behaviors and detect taxi fraud. Our method is robust to the location errors and independent of the map information and road networks. At the same time, the experiments on real-life data sets confirm that our method has better accuracy, scalability, and more efficient computation, compared with the previous related methods. Finally, interesting findings of our work and discussions on potential issues are provided in this paper for future city transportation and human behavior research.

Big trajectory data introduces severe challenges for data storage and communication. In this paper, we propose a novel compression framework called Clockwise Compression Framework (CCF) for big trajectory data compression under road network constraints. In CCF, we design several new methods: 1) a spatial compression algorithm called Enhanced Clockwise Encoding (ECE), 2) a temporal compression algorithm called Fitting-based Temporal Simplification (FTS), and 3) a dedicated querier that processes queries based on the above spatial and temporal compression algorithms, without fully decompressing the trajectroy data. By leveraging the topological information of the road network, CCF is able to perform both spatial compression and temporal compression in on-line modes. We perform extensive experiments in a real big trajectory dataset to verify both effectiveness and efficiency of our methods. CCF shows promising performances in various metrics and outperforms the state-of-the-art methods.

Effective coordination can dramatically reduce radio interference and avoid packet collisions for multistation wireless local area networks (WLANs). Coordination itself needs consume communication resource and thus competes with data transmission for the limited wireless radio resources. In traditional approaches, control frames and data packets are transmitted in an alternate manner, which brings a great deal of coordination overhead. In this paper, we propose a new communication model where the control frames can be "attacheda to the data transmission. Thus, control messages and data traffic can be transmitted simultaneously and consequently the channel utilization can be improved significantly. We implement the idea in OFDM-based WLANs called hJam, which fully explores the physical layer features of the OFDM modulation method and allows one data packet and a number of control messages to be transmitted together. hJam is implemented on the GNU Radio testbed consisting of eight USRP2 nodes. We also conduct comprehensive simulations and the experimental results show that hJam can improve the WLANs efficiency by up to 200 percent compared with the existing 802.11 family protocols.

With the increasing availability of metropolitan transportation data, such as those from vehicle Global Positioning Systems (GPSs) and road-side sensors, it has become viable for authorities, operators, and individuals to analyze the data for better understanding of the transportation system and, possibly, improved utilization and planning of the system. We report our experience in building the Visual Analytics for Intelligent Transportation (VAIT) system, which is the first system on real-life large-scale data sets for intelligent transportation. Our key observation is that metropolitan transportation data are inherently visual as they are spatio-temporal around road networks. Therefore, we visualize and manage traffic data, together with digital maps, and support analytical queries through this interactive visual interface. As a case study, we demonstrate VAIT on real-world taxi GPS and meter data sets from 15 000 taxis running for two months in a Chinese city of over 10 million people. We discuss the technical challenges in data calibration, storage, visualization, and query processing and offer first-hand lessons learned from developing the system. Based on our extensive empirical experiment results, VAIT beats state-of-the-art methods and systems in terms of scalability, efficiency, and effectiveness and offers us an easy-to-use, efficient, and scalable platform to shed more light on intelligent transportation research.

Spectrum sensing is essential for the success of the cognitive radio networks. In traditional spectrum sensing schemes, secondary users (SUs) are responsible for the spectrum sensing which could be very time and resource consuming. It leads to a great deal of inefficiency in spectrum usage and introduces many practical challenges. To tackle these challenges and leverage the spectrum opportunity more efficiently, we propose a new system that provides a spectrum sensing service for SUs using dedicated wireless spectrum sensor networks (WSSNs). In this paper we focus on the sensing channel assignment problem in WSSNs and formulate the problem as a sensing effectiveness maximization problem (SEMP). We prove that SEMP is NP-complete under the ideal case, and show that more challenges arise in real environments. To address the issue, we systematically study the design tradeoff and critical factors when maximizing the sensing effectiveness. Based on these study results we propose a sensing channel assignment algorithm (SCAS). We conduct test-bed empirical investigations as well as comprehensive simulations. Performance evaluation results show that for both the scenarios of given deployments and manual deployments, SCAS is able to sense more channels to improve the sensing effectiveness. The improvement is up to 300 % and the average improvement is 150 % compared with other simple alternatives.

Indoor positioning systems have received increasing attention for supporting location-based services in indoor environments. WiFi-based indoor localization has been attractive due to its open access and low cost properties. However, the distance estimation based on received signal strength indicator (RSSI) is easily affected by the temporal and spatial variance due to the multipath effect, which contributes to most of the estimation errors in current systems. In this work, we analyze this effect across the physical layer and account for the undesirable RSSI readings being reported. We explore the frequency diversity of the subcarriers in orthogonal frequency division multiplexing systems and propose a novel approach called FILA, which leverages the channel state information (CSI) to build a propagation model and a fingerprinting system at the receiver. We implement the FILA system on commercial 802.11 NICs, and then evaluate its performance in different typical indoor scenarios. The experimental results show that the accuracy and latency of distance calculation can be significantly enhanced by using CSI. Moreover, FILA can significantly improve the localization accuracy compared with the corresponding RSSI approach.

The growing importance of operations such as identification, location sensing, and object tracking has led to increasing interests in contactless Radio Frequency Identification (RFID) systems. Enjoying the low cost of RFID tags, modern RFID systems tend to be deployed for large-scale mobile objects. Both the theoretical and experimental results suggest that when tags are in large numbers, most existing collision arbitration protocols do not satisfy the scalability and time-efficiency requirements of many applications. To address this problem, we propose Adaptively Splitting-based Arbitration Protocol (ASAP), a scheme that provides efficient RFID identification for both small and large deployment of RFID tags, in terms of time and energy cost. Theoretical analysis and simulation evaluation show that the performance of ASAP is better than most existing collision-arbitration solutions and the time efficiency is close to the theoretically optimal values.

Transceiver-free object tracking is to trace a moving object that does not carry any communication device in an environment with some monitoring nodes predeployed. Among all the tracking technologies, RF-based technology is an emerging research field facing many challenges. Although we proposed the original idea, until now there is no method achieving scalability without sacrificing latency and accuracy. In this paper, we put forward a real-time tracking system RASS, which can achieve this goal and is promising in the applications like the safeguard system. Our basic idea is to divide the tracking field into different areas, with adjacent areas using different communication channels. So, the interference among different areas can be prevented. For each area, three communicating nodes are deployed on the ceiling as a regular triangle to monitor this area. In each triangle area, we use a Support Vector Regression (SVR) model to locate the object. This model simulates the relationship between the signal dynamics caused by the object and the object position. It not only considers the ideal case of signal dynamics caused by the object, but also utilizes their irregular information. As a result, it can reach the tracking accuracy to around 1 m by just using three nodes in a triangle area with 4 m in each side. The experiments show that the tracking latency of the proposed RASS system is bounded by only about 0.26 m. Our system scales well to a large deployment field without sacrificing the latency and accuracy.

Wireless technology has become ever more popular in recent years, which results in a higher and higher density of wireless devices. In order to cope with this high density, researchers are proposing the provision of multiple concurrent transmissions by dividing a broadband channel into separate narrow band subchannels. In particular, a fine-grained channel access approach calls for efficient channel allocation mechanisms, especially in distributed networks. However, most of the current multi-channel access methods rely on costly coordination, which significantly degrades network performance. Motivated by this, we propose a cross layer design, termed Attachment Learning (AT-Learning), to achieve multi-channel allocation with low cost and high efficiency in distributed OFDMA based networks. AT-Learning utilizes a jamming and cancellation technique to attach identifier signals to data traffic, without degrading the effective throughput of the original data transmission. These identifier signals help mobile stations learn the allocation strategy by themselves. After the learning stage, mobile stations can achieve a TDMA-like performance, where stations will know exactly when to transmit and on which channel without further collisions. We conduct comprehensive simulations, comparing AT-Learning with a traditional multi-channel access method like Slotted ALOHA. The experimental results demonstrate that AT-Learning can improve the throughput by up to 300% over Slotted ALOHA.

近年来, 大数据的价值已被普遍接受, 众多企业或机构都希望应用大数据技术将数据价值真正发挥出来。然而到目前为止, 大数据技术主要是被少数 IT 巨头充分利用, 并未在各领域真正地 “落地开花”。我们认为, 现有的技术已经能够较好地解决大数据带来的效率挑战, 但部署实施的技术门槛太高, 导致这些“高端”的技术难以在 IT 之外的商业领域帮助实现大数据的价值。因此, 我们相信, 现有的大数据技术仍待持续发展, 提升效率不再是唯一目标, 应着手解决价值落地的问题。未来大数据技术的发展方向将是“平民化”, 即优化数据的获取、使用和实施等各个环节, 降低技术门槛, 使大数据应用能够真正普及。

Topology control is an effective method to improve the energy-efficiency and increase the communication capacity of Wireless Sensor Networks (WSNs). Traditional topology control algorithms are based on deterministic model that fails to consider lossy links which provide only probabilistic connectivity. Noticing this fact, we propose a novel probabilistic network model. We meter the network connectivity using network reachability. It is defined as the minimal of the upper limit of the end-to-end delivery ratio between any pair of nodes in the network. We attempt to find a minimal transmission power for each node while the network reachability is above a given application-specified threshold. The whole procedure is called probabilistic topology control (PTC). We prove that PTC is NP-hard and propose a fully distributed algorithm called BRASP. We prove that BRASP has the guaranteed performance and the communication overhead is O(|E| + |V|). The experimental results show that the network energy-efficiency can be improved by up to 250% and the average node degree is reduced by 50%.

Surveillance is a critical problem for harbor protection, border control or the security of commercial facilities. The effective protection of vast near-coast sea surfaces and busy harbor areas from intrusions of unauthorized marine vessels, such as pirates smugglers or, illegal fishermen is particularly challenging. In this paper, we present an innovative solution for ship intrusion detection. Equipped with three-axis accelerometer sensors, we deploy an experimental Wireless Sensor Network (WSN) on the sea's surface to detect ships. Using signal processing techniques and cooperative signal processing, we can detect any passing ships by distinguishing the ship-generated waves from the ocean waves. We design a three-tier intrusion detection system with which we propose to exploit spatial and temporal correlations of an intrusion to increase detection reliability. We conduct evaluations with real data collected in our initial experiments, and provide quantitative analysis of the detection system, such as the successful detection ratio, detection latency, and an estimation of an intruding vessel's velocity.

IEEE 802.15.4 standard specifies physical layer (PHY) and medium access control (MAC) sublayer protocols for low-rate and low-power communication applications. In this protocol, every 4-bit symbol is encoded into a sequence of 32 chips that are actually transmitted over the air. The 32 chips as a whole is also called a pseudonoise code (PN-Code). Due to complex channel conditions such as attenuation and interference, the transmitted PN-Code will often be received with some PN-Code chips corrupted. In this paper, we conduct a systematic analysis on these errors occurring at chip level. We find that there are notable error patterns corresponding to different cases. We then show that recognizing these patterns enables us to identify the channel condition in great details. We believe that understanding what happened to the transmission in our way can potentially bring benefit to channel coding, routing, and error correction protocol design. Finally, we propose Simple Rule, a simple yet effective method based on the chip error patterns to infer the link condition with an accuracy of over 96 percent in our evaluations.

RFID tag identification is a crucial problem in UHF RFID systems. Traditional tag identification algorithms can be classified into two categories, ALOHA-based and tree-based. Both of them are inefficient due to the incidental high coordination cost. In this paper, we bring CSMA into UHF RFID systems to enhance tag read rate by reducing coordination cost. However, it is not straightforward due to the simple hardware design of passive RFID tags, which is unable to sense the transmissions or collisions of other tags. To tackle this challenge, we propose receiver-based CSMA (RCSMA) in this paper. In RCSMA, the reader notifies the tags channel condition. According to different sensing results of reader's notifications, the tags take corresponding actions, e.g., random back off. RCSMA does not require special RFID tag hardware design. An absorbing Markov chain model is presented to analyze the performance of RCSMA and shown to be consistent with the simulation results. Compared with optimized ALOHA-based algorithms and optimized tree-based algorithms, RCSMA can enhance the tag read rate by 30-70 percent under different reader and tag data rates.

People are willing to spend more for their health. Traditional medical services are hospital-centric and patients obtain their treatments mainly at the clinics or hospitals. As people age, more medical services are needed to exceed the potentials of this hospital-centric service model. In this paper, we present the design and implementation of CardioSentinal, a 24-hour heart care and monitoring system. CardioSentinal is designed for in-home and daily medical services. It mainly focuses on the outpatients and elderly. CardioSentinal is an interdisciplinary system that integrates recent advances in many fields such as bio-sensors, small-range wireless communications, pervasive computing, cellular networks and modern data centers. We conducted numerous clinic trials for CardioSentinal. Experimental results show that the sensitivity and accuracy are quite high. It is not as good as the professional measurements in hospital due to harsh environments but the system provides valuable information for heart diseases with low-cost and extreme convenience. Some early experiences and lessons in the work will also be reported.

RFID has been gaining popularity due to its variety of applications, such as inventory control and localization. One important issue in RFID system is tag identification. In RFID systems, the tag randomly selects a slot to send a Random Number (RN) packet to contend for identification. Collision happens when multiple tags select the same slot, which makes the RN packet undecodable and thus reduces the channel utilization. In this paper, we redesign the RN pattern to make the collided RNs decodable. By leveraging the collision slots, the system performance can be dramatically enhanced. This novel scheme is called DDC, which is able to directly decode the collisions without exact knowledge of collided RNs. In the DDC scheme, we modify the RN generator in RFID tag and add a collision decoding scheme for RFID reader. We implement DDC in GNU Radio and USRP2 based testbed to verify its feasibility. Both theoretical analysis and testbed experiment show that DDC achieves 40 percent tag read rate gain compared with traditional RFID protocol.

The IEEE 802.11 is a set of Media Access Control (MAC) and Physical Layer (PHY) specifications which concern the Wireless Local Area Network (WLAN) service. However, most IEEE 802.11 WLAN services are easily affected by external elements, such as the homogeneous interference caused by the high-density deployment of IEEE 802.11 devices, the attenuation effect caused by complicated indoor obstacles, and the heterogeneous interference caused by other devices which operate out of unlicensed 2.4GHz ISM bands. In this paper, we first present a method to capture IEEE 802.11n Bit Error Patterns (BEP) under the network effect such as the homogeneous interference and the signal attenuation caused by obstacles. We separate the two issues by showing the specific BEP distributions under different channel conditions. In addition to the IEEE 802.11n BEP analysis, we further simulated the impact of the LTE-Unlicensed (LTE-U) signal to the IEEE 802.11ac at the 5GHz, and analyzed similar BEPs through a purely experiment based method.

The impact of inclement weather to urban traffic has been widely observed and studied for many years, with focus primarily on individual road segments by analyzing data from roadside deployed monitors. However, two fundamental questions are still open: (i) how to identify regional weather-traffic sensitivity index throughout a city, that indicates the degree to which the region traffic in a city is impacted by weather changes, (ii) among complex regional features, such as road structure and population density, how to dissect the most influential regional features that drive the urban region traffic to be more vulnerable to weather changes. Answering these questions is unprecedentedly important for urban planners to understand the functional characteristics of various urban regions throughout a city, and to improve traffic prediction and learn the key factors in urban planning. However, these two questions are nontrivial to answer, because urban traffic changes dynamically over time and is essentially affected by many other factors, which may dominate the overall impact. In this work, we make the first study on these questions, by developing a weather-traffic index (WTI) system. The system includes two main components: WTI establishment and key factor analysis. Using the proposed system, we conducted comprehensive empirical study in Shanghai, and the WTI extracted have been validated to be surprisingly consistent with real world observations. Further regional key factor analysis yields interesting results. For example, house age has significant impact on WTI, which sheds light on future urban planning and reconstruction.

Intercontact time between moving vehicles is one of the key metrics in vehicular ad hoc networks (VANETs) and central to forwarding algorithms and the end-to-end delay. Due to prohibitive costs, little work has conducted experimental study on intercontact time in urban vehicular environments. In this paper, we carry out an extensive experiment involving thousands of operational taxies in Shanghai city. Studying the taxi trace data on the frequency and duration of transfer opportunities between taxies, we observe that the tail distribution of the intercontact time, that is, the time gap separating two contacts of the same pair of taxies, exhibits an exponential decay, over a large range of timescale. This observation is in sharp contrast to recent empirical data studies based on human mobility, in which the distribution of the intercontact time obeys a power law. By analyzing a simplified mobility model that captures the effect of hot areas in the city, we rigorously prove that common traffic influxes, where large volume of traffic converges, play a major role in generating the exponential tail of the intercontact time. Our results thus provide fundamental guidelines on design of new vehicular mobility models in urban scenarios, new data forwarding protocols and their performance analysis.