Chi Lin, Yanhong Zhou, Haipeng Dai, Jing Deng, Guowei Wu
{"title":"MPF: Prolonging Network Lifetime of Wireless Rechargeable Sensor Networks by Mixing Partial Charge and Full Charge","authors":"Chi Lin, Yanhong Zhou, Haipeng Dai, Jing Deng, Guowei Wu","doi":"10.1109/SAHCN.2018.8397138","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397138","url":null,"abstract":"Recently, wireless power transfer is emerging as an enabling technology of wireless rechargeable sensor networks. Conventional methods that charge each sensor until its battery is full take unproportionally long time to finish, due to the limitation of charging efficiency and power transfer technologies. In this paper, we propose a mixed partial and full charge (MPF) scheme, including three specialized modules, i.e., evaluation module, adjustment module, and selection module. MPF allows nodes to be replenished \"partially\" by a mobile charging vehicle (MCV). When executing adjustment module, a concept of power and path adjustment window is proposed for determining a proper power allocation scheme as well as charging path. Then a scheduling strategy termed return mechanism is designed to further utilize the energy of the MCV and improve effective energy utilization. Finally, we build a high-accuracy charging test-bed and evaluate the applicability as well as performance of the proposed scheme. For large-scale networks, we also perform simulations to demonstrate the effectiveness of MPF in promoting survival rate and reducing traveling distance of the MCV.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120993212","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":"Deadline-Aware Peer-to-Peer Task Offloading in Stochastic Mobile Cloud Computing Systems","authors":"Chongyu Zhou, C. Tham","doi":"10.1109/SAHCN.2018.8397142","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397142","url":null,"abstract":"By taking advantage of pervasive mobile devices and their pairwise encounters, Mobile Cloud Computing (MCC) offers an efficient solution for mobile devices to execute complex applications in a collaborative manner. In this paper, we consider the problem of distributed task offloading in MCC systems with deadline constraints. We propose an online distributed task offloading (DTO) algorithm for practical MCC systems where each mobile user can dynamically make offloading decisions to nearby mobile devices in order to process computation tasks in a collaborative manner. The DTO scheme is lightweight and fully distributed. Through rigorous theoretical analysis, we prove that the proposed DTO algorithm can meet the deadline constraints of the computation tasks and achieve a near-optimal system-wide utility. Furthermore, through real testbed experiments and trace-driven simulations, we compare the DTO scheme with several baseline methods and demonstrate its effectiveness.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122953036","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}
Chao Zhu, Giancarlo Pastor, Yu Xiao, Yong Li, Antti Ylä-Jääski
{"title":"Fog Following Me: Latency and Quality Balanced Task Allocation in Vehicular Fog Computing","authors":"Chao Zhu, Giancarlo Pastor, Yu Xiao, Yong Li, Antti Ylä-Jääski","doi":"10.1109/SAHCN.2018.8397129","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397129","url":null,"abstract":"Emerging vehicular applications, such as real-time situational awareness and cooperative lane change, demand for sufficient computing resources at the edge to conduct time-critical and data-intensive tasks. This paper proposes Fog Following Me (Folo), a novel solution for latency and quality balanced task allocation in vehicular fog computing. Folo is designed to support the mobility of vehicles, including ones generating tasks and the others serving as fog nodes. We formulate the process of task allocation across stationary and mobile fog nodes into a joint optimization problem, with constraints on service latency, quality loss, and fog capacity. As it is a NP-hard problem, we linearize it and solve it using Mixed Integer Linear Programming. To evaluate the effectiveness of Folo, we simulate the mobility of fog nodes at different times of day based on real-world taxi traces, and implement two representative tasks, including video streaming and real-time object recognition. Compared with naive and random fog node selection, the latency and quality balanced task allocation provided by Folo achieves higher performance. More specifically, Folo shortens the average service latency by up to 41% while reducing the quality loss by up to 60%.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131855539","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}
Xinjie Guan, Jia Yin, Xili Wan, Tianjing Wang, Guangwei Bai
{"title":"A Stackelberg Game Model for Dynamic Resource Scheduling in Edge Computing with Cooperative Cloudlets","authors":"Xinjie Guan, Jia Yin, Xili Wan, Tianjing Wang, Guangwei Bai","doi":"10.1109/SAHCN.2018.8397146","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397146","url":null,"abstract":"Aiming to minimize the operators' cost while preserving user experience, we propose a resource scheduling mechanism for cooperative cloudlets in edge computing with a centralized controller. The interactions between cloudlets and the controller are formulated as a two-stage Stackelberg game to determine the amount of physical resources assigned to each cloudlet during deployment phase and the price of resources shared among cooperated cloudlets during operation phase.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121621723","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}
Rui Zhou, Meng Hao, Xiang Lu, Mingjie Tang, Yang Fu
{"title":"Device-Free Localization Based on CSI Fingerprints and Deep Neural Networks","authors":"Rui Zhou, Meng Hao, Xiang Lu, Mingjie Tang, Yang Fu","doi":"10.1109/SAHCN.2018.8397121","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397121","url":null,"abstract":"Localization is of key importance to a variety of applications. Most previous approaches require the objects to carry electronic devices, while on many occasions device-free localization are in need. This paper proposes a device-free localization method based on WiFi Channel State Information (CSI) and Deep Neural Networks (DNN). In the area covered with WiFi, human movements may cause observable variations of WiFi signals. By analyzing the CSI fingerprint patterns and modelling the dependency between CSI fingerprints and locations through deep neural networks, the proposed method is able to estimate the objects' locations according to the measured CSI fingerprints through DNN regression. To cope with the noisy WiFi channels and remove the non-contributing information, the proposed method applies Density-Based Spatial Clustering of Applications with Noise (DBSCAN) to reduce the noise in the raw CSI data, and applies Principal Component Analysis (PCA) to extract the most contributing information in the CSI data. Evaluations in two representative scenarios achieved the mean distance error of 1.08 m and 1.50 m, respectively.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121947483","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}
Max Curran, Md. Shaifur Rahman, Himanshu Gupta, V. Sekar
{"title":"Rethinking Virtual Network Embedding in Reconfigurable Networks","authors":"Max Curran, Md. Shaifur Rahman, Himanshu Gupta, V. Sekar","doi":"10.1109/SAHCN.2018.8397143","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397143","url":null,"abstract":"The virtual network embedding (VNE) problem of mapping virtual network (VN) requests to a substrate network is a key component of network virtualization in datacenters. In a bid to improve datacenter network's performance and cost, there has been recent interest in \"reconfigurable\" network architectures, wherein the network topology can be changed at runtime to better handle current traffic patterns. Such reconfigurable networks seem naturally well-suited for efficient network virtualization- as networks can be \"tailored\" to accommodate the incoming VN requests. Motivated by the above, in this paper, we address the problem of virtual network embedding in reconfigurable networks; to the best of our knowledge, this has not been addressed before. In particular, we address the VNE problem in reconfigurable networks under two different models of VN link demands: fixed-bandwidth and stochastic-bandwidth demands. The former is the traditional model, while we propose the the latter to improve network utilization and leverage the runtime reconfiguration capability of reconfigurable networks. For the stochastic demand model, we employ a novel concept of embedding with \"runtime-binding\", wherein the embedding of a VN link is \"configured\" at runtime (via network reconfiguration) depending on the prevailing network state and traffic. We evaluate the efficiency of our proposed models and techniques via simulation using real VN requests and traffic statistics from large datacenters, and show that our proposed models and techniques offer significant performance advantages (up to 30-40%) over traditional models.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124823872","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":"On Designing Quality-Aware Steering Algorithms for Large-Scale Mobile Crowdsensing","authors":"Shuo Yang, Kunyan Han, Fan Wu, Guihai Chen","doi":"10.1109/SAHCN.2018.8397101","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397101","url":null,"abstract":"Mobile crowdsensing (MCS), as a novel and promising sensing paradigm, can utilize people's mobile devices to gather large amounts of data, such as environment information, traffic conditions, and human movements. The users of mobile crowdsensing are usually more capable than traditional sensors, and can reach locations that cannot be easily covered by static sensors, achieving more comprehensive coverage than traditional sensor networks. However, the uncertainty of the users' behaviors, as well as their uneven levels of qualities of contributed data, may also bring challenges to the coordination and supervision of mobile crowdsensing, causing the effectiveness of crowdsensing platform to significantly deviate from the theoretical optimum. In this paper, we address the users' uncertain behaviors by considering a quality- aware user steering problem, and propose to design user coordination algorithms so as to improve the mobile crowdsensing system's overall effectiveness. We jointly take two issues into account, i.e., data quality and coverage of sensing area, and propose a characterization of the system's effectiveness based on the two factors. Next, we consider optimizing the system's effectiveness in three different practical crowdsensing scenarios, and prove the NP-hardness of each of them. Given the infeasibility of calculating the global optimum in polynomial time, we propose three efficient algorithms to achieve suboptimal solutions to the three problems respectively. We extensively evaluate our proposed algorithms based on both real and synthetic datasets. The evaluation results show that our proposed algorithms can dramatically improve the crowdsensing system's effectiveness.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125565281","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":"Link Us if You Can: Enabling Unlinkable Communication on the Internet","authors":"Zhenbo Xu, Wei Yang, Yang Xu, Ajin Meng, Jianhua Liu, Qijian He, Liusheng Huang","doi":"10.1109/SAHCN.2018.8397144","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397144","url":null,"abstract":"For online conversations with top privacy, we often need to erase the existing contact behavior. Thus we want communications in which adversaries can not link you to the person you contact, namely communications with unlinkability. However, most current communication systems including variations of Mix networks fail to maintain unlinkability against global active adversaries (GAA) who can monitor global traffic and easily compromise clients and infrastructures. Therefore, designing an unlinkable communication system against GAA is challenging. By analyzing limitations of current communication systems, we propose two other features to assure unlinkability: covertness and deniability. In this paper, we design HTor, a novel and practical communication system with unlinkability, via a single web server. HTor interpolates the server to cut off the direct connection between two people in one communication and exploits covert channels (CCs) to hide communications between clients and the server. Considering servers might be corrupted, HTor utilizes a group mechanism to protect the receiver for each message. By extensive large-scale evaluations, we show that communications over HTor are robust and difficult to detect. Besides, HTor is easily implemented and, with multiple servers, it can provide enough bandwidth and relatively low latency for chatting.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128750429","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}
Yan Ding, Chao Chen, Xuefeng Xie, Kai Liu, Liang Feng
{"title":"An Online Trajectory Compression System Applied to Resource-Constrained GPS Devices in Vehicles","authors":"Yan Ding, Chao Chen, Xuefeng Xie, Kai Liu, Liang Feng","doi":"10.1109/SAHCN.2018.8397160","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397160","url":null,"abstract":"The raw vehicle trajectory data gathered by GPS devices is typically large and needs to be compressed online. However, GPS devices have limited resources, and cannot afford such burdensome task. To alleviate this issue, we design an online trajectory compression system consisting of Trajectory Mapping, Trajectory Compressing and Front-End Visualizer, which is implemented in the mobile phone to migrate the computation burdens. The proposed trajectory compression method does not need extra data during compressing suitable for online applications. Experiment results demonstrate our system has excellent performances regarding effectiveness, efficiency and so on.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126508526","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}
Songwei Fu, M. Ceriotti, Yuming Jiang, Chia-Yen Shih, Xintao Huan, P. Marrón
{"title":"An Approach to Detect Anomalous Degradation in Signal Strength of IEEE 802.15.4 Links","authors":"Songwei Fu, M. Ceriotti, Yuming Jiang, Chia-Yen Shih, Xintao Huan, P. Marrón","doi":"10.1109/SAHCN.2018.8397126","DOIUrl":"https://doi.org/10.1109/SAHCN.2018.8397126","url":null,"abstract":"Accurate detection of the channel quality degradation is crucial for applying effective remedial actions to ensure the reliability of IEEE 802.15.4 links. Without knowing the channel quality is degraded, remedial actions may lead to more packet losses, e.g., increasing transmission power may cause even more interference. In this work, we aim to detect the channel quality degradation that turns a good link into a bad one, based on the received signal strength of radio links. The detection should be accurate and robust to diverse channel characteristics and dynamic environmental changes. To achieve this, we propose RADIUS, a lightweight approach that lays its foundation on a thresholding technique based on Bayesian decision theory and combines it with techniques for adapting to environmental changes. Extensive evaluation of RADIUS on a testbed shows that the employed Bayes thresholding technique outperforms two relevant state-of-the-art thresholding techniques by providing a higher accuracy consistently for all links across the network. Besides, RADIUS is able to keep a low error rate of detection (5.78% on average) in a 72-hour experiment, adapting to environmental changes. Furthermore, we developed an exemplary application of RADIUS to show how an existing transmission power tuning scheme can benefit from using RADIUS as an accurate and robust trigger for taking remedial actions.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134266300","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}