Peng Guo, Xuefeng Liu, Tingfang Tang, Shaojie Tang, Jiannong Cao
{"title":"Practical Concurrent Wireless Charging Scheduling for Sensor Networks","authors":"Peng Guo, Xuefeng Liu, Tingfang Tang, Shaojie Tang, Jiannong Cao","doi":"10.1109/ICDCS.2016.33","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.33","url":null,"abstract":"In complex terrain where mobile chargers hardly move around, a feasible solution to charge wireless sensor networks (WSNs) is using multiple fixed chargers to charge WSNs concurrently with relative long distance. Due to the radio interference in the concurrent charging, it is needed to schedule the chargers so as to facilitate each sensor node to harvest sufficient energy quickly. The challenge lies that each charger's charging utility cannot be calculated (or even defined) independently due to the nonlinear superposition charging effect caused by the radio interference. In this paper, we model the concurrent radio charging, and formulate the concurrent charging scheduling problem (CCSP) whose objective is to design a scheduling algorithm for the chargers so as to minimize the time spent on charging each sensor node with at least energy E. We prove that CCSP is NP-hard, and propose a greedy algorithm based on submodular set cover problem. We also propose a genetic algorithm for CCSP. Simulation results show that the performance of the greedy CCSP algorithm is comparable to that of the genetic algorithm.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131360048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jianqiang Sun, Lei Xie, Qingliang Cai, Chuyu Wang, Jie Wu, Sanglu Lu
{"title":"RF-ISee: Identify and Distinguish Multiple RFID Tagged Objects in Augmented Reality Systems","authors":"Jianqiang Sun, Lei Xie, Qingliang Cai, Chuyu Wang, Jie Wu, Sanglu Lu","doi":"10.1109/ICDCS.2016.29","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.29","url":null,"abstract":"In this paper, we leverage RFID technology to label different objects with RFID tags, so as to realize the vision of \"show me what I see from the augmented reality system\". We deploy additional RFID antennas to the COTS depth camera and propose a continuous scanning-based scheme to scan the objects, i.e., the system continuously rotates and samples the depth of field and RF-signals from these tagged objects. In this way, we can accurately identify and distinguish multiple tagged objects, by pairing the tags with the objects according to the correlations between the depth of field and RF-signals. Our solution achieves an average match ratio of 91% in distinguishing up to dozens of tagged objects with a high deployment density.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126326222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Directional Beam Alignment for Millimeter Wave Cellular Systems","authors":"Jie Zhao, Xin Wang, H. Viswanathan","doi":"10.1109/ICDCS.2016.93","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.93","url":null,"abstract":"Transmission in millimeter wave (mmW) band has a big potential to provide orders of higher wireless bandwidth. To combat the high channel loss in high frequency band, beamforming is generally taken to transmit along the direction that provides the maximum transmission gain. This requires the MAC protocol to facilitate the finding of the optimal beamforming direction. Exiting protocol suggests the rotational channel measurement which may introduce high measurement cost, and compromise the transmission capacity. This paper presents a comprehensive design for more efficient directional beam alignment in mmW cellular networks. Instead of exhaustively searching all possible beamforming directions at the transmitter (TX) and the receiver (RX), our proposed scheme selects only a fairly small number of TX and RX beam pairs to facilitate effective beam alignment. To avoid long and resource-consuming exhaustive search, our scheme not only takes advantage of the low rank characteristics of the channel to estimate the full channel information with a small number of measurements, but also further exploits the channel estimation from initial measurements to guide the selection of future beam pairs for more effective measurements later. These strategies help to speed up the process of finding satisfactory beam pairs. We perform extensive simulations to evaluate the performance of our proposed schemes, and our results demonstrate our scheme can significantly outperform other schemes in terms of measurement effectiveness and cost efficiency.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131842548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Federation of Private IaaS Cloud Providers through the Barter of Resources","authors":"F. Brasileiro, E. Falcão","doi":"10.1109/ICDCS.2016.57","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.57","url":null,"abstract":"This paper presents the Fogbow middleware. This middleware addresses cloud federation challenges by providing an additional layer for federation a top each local private IaaS that wants to join the federation. It uses designed-to-federate, internet-friendly technologies like XMPP and it is flexible enough to deal with a wide range of cloud technologies, since it provides a plugin framework for allowing simpler interoperation with a wide range of orchestrators. The plugin framework is also useful to define the behaviour of each member of the federation, providing greater autonomy to these members. A lightweight business model based on barter has been implemented and provides a cheap way to federate small and medium size private IaaS cloud providers.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131869668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
T. He, N. Bartolini, Hana Khamfroush, InJung Kim, Liang Ma, T. L. Porta
{"title":"Service Placement for Detecting and Localizing Failures Using End-to-End Observations","authors":"T. He, N. Bartolini, Hana Khamfroush, InJung Kim, Liang Ma, T. L. Porta","doi":"10.1109/ICDCS.2016.21","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.21","url":null,"abstract":"We consider the problem of placing services in a telecommunication network in the presence of failures. In contrast to existing service placement algorithms that focus on optimizing the quality of service (QoS), we consider the performance of monitoring failures from end-to-end connection states between clients and servers, and investigate service placement algorithms that optimize the monitoring performance subject to QoS constraints. Based on novel performance measures capturing the coverage, the identifiability, and the distinguishability in monitoring failures, we formulate the service placement problem as a set of combinatorial optimizations with these measures as objective functions. In particular, we show that maximizing the distinguishability is equivalent to minimizing the uncertainty in failure localization. We prove that all these optimizations are NP-hard. However, we show that the objectives of coverage and distinguishability have a desirable property that allows them to be approximated to a constant factor by a greedy algorithm. We further show that while the identifiability objective does not have this property, it can be approximated by the maximumdistinguishability placement in the high-identifiability regime. Our evaluations based on real network topologies verify the effectiveness of the proposed algorithms in improving the monitoring performance compared with QoS-based service placement.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116581797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Routing and Scheduling of Social Influence Diffusion in Online Social Networks","authors":"Hui-Ju Hung, De-Nian Yang, Wang-Chien Lee","doi":"10.1109/ICDCS.2016.45","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.45","url":null,"abstract":"Owing to the rising popularity of online social networking services (OSNs), studies on social influence and its diffusion have received significant attention from the research community. Prior research has mostly studied the impact of single-hop influence diffusion and multi-hop influence broadcast in online social networks. Very little research explores the idea of guiding (routing) multi-hop social influence towards a specific target. In this paper, we motivate the needs of timely routing social influence to formulate a new optimization problem, namely, Routing And Scheduling of Target-Oriented Social Influence Diffusion (RAS-TOSID). Accordingly, we propose the Efficient Routing And Scheduling with Social and Temporal decOmposition (ERASSTO) algorithm, which finds the optimal solution to RAS-TOSID in polynomial time. We carry out a user study by implementing ERASSTO in Facebook and conduct a comprehensive evaluation on ERASSTO and alternative approaches by simulation. The result shows that ERASSTO significantly outperforms other algorithms regarding solution quality and computational efficiency.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132250622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yibo Wu, Yi Wang, Wenjie Hu, Xiaomei Zhang, G. Cao
{"title":"Resource-Aware Photo Crowdsourcing Through Disruption Tolerant Networks","authors":"Yibo Wu, Yi Wang, Wenjie Hu, Xiaomei Zhang, G. Cao","doi":"10.1109/ICDCS.2016.18","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.18","url":null,"abstract":"Photo crowdsourcing with smartphone has attracted considerable attention recently due to the prevalence of smartphones and the rich information provided by photos. In scenarios such as disaster recovery or battlefield, where the cellular network is partly damaged or severely overloaded, Disruption Tolerant Networks (DTNs) become the best way to deliver the crowdsourced photos. Since the bandwidth and storage resources in DTN are very limited and not enough to deliver all the crowdsourced photos, it is important to prioritize more valuable photos to use the limited resources. In this paper, we design a resource-aware photo crowdsourcing framework in DTN, which uses photo metadata including the smartphone's location, orientation, and other built-in camera's parameters, to estimate the value of photos. We propose a photo selection algorithm to maximize the value of photos delivered to the command center considering bandwidth and storage constraints. Both prototype implementation and trace-driven simulations demonstrate the effectiveness of our design.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125489820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Efficient Lock-Free Logarithmic Search Data Structure Based on Multi-dimensional List","authors":"Deli Zhang, D. Dechev","doi":"10.1109/ICDCS.2016.19","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.19","url":null,"abstract":"Logarithmic search data structures, such as search trees and skiplists, are fundamental building blocks of many applications. Although the self-balancing binary search trees are among the most ubiquitous sequential search data structures, designing non-blocking rebalancing algorithms is challenging due to the required structural alternation, which may stall other concurrent operations. Skiplists, which probabilistically create multiple levels of shortcuts in an ordered list, provide practical alternatives to balanced search trees. The use of skiplists eliminates the need of rebalancing and ensures amortized logarithmic sequential search time, but concurrency is limited under write-dominated workload because the linkage between multiple distant nodes must be updated. In this paper, we present a linearizable lock-free dictionary design based on a multi-dimensional list (MDList). A node in an MDList arranges its child nodes by their dimensionality and order them by coordinate prefixes. The search operation works by first generating a one-to-one mapping from the scalar keys to a high-dimensional vectors space, then uniquely locating the target position by using the vector as coordinates. Our algorithm guarantees worst-case search time of O(log N) where N is the size of key space. Moreover, the ordering property of the data structure is readily maintained during mutations without rebalancing nor randomization. In our experimental evaluation using a micro-benchmark, our dictionary outperforms the state of the art approaches by as much as 100% when the key universe is large and an average of 30% across all scenarios.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130314678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Randomized Load Balancing in Finite Regimes","authors":"Antonie S. Godtschalk, F. Ciucu","doi":"10.1109/ICDCS.2016.97","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.97","url":null,"abstract":"Randomized load balancing is a cost efficient policy for jobscheduling in parallel server queueing systems whereby, with everyincoming job, a central dispatcher randomly polls some servers andselects the one with the smallest queue. By exactly deriving thejobs' delay distribution in such systems, in explicit and closedform, Mitzenmacher [13] proved the so-called 'power-of-two' result, which states that the random polling of only two serversyields an exponential improvement in delay over randomly selectinga single server. Such a fundamental result, however, was obtainedin an asymptotic regime in the total number of servers, and doesdo not necessarily provide accurate estimates for practical finiteregimes with small or moderate number of servers. In this paper weobtain stochastic lower and upper bounds on the jobs' averagedelay in non-asymptotic/finite regimes, by extending ideas foranalyzing the particular case of the Join-the-Shortest-Queue (JSQ) policy. Numerical illustrations indicate not only that the (lower) bounds are remarkably accurate, but also that the asymptoticapproximation can be misleading in scenarios with a small numberof servers, and especially at very high utilizations.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129203459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient Resource Allocation and Consolidation with Selfish Agents: An Adaptive Auction Approach","authors":"Richard T. B. Ma","doi":"10.1109/ICDCS.2016.12","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.12","url":null,"abstract":"Through virtualization technologies, modern enterprises can build private clouds to support the daily operations of their subsidiaries and consolidate resources from them. In making these resource allocation and consolidation decisions, they want to maximize the achieved utilities and minimize the incurred costs by their subsidiaries, respectively. However, these subsidiaries very often operate autonomously and have private information about job characteristics and energy costs. Due to this information asymmetry, they might be motivated to behave in their own best interests rather than that of the enterprise. To solve these principal-agent problems, we design a tunable auction under which subsidiaries submit bids and resources are allocated in proportion to their bids. We show that the induced competition game obtains a unique Nash equilibrium, under which hidden characteristics of subsidiaries can be revealed. By using variational inequality techniques, we derive the dynamics of the Nash equilibrium as a function of the auction parameters. We design a feedback control mechanism to dynamically adjust the tunable auction parameters based on observable information such as the bids and the resulting allocations. We prove that our adaptive auction converges to the optimal Nash equilibrium under which the aggregate utility of an enterprise is maximized.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122502036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}