GLOBECOM 2022 - 2022 IEEE Global Communications Conference最新文献

Energy Saving on Constrained 12-Leads Real-Time ECG Monitoring 约束12导联实时心电监护的节能研究

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10001012

Hebatalla Ouda, Abeer A. Badawi, H. Hassanein, Khalid Elgazzar

{"title":"Energy Saving on Constrained 12-Leads Real-Time ECG Monitoring","authors":"Hebatalla Ouda, Abeer A. Badawi, H. Hassanein, Khalid Elgazzar","doi":"10.1109/GLOBECOM48099.2022.10001012","DOIUrl":"https://doi.org/10.1109/GLOBECOM48099.2022.10001012","url":null,"abstract":"Continuous real-time electrocardiogram (ECG) monitoring can detect arrhythmia and provide early warning for heart attacks. Effective power management signals and controlling the mode of operation to reduce the need for full fidelity ECG signal. This work studies the impact of the base-delta compression technique for different cardiac conditions on power consummation. It also aims to evaluate operational strategies and their effect on the battery life when the ECG patch can switch between different operating modes (e.g., varying the number of leads according to the cardiac conditions). We use a binary classifier to inform the decision of switching between different operational strategies. Both scenarios are evaluated in terms of execution time, Bluetooth Low Energy (BLE) communication airtime, power consumption, and energy-saving ratios on a Texas Instruments CC2650 Micro-controller Unit (MCU). We compare the performance of the base-delta compression and changing the mode of operation scenarios on various cardiac abnormalities. Performance evaluation shows that operational strategies outperforms data compression in power saving for normal ECG readings by a double fold. In contrast, operational strategies incurs an additional overhead of 1011 ms during an abnormal status. However, base-delta satisfies the embedded platform constraints on execution time and airtime with 25 ms and 20 ms, respectively in the MCU environment.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115412315","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

Scheduler Design for Mobility-aware Multipath QUIC 基于移动性感知的多路径QUIC调度程序设计

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10001247

Wenjun Yang, Lin X. Cai, Shengjie Shu, Jianping Pan

引用次数: 1

Distributed Massive MIMO Cooperation With Low-Dimensional CSI Exchange 分布式大规模MIMO合作与低维CSI交换

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10001298

Zhenyao He, Wei Xu, Hong Shen, Yan Sun, X. You, Jiewei Fu

{"title":"Distributed Massive MIMO Cooperation With Low-Dimensional CSI Exchange","authors":"Zhenyao He, Wei Xu, Hong Shen, Yan Sun, X. You, Jiewei Fu","doi":"10.1109/GLOBECOM48099.2022.10001298","DOIUrl":"https://doi.org/10.1109/GLOBECOM48099.2022.10001298","url":null,"abstract":"The trend of developing distributed multiple-input multiple-output (MIMO) cooperation has been growing for future wireless networks due to its potential of capacity improvement through network-level precoding. In massive MIMO applications, the overhead of channel state information (CSI) exchange among distributed transmitters is too large to make it possible in practical implementations. In this paper, we consider a cooperative multicell massive MIMO network with distributed regularized zero-forcing (RZF) precoding at each base station (BS), where a novel CSI exchange scheme is devised to reduce the interactive overhead. As a key finding of this work, we theoretically prove that it suffices to share the Gram matrix of local CSI among the cooperative BSs in order to achieve the same performance as a centralized cooperative MIMO network using the RZF precoding with global CSI sharing. The CSI exchange from each BS is thus reduced to a symmetric matrix that has a much smaller size than the full CSI and the amount of CSI exchange does NOT grow with the large number of antennas in massive MIMO. Specifically, based on the exchanged Gram matrices, we derive a decentralized RZF precoding design at each BS and develop both the optimal and suboptimal cooperative power allocation strategies, which achieve different performance and complexity tradeoffs. A virtual centralized power allocation is accomplished at each BS and the performance achieved by the proposed decentralized precoding is the same as the centralized benchmark scheme with full CSI exchange. These superiorities of the proposed schemes are verified through simulation results.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123163724","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

Robust Semantic Transmission of Images with Generative Adversarial Networks 基于生成对抗网络的图像鲁棒语义传输

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10000735

Qi He, Haohan Yuan, Daquan Feng, Bo Che, Zhi Chen, X. Xia

引用次数: 2

Sparsification and Optimization for Energy-Efficient Federated Learning in Wireless Edge Networks 无线边缘网络中节能联邦学习的稀疏化与优化

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10001623

Lei Lei, Yaxiong Yuan, Yang Yang, Yu Luo, Lina Pu, S. Chatzinotas

{"title":"Sparsification and Optimization for Energy-Efficient Federated Learning in Wireless Edge Networks","authors":"Lei Lei, Yaxiong Yuan, Yang Yang, Yu Luo, Lina Pu, S. Chatzinotas","doi":"10.1109/GLOBECOM48099.2022.10001623","DOIUrl":"https://doi.org/10.1109/GLOBECOM48099.2022.10001623","url":null,"abstract":"Federated Learning (FL), as an effective decentral-ized approach, has attracted considerable attention in privacy-preserving applications for wireless edge networks. In practice, edge devices are typically limited by energy, memory, and computation capabilities. In addition, the communications be-tween the central server and edge devices are with constrained resources, e.g., power or bandwidth. In this paper, we propose a joint sparsification and optimization scheme to reduce the energy consumption in local training and data transmission. On the one hand, we introduce sparsification, leading to a large number of zero weights in sparse neural networks, to alleviate devices' computational burden and mitigate the data volume to be uploaded. To handle the non-smoothness incurred by sparsification, we develop an enhanced stochastic gradient descent algorithm to improve the learning performance. On the other hand, we optimize power, bandwidth, and learning parameters to avoid communication congestion and enable an energy-efficient transmission between the central server and edge devices. By collaboratively deploying the above two components, the numerical results show that the overall energy consumption in FL can be significantly reduced, compared to benchmark FL with fully-connected neural networks.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116958750","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

High-Speed Packet Classification: A Case for Approximate Sorting 高速分组分类:近似排序的一种情况

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10001397

Aditya Narasimhan, S. Radhakrishnan, Mohammad Atiquzzaman, C. Subramanian

{"title":"High-Speed Packet Classification: A Case for Approximate Sorting","authors":"Aditya Narasimhan, S. Radhakrishnan, Mohammad Atiquzzaman, C. Subramanian","doi":"10.1109/GLOBECOM48099.2022.10001397","DOIUrl":"https://doi.org/10.1109/GLOBECOM48099.2022.10001397","url":null,"abstract":"Buffer capacities at routers are ever-increasing to accommodate the extreme-scale increase in the volume of incoming traffic. Sophisticated packet classification is being adopted to address challenges in meeting application demands. With the number of rules for classification and packets arriving at routers per second reaching 100's of thousands to millions, special hardware is also being built for packet classification to increase throughput at routers. Sorting packets (based on various conditions) in the buffers offers a significant advantage for the packet classification process. The sorting step is a time-consuming step given the large volume of packets in the incoming buffers. We propose a technique to approximately sort the packets by capping the maximum number of comparisons that can be made. We show that the performance of well-known decision tree-based packet classification methods such as HyperCuts, EffiCuts, and SmartSplits can be improved by more than 32% with approximate sorting for when the number of packets is less than 10K at any given time. If the number of packets in the arriving buffer is greater than 10K, we can divide them into smaller portions to achieve similar gains.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117211633","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

Traffic Workload Envelope for Network Performance Guarantees with Multiplexing Gain 具有复用增益的网络性能保证的流量工作负载包络

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10001056

Massieh Kordi Boroujeny, B. L. Mark, Y. Ephraim

引用次数: 1

DRL-based Channel Access in NR Unlicensed Spectrum for Downlink URLLC 基于drl的NR无牌照频谱下行URLLC通道接入

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10000882

Yan Liu, Hui Zhou, Yansha Deng, Arumugam N Allanathan

{"title":"DRL-based Channel Access in NR Unlicensed Spectrum for Downlink URLLC","authors":"Yan Liu, Hui Zhou, Yansha Deng, Arumugam N Allanathan","doi":"10.1109/GLOBECOM48099.2022.10000882","DOIUrl":"https://doi.org/10.1109/GLOBECOM48099.2022.10000882","url":null,"abstract":"To improve the capacity of cellular systems without additional expenses on licensed frequency bands, the 3rd Gen-eration Partnership Project (3GPP) has proposed New Radio Unlicensed (NR-U). It should be noted that each node in NR-U has to perform the Listen-Before- Talk (LBT) operation before transmission to avoid collisions by other unlicensed radio access technologies (e.g., WiFi). Thus, packets transmissions are prone to delay due to the LBT channel access mechanism. How to achieve Ultra-Reliable and Low-Latency Communications (URLLC) requirements in NR-U networks under the coexistence with WiFi networks is of importance and extremely challenging. In this paper, we develop a novel deep reinforcement learning (DRL) framework to optimize the downlink URLLC trans-mission in the NR-U and WiFi coexistence system through dynamically adjusting the energy detection (ED) thresholds. Our results have shown that the NR-U system reliability has been improved significantly via the DRL compared to that without learning approaches, but with the sacrifice of WiFi system reliability. To address this, we redesigned the reward to take fairness into account, which guarantees the WiFi system reliability while improvina the NR- U system reliability.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127341257","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

Task Offloading with 5G Network Slicing for V2X Communications 面向V2X通信的5G网络切片任务分流

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10001378

G. Alkhoury, Sara Berri, A. Chorti

{"title":"Task Offloading with 5G Network Slicing for V2X Communications","authors":"G. Alkhoury, Sara Berri, A. Chorti","doi":"10.1109/GLOBECOM48099.2022.10001378","DOIUrl":"https://doi.org/10.1109/GLOBECOM48099.2022.10001378","url":null,"abstract":"Vehicular Edge Computing (VEC) technology allows vehicles demanding significant computation and storage resources to offload their demands to the nearest edge computing node, aiming at reducing data transfer latency and enhancing the Quality of Service (QoS). Moreover, the heterogeneous applications of Vehicle-to-Everything (V2X) communications need an efficient management of the nodes' resources to satisfy the diverse requirements of the vehicles' demands. To this end, network slicing could be a promising solution. Task offloading algorithms in VEC proposed in the literature usually rely on offloading to a 5G base station (gNodeB) or a Road Side Unit (RSU) and do not differentiate between the various vehicular demands. In this paper, we study the task offloading problem with network slicing in V2X communications from vehicles to edge computing nodes hosted at gNodeBs, RSUs, and nearby vehicles. We model the network and formulate the problem as an integer linear program, with the objective of maximizing the volume of offloaded tasks from diverse services. We propose a heuristic algorithm and slicing schemes to find a near-optimal solution to the NP hard optimization problem. The simulation results show that considering offloading at nearby vehicles in addition to RSUs and gNodeBs yields better results in terms of acceptance ratio and resource utilization. Furthermore, it is found that it is beneficial to use an adaptive slicing scheme instead of relying on a fixed slicing; in particular, when the number of slices is large.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124848436","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

A Novel SDN-enabled Edge Computing Load Balancing Scheme for IoT Video Analytics 一种新的支持sdn的IoT视频分析边缘计算负载均衡方案

GLOBECOM 2022 - 2022 IEEE Global Communications Conference Pub Date : 2022-12-04 DOI: 10.1109/GLOBECOM48099.2022.10000605

Pouria Pourrashidi Shahrbabaki, Rodolfo W. L. Coutinho, Y. Shayan

{"title":"A Novel SDN-enabled Edge Computing Load Balancing Scheme for IoT Video Analytics","authors":"Pouria Pourrashidi Shahrbabaki, Rodolfo W. L. Coutinho, Y. Shayan","doi":"10.1109/GLOBECOM48099.2022.10000605","DOIUrl":"https://doi.org/10.1109/GLOBECOM48099.2022.10000605","url":null,"abstract":"Edge computing has been designed to deploy resources in the proximity of IoT devices, which reduces latency and network overhead. Nevertheless, resources on edge servers are limited and must efficiently be managed. In this paper, we propose a novel software-defined networking (SDN)-based scheme to balance the computation resource requests among a network of edge servers aimed at supporting IoT video analytics streaming applications. In the proposed solution, programmable switches periodically report the IoT video streaming workload forwarded to each edge server. This information is then used at the SDN controller to estimate the incoming and outgoing traffic load at edge servers and balance IoT video streaming among them, by updating routing tables at the programmable switches. The performance of the proposed solution is evaluated and compared to related schemes through extensive simulations using the Mininet emulator. Obtained results show that the proposed solution can reduce up to 21 % of average latency with 20 % load saving in each edge server, compared to deterministic and random-based related solutions.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124881731","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