Wang-Chien Lee

Bio: Wang-Chien Lee is an academic researcher from Pennsylvania State University. The author has contributed to research in topics: Wireless sensor network & Nearest neighbor search. The author has an hindex of 60, co-authored 366 publications receiving 14123 citations. Previous affiliations of Wang-Chien Lee include Ohio State University & Verizon Communications.

Mobile Data Access

Abstract: Next generation wireless networks are going to use IP capable mobile terminals and support both voice/multimedia and data services. VoIP is a promising technology allowing a converged core network for all services, and provides a service platform for easier and quicker service creation. Application of VoIP in wireless networks, however, is not so straightforward as people may expect. Among other issues, mobility support is perhaps the most challenging one. The different levels of mobility support (terminal, personal and service mobility) highlight the gap between the existing VoIP framework, which is so far focusing on fixed networks, and the requirements in a wireless environment. After analyzing the existing solutions/proposals for this problem, a framework is proposed in which the mobility-related services are decomposed into several levels so that mobility support is made available to many applications. This layered approach would help to lead to a mobility enabled wireless IP infrastructure in which voice service is just an application.

Analyzing the social ties and structure of contributors in open source software community

Abstract: We conduct a statistical analysis on the social networks of contributors in Open Source Software (OSS) communities using datasets collected from two most fast-growing OSS social interaction sites, Github.com and Ohloh.net. Our goal is to analyze the connectivity structure of the social networks of contributors and to investigate the effect of the different social tie structures on developers' overall productivity to OSS projects. We first analyze the general structure of the social networks, e.g., graph distances and the degree distribution of the social networks. Our analysis confirms that the social networks of OSS communities follow power-law degree distributions and exhibit small-world characteristics. However, the degree mixing pattern shows that high degree nodes tend to connect more with low degree nodes, suggesting collaborations between experts and newbie developers. Second, we study the correlation between graph degrees and the productivity of the contributors in terms of the amount of contribution and commitment to OSS projects. The analysis demonstrates evident influence of the social ties on the developers' overall productivity.

Navigational path privacy protection: navigational path privacy protection

Abstract: Navigational path query, one of the most popular location-based services (LBSs), determines a route from a source to a destination on a road network. However, issuing path queries to some non-trustworthy service providers may pose privacy threats to the users. For instance, given a query requesting for a path from a residential address to a psychiatrist, some adversaries may deduce "who is related to what disease". In this paper, we present an obfuscator framework that reduces the likelihood of path queries being revealed, while supporting different user privacy protection needs and retaining query evaluation efficiency. The framework consists of two major components, namely, an obfuscator and an obfuscated path query processor. The former formulates obfuscated path queries by intermixing true and fake sources and destinations and the latter facilitates efficient evaluation of the obfuscated path queries in an LBS server. The framework supports three types of obfuscated path queries, namely, independent obfuscated path query, shared obfuscated path query, and anti-collusion obfuscated path query. Our proposal strikes a balance between privacy protection strength and query processing overheads, while enhancing privacy protection against collusion attacks. Finally, we validate the proposed ideas and evaluate the performance of our framework based on an extensive set of empirical experiments.

EASE: an energy-efficient in-network storage scheme for object tracking in sensor networks

Abstract: Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain degree of imprecision in location data of tracked objects, this paper studies precision-constrained approximate queries that trade answer precision for energy efficiency. We develop an Energy-conserving Approximate StoragE (EASE) scheme to ef- ficiently answer approximate location queries by keeping error- bounded imprecise location data at some designated storage node. The data impreciseness is captured by a system parameter, i.e., approximation radius. We analyze the performance of EASE in terms of message complexity and derive the optimal setting of approximation radius. We show via extensive simulation experiments that, as compared to a conventional approach, the EASE scheme cuts down the network traffic by up to 96% and, in most cases, prolongs the network lifetime by a factor of 2�5. I. INTRODUCTION

Probabilistic Top-k query processing in distributed sensor networks

Abstract: In this paper, we propose the notion of sufficient set for distributed processing of probabilistic Top-k queries in cluster-based wireless sensor networks. Through the derivation of sufficient boundary, we show that data items ranked lower than sufficient boundary are not required for answering the probabilistic top-k queries, thus are subject to local pruning. Accordingly, we develop the sufficient set-based (SSB) algorithm for inter-cluster query processing. Experimental results show that the proposed algorithm reduces data transmissions significantly.

Friendship and mobility: user movement in location-based social networks

Abstract: Even though human movement and mobility patterns have a high degree of freedom and variation, they also exhibit structural patterns due to geographic and social constraints. Using cell phone location data, as well as data from two online location-based social networks, we aim to understand what basic laws govern human motion and dynamics. We find that humans experience a combination of periodic movement that is geographically limited and seemingly random jumps correlated with their social networks. Short-ranged travel is periodic both spatially and temporally and not effected by the social network structure, while long-distance travel is more influenced by social network ties. We show that social relationships can explain about 10% to 30% of all human movement, while periodic behavior explains 50% to 70%. Based on our findings, we develop a model of human mobility that combines periodic short range movements with travel due to the social network structure. We show that our model reliably predicts the locations and dynamics of future human movement and gives an order of magnitude better performance than present models of human mobility.

Temporal Networks

Abstract: A great variety of systems in nature, society and technology -- from the web of sexual contacts to the Internet, from the nervous system to power grids -- can be modeled as graphs of vertices coupled by edges The network structure, describing how the graph is wired, helps us understand, predict and optimize the behavior of dynamical systems In many cases, however, the edges are not continuously active As an example, in networks of communication via email, text messages, or phone calls, edges represent sequences of instantaneous or practically instantaneous contacts In some cases, edges are active for non-negligible periods of time: eg, the proximity patterns of inpatients at hospitals can be represented by a graph where an edge between two individuals is on throughout the time they are at the same ward Like network topology, the temporal structure of edge activations can affect dynamics of systems interacting through the network, from disease contagion on the network of patients to information diffusion over an e-mail network In this review, we present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems In the light of traditional network theory, one can see this framework as moving the information of when things happen from the dynamical system on the network, to the network itself Since fundamental properties, such as the transitivity of edges, do not necessarily hold in temporal networks, many of these methods need to be quite different from those for static networks