Sanglu Lu

Nanjing University, Nan-ching, Jiangsu Sheng, China

Are you Sanglu Lu?

Claim your profile

Publications (141)74.58 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: Offloading cellular traffic through mobile social networks has arisen as a promising way for relieving cellular networks. Prior studies mainly focused on caching data in a number of pre-selected helpers. However, such a strategy would fail when mobile users enter and leave the target area over time. In this paper, we examine the research decisions and design tradeoffs that arise when offloading cellular traffic in such a dynamic area of interest, referred to as a MobiArea, and we design an offloading framework, MobiCache, for maximizing cellular operators’ revenues and minimizing the overhead imposed on mobile devices. On the user side, we propose a content floating-based cooperative caching strategy that caches data in geographical floating circles, instead of selected helpers in previous studies, to cope with the dynamics. A geographical routing scheme is designed for delivering data and queries towards floating circles. We also develop a cache replacement scheme to improve caching cost-effectiveness inside floating circles. On the operator side, query history and feedback are maintained for cellular operators to optimize framework parameters that maximize their revenues. Extensive trace-driven simulations show that, compared with a state-of-the-art scheme, MobiCache offloads up to 52% more traffic with 15% shorter delay and 6% less forwarding cost.
    Computer Networks 03/2015; 83. DOI:10.1016/j.comnet.2015.03.011 · 1.28 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: As a supporting technology for most pervasive applications, indoor localization and navigation has attracted extensive attention in recent years. Conventional solutions mainly leverage techniques like WiFi, cellular network etc. to effectively locate the user for indoor localization and navigation. In this paper, we investigate the problem of indoor navigation by using the RFID-based delay tolerant network. Different from the previous work, we aim to efficiently locate and navigate to a specified mobile user who is continuously moving within the indoor environment. As the low-cost RFID tags are widely deployed inside the indoor environment and acting as landmarks, the mobile users can actively interrogate the surrounding tags with devices like smart phones and leave messages or traces to the tags. These messages or traces can be carried and forwarded to more tags by other mobile users. In this way, the RFID-based infrastructure forms a delay tolerant network. By using the crowd-sourcing technology in RFID-based delay tolerant network, we respectively propose a framework, namely CrowdSensing, to schedule the tasks and manage the resources in the network. We further propose a navigation algorithm to locate and navigate to the moving target. We verify the performance of proposed framework and navigation algorithm on mobility model built on real-world human traceset. Experiment results show that our solution can efficiently reduce the average searching time for indoor navigation.
    Journal of Network and Computer Applications 03/2015; 52. DOI:10.1016/j.jnca.2015.02.010 · 1.77 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: While mobility is the inherent cause of resource poverty and low connectivity in wireless environment, it also enables the opportunity for surrounding sensing, therefor providing mobilityaugmented cloud service becomes the key challenge for the emerging paradigm of Mobile Cloud Computing (MCC). This article provides an overview of the mechanisms and open issues for mobility-augmented service provisioning in MCC. We first outline the concept, system architecture, and taxonomy of research issues. Then we introduce three key mechanisms with respect to mobility augmentation, heterogeneous network convergence and mobile service provisioning. Moreover, we discuss the open challenges to reveal the future direction of MCC.
    IEEE Communications Magazine 03/2015; 53(3):89-97. DOI:10.1109/MCOM.2015.7060487 · 4.46 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the increasing number of location-dependent applications, positioning and tracking a mobile device becomes more and more important to enable pervasive and context-aware service. While extensive research has been performed in physical localization and logical localization for satellite, GSM and WiFi communication networks where fixed reference points are densely-deployed, positioning and tracking techniques in a sparse disruption tolerant network (DTN) have not been well addressed. In this paper, we propose a decentralized cooperative method called PulseCounting for DTN localization and a probabilistic tracking method called ProbTracking to confront this challenge. PulseCounting evaluates the user walking steps and movement orientations using accelerometer and electronic compass equipped in cellphones. It estimates user location by accumulating the walking segments, and improves the estimation accuracy by exploiting the encounters of mobile nodes. Several methods to refine the location estimation are discussed, which include the adjustment of trajectory based on reference points and the mutual refinement of location estimation for encountering nodes based on maximum-likelihood. To track user movement, the proposed ProbTracking method uses Markov chain to describe movement patterns and determines the most possible user walking trajectories without full record of user locations. We implemented the positioning and tracking system in Android phones and deployed a testbed in the campus of Nanjing University. Extensive experiments are conducted to evaluate the effectiveness and accuracy of the proposed methods, which show an average deviation of 9m in our system compared to GPS.
    IEEE Transactions on Parallel and Distributed Systems 02/2015; 26(2):382-391. DOI:10.1109/TPDS.2014.2310471 · 2.17 Impact Factor
  • IEEE Transactions on Mobile Computing 01/2015; DOI:10.1109/TMC.2015.2395426 · 2.91 Impact Factor
  • IEEE Transactions on Parallel and Distributed Systems 01/2015; DOI:10.1109/TPDS.2015.2425403 · 2.17 Impact Factor
  • IEEE Transactions on Computers 01/2015; DOI:10.1109/TC.2015.2435792 · 1.47 Impact Factor
  • Yafeng Yin, Lei Xie, Jie Wu, Sanglu Lu
    IEEE Transactions on Computers 01/2015; DOI:10.1109/TC.2015.2435749 · 1.47 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Many studies have presented the order sense results of information transmission capacity and packet delivery delay in mobile ad hoc networks (MANETs). To achieve the fundamental understanding of MANETs, we focus on deriving the closed-form expressions of the network capacity and end-to-end delay. A MANET with the generalized correlated mobility model is considered in this paper, where the mobility of nodes clustered in one group is confined within a specified area, and multiple groups move uniformly across the network. We also leverage limited packet redundancy to speed up the packet transmission, i.e., each source node is allowed to distribute at most f copies of each packet in its delivery process. Specifically, we first propose an effective multi-hop scheduling-routing scheme under the correlated mobility model, and then develop the closed-form expressions of both per node throughput capacity and expected end-to-end delay. We further explore the tradeoff between throughput capacity and packet delay by using packet redundancy f. The simulation studies validate our theoretical results.
    IEEE Transactions on Parallel and Distributed Systems 11/2014; 25(11):2829-2839. DOI:10.1109/TPDS.2014.2298014 · 2.17 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The research breakthrough on the hardware implementation of wireless full-duplex transmission has attracted significant interests on building full-duplex wireless networks in recent years. However, due to the asymmetry of real traffic flows, it is challenging to improve the network performance by effectively utilizing the full-duplex capacity. In this paper, we investigate the transmission delay minimization problem of full-duplex WLANs under ad-hoc mode. We first derive a lower bound of the total transmission delay and then propose a relay-based cooperative schedule scheme named CR-Mechanism, via exploiting eligible full-duplex communication opportunities. Our theoretical analysis shows that it achieves such lower bound with a polynomial-time complexity. Furthermore, the closed-form expressions of the expectation of totaly delay, time saving and transmission cost of CR-Mechanism are also derived. The extensive experimental results confirm that CR-Mechanism is an optimal scheduling algorithm with better performance than conventional mechanisms under different traffic models.
    Journal of Network and Computer Applications 11/2014; 46:407-417. DOI:10.1016/j.jnca.2014.07.013 · 1.77 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In cognitive radio networks (CRNs), a wireless user with primary access right on a channel (called primary user) has prioritized access to the channel and the user with secondary access right (called secondary user) can use the channel when the primary user is idle. Spectrum auction has emerged as a promising approach to address the access allocation problem in CRNs. A significant challenge in designing such auction is providing truthfulness to avoid market manipulation. In most previous work, the primary access rights on channels are pre-determined before the auction and bidders can only compete for the secondary access rights. However, a user's requirement on spectrum access rights relies on their QoS demands. Therefore, it is much desirable to allocate spectrum access rights on the basis of QoS demands as well as to exploit the resulting spatial spectrum reuse opportunities. To solve this problem, we propose TRUMP, a truthful spectrum auction mechanism, by taking into consideration both QoS demands and spectrum spatial reuse, which can drastically improve spectrum utilization. The theoretical analysis proves that TRUMP achieves truthfulness and individual rationality with polynomial-time complexity. Our extensive simulation results show that our proposals outperform previous work in terms of both social welfare and spectrum utilization.
    IEEE Transactions on Parallel and Distributed Systems 10/2014; 25(10):2499-2508. DOI:10.1109/TPDS.2013.226 · 2.17 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the rapid proliferation of RFID technologies, RFID has been introduced to the applications like safety inspection and warehouse management. Conventionally a number of deployment rules are specified for these applications. This paper studies a practically important problem of rule checking over RFID tags, i.e., checking whether the specified rules are satisfied according to the RFID tags within the monitoring area. This rule checking function may need to be executed frequently over a large number of tags and therefore should be made efficient in terms of execution time. Aiming to achieve time efficiency, we respectively propose two protocols, CRCP and ECRCP. CRCP works based on collision detection, while ECRCP combines the collision detection and the logical features of the rules. Simulation results indicate that our protocols achieve much better performance than other solutions in terms of time efficiency.
    Conference on Mobile and Ubiquitous Systems (MobiQuitous); 08/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: Motivated by various applications in mobile ad-hoc networks (MANETs) that require nodes to share their individual information to each other, we study the multi-message dissemination problem in a MANET, which is to distribute multiple messages to all mobile nodes in the network in parallel. The objective is to minimize the stopping time, i.e., the time taking for all nodes to receive a copy of the whole messages. We consider an intrinsically one-sided protocol based on random linear network coding (RLNC), where all packets forwarded are in the form of random linear combinations of packets received so far. Its supreme performance is demonstrated theoretically for two cases, low mobility and high mobility, according to the node velocity. In particular, we show that, under general settings, our derived upper bounds of the stopping time match the established lower bound in both cases, although the effects of mobility in the two cases are significantly different. Thus, we conclude that RLNC achieves order optimality for fast information dissemination in MANETs.
    IEEE Transactions on Parallel and Distributed Systems 07/2014; 25(7):1841-1851. DOI:10.1109/TPDS.2013.275 · 2.17 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the rapid proliferation of RFID-based applications, RFID tags have been deployed into pervasive spaces in increasingly large numbers, e.g., the shelves of super markets are filled with tag-labeled items. Conventional localization schemes usually leverage precise anchor nodes to help compute the position of objects. However, it is usually difficult to find or deploy enough anchor nodes for accurate localization. In this paper, we propose solutions to locate the mobile users based on imprecise anchors in RFID systems. A large number of tags with approximate locations are used as anchor nodes to compute the user's locations. We thus present a time-efficient localization scheme to continuously tracking the mobile users. Experimental results indicate that our solutions can accurately locate the mobile users in a real-time approach. The improved method's accuracy is more than 30% better than the base solution.
    ICC 2014 - 2014 IEEE International Conference on Communications; 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: Data storage has become an important issue for energy efficient data management in sensor networks. In this paper, we investigate the optimized storage placement problem in large scale sensor networks, aiming to achieve minimized energy cost. In order to efficiently deal with large scale deployment areas with irregular shape, we propose to utilize the hop as the computation unit instead of the node, such that computation complexity can be greatly reduced. We propose methodologies to solve the optimization problem both in situations for limited and unlimited numbers of storage units. The ultimate goal of this paper is to give fundamental guidance for optimized storage placement in large scale sensor networks. Simulation results show that our methodologies can greatly reduce the overall energy consumption compared to other strategies.
    Frontiers of Computer Science (print) 06/2014; 8(3):409-425. DOI:10.1007/s11704-014-2278-8 · 0.41 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In today's data center networks, incast congestion happens when multiple servers send data to one receiver simultaneously. Such congestion results in long idle periods of transmission, which significantly delays the mission complete time (MCT). In this paper, we introduce the MIP, a simple distributed scheme at sender side to Minimize the Idle Periods. To this end, MIP increases the concurrency of data transmission by using proactive fair rate control and cut down idle period further by carefully selected RT O. Extensive simulations show that MIP is able to provide near-optimal MCT performance. In particular, MIP requires no modification to OS kernel or switches in current data center networks.
    ICC 2014 - 2014 IEEE International Conference on Communications; 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: Today's public cloud providers typically deploy their small sized data centers in multiple geographically different locations, so as to improve data center power usage effectiveness and locate resources closer to users. A major challenge is resource allocation. Many results have been reported regarding this issue from the perspectives of virtual machine consolidation, network-aware virtual machine placement, traffic engineering, dynamic capacity provisioning, and so on. However, there has not been any focus on stable resource allocations, where no resource request or data center has any migration incentives. To the best of our knowledge, this paper is the first attempt at gaining a better understanding of the structure of the Stable rEsource Allocation (SEA) problem. We introduce a formal problem statement and develop two algorithms for the 1-dimensional (1-D) and 2-D cases, respectively. Simulation results show that the proposed algorithms have good scalability and convergence.
    ICC 2014 - 2014 IEEE International Conference on Communications; 06/2014
  • Lei Xie, Hao Han, Qun Li, Jie Wu, Sanglu Lu
    [Show abstract] [Hide abstract]
    ABSTRACT: Collecting histograms over RFID tags is an essential premise for effective aggregate queries and analysis in large-scale RFID-based applications. In this paper we consider efficient collection of histograms from the massive number of RFID tags without the need to read all tag data. We first consider the problem of basic histogram collection and propose an efficient algorithm based on the idea of ensemble sampling. We further consider the problems of advanced histogram collection, respectively, with an iceberg query and a top-k query. Efficient algorithms are proposed to tackle the above problems such that the qualified/unqualified categories can be quickly identified. Experiment results indicate that our ensemble sampling-based solutions can achieve a much better performance than the basic estimation/identification schemes.
    IEEE INFOCOM 2014 - IEEE Conference on Computer Communications; 04/2014
  • Xin Li, Jie Wu, Shaojie Tang, Sanglu Lu
    [Show abstract] [Hide abstract]
    ABSTRACT: As tenants take networked virtual machines (VMs) as their requirements, effective placement of VMs is needed to reduce the network cost in cloud data centers. The cost is one of the major concerns for the cloud providers. In addition to the cost caused by network traffics (N-cost), the cost caused by the utilization of physical machines (PM-cost) is also non-negligible. In this paper, we focus on the optimized placement of VMs to minimize the cost, the combination of N-cost and PM-cost. We define N-cost by various functions, according to different communication models. We formulate the placement problem, and prove it to be NP-hard. We investigate the problem from two aspects. Firstly, we put a special emphasis on minimizing the N-cost with fixed PM-cost. For the case that tenants request the same amount of VMs, we present optimal algorithms under various definitions of N-cost. For the case that tenants require different numbers of VMs, we propose an approximation algorithm. Also, a greedy algorithm is implemented as the baseline to evaluate the performance. Secondly, we study the general case of the VM placement problem, in which both N-cost and PM-cost are taken into account. We present an effective binary-search-based algorithm to determine how many PMs should be used, which makes a tradeoff between PM-cost and N-cost. For all of the algorithms, we conduct theoretical analysis and extensive simulations to evaluate their performance and efficiency.
    IEEE INFOCOM 2014 - IEEE Conference on Computer Communications; 04/2014

Publication Stats

399 Citations
74.58 Total Impact Points

Institutions

  • 2004–2015
    • Nanjing University
      • • State Key Laboratory for Novel Software Technology
      • • Department of Computer Science & Technology
      Nan-ching, Jiangsu Sheng, China
  • 2012
    • Nanjing Institute of Technology
      Nan-ching-hsü, Jiangxi Sheng, China
  • 2011
    • College of William and Mary
      • Department of Computer Science
      Williamsburg, VA, United States
    • Temple University
      • Department of Computer and Information Science
      Philadelphia, PA, United States
  • 2009
    • The University of Aizu
      • School of Computer Science and Engineering
      Fukushima-shi, Fukushima-ken, Japan
  • 2008
    • The University of Hong Kong
      • Department of Computer Science
      Hong Kong, Hong Kong
  • 2000
    • University of Queensland
      Brisbane, Queensland, Australia