Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9148903
Ke Xu, F. Zheng, Pan Cao, Hongguang Xu, Xu Zhu
In this paper, a hybrid multi-user massive MIMO system operating on the mmWave frequency is considered. To reduce the heavy beam training overhead for such a massive MIMO system, we propose a 3D beam training algorithm, which estimates the azimuth and elevation of the angle of arrival (AoA) and departure (AoD) between the base station (BS) and the mobile stations (MSs). The proposed algorithm first executes a hierarchical search to acquire the range of azimuth and elevation, then applies an exhaustive search within this range for a more precise matching. Through this two-stage approach, the beam training overhead can be substantially reduced.
{"title":"Fast 3D Beam Training in mmWave Multiuser MIMO Systems with Finite-Bit Phase Shifters","authors":"Ke Xu, F. Zheng, Pan Cao, Hongguang Xu, Xu Zhu","doi":"10.1109/ICC40277.2020.9148903","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148903","url":null,"abstract":"In this paper, a hybrid multi-user massive MIMO system operating on the mmWave frequency is considered. To reduce the heavy beam training overhead for such a massive MIMO system, we propose a 3D beam training algorithm, which estimates the azimuth and elevation of the angle of arrival (AoA) and departure (AoD) between the base station (BS) and the mobile stations (MSs). The proposed algorithm first executes a hierarchical search to acquire the range of azimuth and elevation, then applies an exhaustive search within this range for a more precise matching. Through this two-stage approach, the beam training overhead can be substantially reduced.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127310480","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 : 2020-06-01DOI: 10.1109/ICC40277.2020.9148889
Hyun-Ho Choi, Dara Ron, Sengly Muy, Jung-Ryun Lee
For energy-neutral operation (ENO) of wireless sensor networks (WSNs), we consider a WSN deployed in a wireless powered communication network. In this network, sensor nodes with high harvesting energies and good link budgets have energy remaining after sending their data to the cluster head (CH), whereas the CH suffers from energy scarcity. Thus, we apply the simultaneous wireless information and power transfer (SWIPT) technique so that the sensor nodes can transfer their remaining energy to the CH while transmitting data in a cooperative manner. To maximize the achievable rate of sensing data while guaranteeing ENO, we propose a novel ENO framework, which provides a frame structure for SWIPT operation, rate improvement subject to ENO, SWIPT ratio optimization, as well as clustering and CH selection algorithm. The results of extensive simulations demonstrate that the proposed scheme based on SWIPT significantly improves the achievable rate while guaranteeing ENO, in comparison with the conventional schemes without SWIPT.
{"title":"Energy-Neutral Wireless Sensor Network Based on SWIPT in Wireless Powered Communication Networks","authors":"Hyun-Ho Choi, Dara Ron, Sengly Muy, Jung-Ryun Lee","doi":"10.1109/ICC40277.2020.9148889","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148889","url":null,"abstract":"For energy-neutral operation (ENO) of wireless sensor networks (WSNs), we consider a WSN deployed in a wireless powered communication network. In this network, sensor nodes with high harvesting energies and good link budgets have energy remaining after sending their data to the cluster head (CH), whereas the CH suffers from energy scarcity. Thus, we apply the simultaneous wireless information and power transfer (SWIPT) technique so that the sensor nodes can transfer their remaining energy to the CH while transmitting data in a cooperative manner. To maximize the achievable rate of sensing data while guaranteeing ENO, we propose a novel ENO framework, which provides a frame structure for SWIPT operation, rate improvement subject to ENO, SWIPT ratio optimization, as well as clustering and CH selection algorithm. The results of extensive simulations demonstrate that the proposed scheme based on SWIPT significantly improves the achievable rate while guaranteeing ENO, in comparison with the conventional schemes without SWIPT.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130078060","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 : 2020-06-01DOI: 10.1109/ICC40277.2020.9148783
Mohamed Amine Ben Temim, G. Ferré, Romain Tajan, Baptiste Laporte-Fauret
LoRa is a chirp spread-spectrum modulation that operates in industrial, scientific, and medical (ISM) free bands. The modulation has been developed for low power and long-range wireless Internet of Things (IoT) communications. Operating in unlicensed bands requires connected objects to reduce their energy consumption. Thereby, it is very likely that their access to the radio channel is random, which leads to an increase in the probability of packet collisions. In this paper, we design a new receiver able to decode several IoTLoRa-Like signals simultaneously received on the same channel and with the same spreading factor which leads to destructive collisions. Based on the particular structure of the superposed received signals and the Successive Interference Cancellation (SIC) algorithm, we propose a novel approach to detect, synchronize and decode each of them iteratively.
{"title":"A Novel Approach to Process the Multiple Reception of Non-Orthogonal LoRa-Like Signals","authors":"Mohamed Amine Ben Temim, G. Ferré, Romain Tajan, Baptiste Laporte-Fauret","doi":"10.1109/ICC40277.2020.9148783","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148783","url":null,"abstract":"LoRa is a chirp spread-spectrum modulation that operates in industrial, scientific, and medical (ISM) free bands. The modulation has been developed for low power and long-range wireless Internet of Things (IoT) communications. Operating in unlicensed bands requires connected objects to reduce their energy consumption. Thereby, it is very likely that their access to the radio channel is random, which leads to an increase in the probability of packet collisions. In this paper, we design a new receiver able to decode several IoTLoRa-Like signals simultaneously received on the same channel and with the same spreading factor which leads to destructive collisions. Based on the particular structure of the superposed received signals and the Successive Interference Cancellation (SIC) algorithm, we propose a novel approach to detect, synchronize and decode each of them iteratively.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128902621","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 : 2020-06-01DOI: 10.1109/ICC40277.2020.9149362
S. Chatterjee, Mohammad J. Abdel-Rahman, A. B. Mackenzie
Millimeter wave (mmW) systems typically use beamforming techniques to compensate for the high pathloss. However, directional communications in the presence of uncertainty in user equipment (UE) locations and channel conditions make maintaining coverage and connectivity challenging. In this context, assuming that mmW access points (APs) use low complexity fixed directional antennas, we propose a joint optimization framework for AP deployment and UE assignment in indoor mmW networks. The goal of our optimization framework is to determine the minimum number of required APs, their optimal locations, their optimal beam directions, and their optimal assignments to individual UEs in order to ensure network-wide coverage and maximize the stability of mmW beams assigned to individual UEs. The network deployment decisions (i.e., the required number of APs, their placements, and their beam directions) are static and are taken before UE locations and channel conditions are revealed. The UE assignment decisions are taken under each realization of UE locations and channel conditions considering the availability and stability of the mmW beams. Our numerical results demonstrate the behavior of the proposed framework under various UE distributions and system parameters.
{"title":"Robust Access Point Deployment and Adaptive User Assignment for Indoor Millimeter Wave Networks","authors":"S. Chatterjee, Mohammad J. Abdel-Rahman, A. B. Mackenzie","doi":"10.1109/ICC40277.2020.9149362","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149362","url":null,"abstract":"Millimeter wave (mmW) systems typically use beamforming techniques to compensate for the high pathloss. However, directional communications in the presence of uncertainty in user equipment (UE) locations and channel conditions make maintaining coverage and connectivity challenging. In this context, assuming that mmW access points (APs) use low complexity fixed directional antennas, we propose a joint optimization framework for AP deployment and UE assignment in indoor mmW networks. The goal of our optimization framework is to determine the minimum number of required APs, their optimal locations, their optimal beam directions, and their optimal assignments to individual UEs in order to ensure network-wide coverage and maximize the stability of mmW beams assigned to individual UEs. The network deployment decisions (i.e., the required number of APs, their placements, and their beam directions) are static and are taken before UE locations and channel conditions are revealed. The UE assignment decisions are taken under each realization of UE locations and channel conditions considering the availability and stability of the mmW beams. Our numerical results demonstrate the behavior of the proposed framework under various UE distributions and system parameters.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"28 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130645411","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 : 2020-06-01DOI: 10.1109/ICC40277.2020.9149255
Jamsheed Manja Ppallan, Sweta Jaiswal, K. Arunachalam, D. Sabareesh, M. Kanagarathinam, Pasquale Imputato, S. Avallone
The Next Generation Networks (NGN) set its standard to provide very high data rates, Ultra-Reliable Low Latency Communications (URLLC), increased network capacity and significantly improved Quality of Service (QoS). Thus, it provides an infrastructure for the Internet of Things (IoT) to power billions of connected devices. With this upsurge in IoT devices, the need for adopting IPv6 over exhausting IPv4 addresses becomes more unavoidable. Hence, Internet Service Providers (ISP’s) are adopting IPv6 along with IPv4 addresses using an address transition method called dual-stack. However, the Dual-Stack network causes relatively more connectivity overhead than the single stack network. For example, DNS lookup and TCP connection time are comparatively high in dual-stack mobile devices. This affects the page loading time of the application, thereby impacting the user experience significantly. In this paper, we analyzed all these connectivity overheads and propose a novel solution called NexGen Connectivity optimizer (NexGenCO), which provides better connectivity for the applications using network-aware concurrency and intelligent DNS caching. NexGenCO is prototyped and evaluated in Samsung devices with Android Pie. It significantly reduces connectivity overhead and improves page loading time up to 18% consistently.
{"title":"NexGen Connectivity Optimizer: An Enhancement of Smart Phone Performance for Better Connectivity","authors":"Jamsheed Manja Ppallan, Sweta Jaiswal, K. Arunachalam, D. Sabareesh, M. Kanagarathinam, Pasquale Imputato, S. Avallone","doi":"10.1109/ICC40277.2020.9149255","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149255","url":null,"abstract":"The Next Generation Networks (NGN) set its standard to provide very high data rates, Ultra-Reliable Low Latency Communications (URLLC), increased network capacity and significantly improved Quality of Service (QoS). Thus, it provides an infrastructure for the Internet of Things (IoT) to power billions of connected devices. With this upsurge in IoT devices, the need for adopting IPv6 over exhausting IPv4 addresses becomes more unavoidable. Hence, Internet Service Providers (ISP’s) are adopting IPv6 along with IPv4 addresses using an address transition method called dual-stack. However, the Dual-Stack network causes relatively more connectivity overhead than the single stack network. For example, DNS lookup and TCP connection time are comparatively high in dual-stack mobile devices. This affects the page loading time of the application, thereby impacting the user experience significantly. In this paper, we analyzed all these connectivity overheads and propose a novel solution called NexGen Connectivity optimizer (NexGenCO), which provides better connectivity for the applications using network-aware concurrency and intelligent DNS caching. NexGenCO is prototyped and evaluated in Samsung devices with Android Pie. It significantly reduces connectivity overhead and improves page loading time up to 18% consistently.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132972884","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 : 2020-06-01DOI: 10.1109/ICC40277.2020.9148645
Konstantin Mikhaylov, Martin Stusek, Pavel Mašek, R. Fujdiak, Radek Mozny, S. Andreev, Jiri Hosek
In this paper, we study real-world performance of Sigfox, which is one of the most mature Low-Power Wide-Area Network (LPWAN) technologies that operate in unlicensed frequency bands. During an extensive measurement campaign conducted over three months in the city of Brno, Czech Republic, we assessed the communication performance and the radio channel properties in 311 different test locations. We observed that despite the challenging natural landscape and urban environment of the test area, more than 94% of the packets sent were received successfully, with at least one packet delivered from 297 out of 311 tested locations. Our results also reported experiment-based radio channel and signal-to-noise characterization as well as provided insights into the efficiency of two crucial mechanisms used by Sigfox to improve the packet delivery - packet repetition and multi-gateway reception. Finally, we employed our experimental data to understand the efficiency of two non-fingerprint localization methods based on received signal strength indicator in a practical Sigfox network.
{"title":"Communication Performance of a Real-Life Wide-Area Low-Power Network Based on Sigfox Technology","authors":"Konstantin Mikhaylov, Martin Stusek, Pavel Mašek, R. Fujdiak, Radek Mozny, S. Andreev, Jiri Hosek","doi":"10.1109/ICC40277.2020.9148645","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148645","url":null,"abstract":"In this paper, we study real-world performance of Sigfox, which is one of the most mature Low-Power Wide-Area Network (LPWAN) technologies that operate in unlicensed frequency bands. During an extensive measurement campaign conducted over three months in the city of Brno, Czech Republic, we assessed the communication performance and the radio channel properties in 311 different test locations. We observed that despite the challenging natural landscape and urban environment of the test area, more than 94% of the packets sent were received successfully, with at least one packet delivered from 297 out of 311 tested locations. Our results also reported experiment-based radio channel and signal-to-noise characterization as well as provided insights into the efficiency of two crucial mechanisms used by Sigfox to improve the packet delivery - packet repetition and multi-gateway reception. Finally, we employed our experimental data to understand the efficiency of two non-fingerprint localization methods based on received signal strength indicator in a practical Sigfox network.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130945695","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 : 2020-06-01DOI: 10.1109/ICC40277.2020.9149192
Gao Liu, Huidong Dong, Zheng Yan
Security-related data collection is an essential part for attack detection and security measurement in Mobile Ad Hoc Networks (MANETs). Due to no fixed infrastructure of MANETs, a detection node playing as a collector should discover available routes to a collection node for data collection. Notably, route discovery suffers from many attacks (e.g., wormhole attack), thus the detection node should also collect securityrelated data during route discovery and analyze these data for determining reliable routes. However, few literatures provide incentives for security-related data collection in MANETs, and thus the detection node might not collect sufficient data, which greatly impacts the accuracy of attack detection and security measurement. In this paper, we propose B4SDC, a blockchain system for security-related data collection in MANETs. Through controlling the scale of RREQ forwarding in route discovery, the collector can constrain its payment and simultaneously make each forwarder of control information (namely RREQs and RREPs) obtain rewards as much as possible to ensure fairness. At the same time, B4SDC avoids collusion attacks with cooperative receipt reporting, and spoofing attacks by adopting a secure digital signature. Based on a novel Proof-of-Stake consensus mechanism by accumulating stakes through message forwarding, B4SDC not only provides incentives for all participating nodes, but also avoids forking and ensures high efficiency and real decentralization at the same time. We analyze B4SDC in terms of incentives and security, and evaluate its performance through simulations. The thorough analysis and experimental results show the efficacy and effectiveness of B4SDC.
{"title":"B4SDC: A Blockchain System for Security Data Collection in MANETs","authors":"Gao Liu, Huidong Dong, Zheng Yan","doi":"10.1109/ICC40277.2020.9149192","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149192","url":null,"abstract":"Security-related data collection is an essential part for attack detection and security measurement in Mobile Ad Hoc Networks (MANETs). Due to no fixed infrastructure of MANETs, a detection node playing as a collector should discover available routes to a collection node for data collection. Notably, route discovery suffers from many attacks (e.g., wormhole attack), thus the detection node should also collect securityrelated data during route discovery and analyze these data for determining reliable routes. However, few literatures provide incentives for security-related data collection in MANETs, and thus the detection node might not collect sufficient data, which greatly impacts the accuracy of attack detection and security measurement. In this paper, we propose B4SDC, a blockchain system for security-related data collection in MANETs. Through controlling the scale of RREQ forwarding in route discovery, the collector can constrain its payment and simultaneously make each forwarder of control information (namely RREQs and RREPs) obtain rewards as much as possible to ensure fairness. At the same time, B4SDC avoids collusion attacks with cooperative receipt reporting, and spoofing attacks by adopting a secure digital signature. Based on a novel Proof-of-Stake consensus mechanism by accumulating stakes through message forwarding, B4SDC not only provides incentives for all participating nodes, but also avoids forking and ensures high efficiency and real decentralization at the same time. We analyze B4SDC in terms of incentives and security, and evaluate its performance through simulations. The thorough analysis and experimental results show the efficacy and effectiveness of B4SDC.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127864994","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 : 2020-06-01DOI: 10.1109/ICC40277.2020.9148679
Alireza Haqiqatnejad, F. Kayhan, S. Shahbazpanahi, B. Ottersten
We propose a one-bit symbol-level precoding method for massive multiuser multiple-input multiple-output (MU-MIMO) downlink systems using the idea of constructive interference (CI). In particular, we adopt a max-min fair design criterion which aims to maximize the minimum instantaneous received signal-to-noise ratio (SNR) among the user equipments (UEs), while ensuring a CI constraint for each UE and under the restriction that the output of the precoder is a vector of binary elements. This design problem is an NP-hard binary quadratic programming due to the one-bit constraints on the elements of the precoder’s output vector, and hence, is difficult to solve. In this paper, we tackle this difficulty by reformulating the problem, in several steps, into an equivalent continuous-domain biconvex form. Our final biconvex reformulation is obtained via an exact penalty approach and can efficiently be solved using a standard block coordinate ascent algorithm. We show through simulation results that the proposed design outperforms the existing schemes in terms of (uncoded) bit error rate. It is further shown via numerical analysis that our solution algorithm is computationally-efficient as it needs only a few tens of iterations to converge in most practical scenarios.
{"title":"One-Bit Quantized Constructive Interference Based Precoding for Massive Multiuser MIMO Downlink","authors":"Alireza Haqiqatnejad, F. Kayhan, S. Shahbazpanahi, B. Ottersten","doi":"10.1109/ICC40277.2020.9148679","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148679","url":null,"abstract":"We propose a one-bit symbol-level precoding method for massive multiuser multiple-input multiple-output (MU-MIMO) downlink systems using the idea of constructive interference (CI). In particular, we adopt a max-min fair design criterion which aims to maximize the minimum instantaneous received signal-to-noise ratio (SNR) among the user equipments (UEs), while ensuring a CI constraint for each UE and under the restriction that the output of the precoder is a vector of binary elements. This design problem is an NP-hard binary quadratic programming due to the one-bit constraints on the elements of the precoder’s output vector, and hence, is difficult to solve. In this paper, we tackle this difficulty by reformulating the problem, in several steps, into an equivalent continuous-domain biconvex form. Our final biconvex reformulation is obtained via an exact penalty approach and can efficiently be solved using a standard block coordinate ascent algorithm. We show through simulation results that the proposed design outperforms the existing schemes in terms of (uncoded) bit error rate. It is further shown via numerical analysis that our solution algorithm is computationally-efficient as it needs only a few tens of iterations to converge in most practical scenarios.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129035519","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 : 2020-06-01DOI: 10.1109/ICC40277.2020.9148934
Yunshu Liu, Zhixuan Fang, M. H. Cheung, Wei Cai, Jianwei Huang
Miners in a blockchain system are suffering from the ever-increasing storage costs, which in general have not been properly compensated by the users’ transaction fees. In the long run, this may lead to less participation of miners and jeopardize the blockchain security. In this paper, we study the economics of blockchain storage and identify the incentive issues related to this storage cost problem. More specifically, we model the interactions among users (who generate transactions) and miners in two stages, where the users set the transaction fees in Stage 1, and the miners select which transactions to include in Stage 2. Through characterizing the Nash equilibrium of the two-stage game, we find that the transaction fees indeed cannot cover the storage costs under the current practice in general, due to the negative externality and the unfair delay-based pricing. We also identify that a longer block interval can alleviate the concern by raising the transactions fees at the expense of larger delay.
{"title":"Economics of Blockchain Storage","authors":"Yunshu Liu, Zhixuan Fang, M. H. Cheung, Wei Cai, Jianwei Huang","doi":"10.1109/ICC40277.2020.9148934","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148934","url":null,"abstract":"Miners in a blockchain system are suffering from the ever-increasing storage costs, which in general have not been properly compensated by the users’ transaction fees. In the long run, this may lead to less participation of miners and jeopardize the blockchain security. In this paper, we study the economics of blockchain storage and identify the incentive issues related to this storage cost problem. More specifically, we model the interactions among users (who generate transactions) and miners in two stages, where the users set the transaction fees in Stage 1, and the miners select which transactions to include in Stage 2. Through characterizing the Nash equilibrium of the two-stage game, we find that the transaction fees indeed cannot cover the storage costs under the current practice in general, due to the negative externality and the unfair delay-based pricing. We also identify that a longer block interval can alleviate the concern by raising the transactions fees at the expense of larger delay.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128853499","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 : 2020-06-01DOI: 10.1109/ICC40277.2020.9148976
Jue Wang, Zhaoyang Zhang, Yan Chen, Xiaoming Chen, C. Zhong
In the mMTC scenario, enormous devices turn active sporadically or frequently to seek for opportunities to transmit short packets. In this highly dynamic situation, it is critical to design efficient random access (RA) procedures to cope both with the flood of simultaneous access requests and with the potential access failures. In this paper, we propose an incremental RA scheme exploiting the nested Reed-Muller (RM) sequences. Specifically, the users who suffer from access failures expand their RM sequences following the given expansion rule, which utilizes both the nested structure and the cross-correlation property of RM sequences. At the receiver, a recursive detection algorithm is proposed, which exploits the discrepancy in the sequence length to detect the retransmission users progressively. On the other hand, new active users continuously spring up in the system, thus causing the incremental number of users seeking for access. In this case, the proposed scheme can detect newly active users together with retransmission ones with great detection capability and low access latency. Our simulation results verify the superior performance of the proposed RA scheme.
{"title":"Incremental Random Massive Access Exploiting Nested Reed-Muller Sequences","authors":"Jue Wang, Zhaoyang Zhang, Yan Chen, Xiaoming Chen, C. Zhong","doi":"10.1109/ICC40277.2020.9148976","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148976","url":null,"abstract":"In the mMTC scenario, enormous devices turn active sporadically or frequently to seek for opportunities to transmit short packets. In this highly dynamic situation, it is critical to design efficient random access (RA) procedures to cope both with the flood of simultaneous access requests and with the potential access failures. In this paper, we propose an incremental RA scheme exploiting the nested Reed-Muller (RM) sequences. Specifically, the users who suffer from access failures expand their RM sequences following the given expansion rule, which utilizes both the nested structure and the cross-correlation property of RM sequences. At the receiver, a recursive detection algorithm is proposed, which exploits the discrepancy in the sequence length to detect the retransmission users progressively. On the other hand, new active users continuously spring up in the system, thus causing the incremental number of users seeking for access. In this case, the proposed scheme can detect newly active users together with retransmission ones with great detection capability and low access latency. Our simulation results verify the superior performance of the proposed RA scheme.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125450134","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
扫码关注我们
求助内容：
应助结果提醒方式：