Pub Date : 2022-07-01DOI: 10.1109/ICDCS54860.2022.00067
Sri Pramodh Rachuri, Arun Gantasala, Prajeeth Emanuel, Anshul Gandhi, Robert Foley, Peter Puhov, Theo Gkountouvas, H. Lei
Resource disaggregation (RD) is an emerging paradigm for data center computing whereby resource-optimized servers are employed to minimize resource fragmentation and improve resource utilization. Apache Spark deployed under the RD paradigm employs a cluster of compute-optimized servers to run executors and a cluster of storage-optimized servers to host the data on HDFS. However, the network transfer from storage to compute cluster becomes a severe bottleneck for big data processing. Near-data processing (NDP) is a concept that aims to alleviate network load in such cases by offloading (or "pushing down") some of the compute tasks to the storage cluster. Employing NDP for Spark under the RD paradigm is challenging because storage-optimized servers have limited computational resources and cannot host the entire Spark processing stack. Further, even if such a lightweight stack could be developed and deployed on the storage cluster, it is not entirely obvious which Spark queries would benefit from pushdown, and which tasks of a given query should be pushed down to storage.This paper presents the design and implementation of a near-data processing system for Spark, SparkNDP, that aims to address the aforementioned challenges. SparkNDP works by implementing novel NDP Spark capabilities on the storage cluster using a lightweight library of SQL operators and then developing an analytical model to help determine which Spark tasks should be pushed down to storage based on the current network and system state. Simulation and prototype implementation results show that SparkNDP can help reduce Spark query execution times when compared to both the default approach of not pushing down any tasks to storage and the outright NDP approach of pushing all tasks to storage.
{"title":"Optimizing Near-Data Processing for Spark","authors":"Sri Pramodh Rachuri, Arun Gantasala, Prajeeth Emanuel, Anshul Gandhi, Robert Foley, Peter Puhov, Theo Gkountouvas, H. Lei","doi":"10.1109/ICDCS54860.2022.00067","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00067","url":null,"abstract":"Resource disaggregation (RD) is an emerging paradigm for data center computing whereby resource-optimized servers are employed to minimize resource fragmentation and improve resource utilization. Apache Spark deployed under the RD paradigm employs a cluster of compute-optimized servers to run executors and a cluster of storage-optimized servers to host the data on HDFS. However, the network transfer from storage to compute cluster becomes a severe bottleneck for big data processing. Near-data processing (NDP) is a concept that aims to alleviate network load in such cases by offloading (or \"pushing down\") some of the compute tasks to the storage cluster. Employing NDP for Spark under the RD paradigm is challenging because storage-optimized servers have limited computational resources and cannot host the entire Spark processing stack. Further, even if such a lightweight stack could be developed and deployed on the storage cluster, it is not entirely obvious which Spark queries would benefit from pushdown, and which tasks of a given query should be pushed down to storage.This paper presents the design and implementation of a near-data processing system for Spark, SparkNDP, that aims to address the aforementioned challenges. SparkNDP works by implementing novel NDP Spark capabilities on the storage cluster using a lightweight library of SQL operators and then developing an analytical model to help determine which Spark tasks should be pushed down to storage based on the current network and system state. Simulation and prototype implementation results show that SparkNDP can help reduce Spark query execution times when compared to both the default approach of not pushing down any tasks to storage and the outright NDP approach of pushing all tasks to storage.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127440710","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}
Pub Date : 2022-07-01DOI: 10.1109/ICDCS54860.2022.00105
Weipeng Zhuo, Ziqi Zhao, Ka Ho Chiu, Shiju Li, Sangtae Ha, Chul-Ho Lee, S. G. Gary Chan
We study the problem of floor identification for radiofrequency (RF) signal samples obtained in a crowdsourced manner, where the signal samples are highly heterogeneous and most samples lack their floor labels. We propose GRAFICS, a graph embedding-based floor identification system. GRAFICS first builds a highly versatile bipartite graph model, having APs on one side and signal samples on the other. GRAFICS then learns the low-dimensional embeddings of signal samples via a novel graph embedding algorithm named E-LINE. GRAFICS finally clusters the node embeddings along with the embeddings of a few labeled samples through a proximity-based hierarchical clustering, which eases the floor identification of every new sample. We validate the effectiveness of GRAFICS based on two large-scale datasets that contain RF signal records from 204 buildings in Hangzhou, China, and five buildings in Hong Kong. Our experiment results show that GRAFICS achieves highly accurate prediction performance with only a few labeled samples (96% in both micro- and macro-F scores) and significantly outperforms several state-of-the-art algorithms (by about 45% improvement in micro-F score and 53% in macro-F score).
{"title":"GRAFICS: Graph Embedding-based Floor Identification Using Crowdsourced RF Signals","authors":"Weipeng Zhuo, Ziqi Zhao, Ka Ho Chiu, Shiju Li, Sangtae Ha, Chul-Ho Lee, S. G. Gary Chan","doi":"10.1109/ICDCS54860.2022.00105","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00105","url":null,"abstract":"We study the problem of floor identification for radiofrequency (RF) signal samples obtained in a crowdsourced manner, where the signal samples are highly heterogeneous and most samples lack their floor labels. We propose GRAFICS, a graph embedding-based floor identification system. GRAFICS first builds a highly versatile bipartite graph model, having APs on one side and signal samples on the other. GRAFICS then learns the low-dimensional embeddings of signal samples via a novel graph embedding algorithm named E-LINE. GRAFICS finally clusters the node embeddings along with the embeddings of a few labeled samples through a proximity-based hierarchical clustering, which eases the floor identification of every new sample. We validate the effectiveness of GRAFICS based on two large-scale datasets that contain RF signal records from 204 buildings in Hangzhou, China, and five buildings in Hong Kong. Our experiment results show that GRAFICS achieves highly accurate prediction performance with only a few labeled samples (96% in both micro- and macro-F scores) and significantly outperforms several state-of-the-art algorithms (by about 45% improvement in micro-F score and 53% in macro-F score).","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127970144","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}
Pub Date : 2022-07-01DOI: 10.1109/ICDCS54860.2022.00070
Peter Zdankin, Marco Picone, M. Mamei, Torben Weis
Smart homes usually consist of smart objects (SOs) with limited resources and capabilities, and therefore constrain the complexity of applications that can be performed on them. In particular, updating smart objects within a smart home is a challenging undertaking, as seemingly insignificant updates affect the longevity of the deployment if they cause previously established dependencies to break. In this paper, we propose an architecture that we call Longevity Digital Twins (LDTs) as a strategic counterpart of SOs, aimed at running at the edge, as local to the smart home as possible. With this architecture, the capabilities of a SO can be virtually enhanced to support the software update process in the smart home. In this context, foresighted software management requires both a local capability to describe involved functionalities together with awareness about existing dependencies in this distributed system. Using a simulated smart home environment, we first measure the impact of conventional update strategies and then present the noticeable improvement that LDTs offer to this problem. Going further, we present the analysis of a real-world use case that showcases the potential of LDTs on how it could not only prevent the installation of breaking updates but also extend a SOs capabilities and its overall longevity.
{"title":"A Digital-Twin Based Architecture for Software Longevity in Smart Homes","authors":"Peter Zdankin, Marco Picone, M. Mamei, Torben Weis","doi":"10.1109/ICDCS54860.2022.00070","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00070","url":null,"abstract":"Smart homes usually consist of smart objects (SOs) with limited resources and capabilities, and therefore constrain the complexity of applications that can be performed on them. In particular, updating smart objects within a smart home is a challenging undertaking, as seemingly insignificant updates affect the longevity of the deployment if they cause previously established dependencies to break. In this paper, we propose an architecture that we call Longevity Digital Twins (LDTs) as a strategic counterpart of SOs, aimed at running at the edge, as local to the smart home as possible. With this architecture, the capabilities of a SO can be virtually enhanced to support the software update process in the smart home. In this context, foresighted software management requires both a local capability to describe involved functionalities together with awareness about existing dependencies in this distributed system. Using a simulated smart home environment, we first measure the impact of conventional update strategies and then present the noticeable improvement that LDTs offer to this problem. Going further, we present the analysis of a real-world use case that showcases the potential of LDTs on how it could not only prevent the installation of breaking updates but also extend a SOs capabilities and its overall longevity.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124899825","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}
Pub Date : 2022-07-01DOI: 10.1109/ICDCS54860.2022.00119
Chenxi Qiu, Sourabh Yadav, A. Squicciarini, Qing Yang, Song Fu, Juanjuan Zhao, Chengzhong Xu
To enable self-driving without a human driver, an autonomous vehicle needs to perceive its surrounding obstacles using onboard sensors, of which the perception accuracy might be limited by their own sensing range. An effective way to improve vehicles’ perception accuracy is to let nearby vehicles exchange their sensor data so that vehicles can detect obstacles beyond their own sensing ranges, called cooperative perception. The shared sensor data, however, might disclose the sensitive information of vehicles’ passengers, raising privacy and safety concerns (e.g. stalking or sensitive location leakage).In this paper, we propose a new data-sharing policy for the cooperative perception of autonomous vehicles, of which the objective is to minimize vehicles’ information disclosure without compromising their perception accuracy. Considering vehicles usually have different desires for data-sharing under different traffic environments, our policy provides vehicles autonomy to determine what types of sensor data to share based on their own needs. Moreover, given the dynamics of vehicles’ data-sharing decisions, the policy can be adjusted to incentivize vehicles’ decisions to converge to the desired decision field, such that a healthy cooperation environment can be maintained in a long term. To achieve such objectives, we analyze the dynamics of vehicles’ data-sharing decisions by resorting to the game theory model, and optimize the data-sharing ratio in the policy based on the analytic results. Finally, we carry out an extensive trace-driven simulation to test the performance of the proposed data-sharing policy. The experimental results demonstrate that our policy can help incentivize vehicles’ data-sharing decisions to the desired decision fields efficiently and effectively.
{"title":"Distributed Data-Sharing Consensus in Cooperative Perception of Autonomous Vehicles","authors":"Chenxi Qiu, Sourabh Yadav, A. Squicciarini, Qing Yang, Song Fu, Juanjuan Zhao, Chengzhong Xu","doi":"10.1109/ICDCS54860.2022.00119","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00119","url":null,"abstract":"To enable self-driving without a human driver, an autonomous vehicle needs to perceive its surrounding obstacles using onboard sensors, of which the perception accuracy might be limited by their own sensing range. An effective way to improve vehicles’ perception accuracy is to let nearby vehicles exchange their sensor data so that vehicles can detect obstacles beyond their own sensing ranges, called cooperative perception. The shared sensor data, however, might disclose the sensitive information of vehicles’ passengers, raising privacy and safety concerns (e.g. stalking or sensitive location leakage).In this paper, we propose a new data-sharing policy for the cooperative perception of autonomous vehicles, of which the objective is to minimize vehicles’ information disclosure without compromising their perception accuracy. Considering vehicles usually have different desires for data-sharing under different traffic environments, our policy provides vehicles autonomy to determine what types of sensor data to share based on their own needs. Moreover, given the dynamics of vehicles’ data-sharing decisions, the policy can be adjusted to incentivize vehicles’ decisions to converge to the desired decision field, such that a healthy cooperation environment can be maintained in a long term. To achieve such objectives, we analyze the dynamics of vehicles’ data-sharing decisions by resorting to the game theory model, and optimize the data-sharing ratio in the policy based on the analytic results. Finally, we carry out an extensive trace-driven simulation to test the performance of the proposed data-sharing policy. The experimental results demonstrate that our policy can help incentivize vehicles’ data-sharing decisions to the desired decision fields efficiently and effectively.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132056413","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}
Pub Date : 2022-07-01DOI: 10.1109/ICDCS54860.2022.00103
Jiachen Wang, Tianyu Zhang, Dawei Shen, Xiao Hu, Song Han
Industrial wireless networks (IWNs) are being increasingly deployed in the field to serve as the network fabrics for various industrial Internet-of-Things (IIoT) applications. Given that IWNs typically operate in noisy and harsh environments, frequently occurring network dynamics post huge challenges for IWN resource management especially when the network scales up. Existing centralized and distributed network management solutions either suffer from large communication overhead and time delay, or introduce schedule collisions which unnecessarily degrade the system performance. To address these problems, this work proposes a novel HierArchical Resource Partitioning framework (HARP), to provide dynamic resource management in IWNs. By hierarchically partitioning and allocating resources for the links in the network, HARP enables distributed collision-free resource allocation. HARP enables rapid adjustment of the partitions in the presence of network dynamics with modest communication overhead. The effectiveness of HARP is validated and evaluated through both simulation studies and testbed experiments on a 50-node multi-channel multi-hop 6TiSCH network.
{"title":"HARP: Hierarchical Resource Partitioning in Dynamic Industrial Wireless Networks","authors":"Jiachen Wang, Tianyu Zhang, Dawei Shen, Xiao Hu, Song Han","doi":"10.1109/ICDCS54860.2022.00103","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00103","url":null,"abstract":"Industrial wireless networks (IWNs) are being increasingly deployed in the field to serve as the network fabrics for various industrial Internet-of-Things (IIoT) applications. Given that IWNs typically operate in noisy and harsh environments, frequently occurring network dynamics post huge challenges for IWN resource management especially when the network scales up. Existing centralized and distributed network management solutions either suffer from large communication overhead and time delay, or introduce schedule collisions which unnecessarily degrade the system performance. To address these problems, this work proposes a novel HierArchical Resource Partitioning framework (HARP), to provide dynamic resource management in IWNs. By hierarchically partitioning and allocating resources for the links in the network, HARP enables distributed collision-free resource allocation. HARP enables rapid adjustment of the partitions in the presence of network dynamics with modest communication overhead. The effectiveness of HARP is validated and evaluated through both simulation studies and testbed experiments on a 50-node multi-channel multi-hop 6TiSCH network.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134012584","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}
Pub Date : 2022-07-01DOI: 10.1109/ICDCS54860.2022.00055
Shengzhong Liu, Tianshi Wang, Hongpeng Guo, Xinzhe Fu, P. David, Maggie B. Wigness, Archan Misra, T. Abdelzaher
This paper presents a real-time multi-view scheduling framework for DNN-based live video analytics at the edge to minimize frame processing latency. The work is motivated by applications where a higher frame rate is important, not to miss actions of interest. Examples include defense, border security, and intruder detection applications where sensors (in this paper, cameras) are deployed to monitor key roads, chokepoints, or passageways to identify events of interest (and intervene in real-time). Supporting a higher frame rate entails lowering frame processing latency. We assume that multiple cameras are deployed with partially overlapping views. Each camera has access to limited onboard computing capacity. Many targets cross the field of view of these cameras (but the great majority do not require action). We take advantage of the spatial-temporal correlations among multi-camera video streams to perform target-to-camera assignment such that the maximum frame processing time across cameras is minimized. Specifically, we use a data-driven approach to identify objects seen by multiple cameras, and propose a batch-aware latency-balanced (BALB) scheduling algorithm to drive the object-to-camera assignment. We empirically evaluate the proposed system with a real-world surveillance dataset on a testbed consisting of multiple NVIDIA Jetson boards. The results show that our system substantially improves the video processing speed, attaining multiplicative speedups of 2.45× to 6.85×, and consistently outperforms the competitive static region partitioning strategy.
{"title":"Multi-View Scheduling of Onboard Live Video Analytics to Minimize Frame Processing Latency","authors":"Shengzhong Liu, Tianshi Wang, Hongpeng Guo, Xinzhe Fu, P. David, Maggie B. Wigness, Archan Misra, T. Abdelzaher","doi":"10.1109/ICDCS54860.2022.00055","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00055","url":null,"abstract":"This paper presents a real-time multi-view scheduling framework for DNN-based live video analytics at the edge to minimize frame processing latency. The work is motivated by applications where a higher frame rate is important, not to miss actions of interest. Examples include defense, border security, and intruder detection applications where sensors (in this paper, cameras) are deployed to monitor key roads, chokepoints, or passageways to identify events of interest (and intervene in real-time). Supporting a higher frame rate entails lowering frame processing latency. We assume that multiple cameras are deployed with partially overlapping views. Each camera has access to limited onboard computing capacity. Many targets cross the field of view of these cameras (but the great majority do not require action). We take advantage of the spatial-temporal correlations among multi-camera video streams to perform target-to-camera assignment such that the maximum frame processing time across cameras is minimized. Specifically, we use a data-driven approach to identify objects seen by multiple cameras, and propose a batch-aware latency-balanced (BALB) scheduling algorithm to drive the object-to-camera assignment. We empirically evaluate the proposed system with a real-world surveillance dataset on a testbed consisting of multiple NVIDIA Jetson boards. The results show that our system substantially improves the video processing speed, attaining multiplicative speedups of 2.45× to 6.85×, and consistently outperforms the competitive static region partitioning strategy.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878071","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}
Pub Date : 2022-07-01DOI: 10.1109/ICDCS54860.2022.00058
Jialin Zhang, Xiang Huang, Jingao Xu, Yue Wu, Q. Ma, Xin Miao, Li Zhang, Peng Chen, Zhengxin Yang
Accurate and real-time instance segmentation on mobile devices enables a wide spectrum of applications such as augmented reality, context-aware inspection and environ-mental cognition. However, the computation resource demanded by instance segmentation impedes its deployment on resource-constrained commercial mobile devices. Prior studies enable smartphones to conduct computational-intensive tasks in real-time with the assistance of an edge server. However, simply applying an edge-assisted framework hardly achieves delightful segmentation performance due to the movements of devices and targets, pixel-level precision requirements, and huge computational overhead even for edge nodes. This work proposes edgeIS, an edge-assisted system that enables real-time and accurate instance segmentation on mobile devices. edgeIS embraces the mobile device sensing ability of surroundings and its own motion, and redesigns an innovative mobile-edge collaboration paradigm suitable for segmentation tasks. We implement edgeIS on a lightweight edge node and different mobile devices. Extensive experiments are conducted under four datasets. The results show that edgeIS can run on mobile devices in real-time and achieve a 0.92 segmentation IoU, outperforming existing state-of-the-art solutions. We further embed edgeIS in an AR-based inspection system deployed in an oil field and the performance of edgeIS meets the demand of the industrial scenario.
{"title":"Edge Assisted Real-time Instance Segmentation on Mobile Devices","authors":"Jialin Zhang, Xiang Huang, Jingao Xu, Yue Wu, Q. Ma, Xin Miao, Li Zhang, Peng Chen, Zhengxin Yang","doi":"10.1109/ICDCS54860.2022.00058","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00058","url":null,"abstract":"Accurate and real-time instance segmentation on mobile devices enables a wide spectrum of applications such as augmented reality, context-aware inspection and environ-mental cognition. However, the computation resource demanded by instance segmentation impedes its deployment on resource-constrained commercial mobile devices. Prior studies enable smartphones to conduct computational-intensive tasks in real-time with the assistance of an edge server. However, simply applying an edge-assisted framework hardly achieves delightful segmentation performance due to the movements of devices and targets, pixel-level precision requirements, and huge computational overhead even for edge nodes. This work proposes edgeIS, an edge-assisted system that enables real-time and accurate instance segmentation on mobile devices. edgeIS embraces the mobile device sensing ability of surroundings and its own motion, and redesigns an innovative mobile-edge collaboration paradigm suitable for segmentation tasks. We implement edgeIS on a lightweight edge node and different mobile devices. Extensive experiments are conducted under four datasets. The results show that edgeIS can run on mobile devices in real-time and achieve a 0.92 segmentation IoU, outperforming existing state-of-the-art solutions. We further embed edgeIS in an AR-based inspection system deployed in an oil field and the performance of edgeIS meets the demand of the industrial scenario.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124368775","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}
One-hop multicasting (OHM) of high-volume sensor data is essential for cooperative autonomous driving applications. While millimeter-Wave (mmWave) bands can be utilized for high-bandwidth OHM data transmission, it is very challenging for individual vehicles to find and communicate with a proper neighbor in a fully distributed and highly dynamic scenario. In this paper, we propose a fully distributed OHM scheme in vehicular networks, called mmV2V, which consists of three highly integrated protocols. Specifically, synchronized vehicles first conduct a probabilistic neighbor discovery procedure, in which randomly divided transmitters (or receivers) clockwise scan (or listen to) the surroundings in pace with heterogeneous Tx (or Rx) beams. In this way, the vast majority of neighbors can be identified in a few repeated rounds. Furthermore, vehicles negotiate with each of their neighbors about the optimal communication schedule in evenly distributed slots. Finally, each agreed pair of neighboring vehicles start high data rate transmissions with refined beams. We conduct extensive simulations and the results demonstrate that mmV2V can achieve a high completion ratio in rigid OHM tasks under various traffic conditions.
{"title":"mmV2V: Combating One-hop Multicasting in Millimeter-wave Vehicular Networks","authors":"Jiangang Shen, Hongzi Zhu, Yunxiang Cai, Bangzhao Zhai, Xudong Wang, Shan Chang, Haibin Cai, M. Guo","doi":"10.1109/ICDCS54860.2022.00076","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00076","url":null,"abstract":"One-hop multicasting (OHM) of high-volume sensor data is essential for cooperative autonomous driving applications. While millimeter-Wave (mmWave) bands can be utilized for high-bandwidth OHM data transmission, it is very challenging for individual vehicles to find and communicate with a proper neighbor in a fully distributed and highly dynamic scenario. In this paper, we propose a fully distributed OHM scheme in vehicular networks, called mmV2V, which consists of three highly integrated protocols. Specifically, synchronized vehicles first conduct a probabilistic neighbor discovery procedure, in which randomly divided transmitters (or receivers) clockwise scan (or listen to) the surroundings in pace with heterogeneous Tx (or Rx) beams. In this way, the vast majority of neighbors can be identified in a few repeated rounds. Furthermore, vehicles negotiate with each of their neighbors about the optimal communication schedule in evenly distributed slots. Finally, each agreed pair of neighboring vehicles start high data rate transmissions with refined beams. We conduct extensive simulations and the results demonstrate that mmV2V can achieve a high completion ratio in rigid OHM tasks under various traffic conditions.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125354727","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}
Pub Date : 2022-07-01DOI: 10.1109/ICDCS54860.2022.00023
T. Hardin, D. Kotz
Blockchain technology is heralded for its ability to provide transparent and immutable audit trails for data shared among semi-trusted parties. With the addition of smart contracts, blockchains can track and verify arbitrary computations – which enables blockchain users to verify the provenance of information derived from data through the blockchain. This provenance comes at the cost of data confidentiality and user privacy, however, which is unacceptable for many sensitive applications. The need for verifiable yet confidential data sharing and computation has led some to add trusted execution environment (TEE) hardware to blockchain platforms. By moving sensitive operations (e.g., data decryption and analysis) off of the blockchain and into a TEE, they get both the confidentiality of TEEs and the transparency of blockchains without the need to completely trust any one party in the data-sharing ecosystem.In this paper, we build on our TEE-enabled blockchain data-sharing system, Amanuensis, to ensure the freshness of access-control lists shared between the blockchain and TEE, and to improve the privacy of users interacting within the system. We also detail how TEE-based remote attestation help us to achieve information provenance – specifically, how to achieve information provenance in the context of the Intel SGX trusted execution environment. Finally, we present an evaluation of our system, in which we test several real-world machine-learning applications (logistic regression, kNN, SVM) to determine the run-time overhead of information confidentiality and provenance. Each machine-learning program exhibited a slowdown between 1.1 and 2.8x when run inside of our confidential environment, and took an average of 59 milliseconds to verify the provenance of an input data set.
{"title":"Amanuensis: provenance, privacy, and permission in TEE-enabled blockchain data systems","authors":"T. Hardin, D. Kotz","doi":"10.1109/ICDCS54860.2022.00023","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00023","url":null,"abstract":"Blockchain technology is heralded for its ability to provide transparent and immutable audit trails for data shared among semi-trusted parties. With the addition of smart contracts, blockchains can track and verify arbitrary computations – which enables blockchain users to verify the provenance of information derived from data through the blockchain. This provenance comes at the cost of data confidentiality and user privacy, however, which is unacceptable for many sensitive applications. The need for verifiable yet confidential data sharing and computation has led some to add trusted execution environment (TEE) hardware to blockchain platforms. By moving sensitive operations (e.g., data decryption and analysis) off of the blockchain and into a TEE, they get both the confidentiality of TEEs and the transparency of blockchains without the need to completely trust any one party in the data-sharing ecosystem.In this paper, we build on our TEE-enabled blockchain data-sharing system, Amanuensis, to ensure the freshness of access-control lists shared between the blockchain and TEE, and to improve the privacy of users interacting within the system. We also detail how TEE-based remote attestation help us to achieve information provenance – specifically, how to achieve information provenance in the context of the Intel SGX trusted execution environment. Finally, we present an evaluation of our system, in which we test several real-world machine-learning applications (logistic regression, kNN, SVM) to determine the run-time overhead of information confidentiality and provenance. Each machine-learning program exhibited a slowdown between 1.1 and 2.8x when run inside of our confidential environment, and took an average of 59 milliseconds to verify the provenance of an input data set.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"2019 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121396822","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}
Pub Date : 2022-07-01DOI: 10.1109/ICDCS54860.2022.00132
Jagnyashini Debadarshini, S. Saha
An efficient Home Area Network (HAN) acts as a base of an Advanced Metering Infrastructure (AMI). A HAN not only facilitates AMI with efficient real-time monitoring of the electricity consumption but also manages the load profile of the whole system. However, the existing works on implementing HAN are mostly centralized and suffer from well-known problems. In this work, we propose an IoT-based efficient decentralized strategy using synchronous transmission to practically realize HAN. An inter-device coordination strategy is proposed to minimize the peak load as well as reduce the sudden changes in the overall system without compromising the user’s requirements. Through experiments over IoT-testbeds, we demonstrate that the proposed strategy can reduce the peak load upto 50% and reduce the load variations upto 58% for even a high and random rate of requests for execution of power-hungry house appliances.
{"title":"Collaborative Load Management in Smart Home Area Network","authors":"Jagnyashini Debadarshini, S. Saha","doi":"10.1109/ICDCS54860.2022.00132","DOIUrl":"https://doi.org/10.1109/ICDCS54860.2022.00132","url":null,"abstract":"An efficient Home Area Network (HAN) acts as a base of an Advanced Metering Infrastructure (AMI). A HAN not only facilitates AMI with efficient real-time monitoring of the electricity consumption but also manages the load profile of the whole system. However, the existing works on implementing HAN are mostly centralized and suffer from well-known problems. In this work, we propose an IoT-based efficient decentralized strategy using synchronous transmission to practically realize HAN. An inter-device coordination strategy is proposed to minimize the peak load as well as reduce the sudden changes in the overall system without compromising the user’s requirements. Through experiments over IoT-testbeds, we demonstrate that the proposed strategy can reduce the peak load upto 50% and reduce the load variations upto 58% for even a high and random rate of requests for execution of power-hungry house appliances.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"385 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124781237","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：