Pub Date : 2024-09-17DOI: 10.1109/TMC.2024.3461708
Ziyao Huang;Weiwei Wu;Kui Wu;Hang Yuan;Chenchen Fu;Feng Shan;Jianping Wang;Junzhou Luo
Unmanned aerial vehicles (UAVs) play a critical role in disaster response, swiftly gathering information from various points-of-interest (PoIs) across extensive areas. The freshness of this information is measured by the age of information (AoI), representing the time since the latest information acquisition of a specific PoI. However, devising AoI-minimizing routes for UAVs in obstructed post-disaster environments poses unique challenges that have yet to be fully overcome. Obstacles, like post-disaster barriers, can impede direct flight paths between PoIs, and limited battery life requires energy-conscious route planning. Additionally, existing solutions fail to universally minimize varying data freshness requirements. This research addresses the AoI-driven UAV travel problem, seeking to establish periodic routes that optimize AoI metrics while considering energy and general graph constraints. We develop a learning-based algorithm to enhance the current route iteratively, utilizing guidance from a deep reinforcement learning (DRL) agent and executing a series of operations to potentially decrease AoI while adhering to topological and energy constraints. The algorithm is validated on real post-disaster datasets, demonstrating significant improvements in various AoI metrics compared to other learning-based approaches. Furthermore, our algorithm outperforms approximation algorithms and can approach the global optimum when tailored to existing AoI-minimizing problems.
{"title":"LI2: A New Learning-Based Approach to Timely Monitoring of Points-of-Interest With UAV","authors":"Ziyao Huang;Weiwei Wu;Kui Wu;Hang Yuan;Chenchen Fu;Feng Shan;Jianping Wang;Junzhou Luo","doi":"10.1109/TMC.2024.3461708","DOIUrl":"10.1109/TMC.2024.3461708","url":null,"abstract":"Unmanned aerial vehicles (UAVs) play a critical role in disaster response, swiftly gathering information from various points-of-interest (PoIs) across extensive areas. The freshness of this information is measured by the age of information (AoI), representing the time since the latest information acquisition of a specific PoI. However, devising AoI-minimizing routes for UAVs in obstructed post-disaster environments poses unique challenges that have yet to be fully overcome. Obstacles, like post-disaster barriers, can impede direct flight paths between PoIs, and limited battery life requires energy-conscious route planning. Additionally, existing solutions fail to universally minimize varying data freshness requirements. This research addresses the AoI-driven UAV travel problem, seeking to establish periodic routes that optimize AoI metrics while considering energy and general graph constraints. We develop a learning-based algorithm to enhance the current route iteratively, utilizing guidance from a deep reinforcement learning (DRL) agent and executing a series of operations to potentially decrease AoI while adhering to topological and energy constraints. The algorithm is validated on real post-disaster datasets, demonstrating significant improvements in various AoI metrics compared to other learning-based approaches. Furthermore, our algorithm outperforms approximation algorithms and can approach the global optimum when tailored to existing AoI-minimizing problems.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"45-61"},"PeriodicalIF":7.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-17DOI: 10.1109/TMC.2024.3462721
Emad Saleh;Malek Alsmadi;Salama Ikki
This work outlines a framework for full-duplex (FD) multiple-input multiple-output (MIMO) communication systems considering practical conditions, such as imperfect channel state information (CSI) and hardware impairments (HWIs). We analyze the performance of FD multi-user (MU) MIMO systems, specifically studying the effects of practical channel estimation errors and HWIs on the spectral efficiency (SE) performance of FD MU-MIMO systems. Maximum ratio combining/maximum ratio transmission (MRC/MRT) and zero-forcing reception/zero-forcing transmission (ZFR/ZFT) linear detectors/precoders are considered at the base station (BS). Moreover, linear minimum mean square error (LMMSE) and least square (LS) error estimation are used to estimate the channel at the BS. Mathematical derivations for the lower bounds of uplink (UL) and downlink (DL) SEs are presented in the context of imperfect CSI and HWIs. Computer simulations validate the analytical derivations. The results demonstrate the tightness of the obtained bounds.
{"title":"FD MU-MIMO Systems: Performance Analysis in the Presence of Imperfect CSI and Non-Ideal Transceivers","authors":"Emad Saleh;Malek Alsmadi;Salama Ikki","doi":"10.1109/TMC.2024.3462721","DOIUrl":"10.1109/TMC.2024.3462721","url":null,"abstract":"This work outlines a framework for full-duplex (FD) multiple-input multiple-output (MIMO) communication systems considering practical conditions, such as imperfect channel state information (CSI) and hardware impairments (HWIs). We analyze the performance of FD multi-user (MU) MIMO systems, specifically studying the effects of practical channel estimation errors and HWIs on the spectral efficiency (SE) performance of FD MU-MIMO systems. Maximum ratio combining/maximum ratio transmission (MRC/MRT) and zero-forcing reception/zero-forcing transmission (ZFR/ZFT) linear detectors/precoders are considered at the base station (BS). Moreover, linear minimum mean square error (LMMSE) and least square (LS) error estimation are used to estimate the channel at the BS. Mathematical derivations for the lower bounds of uplink (UL) and downlink (DL) SEs are presented in the context of imperfect CSI and HWIs. Computer simulations validate the analytical derivations. The results demonstrate the tightness of the obtained bounds.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"422-434"},"PeriodicalIF":7.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
To bridge the gap of conventional single-hop task offloading schemes in infrastructure-free scenarios, multi-hop task offloading schemes for IoT devices in Mobile Edge Computing (MEC) are desired to jointly optimize task offloading decisions and routing paths. In this paper, we investigate a hierarchical multi-hop edge computing framework and propose a joint Task Offloading and Relay Selection (TORS) scheme. It considers real-time computation at each relay node and employs directional searches to facilitate the task execution and results reporting at the fastest speed. However, finding the optimal TORS solution is a formidable challenge due to the time-varying network environments, the strong interdependence of decision sets across different time slots, and the high computational complexity. To address these challenges, we first leverage Lyapunov optimization to transform the stochastic TORS problem into a deterministic per-slot block problem, avoiding the need for extensive system prior knowledge. Subsequently, we propose a Soft Actor-Critic (SAC)-based algorithm, SAC-TORS, to find a satisfactory TORS solution with minimal computational complexity in a distributed manner. Accordingly, each IoT device can independently make self-determined and directional decisions with observable network information. Through extensive experiments, we demonstrate that the SAC-TORS outperforms state-of-the-art solutions, achieving performance improvements of up to 66%.
{"title":"Multi-Hop Task Offloading and Relay Selection for IoT Devices in Mobile Edge Computing","authors":"Ting Li;Yinlong Liu;Tao Ouyang;Hangsheng Zhang;Kai Yang;Xu Zhang","doi":"10.1109/TMC.2024.3462731","DOIUrl":"10.1109/TMC.2024.3462731","url":null,"abstract":"To bridge the gap of conventional single-hop task offloading schemes in infrastructure-free scenarios, multi-hop task offloading schemes for IoT devices in Mobile Edge Computing (MEC) are desired to jointly optimize task offloading decisions and routing paths. In this paper, we investigate a hierarchical multi-hop edge computing framework and propose a joint Task Offloading and Relay Selection (TORS) scheme. It considers real-time computation at each relay node and employs directional searches to facilitate the task execution and results reporting at the fastest speed. However, finding the optimal TORS solution is a formidable challenge due to the time-varying network environments, the strong interdependence of decision sets across different time slots, and the high computational complexity. To address these challenges, we first leverage Lyapunov optimization to transform the stochastic TORS problem into a deterministic per-slot block problem, avoiding the need for extensive system prior knowledge. Subsequently, we propose a Soft Actor-Critic (SAC)-based algorithm, SAC-TORS, to find a satisfactory TORS solution with minimal computational complexity in a distributed manner. Accordingly, each IoT device can independently make self-determined and directional decisions with observable network information. Through extensive experiments, we demonstrate that the SAC-TORS outperforms state-of-the-art solutions, achieving performance improvements of up to 66%.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"466-481"},"PeriodicalIF":7.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Integrating wireless-powered Mobile Edge Computing (MEC) with Unmanned Aerial Vehicles (UAVs) leverages computation offloading services for mobile devices, significantly enhancing the mobility and control of MEC networks. However, current research has not focused on customizing system designs for Terahertz (THz) communication networks. When dealing with THz communication, one must account for blockage vulnerability due to severe THz wave propagation attenuation and insufficient diffraction. The Intelligent Reflecting Surface (IRS) can effectively address these limitations in the model, enhancing spectrum efficiency and coverage capabilities while reducing blockage vulnerability in THz networks. In this paper, we introduce an upgraded MEC system that integrates IRS and UAVs into THz communication networks, focusing on a binary offloading policy for studying the computation offloading problem. Our primary objective is to optimize the energy consumption of both UAVs and User Electronic Devices, alongside refining the phase shift of the IRS reflector. The problem is a Mixed Integer Non-Linear Programming problem known as NP-hard. To tackle this challenge, we propose a two-stage deep learning-based optimization framework named Iterative Order-Preserving Policy Optimization (IOPO). Unlike exhaustive search methods, IOPO continually updates offloading decisions through an order-preserving quantization method, thereby accelerating convergence and reducing computational complexity, especially when handling complex problems with extensive solution spaces. The numerical results demonstrate that the proposed algorithm significantly improves energy efficiency and achieves near-optimal performance compared to benchmark methods.
{"title":"Two-Stage Deep Energy Optimization in IRS-Assisted UAV-Based Edge Computing Systems","authors":"Jianqiu Wu;Zhongyi Yu;Jianxiong Guo;Zhiqing Tang;Tian Wang;Weijia Jia","doi":"10.1109/TMC.2024.3461719","DOIUrl":"10.1109/TMC.2024.3461719","url":null,"abstract":"Integrating wireless-powered Mobile Edge Computing (MEC) with Unmanned Aerial Vehicles (UAVs) leverages computation offloading services for mobile devices, significantly enhancing the mobility and control of MEC networks. However, current research has not focused on customizing system designs for Terahertz (THz) communication networks. When dealing with THz communication, one must account for blockage vulnerability due to severe THz wave propagation attenuation and insufficient diffraction. The Intelligent Reflecting Surface (IRS) can effectively address these limitations in the model, enhancing spectrum efficiency and coverage capabilities while reducing blockage vulnerability in THz networks. In this paper, we introduce an upgraded MEC system that integrates IRS and UAVs into THz communication networks, focusing on a binary offloading policy for studying the computation offloading problem. Our primary objective is to optimize the energy consumption of both UAVs and User Electronic Devices, alongside refining the phase shift of the IRS reflector. The problem is a Mixed Integer Non-Linear Programming problem known as NP-hard. To tackle this challenge, we propose a two-stage deep learning-based optimization framework named Iterative Order-Preserving Policy Optimization (IOPO). Unlike exhaustive search methods, IOPO continually updates offloading decisions through an order-preserving quantization method, thereby accelerating convergence and reducing computational complexity, especially when handling complex problems with extensive solution spaces. The numerical results demonstrate that the proposed algorithm significantly improves energy efficiency and achieves near-optimal performance compared to benchmark methods.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"449-465"},"PeriodicalIF":7.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-17DOI: 10.1109/TMC.2024.3462941
Demin Gao;Liyuan Ou;Yongrui Chen;Xiuzhen Guo;Ruofeng Liu;Yunhuai Liu;Tian He
Wi-Fi is the de facto standard for providing wireless access to the Internet in the 2.4 GHz ISM band. Tens of billions of Wi-Fi devices (e.g., smartphones) have been shipped worldwide with limited types of wireless radios operating only when Wi-Fi connectivity is available, making it challenging to access data in heterogeneous IoT devices. However, the direct connection between Wireless Personal Area Network (WPAN) technologies, such as Bluetooth, and Wi-Fi presents challenges due to the inherent distinct physical layer. In our work, a novel communication method called BlueWi has been introduced, which serves as a cross technology communication method that enables BLE devices to establish connections and engage in communication with Wi-Fi based WPAN networks. We let BLE signals hitchhike on ongoing Wi-Fi signals, enabling Wi-Fi to recognize specific BLE signal waveforms in the frequency domain. By analyzing the decoded Wi-Fi payload, BlueWi can retrieve the BLE data, ensuring this method remains fully compatible with existing commodity Wi-Fi hardware. The direct sequence spread spectrum scheme is appended to handle general BLE frames and can be considered as “ COPY ” operation, which allows for better correlation and detection of the signal at the receiver. Evaluations conducted using both USRP and commodity devices have demonstrated that BlueWi can achieve concurrent wireless communication from BLE commercial chips to Wi-Fi networks with a frame reception rate exceeding 96%.
{"title":"Physical-Layer CTC From BLE to Wi-Fi With IEEE 802.11ax","authors":"Demin Gao;Liyuan Ou;Yongrui Chen;Xiuzhen Guo;Ruofeng Liu;Yunhuai Liu;Tian He","doi":"10.1109/TMC.2024.3462941","DOIUrl":"10.1109/TMC.2024.3462941","url":null,"abstract":"Wi-Fi is the de facto standard for providing wireless access to the Internet in the 2.4 GHz ISM band. Tens of billions of Wi-Fi devices (e.g., smartphones) have been shipped worldwide with limited types of wireless radios operating only when Wi-Fi connectivity is available, making it challenging to access data in heterogeneous IoT devices. However, the direct connection between Wireless Personal Area Network (WPAN) technologies, such as Bluetooth, and Wi-Fi presents challenges due to the inherent distinct physical layer. In our work, a novel communication method called BlueWi has been introduced, which serves as a cross technology communication method that enables BLE devices to establish connections and engage in communication with Wi-Fi based WPAN networks. We let BLE signals hitchhike on ongoing Wi-Fi signals, enabling Wi-Fi to recognize specific BLE signal waveforms in the frequency domain. By analyzing the decoded Wi-Fi payload, BlueWi can retrieve the BLE data, ensuring this method remains fully compatible with existing commodity Wi-Fi hardware. The direct sequence spread spectrum scheme is appended to handle general BLE frames and can be considered as “\u0000<italic>COPY</i>\u0000” operation, which allows for better correlation and detection of the signal at the receiver. Evaluations conducted using both USRP and commodity devices have demonstrated that BlueWi can achieve concurrent wireless communication from BLE commercial chips to Wi-Fi networks with a frame reception rate exceeding 96%.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"338-351"},"PeriodicalIF":7.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Human activity recognition (HAR) is an important task in the field of human-computer interaction. Given the penetration of WiFi devices in our daily lives, HAR using WiFi channel state information (CSI) is a more cost-efficient and comfortable approach. However, most existing approaches ignore the correlation between CSI sub-carriers, which makes their models inefficient and need to rely on deeper and more complex networks to further improve performance. To solve these problems, we propose a reconstructed WiFi CSI phase based HAR approach (WiPhase), which contains a two-stream model to fuse both temporal features and sub-carrier correlation features of reconstructed CSI phase. Specifically, a gated pseudo-Siamese network (GPSiam) is designed to capture the temporal features of the reconstructed sparse CSI phase integration representation (CSI-PIR), and a dynamic resolution based graph attention network (DRGAT) is designed to capture the nonlinear correlation between CSI sub-carriers by the reconstructed CSI phase graph. Furthermore, dendrite network (DD) makes the final decision by combining the features output from GPSiam and DRGAT. Experimental results show that WiPhase outperforms the existing state-of-the-art approaches.
{"title":"WiPhase: A Human Activity Recognition Approach by Fusing of Reconstructed WiFi CSI Phase Features","authors":"Xingcan Chen;Chenglin Li;Chengpeng Jiang;Wei Meng;Wendong Xiao","doi":"10.1109/TMC.2024.3461672","DOIUrl":"10.1109/TMC.2024.3461672","url":null,"abstract":"Human activity recognition (HAR) is an important task in the field of human-computer interaction. Given the penetration of WiFi devices in our daily lives, HAR using WiFi channel state information (CSI) is a more cost-efficient and comfortable approach. However, most existing approaches ignore the correlation between CSI sub-carriers, which makes their models inefficient and need to rely on deeper and more complex networks to further improve performance. To solve these problems, we propose a reconstructed WiFi CSI phase based HAR approach (WiPhase), which contains a two-stream model to fuse both temporal features and sub-carrier correlation features of reconstructed CSI phase. Specifically, a gated pseudo-Siamese network (GPSiam) is designed to capture the temporal features of the reconstructed sparse CSI phase integration representation (CSI-PIR), and a dynamic resolution based graph attention network (DRGAT) is designed to capture the nonlinear correlation between CSI sub-carriers by the reconstructed CSI phase graph. Furthermore, dendrite network (DD) makes the final decision by combining the features output from GPSiam and DRGAT. Experimental results show that WiPhase outperforms the existing state-of-the-art approaches.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"394-406"},"PeriodicalIF":7.7,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-13DOI: 10.1109/TMC.2024.3459944
Hanxiang He;Xintao Huan;Jing Wang;Yong Luo;Han Hu;Jianping An
Concerns surrounding privacy leakages caused by prevalent vision-based person identifications are countless. A promising privacy-preserving solution is to identify the wireless signals reflecting persons, which, however, faces a major challenge of losing efficacy in multi-environments. In this paper, we work on person identification based on wireless signals using transfer learning, toward tackling the performance deterioration across environments. We investigate the feature variations induced by environmental shifts based on data measurements. Lay our foundation on the feature alignment concept, we propose a novel wireless-based person identification framework using transfer learning. In the framework, we integrate a series of signal processing methods including signal selection, pre-processing, and augmentation, where the first includes a reference environment to assist the feature extraction while the latter two respectively reduce the data noise and improve the data diversity. We also propose a model generalization method where a neural network is employed to align features from different environments, which facilitates the extraction of environment-independent features while incorporating both person and environment information. On a real wireless testbed consisting of an Impulse Radio Ultra-WideBand (IR-UWB) radar, we build and publicly release a dataset with 22,264 samples of ten individuals from three environments, varying in testing distance and obstruction condition. Extensive experimental evaluations demonstrate that the proposed framework can improve the identification accuracy across environments, and surpasses state-of-the-art methods by up to 18.06%.
{"title":"P3ID: A Privacy-Preserving Person Identification Framework Towards Multi-Environments Based on Transfer Learning","authors":"Hanxiang He;Xintao Huan;Jing Wang;Yong Luo;Han Hu;Jianping An","doi":"10.1109/TMC.2024.3459944","DOIUrl":"10.1109/TMC.2024.3459944","url":null,"abstract":"Concerns surrounding privacy leakages caused by prevalent vision-based person identifications are countless. A promising privacy-preserving solution is to identify the wireless signals reflecting persons, which, however, faces a major challenge of losing efficacy in multi-environments. In this paper, we work on person identification based on wireless signals using transfer learning, toward tackling the performance deterioration across environments. We investigate the feature variations induced by environmental shifts based on data measurements. Lay our foundation on the feature alignment concept, we propose a novel wireless-based person identification framework using transfer learning. In the framework, we integrate a series of signal processing methods including signal selection, pre-processing, and augmentation, where the first includes a reference environment to assist the feature extraction while the latter two respectively reduce the data noise and improve the data diversity. We also propose a model generalization method where a neural network is employed to align features from different environments, which facilitates the extraction of environment-independent features while incorporating both person and environment information. On a real wireless testbed consisting of an Impulse Radio Ultra-WideBand (IR-UWB) radar, we build and publicly release a dataset with 22,264 samples of ten individuals from three environments, varying in testing distance and obstruction condition. Extensive experimental evaluations demonstrate that the proposed framework can improve the identification accuracy across environments, and surpasses state-of-the-art methods by up to 18.06%.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"102-116"},"PeriodicalIF":7.7,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142269296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-13DOI: 10.1109/TMC.2024.3460170
Ashwin Ganesan
An assumption that researchers have often used to model interference in a wireless network is the unit disk graph model. While many theoretical results and performance guarantees have been obtained under this model, an open research direction is to extend these results to hypergraph interference models. Motivated by recent results that the worst-case performance of the distributed maximal scheduling algorithm is characterized by the interference degree of the hypergraph, in the present work we investigate properties of the interference degree of the hypergraph and the structure of hypergraphs arising from physical constraints. We show that the problem of computing the interference degree of a hypergraph is NP-hard and we prove some properties and results concerning this hypergraph invariant. We investigate which hypergraphs are realizable, i.e. which hypergraphs arise in practice, based on physical constraints, as the interference model of a wireless network. In particular, a question that arises naturally is: what is the maximal value of $r$ such that the hypergraph $K_{1,r}$ is realizable? We determine this quantity for various integral and nonintegral values of the path loss exponent of signal propagation. We also investigate hypergraphs generated by line networks.
{"title":"The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems","authors":"Ashwin Ganesan","doi":"10.1109/TMC.2024.3460170","DOIUrl":"10.1109/TMC.2024.3460170","url":null,"abstract":"An assumption that researchers have often used to model interference in a wireless network is the unit disk graph model. While many theoretical results and performance guarantees have been obtained under this model, an open research direction is to extend these results to hypergraph interference models. Motivated by recent results that the worst-case performance of the distributed maximal scheduling algorithm is characterized by the interference degree of the hypergraph, in the present work we investigate properties of the interference degree of the hypergraph and the structure of hypergraphs arising from physical constraints. We show that the problem of computing the interference degree of a hypergraph is NP-hard and we prove some properties and results concerning this hypergraph invariant. We investigate which hypergraphs are realizable, i.e. which hypergraphs arise in practice, based on physical constraints, as the interference model of a wireless network. In particular, a question that arises naturally is: what is the maximal value of \u0000<inline-formula><tex-math>$r$</tex-math></inline-formula>\u0000 such that the hypergraph \u0000<inline-formula><tex-math>$K_{1,r}$</tex-math></inline-formula>\u0000 is realizable? We determine this quantity for various integral and nonintegral values of the path loss exponent of signal propagation. We also investigate hypergraphs generated by line networks.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"150-164"},"PeriodicalIF":7.7,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-13DOI: 10.1109/TMC.2024.3460392
Guoming Zhang;Heqiang Fu;Zhijie Xiang;Xinyan Zhou;Pengfei Hu;Xiuzhen Cheng;Yanni Yang
Sound eavesdropping using light has been an area of considerable interest and concern, as it can be achieved over long distances. However, previous work has often lacked stealth (e.g., active emission of laser beams) or been limited in the range of realistic applications (e.g., using direct light from a device’s indicator LED or a hanging light bulb). In this paper, we present EchoLight , a non-intrusive, passive and long-range sound eavesdropping method that utilizes the extensive reflection of ambient light from vibrating objects to reconstruct sound. We analyze the relationship between reflection light signals and sound signals, particularly in situations where the frequency response of reflective objects and the efficiency of diffuse reflection are suboptimal. Based on this analysis, we have introduced an algorithm based on cGAN to address the issues of nonlinear distortion and spectral absence in the frequency domain of sound. We extensively evaluate EchoLight ’s performance in a variety of real-world scenarios. It demonstrates the ability to accurately reconstruct audio from a variety of source distances, attack distances, sound levels, light sources, and reflective materials. Our results reveal that the reconstructed audio exhibits a high degree of similarity to the original audio over 40 meters of attack distance.
{"title":"Ambient Light Reflection-Based Eavesdropping Enhanced With cGAN","authors":"Guoming Zhang;Heqiang Fu;Zhijie Xiang;Xinyan Zhou;Pengfei Hu;Xiuzhen Cheng;Yanni Yang","doi":"10.1109/TMC.2024.3460392","DOIUrl":"10.1109/TMC.2024.3460392","url":null,"abstract":"Sound eavesdropping using light has been an area of considerable interest and concern, as it can be achieved over long distances. However, previous work has often lacked stealth (e.g., active emission of laser beams) or been limited in the range of realistic applications (e.g., using direct light from a device’s indicator LED or a hanging light bulb). In this paper, we present \u0000<monospace>EchoLight</monospace>\u0000, a non-intrusive, passive and long-range sound eavesdropping method that utilizes the extensive reflection of ambient light from vibrating objects to reconstruct sound. We analyze the relationship between reflection light signals and sound signals, particularly in situations where the frequency response of reflective objects and the efficiency of diffuse reflection are suboptimal. Based on this analysis, we have introduced an algorithm based on cGAN to address the issues of nonlinear distortion and spectral absence in the frequency domain of sound. We extensively evaluate \u0000<monospace>EchoLight</monospace>\u0000’s performance in a variety of real-world scenarios. It demonstrates the ability to accurately reconstruct audio from a variety of source distances, attack distances, sound levels, light sources, and reflective materials. Our results reveal that the reconstructed audio exhibits a high degree of similarity to the original audio over 40 meters of attack distance.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"72-85"},"PeriodicalIF":7.7,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142269379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Many emerging applications in edge computing require processing of huge volumes of data generated by end devices, using the freshest available information. In this paper, we address the distributed optimization of multi-user long-term average Age-of-Information (AoI) objectives in edge networks that use NOMA transmission. This poses a challenge of non-convex online optimization, which in existing work often requires either decision making in a combinatorial space or a global view of entire network states. To overcome this challenge, we propose a reinforcement learning-based framework that adopts a novel hierarchical decomposition of decision making. Specifically, we propose three different types of distributed agents to learn with respect to efficiency of AoI scheduling, fairness of AoI scheduling, as well as a high-level policy balancing these potentially conflicting design objectives. Not only does the proposed decomposition improve learning performance due to disentanglement of different design objectives/rewards, but it also enables the algorithm to learn the best policy while also learning the explanations – as actions can be directly compared in terms of the design objectives. Our evaluations show that the proposed algorithm improves the long-term average AoI by $200%{-}300%$ and 400% compared to prior works with NOMA and the optimal solution without NOMA, respectively.
{"title":"Distributed Age-of-Information Scheduling With NOMA via Deep Reinforcement Learning","authors":"Congwei Zhang;Yifei Zou;Zuyuan Zhang;Dongxiao Yu;Jorge Torres Gómez;Tian Lan;Falko Dressler;Xiuzhen Cheng","doi":"10.1109/TMC.2024.3459101","DOIUrl":"10.1109/TMC.2024.3459101","url":null,"abstract":"Many emerging applications in edge computing require processing of huge volumes of data generated by end devices, using the freshest available information. In this paper, we address the distributed optimization of multi-user long-term average Age-of-Information (AoI) objectives in edge networks that use NOMA transmission. This poses a challenge of non-convex online optimization, which in existing work often requires either decision making in a combinatorial space or a global view of entire network states. To overcome this challenge, we propose a reinforcement learning-based framework that adopts a novel hierarchical decomposition of decision making. Specifically, we propose three different types of distributed agents to learn with respect to efficiency of AoI scheduling, fairness of AoI scheduling, as well as a high-level policy balancing these potentially conflicting design objectives. Not only does the proposed decomposition improve learning performance due to disentanglement of different design objectives/rewards, but it also enables the algorithm to learn the best policy while also learning the explanations – as actions can be directly compared in terms of the design objectives. Our evaluations show that the proposed algorithm improves the long-term average AoI by \u0000<inline-formula><tex-math>$200%{-}300%$</tex-math></inline-formula>\u0000 and 400% compared to prior works with NOMA and the optimal solution without NOMA, respectively.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"30-44"},"PeriodicalIF":7.7,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142180543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：