IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第9页

PGA: A Priority-aware Genetic Algorithm for Task Scheduling in Heterogeneous Fog-Cloud Computing 基于优先级感知的异构雾云任务调度遗传算法

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484436

Farooq Hoseiny, S. Azizi, M. Shojafar, Fardin Ahmadiazar, R. Tafazolli

{"title":"PGA: A Priority-aware Genetic Algorithm for Task Scheduling in Heterogeneous Fog-Cloud Computing","authors":"Farooq Hoseiny, S. Azizi, M. Shojafar, Fardin Ahmadiazar, R. Tafazolli","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484436","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484436","url":null,"abstract":"Fog-Cloud computing has become a promising platform for executing Internet of Things (IoT) tasks with different requirements. Although the fog environment provides low latency due to its proximity to IoT devices, it suffers from resource constraints. This is vice versa for the cloud environment. Therefore, efficiently utilizing the fog-cloud resources for executing tasks offloaded from IoT devices is a fundamental issue. To cope with this, in this paper, we propose a novel scheduling algorithm in fog-cloud computing named PGA to optimize the multi-objective function that is a weighted sum of overall computation time, energy consumption, and percentage of deadline satisfied tasks (PDST). We take the different requirements of the tasks and the heterogeneous nature of the fog and cloud nodes. We propose a hybrid approach based on prioritizing tasks and a genetic algorithm to find a preferable computing node for each task. The extensive simulations evaluate our proposed algorithm to demonstrate its superiority over the state-of-the-art strategies.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124665157","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}

引用次数: 15

Combating Distance Limitation in Sub-Terahertz Frequency Band for Physical Layer Security in UAV Communications 亚太赫兹频段距离限制对无人机通信物理层安全的影响

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484560

A. Alali, D. Rawat

引用次数: 7

Measurement Analysis of Co-occurrence Degree of Web Objects Web对象共现度的测量分析

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484587

N. Kamiyama, Kouki Sakurai, A. Nakao

{"title":"Measurement Analysis of Co-occurrence Degree of Web Objects","authors":"N. Kamiyama, Kouki Sakurai, A. Nakao","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484587","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484587","url":null,"abstract":"As a technique to reduce the web response time, HTTP/2 and HTTP/3 have been standardized. However, parallel download in these techniques is possible only for web objects which are provided from the identical object server, so many web objects need to be downloaded from a small number of object servers to improve the effect of HTTP/2 and HTTP/3. To deliver web objects, CDNs delivering objects from cache servers located near requesting users have been widely used. Hence, if we define the co-occurrence degree as the number of webpages in which an object set is included, it is desirable to replace cached objects so that object sets with high co-occurrence degree are remained in the cache. However, the effectiveness of replacing objects based on the co-occurrence degree strongly depends on how the co-occurrence phenomenon of objects appears in the actual webpages. Therefore, in this paper, to clarify the potential of cache replacement based on the co-occurrence degree, we investigate how much the co-occurrence phenomena of objects are observed in actual webpages by measuring the most popular 7,604 webpages. We confirm that the distribution of co-occurrence degree of objects obeys a power law, and the co-occurrence degrees of about 0.01% two-objects sets and 0.001% three-object sets exceed 500. Hence, we confirm the potential of cache replacement based on the co-occurrence degree of objects.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124575333","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

Sensing Quality Constrained Packet Rate Optimization via Multi-UAV Collaborative Compression and Relay 基于多无人机协同压缩中继的感知质量约束分组速率优化

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484626

Kaitao Meng, Xiaofan He, Deshi Li, Mingliu Liu, Chan Xu

{"title":"Sensing Quality Constrained Packet Rate Optimization via Multi-UAV Collaborative Compression and Relay","authors":"Kaitao Meng, Xiaofan He, Deshi Li, Mingliu Liu, Chan Xu","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484626","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484626","url":null,"abstract":"Due to the on-demand deployable and flexible-observation features, unmanned aerial vehicles (UAVs) is considered as one of the key enabling techniques in next-generation sensing systems. In many sensing applications (e.g., disaster rescue and environment monitoring), a single UAV is not sufficient to fulfill the requirements of transmission delay and sensing quality. Considering this, a multi-UAV collaborative compression and relaying scheme is proposed in this work. The sensory data is packed according to the sensing quality requirement and the sensory data packet rate can be maximized to improve the freshness of the sensory data. To tackle the non-convex problem of finding the optimal compression ratios and UAVs locations with packet rate maximization, the considered problem is converted into a monotonic optimization (MO) by deriving the closed-form expression of the optimal compression ratio for given UAV locations. Then, by exploiting the inherent structure of the optimal UAV locations, a novel region-elimination-based fast location search algorithm is proposed, which can effectively avoid unnecessary search and achieve a substantially faster convergence as compared to the standard MO algorithm. Besides, numerical simulations are conducted to validate the effectiveness of the proposed scheme.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130887503","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}

引用次数: 3

Optimal Channel Sharing assisted Multi-user Computation Offloading via NOMA 最优信道共享通过NOMA辅助多用户计算卸载

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484644

Tianshun Wang, Yang Li, Yuan Wu, L. Qian, Lin Bin, Weijia Jia

{"title":"Optimal Channel Sharing assisted Multi-user Computation Offloading via NOMA","authors":"Tianshun Wang, Yang Li, Yuan Wu, L. Qian, Lin Bin, Weijia Jia","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484644","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484644","url":null,"abstract":"Computation offloading via mobile edge computing (MEC) has been considered as one of the promising paradigms for enabling computation-intensive yet latency-sensitive services on resource-limited mobile terminals in future wireless systems. In this paper, we propose a channel sharing assisted multi-user computation offloading in MEC via non-orthogonal multiple access (NOMA), in which a group of edge-computing users (EUs) form a NOMA-group and further reuse the cellular user’s (CU’s) channel for computation-offloading transmission. Specifically, we formulate a joint optimization of the EUs’ offloaded workloads, NOMA-transmission duration, as well as the processing-rate allocations (for different EUs) at the edge computing server (ECS), with the objective of minimizing the overall latency for all EUs to complete their tasks. In spite of the non-convexity of the joint optimization, we identify the structural feature of the optimal offloading solution and propose a layered-algorithm for finding the solution efficiently. Numerical results are provided to validate the effectiveness of our proposed algorithm as well as the advantage of our multi-user offloading scheme via NOMA.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130908717","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}

引用次数: 1

Resource Allocation for Heterogeneous Traffic with Power Consumption Constraints 具有功耗约束的异构业务资源分配

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484575

Emmanouil Fountoulakis, N. Pappas, A. Ephremides

引用次数: 0

A Mobile Edge Computing Framework for Task Offloading and Resource Allocation in UAV-assisted VANETs 一种用于无人机辅助vanet任务卸载和资源分配的移动边缘计算框架

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484643

Yixin He, D. Zhai, Ruonan Zhang, Jianbo Du, G. Aujla, Haotong Cao

{"title":"A Mobile Edge Computing Framework for Task Offloading and Resource Allocation in UAV-assisted VANETs","authors":"Yixin He, D. Zhai, Ruonan Zhang, Jianbo Du, G. Aujla, Haotong Cao","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484643","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484643","url":null,"abstract":"In this paper, we propose a mobile edge computing (MEC)-enabled unmanned aerial vehicle (UAV)-assisted vehicular ad hoc networks (VANETs) architecture, based on which a number of vehicles are served by UAVs equipped with computation resource. Each vehicle has to offload its computing tasks to the proper MEC server on UAV due to the limited computation power. To counter the problems above, we first model and analyze the transmission model from the vehicle to the MEC server on UAV and the task computation model of the local vehicle and the edge UAV. Then, the problem is formulated as a multi-objective optimization problem by jointly considering the MEC selection, the resource allocation, and task offloading. For tackling this hard problem, we decouple the multi-objective optimization problem as two subproblems and propose an efficient iterative algorithm to jointly make the MEC selection decision based on the criteria of load balancing and optimize the offloading ratio and the computation resource according to the Lagrangian dual decomposition. Finally, the simulation results demonstrate that our proposed algorithm achieves significant performance superiority as compared with other schemes in terms of the successful task processing ratio.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126667011","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}

引用次数: 4

Decentralized Max-Min Resource Allocation for Monotonic Utility Functions 单调效用函数的分散最大最小资源分配

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484502

S. Wu, Xi Peng, Guangjian Tian

{"title":"Decentralized Max-Min Resource Allocation for Monotonic Utility Functions","authors":"S. Wu, Xi Peng, Guangjian Tian","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484502","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484502","url":null,"abstract":"We consider a decentralized solution to max-min resource allocation for a multi-agent system. Limited resources are allocated to the agents in a network, each of which has a utility function monotonically increasing in its allocated resource. We aim at finding the allocation that maximizes the minimum utility among all agents. Although the problem can be easily solved with a centralized algorithm, developing a decentralized algorithm in absence of a central coordinator is challenging. We show that the decentralized max-min resource allocation problem can be nontrivially transformed to a canonical decentralized optimization. By using the gradient tracking technique in the decentralized optimization, we develop a decentralized algorithm to solve the max-min resource allocation. The algorithm converges to a solution at a linear convergence rate (in a log-scale) for strongly monotonic and Lipschitz continuous utility functions. Moreover, the algorithm is privacy-preserving since the agents only transmit encoded utilities and allocated resource to their intermediate neighbors. Numerical simulations show the advantage of our problem reformulation and validate the theoretical convergence result.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126611037","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}

引用次数: 2

Demonstrating Physical Layer Security Via Weighted Fractional Fourier Transform 用加权分数傅里叶变换证明物理层的安全性

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484444

Xiaojie Fang, Xinyu Yin, Ning Zhang, X. Sha, Hongli Zhang, Zhu Han

引用次数: 3

Secure Sharing of Spatio-Temporal Data through Name-based Access Control 基于名称访问控制的时空数据安全共享

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484557

Laqin Fan, Lan Wang

引用次数: 0