发布求助
文献互助 智能选刊 最新文献

2023 IEEE Symposium on Computers and Communications (ISCC)最新文献

筛选
英文 中文
Deep Reinforcement Learning for Joint Service Placement and Request Scheduling in Mobile Edge Computing Networks 移动边缘计算网络中联合服务布局和请求调度的深度强化学习
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10217876
Yuxuan Deng, Xiuhua Li, Chuan Sun, Jinlong Hao, Xiaofei Wang, Victor C. M. Leung
{"title":"Deep Reinforcement Learning for Joint Service Placement and Request Scheduling in Mobile Edge Computing Networks","authors":"Yuxuan Deng, Xiuhua Li, Chuan Sun, Jinlong Hao, Xiaofei Wang, Victor C. M. Leung","doi":"10.1109/ISCC58397.2023.10217876","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10217876","url":null,"abstract":"Mobile edge computing aims to provide cloud-like services on edge servers located near Mobile Devices (MDs) with higher Quality of Service (QoS). However, the mobility of MDs makes it difficult to find a global optimal solution for the coupled service placement and request scheduling problem. To address these issues, we consider a three-tier MEC network with vertical and horizontal cooperation. Then we formulate the joint service placement and request scheduling problem in a mobile scenario with heterogeneous services and resource limits, and convert it into two Markov decision processes to decouple decisions across successive time slots. We propose a Cyclic Deep Q-network-based Service placement and Request scheduling (CDSR) framework to find a long-term optimal solution despite future information unavailability. Specifically, to solve the issue of enormous action space, we decompose the system agent and train them cyclically. Evaluation results demonstrates the effectiveness of our proposed CDSR on user-perceived QoS.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130541175","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}
引用次数: 0
How Does Oversampling Affect the Performance of Classification Algorithms? 过采样如何影响分类算法的性能?
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218099
Zhizheng Xiang, Yingying Xu, Zhenzhou Tang
{"title":"How Does Oversampling Affect the Performance of Classification Algorithms?","authors":"Zhizheng Xiang, Yingying Xu, Zhenzhou Tang","doi":"10.1109/ISCC58397.2023.10218099","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218099","url":null,"abstract":"To address the issue of imbalanced datasets classification, this study explores how different oversampling algorithms and imbalance ratios affect the performance of classification algorithms. Two oversampling algorithms, including random oversampling and Synthetic Minority Oversampling Technique (SMOTE), are used to adjust the imbalance ratio of the training dataset to 999:1, 99:1, 9:1, 3:1, and 1:1. Four classification methods, including the Convolutional Neural Network, Vision Transformer, XGBoost and CatBoost, are evaluated using performance metrics such as precision, recall, AUC, and F2-Score. We conduct more than 240 experiments and observe that oversampling ratio has a significant positive impact on AUC and recall rate, but a negative impact on precision. The study also identifies the best oversampling algorithm and imbalance ratio for each classification algorithm. It is noteworthy that the Vision Transformer algorithm used in this study has not been employed in previous research on imbalanced data classification.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124668041","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}
引用次数: 0
Subcarrier-Index Modulation for OFDM-based PLC Systems 基于ofdm的PLC系统的子载波指数调制
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10217844
A. Omri, Javier Hernandez Fernandez, Roberto Di Pietro
{"title":"Subcarrier-Index Modulation for OFDM-based PLC Systems","authors":"A. Omri, Javier Hernandez Fernandez, Roberto Di Pietro","doi":"10.1109/ISCC58397.2023.10217844","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10217844","url":null,"abstract":"In this paper, we investigate and evaluate the performances of a subcarrier-index modulation (SIM) technique within an orthogonal frequency division multiplexing (OFDM)-based narrow-band (NB)-power line communication (PLC) system. The SIM technique has been proposed and used mainly in wireless communications to enhance energy and spectral efficiencies. To evaluate the advantages of this technique in PLC, Monte Carlo simulations were performed using field measurements of PLC noise and channel frequency response (CFR). The results show significant advantages in terms of improving the overall system energy and spectral efficiencies, especially for single-level modulation. For instance, when using the SIM-OFDM technique, with a binary phase-shift keying (BPSK) modulation, an energy gain of 66.66% and a bit gain of 50%, with respect to the standard modulation, can be observed.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116544168","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}
引用次数: 0
Refinement and Verification for IoT Service Composition 物联网服务组合的细化与验证
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218287
Sarah Hussein Toman, Lazhar Hamel, Mohamed Graiet
{"title":"Refinement and Verification for IoT Service Composition","authors":"Sarah Hussein Toman, Lazhar Hamel, Mohamed Graiet","doi":"10.1109/ISCC58397.2023.10218287","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218287","url":null,"abstract":"Internet of Things (IoT) is a finite set of interconnected devices that can cooperate and interact with each other through the Internet. As the number of IoT devices have increased, the number of services increased as well, further complicating the process of service composition. In this paper, an Event-B formal model is presented to verify the correctness of the IoT service composition (IoTSC) system. In addition, the proposed model satisfies some functional and non-functional properties such as compatibility and availability to fulfil the requirements of the IoTSC. Our model is developed incrementally from abstract level to target level by using the refinement mechanism. A Fire Alarm Detection System is used as a case study for our model. Finally, we use proof obligations and the Rodin platform to validate and proof the correctness of the proposed formal model.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121470733","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}
引用次数: 0
Quick Notification of Block Generation Using Bloom Filter in a Blockchain 在区块链中使用Bloom过滤器生成块的快速通知
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218308
Tsuyoshi Hasegawa, Akira Sakurai, Kazuyuki Shudo
{"title":"Quick Notification of Block Generation Using Bloom Filter in a Blockchain","authors":"Tsuyoshi Hasegawa, Akira Sakurai, Kazuyuki Shudo","doi":"10.1109/ISCC58397.2023.10218308","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218308","url":null,"abstract":"Forks in a blockchain sacrifice security. In this paper, we propose a protocol for quickly propagating block generation notifications in the blockchain network quickly to reduce the fork rate. Block generation notifications contain a Bloom filter that represents transactions in the generated block. Thus, when nodes receive a block generation notification, they can start mining the next block. In experiments in which a simulator is used, we compared the propagation time of a block generation notification with that of a block in the existing protocol. As a result, the propagation time of the 50 %ile is 41.1 % of an existing protocol, the 90 %ile is 39.2 % of the existing protocol, and the fork rate calculated from the average propagation time is 40.8 % of the existing protocol.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115082346","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}
引用次数: 0
RVDSE: Efficient Result Verifiable Searchable Encryption in Redactable Blockchain RVDSE:可读区块链中有效的结果可验证可搜索加密
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218106
Ruizhong Du, Na Liu, Mingyue Li, Junfeng Tian
{"title":"RVDSE: Efficient Result Verifiable Searchable Encryption in Redactable Blockchain","authors":"Ruizhong Du, Na Liu, Mingyue Li, Junfeng Tian","doi":"10.1109/ISCC58397.2023.10218106","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218106","url":null,"abstract":"To solve the inefficiencies, inflexibility in updates, and high storage costs associated with current result verifiable searchable encryption schemes, we propose an efficient scheme that result verifiable dynamic searchable encryption in a redactable blockchain (RVDSE). By dividing the inverted index into blocks, uploading corresponding verification tags to the blockchain, and using smart contracts to verify query results, we improve query and verification performance. Additionally, we employ blockchain rewriting technology to update tags in the result checklist, thereby improving blockchain data update performance and scalability while maintaining constant storage overhead. Security analysis confirms that our solution guarantees query result accuracy and completeness. Experimental results demonstrate that our approach enhances query and result verification efficiency, even with low-speed blockchain data scale growth, particularly as data collection scales increase.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116462364","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}
引用次数: 0
Optimal Walks in Contact Sequence Temporal Graphs with No Zero Duration Cycle 无零周期接触序列时间图的最优行走
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218173
Anuj Jain, S. Sahni
{"title":"Optimal Walks in Contact Sequence Temporal Graphs with No Zero Duration Cycle","authors":"Anuj Jain, S. Sahni","doi":"10.1109/ISCC58397.2023.10218173","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218173","url":null,"abstract":"We develop an algorithm to find walks in contact sequence temporal graphs that have no cycle whose duration is zero. These walks minimize any specified linear combination of optimization criteria such as arrival time, travel duration, hops, and cost. The algorithm also accommodates waiting time constraints. When min and max waiting time constraints are specified, the complexity of our algorithm is $O(vert Vvert +vert Evertdelta)$, where $vert Vvert$ is the number of vertices, $vert Evert$ is the number of edges, and $delta$ is the maximum out-degree of a vertex in the contact sequence temporal graph. When there are no maximum waiting time constraints, the complexity of our algorithm is $O(vert Vvert +vert Evert)$. On the test data used by Bentert et al., our optimal walks algorithm provides a speedup of up to 77 over the algorithm of Bentert et al. [1] and a memory reduction of up to 3.2.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130884918","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}
引用次数: 0
Asynchronous and Heterogeneous Wake-Up Schedules for IoT Neighbor Communication 物联网邻居通信的异步和异构唤醒调度
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218191
Alexandre F. Cardoso, C. Albuquerque, Cledson de Souza, D. Passos
{"title":"Asynchronous and Heterogeneous Wake-Up Schedules for IoT Neighbor Communication","authors":"Alexandre F. Cardoso, C. Albuquerque, Cledson de Souza, D. Passos","doi":"10.1109/ISCC58397.2023.10218191","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218191","url":null,"abstract":"For Internet of Things devices, one of the main power demands comes from the radio interfaces. Hence, duty cycling, i.e., activating and deactivating the radio, becomes essential to energy savings. In asynchronous scenarios, scheduled-based duty cycle methods stand out for their low deployment cost. Recently, the literature reports many studies on asymmetric scheduled-based methods — i.e., different nodes operating under different duty cycles. In this work we propose an extension of this concept: the heterogeneous duty cycling. It allows nodes to operate under schedules generated by distinct methods, resulting in a wider range of duty cycle choices and also a better coexistence between devices from different manufactures. In particular, we study which combinations of methods present the rotation closure property, and what are the average and maximum latencies for those pairs. We also show that heterogeneous duty cycling can improve performance if schedules are properly selected.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133960466","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}
引用次数: 0
Formal Modeling and Verification of ERC Smart Contracts: Application to NFT ERC智能合约的形式化建模与验证:在NFT中的应用
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218105
Rim Ben Fekih, Mariem Lahami, M. Jmaiel, Salma Bradai
{"title":"Formal Modeling and Verification of ERC Smart Contracts: Application to NFT","authors":"Rim Ben Fekih, Mariem Lahami, M. Jmaiel, Salma Bradai","doi":"10.1109/ISCC58397.2023.10218105","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218105","url":null,"abstract":"Blockchain-based applications are basically built on smart contracts, which are widely different in regards of the encoded logic and the used standards. When talking about Ethereum standards, ERC-721 is a well-known standard interface developed for Non-Fungible Tokens. Even though it is standard-based contracts that are more and more exploited, prior work on smart contracts verification mostly investigates efforts in regards of specific vulnerabilities. To address this gap, this paper introduces a formal modeling and verification approach for Ethereum smart contracts including the standard-based ones. We propose a model checking framework that, according to a Solidity smart contract provided as an input, uses ERC guidelines as a standard template to extract the related security properties. Another added benefit of our proposal consists on modeling ERC contracts using the extended finite state machine formalism. As a proof of concept, we illustrate our model checking approach through an NFT contract.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"58 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134388701","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}
引用次数: 0
When Robotics Meets Distributed Learning: the Federated Learning Robotic Network Framework 当机器人遇到分布式学习:联邦学习机器人网络框架
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218022
Roberto Marino, Lorenzo Carnevale, M. Villari
{"title":"When Robotics Meets Distributed Learning: the Federated Learning Robotic Network Framework","authors":"Roberto Marino, Lorenzo Carnevale, M. Villari","doi":"10.1109/ISCC58397.2023.10218022","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218022","url":null,"abstract":"Federated Learning (FL) is a cutting-edge technology for distributed solving of large-scale problems using local data exclusively. The potential of Federated Learning is nowadays clear in different context from automatic analysis of healthcare data to object recognition in video sources coming from public video streams, from distributed search for data breach and finance frauds to collaborative learning of hand typing on mobile phone. Multi-robot systems can also largely benefit from FL concerning resolution of problems like trajectory prediction, non colliding trajectory generation, distributed localization and mapping or distributed reinforcement learning. In this paper we propose a multi-robot framework that includes distributed learning capabilities by using Decentralized Stochastic Gradient Descent on graphs. First of all we motivate the position of the paper discussing the privacy preserving problem for multi robot systems and the need of decentralized learning. Then we build our methodology starting from a set of prior definitions. Finally we discuss in details the possible applications in robotics field.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132119669","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}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信