Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118705
Sota Uchimura, G. Abreu, K. Ishibashi
We propose a hybrid beamforming for coordinated multi-point (CoMP) transmission using orthogonal frequency division multiplexing (OFDM) over millimeter-wave (mmWave) channels to combat random propagation path blockages. In particular, a sum-of-outage-probability minimization problem with manifold constraints is formulated, which designs the hybrid beamformers, the data rate allocation, and the power allocation over subcarriers jointly to meet the prescribed data rate requirement. A new block stochastic learning mechanism exploiting prior knowledge of the path blockages is also introduced to solve the problem efficiently. Numerical results confirm the effectiveness of the proposed approach in minimizing the outage probability of users according to their target rate. Furthermore, these results also show that the proposed hybrid CoMP transmission only with a few radio frequency (RF) chains and knowledge of blockage probabilities achieves comparable outage performance to a fully digital CoMP transmission alternative with perfect knowledge of instantaneous path blockages.
{"title":"Hybrid Beamforming for Outage-Minimization in Frequency Selective Millimeter-Wave Channels","authors":"Sota Uchimura, G. Abreu, K. Ishibashi","doi":"10.1109/WCNC55385.2023.10118705","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118705","url":null,"abstract":"We propose a hybrid beamforming for coordinated multi-point (CoMP) transmission using orthogonal frequency division multiplexing (OFDM) over millimeter-wave (mmWave) channels to combat random propagation path blockages. In particular, a sum-of-outage-probability minimization problem with manifold constraints is formulated, which designs the hybrid beamformers, the data rate allocation, and the power allocation over subcarriers jointly to meet the prescribed data rate requirement. A new block stochastic learning mechanism exploiting prior knowledge of the path blockages is also introduced to solve the problem efficiently. Numerical results confirm the effectiveness of the proposed approach in minimizing the outage probability of users according to their target rate. Furthermore, these results also show that the proposed hybrid CoMP transmission only with a few radio frequency (RF) chains and knowledge of blockage probabilities achieves comparable outage performance to a fully digital CoMP transmission alternative with perfect knowledge of instantaneous path blockages.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127763070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118771
Zhiyu Huang, Zhichao Sheng, A. Nasir, Cheng Yin, Antonino Masaracchia
This paper investigates the unmanned aerial vehicle (UAV)-assisted communication network with multiple downlink users (DLUs) and uplink users (ULUs) in the presence of multiple malicious jammers. To guarantee fairness among the users and their uplink and downlink communication throughput, we aim to maximize the minimum average throughput by jointly optimizing the scheduling of ULUs/DLUs, three dimensional (3D) trajectory and the UAV transmission power. Although the optimization problem is computationally intractable due to its non-convexity, we develop an iterative algorithm based on the block coordinate descend approach and the successive convex approximation technique to solve the problem efficiently. Numerical outcomes show that our proposed algorithm can improve throughput significantly over several benchmark schemes.
{"title":"UAV-Assisted Downlink-and-Uplink Communication in the Presence of Multiple Malicious Jammers","authors":"Zhiyu Huang, Zhichao Sheng, A. Nasir, Cheng Yin, Antonino Masaracchia","doi":"10.1109/WCNC55385.2023.10118771","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118771","url":null,"abstract":"This paper investigates the unmanned aerial vehicle (UAV)-assisted communication network with multiple downlink users (DLUs) and uplink users (ULUs) in the presence of multiple malicious jammers. To guarantee fairness among the users and their uplink and downlink communication throughput, we aim to maximize the minimum average throughput by jointly optimizing the scheduling of ULUs/DLUs, three dimensional (3D) trajectory and the UAV transmission power. Although the optimization problem is computationally intractable due to its non-convexity, we develop an iterative algorithm based on the block coordinate descend approach and the successive convex approximation technique to solve the problem efficiently. Numerical outcomes show that our proposed algorithm can improve throughput significantly over several benchmark schemes.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134053420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118892
Yuzhou Shang, Zhaoyang Zhang, Zhaohui Yang
Polar code is envisioned as a promising candidate for ultra-reliable low-latency communications (URLLC) in fifth-generation (5G) communication and beyond. To decode polar code, a successive cancellation list (SCL) decoder with a large list size can provide near maximum likelihood (ML) decoding performance. However, a large list size will lead to unacceptable spatial complexity, making it impractical. When the list size is small, although the complexity is low, its performance still needs to be improved. The main reason is that the sequence features implied in log-likelihood ratio (LLR) sequences are lost during calculating path metrics used for path selection. Because of the excellent sequence feature extraction ability of the long short-term memory (LSTM) network, we propose an LSTM-based path selection mechanism to replace the path metric-based path selection mechanism in SCL. In our proposed scheme, the LSTM network selects the surviving path according to the LLR sequences corresponding to the current paths. Simulation results show the effectiveness of the proposed LSTM-based path selection mechanism.
{"title":"LSTM-based Path Selection for Successive Cancellation List Decoding for Short Polar Codes","authors":"Yuzhou Shang, Zhaoyang Zhang, Zhaohui Yang","doi":"10.1109/WCNC55385.2023.10118892","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118892","url":null,"abstract":"Polar code is envisioned as a promising candidate for ultra-reliable low-latency communications (URLLC) in fifth-generation (5G) communication and beyond. To decode polar code, a successive cancellation list (SCL) decoder with a large list size can provide near maximum likelihood (ML) decoding performance. However, a large list size will lead to unacceptable spatial complexity, making it impractical. When the list size is small, although the complexity is low, its performance still needs to be improved. The main reason is that the sequence features implied in log-likelihood ratio (LLR) sequences are lost during calculating path metrics used for path selection. Because of the excellent sequence feature extraction ability of the long short-term memory (LSTM) network, we propose an LSTM-based path selection mechanism to replace the path metric-based path selection mechanism in SCL. In our proposed scheme, the LSTM network selects the surviving path according to the LLR sequences corresponding to the current paths. Simulation results show the effectiveness of the proposed LSTM-based path selection mechanism.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134345497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118853
S.I. Hassouna, M. Jamshed, M. Rehman, M. Imran, Q. Abbasi
In wireless communications, various study findings have shown that a reconfigurable intelligent surface (RIS) may successfully alter wireless wave parameters like phase and amplitude without requiring sophisticated signal processing and decoding at the receiver. However, it is necessary to take into account designing the surface under a realistic frequency selective fading channel. Because of this, we chose a wideband OFDM multi-user communication system based on an actual RIS setup that considers mutual coupling (MC) and electromagnetic interference (EMI). We used Hadamard matrix in the pilot transmissions to estimate the uncontrollable and the controllable channels. The best pilot configuration was selected to initialize the gradient descent method in order to calculate the optimal reflection coefficient that maximize the data rate for each user in the presence of EMI and MC. Simulation results revealed that the data rate has been degraded when considering EMI and MC for around 30 Mbits/s for each user. This confirms that both EMI and MC must be given considerable attention in our research due to their inevitable effects on the system performance.
{"title":"Investigating the Data Rate of Intelligent Reflecting Surfaces with Mutual Coupling and EMI","authors":"S.I. Hassouna, M. Jamshed, M. Rehman, M. Imran, Q. Abbasi","doi":"10.1109/WCNC55385.2023.10118853","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118853","url":null,"abstract":"In wireless communications, various study findings have shown that a reconfigurable intelligent surface (RIS) may successfully alter wireless wave parameters like phase and amplitude without requiring sophisticated signal processing and decoding at the receiver. However, it is necessary to take into account designing the surface under a realistic frequency selective fading channel. Because of this, we chose a wideband OFDM multi-user communication system based on an actual RIS setup that considers mutual coupling (MC) and electromagnetic interference (EMI). We used Hadamard matrix in the pilot transmissions to estimate the uncontrollable and the controllable channels. The best pilot configuration was selected to initialize the gradient descent method in order to calculate the optimal reflection coefficient that maximize the data rate for each user in the presence of EMI and MC. Simulation results revealed that the data rate has been degraded when considering EMI and MC for around 30 Mbits/s for each user. This confirms that both EMI and MC must be given considerable attention in our research due to their inevitable effects on the system performance.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124448146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118776
Arash Sahbafard, R. Schmidt, F. Kaltenberger, A. Springer, Hans-Peter Bernhard
5G, the latest generation of cellular technology, targets not only enhanced data rates but also new applications which require, e.g., ultra-reliable low latency communication. Verticals like industrial automation or automotive, which want to make use of this type of wireless services, need experimental deployments to test the performance of 5G in various modes and environments for their use cases. Due to the ongoing stan-dardization process, experimental 5G networks based on open-source frameworks are especially well suited, as they provide the possibility to easily implement new features introduced by the yearly 5G standard releases. We thus present an experimental 5G standalone deployment, based on the OpenAirInterface, which is an open-source framework, that is being used both, commercially and for academic purposes. We evaluate coverage parameters including reference signal received power, reference signal received quality, and signal to interference and noise ratio both for single user and multiple user scenarios. The measured downlink data rate reaches up to 390 Mbps at a bandwidth of 60 MHz, which is close to the achievable theoretical value. The average latency both for uplink and downlink was measured to be 19 ms for the round trip time, while the minimum latency value was 6 ms, which is acceptable for many application.
{"title":"On the Performance of an Indoor Open-Source 5G Standalone Deployment","authors":"Arash Sahbafard, R. Schmidt, F. Kaltenberger, A. Springer, Hans-Peter Bernhard","doi":"10.1109/WCNC55385.2023.10118776","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118776","url":null,"abstract":"5G, the latest generation of cellular technology, targets not only enhanced data rates but also new applications which require, e.g., ultra-reliable low latency communication. Verticals like industrial automation or automotive, which want to make use of this type of wireless services, need experimental deployments to test the performance of 5G in various modes and environments for their use cases. Due to the ongoing stan-dardization process, experimental 5G networks based on open-source frameworks are especially well suited, as they provide the possibility to easily implement new features introduced by the yearly 5G standard releases. We thus present an experimental 5G standalone deployment, based on the OpenAirInterface, which is an open-source framework, that is being used both, commercially and for academic purposes. We evaluate coverage parameters including reference signal received power, reference signal received quality, and signal to interference and noise ratio both for single user and multiple user scenarios. The measured downlink data rate reaches up to 390 Mbps at a bandwidth of 60 MHz, which is close to the achievable theoretical value. The average latency both for uplink and downlink was measured to be 19 ms for the round trip time, while the minimum latency value was 6 ms, which is acceptable for many application.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115784436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118939
Vatsala Sharma, Prajwalita Saikia, S. Singh, Keshav Singh, Wan-Jen Huang, S. Biswas
In this work, we investigate the performance of a federated edge learning (FEEL)-enhanced edge computing in unmanned aerial vehicles (UAV)-aided internet of things (IoT) system under the consideration of limited energy at each UAV. It consists of multiple UAVs which apply FEEL for local training and, then, transmit the required parameters to a centralized IoT-server. We use a new cost metric obtained by a linear combination of latency and energy consumption, and formulate an optimization problem to jointly optimize the central processing unit (CPU)-frequency during FEEL and allotted bandwidth under the consideration of the limited overall system bandwidth and energy available at each UAV. Due to the non-convex nature of the formulated problem, we propose a twin delayed deep deterministic policy gradient (TD3)-based algorithm that solves the problem and provides the optimum CPU frequency and allotted bandwidth to each user. We validate the accuracy and convergence of the proposed algorithm via exhaustive simulations and highlight its effectiveness by comparing its performance with that of deep deterministic policy gradient (DDPG) and deep Qnetwork (DQN)-based solutions.
{"title":"FEEL-enhanced Edge Computing in Energy Constrained UAV-aided IoT Networks","authors":"Vatsala Sharma, Prajwalita Saikia, S. Singh, Keshav Singh, Wan-Jen Huang, S. Biswas","doi":"10.1109/WCNC55385.2023.10118939","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118939","url":null,"abstract":"In this work, we investigate the performance of a federated edge learning (FEEL)-enhanced edge computing in unmanned aerial vehicles (UAV)-aided internet of things (IoT) system under the consideration of limited energy at each UAV. It consists of multiple UAVs which apply FEEL for local training and, then, transmit the required parameters to a centralized IoT-server. We use a new cost metric obtained by a linear combination of latency and energy consumption, and formulate an optimization problem to jointly optimize the central processing unit (CPU)-frequency during FEEL and allotted bandwidth under the consideration of the limited overall system bandwidth and energy available at each UAV. Due to the non-convex nature of the formulated problem, we propose a twin delayed deep deterministic policy gradient (TD3)-based algorithm that solves the problem and provides the optimum CPU frequency and allotted bandwidth to each user. We validate the accuracy and convergence of the proposed algorithm via exhaustive simulations and highlight its effectiveness by comparing its performance with that of deep deterministic policy gradient (DDPG) and deep Qnetwork (DQN)-based solutions.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125629898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118789
Lili Song, Zhenzhen Gao, Jian Huang, Boliang Han
The physical layer (PHY) security technology based on radio frequency (RF) fingerprint can effectively solve the secure access problem of wireless devices. The hardware impairments of the devices can be used to generate the unique RF fingerprint to identify different wireless devices. Fingerprint extraction as a key step in the process of identification faces the challenges of ensuring the identification accuracy with reduced sample dimension and low testing and training time. To address the above problems, we propose a lightweight RF fingerprint extraction scheme to extract the physical layer attributes and effectively reduce the data dimension and time consumption. Based on the proposed RF fingerprint, the Bayesian classifier is used to identify the wireless devices. Furthermore, a joint judgment strategy is proposed to improve the identification accuracy by using multiple segments of one signal frame. The experimental result shows that, compared to the existing RF fingerprint identification schemes, the proposed RF fingerprint identification scheme obtains the best identification accuracy with lower time and data consumption.
{"title":"A Lightweight Radio Frequency Fingerprint Extraction Scheme for Device Identification","authors":"Lili Song, Zhenzhen Gao, Jian Huang, Boliang Han","doi":"10.1109/WCNC55385.2023.10118789","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118789","url":null,"abstract":"The physical layer (PHY) security technology based on radio frequency (RF) fingerprint can effectively solve the secure access problem of wireless devices. The hardware impairments of the devices can be used to generate the unique RF fingerprint to identify different wireless devices. Fingerprint extraction as a key step in the process of identification faces the challenges of ensuring the identification accuracy with reduced sample dimension and low testing and training time. To address the above problems, we propose a lightweight RF fingerprint extraction scheme to extract the physical layer attributes and effectively reduce the data dimension and time consumption. Based on the proposed RF fingerprint, the Bayesian classifier is used to identify the wireless devices. Furthermore, a joint judgment strategy is proposed to improve the identification accuracy by using multiple segments of one signal frame. The experimental result shows that, compared to the existing RF fingerprint identification schemes, the proposed RF fingerprint identification scheme obtains the best identification accuracy with lower time and data consumption.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"466 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124439311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118639
Fei Liu, Hongyan Li, Peng Wang, Keyi Shi, Yun Hu
Virtual Reality (VR) applications delivered over wireless networks have attracted interest from academia and industry. The delay of VR applications is mainly composed of computing delay and communication delay. Although cloud computing centers have adequate computing power, accessing them requires long communication delay. Mobile edge computing (MEC), which offloads the computing power from the cloud computing center to the edge, is regarded as a feasible way to alleviate communication delay. However, due to the differences in the capability and location of MEC nodes, the selection of MEC nodes will affect both the computing delay and communication delay. In this paper, we focus on the joint representation of computing and communication resources and the selection of the optimal MEC node. First, we adopt graph-based joint computing and communication resources (GCC) model for VR applications routing and formulate the VR routing problem as an ILP problem. Then we design a Computing Nodes Expanded (CNE) algorithm, which allows us to use the Dijkstra algorithm to quickly obtain the optimal computing node and the path of shortest total delay. Finally, we run numerical experiments to evaluate the performance of the proposal algorithm. Simulation shows that the CNE algorithm can reduce the total delay by 42.9% and increase the delay satisfaction ratio by 23.3% compared to other benchmark algorithms.
{"title":"Graph based Joint Computing and Communication Scheduling for Virtual Reality Applications","authors":"Fei Liu, Hongyan Li, Peng Wang, Keyi Shi, Yun Hu","doi":"10.1109/WCNC55385.2023.10118639","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118639","url":null,"abstract":"Virtual Reality (VR) applications delivered over wireless networks have attracted interest from academia and industry. The delay of VR applications is mainly composed of computing delay and communication delay. Although cloud computing centers have adequate computing power, accessing them requires long communication delay. Mobile edge computing (MEC), which offloads the computing power from the cloud computing center to the edge, is regarded as a feasible way to alleviate communication delay. However, due to the differences in the capability and location of MEC nodes, the selection of MEC nodes will affect both the computing delay and communication delay. In this paper, we focus on the joint representation of computing and communication resources and the selection of the optimal MEC node. First, we adopt graph-based joint computing and communication resources (GCC) model for VR applications routing and formulate the VR routing problem as an ILP problem. Then we design a Computing Nodes Expanded (CNE) algorithm, which allows us to use the Dijkstra algorithm to quickly obtain the optimal computing node and the path of shortest total delay. Finally, we run numerical experiments to evaluate the performance of the proposal algorithm. Simulation shows that the CNE algorithm can reduce the total delay by 42.9% and increase the delay satisfaction ratio by 23.3% compared to other benchmark algorithms.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134125268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118791
Shoma Nishigami, Eiji Nii, Naoki Fujiyama, Shoma Izuhara, H. Yomo, Y. Takizawa
In real environments, it is difficult to predict the occurrence of events such as damage to structures and people in need of rescue, and the location and number of most such events are unknown. We have proposed a Mobile Sensing Cluster (MSC) to search for and capture unknown events. MSC dynamically forms multiple swarms of autonomous mobile systems such as robots and UAVs based on swarm intelligence, and it achieves search and capture of more unknown events in a short time. However, the effectiveness of MSC strongly depends on the number of autonomous mobile systems used. In this paper, we propose a Self-Cloning Mobile Sensing Cluster to achieve the search and capture of unknown events beyond the actual number of autonomous mobile systems, and we discuss its basic effectiveness based on an evaluation using simulations. The Self-Cloning MSC consists of both actual mobile systems in physical space and virtual cloned mobile entities in cyber space. This virtually increases the number of autonomous mobile systems with the cloned mobile entities, allowing them to form diverse swarms based on MSC.
{"title":"Self-Cloning Mobile Sensing Cluster based on Swarm Intelligence with Multiple Autonomous Mobile Systems","authors":"Shoma Nishigami, Eiji Nii, Naoki Fujiyama, Shoma Izuhara, H. Yomo, Y. Takizawa","doi":"10.1109/WCNC55385.2023.10118791","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118791","url":null,"abstract":"In real environments, it is difficult to predict the occurrence of events such as damage to structures and people in need of rescue, and the location and number of most such events are unknown. We have proposed a Mobile Sensing Cluster (MSC) to search for and capture unknown events. MSC dynamically forms multiple swarms of autonomous mobile systems such as robots and UAVs based on swarm intelligence, and it achieves search and capture of more unknown events in a short time. However, the effectiveness of MSC strongly depends on the number of autonomous mobile systems used. In this paper, we propose a Self-Cloning Mobile Sensing Cluster to achieve the search and capture of unknown events beyond the actual number of autonomous mobile systems, and we discuss its basic effectiveness based on an evaluation using simulations. The Self-Cloning MSC consists of both actual mobile systems in physical space and virtual cloned mobile entities in cyber space. This virtually increases the number of autonomous mobile systems with the cloned mobile entities, allowing them to form diverse swarms based on MSC.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131964000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118894
J. Wang, Xinxin Ma, Le Zheng, Kai Yang, Zhao Chen, Qiaoqiao Xia
This paper studies the secrecy wireless information and power transfer problem in ultra-dense cloud radio access network (UD-CRAN) with wireless fronthaul, which is a promising framework for future Internet of Things (IoT). The transmission schemes of wireless fronthaul and access links are jointly designed, while addressing the characteristics of ultra-dense network such as base station diversity and high probability of line-of-sight transmission. Specifically, we employ the idea of block diagonalization to deal with the fronthaul interference, which support multi-stream fronthaul transmission for each remote radio head (RRH). We then jointly optimize the power allocation in the fronthaul and the resource allocation in the access link which includes beamforming for information and energy transmission, on/off of RRHs, and user-RRH association. In order to solve the formulated mixed integer non-convex optimization problem, we leverage the sparsity of beamforming vectors brought by the ultra-dense RRHs. We then solve the reformulated problem by employing the successive convex approximation approach. Finally, numerical results are presented to demonstrate the effectiveness of the proposed scheme.
{"title":"Secrecy Wireless Information and Power Transfer in Ultra-Dense Cloud-RAN with Wireless Fronthaul","authors":"J. Wang, Xinxin Ma, Le Zheng, Kai Yang, Zhao Chen, Qiaoqiao Xia","doi":"10.1109/WCNC55385.2023.10118894","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118894","url":null,"abstract":"This paper studies the secrecy wireless information and power transfer problem in ultra-dense cloud radio access network (UD-CRAN) with wireless fronthaul, which is a promising framework for future Internet of Things (IoT). The transmission schemes of wireless fronthaul and access links are jointly designed, while addressing the characteristics of ultra-dense network such as base station diversity and high probability of line-of-sight transmission. Specifically, we employ the idea of block diagonalization to deal with the fronthaul interference, which support multi-stream fronthaul transmission for each remote radio head (RRH). We then jointly optimize the power allocation in the fronthaul and the resource allocation in the access link which includes beamforming for information and energy transmission, on/off of RRHs, and user-RRH association. In order to solve the formulated mixed integer non-convex optimization problem, we leverage the sparsity of beamforming vectors brought by the ultra-dense RRHs. We then solve the reformulated problem by employing the successive convex approximation approach. Finally, numerical results are presented to demonstrate the effectiveness of the proposed scheme.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132274346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：