Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024381
Weidong Fang, Wuxiong Zhang, Wei Chen, Weiwei Gao, G. Jia
As a three-dimensional distributed network, the UAV network is very critical for communication security. The current security approaches for UAV are mainly traditional secure schemes, such as encryption, authentication, and etc. Unfortunately, these secure schemes could not defend against the internal attacks. Simultaneously, as an effective technology to defend against the internal attacks, this is, a trust management technology, has security vulnerabilities in the third party recommendation. Nevertheless, there is also the risk of cyber holes in UAV network. In this paper, we propose an indirect observation node selection scheme (IONSS) to solve these issues. For all current indirect observation nodes, their energy levels are sorted to select the appropriate nodes. The Grey-decision calculation is performed and sorted with the attribute of these nodes, and the previous nodes are preferentially selected as the indirect observation nodes. The simulation results show that the balance between security and energy efficiency.
{"title":"IONSS: Indirect Observation Node Selection Scheme in Trust Management for UAV Network","authors":"Weidong Fang, Wuxiong Zhang, Wei Chen, Weiwei Gao, G. Jia","doi":"10.1109/GCWkshps45667.2019.9024381","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024381","url":null,"abstract":"As a three-dimensional distributed network, the UAV network is very critical for communication security. The current security approaches for UAV are mainly traditional secure schemes, such as encryption, authentication, and etc. Unfortunately, these secure schemes could not defend against the internal attacks. Simultaneously, as an effective technology to defend against the internal attacks, this is, a trust management technology, has security vulnerabilities in the third party recommendation. Nevertheless, there is also the risk of cyber holes in UAV network. In this paper, we propose an indirect observation node selection scheme (IONSS) to solve these issues. For all current indirect observation nodes, their energy levels are sorted to select the appropriate nodes. The Grey-decision calculation is performed and sorted with the attribute of these nodes, and the previous nodes are preferentially selected as the indirect observation nodes. The simulation results show that the balance between security and energy efficiency.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116534825","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024464
Meng Zhou, Yao Zhang, Haotong Cao, Xu Qiao, Longxiang Yang
This paper considers the enhanced power allocation algorithms for uplink mixed analog-to-digital converters (ADCs) massive multiple-input multiple- output (MIMO) systems. With the maximal-ratio combining (MRC) receiver and the linear additive quantization noise model (AQNM), the closed-form expression for the uplink spectral efficiency (SE) is derived. Based on the obtained achievable SE, a mixed quality-of-service (QoS) power allocation algorithm is designed first, in which the target users can meet their QoS constraints. Besides, considering the fact that in the future practical communication scenarios, some urgent emerging situations such as driverless vehicles, tele- surgery, and real-time data analytics usually require a higher SE than others. A weighted max-min power allocation algorithm is also explored in this paper. In particular, both the two power allocation algorithms can be characterized as geometric programmings (GPs). Numerical results are provided to compare the difference and verify the effectiveness of the proposed enhanced power allocation algorithms.
{"title":"Enhanced Power Allocation Algorithms for Uplink Mixed ADCS Massive MIMO Systems","authors":"Meng Zhou, Yao Zhang, Haotong Cao, Xu Qiao, Longxiang Yang","doi":"10.1109/GCWkshps45667.2019.9024464","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024464","url":null,"abstract":"This paper considers the enhanced power allocation algorithms for uplink mixed analog-to-digital converters (ADCs) massive multiple-input multiple- output (MIMO) systems. With the maximal-ratio combining (MRC) receiver and the linear additive quantization noise model (AQNM), the closed-form expression for the uplink spectral efficiency (SE) is derived. Based on the obtained achievable SE, a mixed quality-of-service (QoS) power allocation algorithm is designed first, in which the target users can meet their QoS constraints. Besides, considering the fact that in the future practical communication scenarios, some urgent emerging situations such as driverless vehicles, tele- surgery, and real-time data analytics usually require a higher SE than others. A weighted max-min power allocation algorithm is also explored in this paper. In particular, both the two power allocation algorithms can be characterized as geometric programmings (GPs). Numerical results are provided to compare the difference and verify the effectiveness of the proposed enhanced power allocation algorithms.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134165535","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024434
Pranav Pratap Singh, R. Kaushik, Harpreet Singh, Neeraj Kumar, P. Rana
In this paper, we propose an optimal scheme to identify various plant leaf diseases.We explore various optimizers and loss function in the proposed scheme to find the best possible combination to get most accurate output on our datasets(plant leaves). Some of the optimizers used in the proposal are Adaptive Momentum, Root Mean Square Propogation, Adaptive Gradi- ent Descent, Nestrov Accelerated Adam,and Stochastic Graient Descent.Also, various loss functions used in our keras model are Mean Squared Error, Categorical Crossentropy, and Cosine Proximity. Leaf datasets used in research consisted of few (i) Healthy datasets and (ii) Diseased leaf datasets. From the results obtained, it is proved that CNN has significantly higher accuracy in comparison to the Random Forest classification models used for the same purposes in the past.
{"title":"Convolutional Neural Networks Based Plant Leaf Diseases Detection Scheme","authors":"Pranav Pratap Singh, R. Kaushik, Harpreet Singh, Neeraj Kumar, P. Rana","doi":"10.1109/GCWkshps45667.2019.9024434","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024434","url":null,"abstract":"In this paper, we propose an optimal scheme to identify various plant leaf diseases.We explore various optimizers and loss function in the proposed scheme to find the best possible combination to get most accurate output on our datasets(plant leaves). Some of the optimizers used in the proposal are Adaptive Momentum, Root Mean Square Propogation, Adaptive Gradi- ent Descent, Nestrov Accelerated Adam,and Stochastic Graient Descent.Also, various loss functions used in our keras model are Mean Squared Error, Categorical Crossentropy, and Cosine Proximity. Leaf datasets used in research consisted of few (i) Healthy datasets and (ii) Diseased leaf datasets. From the results obtained, it is proved that CNN has significantly higher accuracy in comparison to the Random Forest classification models used for the same purposes in the past.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130305352","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024392
Jie Jiang, Yibo Yan, Mengyu Zhang, Binchao Yin, Yumeng Jiang, Tong Yang, Xiaoming Li, Tengjiao Wang
Hash tables have been broadly used in many security applications. These applications require fast query speed and high memory efficiency. However, the query speed degrades when hash collisions happen. The design goal of this paper is to achieve high load factor as well as fast query at the same time. In this paper, we propose a novel hashing scheme, namely the Shifting Hash Table (SHT), which consists of two parts. The first part is an enhanced version of the Bloom filter checking which subtable(s) may contain the incoming items, and the second part contains a cuckoo hashing based hash table which stores the key-value pairs. The key technique of this paper is that we divide items into two categories: at-home and abroad. We only insert the second kind of items (abroad) into the Bloom filter, thus the memory usage of the filter is significantly reduced. We conducted extensive experiments and the results show that SHT significantly outperforms the state-of-the-art. Specifically, SHT can query an item using on average less than 1.05 bucket probes and even using 1 bit per entry in the fast memory, and achieve a high load factor which is 95% at the same time.
{"title":"Shifting Hash Table: An Efficient Hash Table with Delicate Summary","authors":"Jie Jiang, Yibo Yan, Mengyu Zhang, Binchao Yin, Yumeng Jiang, Tong Yang, Xiaoming Li, Tengjiao Wang","doi":"10.1109/GCWkshps45667.2019.9024392","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024392","url":null,"abstract":"Hash tables have been broadly used in many security applications. These applications require fast query speed and high memory efficiency. However, the query speed degrades when hash collisions happen. The design goal of this paper is to achieve high load factor as well as fast query at the same time. In this paper, we propose a novel hashing scheme, namely the Shifting Hash Table (SHT), which consists of two parts. The first part is an enhanced version of the Bloom filter checking which subtable(s) may contain the incoming items, and the second part contains a cuckoo hashing based hash table which stores the key-value pairs. The key technique of this paper is that we divide items into two categories: at-home and abroad. We only insert the second kind of items (abroad) into the Bloom filter, thus the memory usage of the filter is significantly reduced. We conducted extensive experiments and the results show that SHT significantly outperforms the state-of-the-art. Specifically, SHT can query an item using on average less than 1.05 bucket probes and even using 1 bit per entry in the fast memory, and achieve a high load factor which is 95% at the same time.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124879218","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024517
Shishi Zhang, Wenchi Cheng
Efficient disaster recovery can rely on unmanned aerial vehicles (UAVs)-assisted emergency communication networks. Due to the rapid growing of the real-time multimedia traffics in the post-disaster situations, the UAV-enabled emergency network is expected to satisfy different levels of delay requirements. In addition to UAVs, the underlying spectrum sharing transmission links are typically applied to deploy device-to-device (D2D) communications in the emergency scenarios. Therefore, the interference management is critical to UAVs-assisted networks with D2D communications. In this paper, we propose the statistical delay-bounded quality of service (QoS) provisioning framework to support diverse traffics in the UAV-enabled emergency network, where the UAVs are deployed as base stations for downlink transmissions with underlying spectrum sharing device-to-device (D2D) users engaged. In particular, we formulate the optimization problem, which subjects to the average power and peak rate constraints, to maximize the effective capacity under various QoS requirements. Simulation results verify the impact of interference related parameters and delay exponents on the effective capacity and show that our developed optimal power allocation scheme can achieve the maximum effective capacity under diverse delay-bounded QoS requirements than other existing schemes.
{"title":"Statistical QoS Provisioning for UAV-Enabled Emergency Communication Networks","authors":"Shishi Zhang, Wenchi Cheng","doi":"10.1109/GCWkshps45667.2019.9024517","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024517","url":null,"abstract":"Efficient disaster recovery can rely on unmanned aerial vehicles (UAVs)-assisted emergency communication networks. Due to the rapid growing of the real-time multimedia traffics in the post-disaster situations, the UAV-enabled emergency network is expected to satisfy different levels of delay requirements. In addition to UAVs, the underlying spectrum sharing transmission links are typically applied to deploy device-to-device (D2D) communications in the emergency scenarios. Therefore, the interference management is critical to UAVs-assisted networks with D2D communications. In this paper, we propose the statistical delay-bounded quality of service (QoS) provisioning framework to support diverse traffics in the UAV-enabled emergency network, where the UAVs are deployed as base stations for downlink transmissions with underlying spectrum sharing device-to-device (D2D) users engaged. In particular, we formulate the optimization problem, which subjects to the average power and peak rate constraints, to maximize the effective capacity under various QoS requirements. Simulation results verify the impact of interference related parameters and delay exponents on the effective capacity and show that our developed optimal power allocation scheme can achieve the maximum effective capacity under diverse delay-bounded QoS requirements than other existing schemes.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131698138","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024621
Ting Li, Liqiang Zhao, Ran Duan, Hongxin Tian
5G is becoming open, service-oriented, and software- oriented by introducing Service Based Architecture (SBA) into its core network. In consequence, we propose SBA-based mobile edge computing (MEC) in this paper. Firstly, we present a service-based MEC platform architecture, composed of network functions (NFs) and service based interface. We design several specific NFs that are different from SBA in 5G core network. Secondly, MEC platform architecture is enhanced by introducing templates for dedicated MEC services. Thirdly, we present a MEC orchestration scheme, which contains parameter configuration and instantiation. We establish a testbed based on an open source software, and experiment results demonstrate that our proposed SBA-based MEC can provide users with customized services, e.g., low latency computing and high speed caching.
5G通过在核心网络中引入基于服务的架构(Service Based Architecture, SBA)，实现开放、面向服务、软件导向。因此，我们在本文中提出基于sba的移动边缘计算(MEC)。首先，提出了一种基于服务的MEC平台架构，该架构由网络功能(NFs)和基于服务的接口组成。我们设计了几个不同于5G核心网SBA的特定NFs。其次，通过引入MEC专用服务模板，增强了MEC平台架构。第三，我们提出了一个包含参数配置和实例化的MEC编排方案。我们建立了一个基于开源软件的测试平台，实验结果表明，我们提出的基于sba的MEC可以为用户提供定制服务，如低延迟计算和高速缓存。
{"title":"SBA-Based Mobile Edge Computing","authors":"Ting Li, Liqiang Zhao, Ran Duan, Hongxin Tian","doi":"10.1109/GCWkshps45667.2019.9024621","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024621","url":null,"abstract":"5G is becoming open, service-oriented, and software- oriented by introducing Service Based Architecture (SBA) into its core network. In consequence, we propose SBA-based mobile edge computing (MEC) in this paper. Firstly, we present a service-based MEC platform architecture, composed of network functions (NFs) and service based interface. We design several specific NFs that are different from SBA in 5G core network. Secondly, MEC platform architecture is enhanced by introducing templates for dedicated MEC services. Thirdly, we present a MEC orchestration scheme, which contains parameter configuration and instantiation. We establish a testbed based on an open source software, and experiment results demonstrate that our proposed SBA-based MEC can provide users with customized services, e.g., low latency computing and high speed caching.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"425 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133162071","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024651
Wenwen Li, Z. Dou, Can Wang, Yu Zhang
Modulation classification plays an important role in civil and military fields such as software defined radio, electronic countermeasure and intelligent demodulator. Due to the difficulty of feature extraction in traditional signal modulation classification algorithm, this paper proposes a signal modulation classification algorithm based on deep belief network. The proposed algorithm does not need to extract the signal features, and uses the I/Q data to classify signal directly. The simulation results show that the classification performance of the proposed algorithm is better than traditional machine learning algorithm, when the simulation condition is same.
{"title":"Signal Modulation Classification Based on Deep Belief Network","authors":"Wenwen Li, Z. Dou, Can Wang, Yu Zhang","doi":"10.1109/GCWkshps45667.2019.9024651","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024651","url":null,"abstract":"Modulation classification plays an important role in civil and military fields such as software defined radio, electronic countermeasure and intelligent demodulator. Due to the difficulty of feature extraction in traditional signal modulation classification algorithm, this paper proposes a signal modulation classification algorithm based on deep belief network. The proposed algorithm does not need to extract the signal features, and uses the I/Q data to classify signal directly. The simulation results show that the classification performance of the proposed algorithm is better than traditional machine learning algorithm, when the simulation condition is same.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"365 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133904585","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024474
Kaiming Shen, Saeed R. Khosravirad, Wei Yu
Multi-hop relaying has emerged as a key technique for ultra-reliable communications due to its ability to harness spatial location diversity while avoiding interference. In this framework, the user messages are aggregated into a single packet and broadcast to all the receivers in multiple phases, thus allowing the stronger receivers to relay the packet to the weaker receivers. Prior implementations of the above framework, however, typically do not leverage the past received signals to improve message decoding. This paper proposes using incremental redundancy coding with coordinated decoding across the multiple phases, in conjunction with transmission using space-time coding, to enable higher achievable rate overall. The resulting scheme provides significant improvement over the existing methods. Moreover, we propose an extension that incorporates multi-cell interference management.
{"title":"Ultra-Reliable Wireless Communications via Incremental Redundancy and Space-Time Coding","authors":"Kaiming Shen, Saeed R. Khosravirad, Wei Yu","doi":"10.1109/GCWkshps45667.2019.9024474","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024474","url":null,"abstract":"Multi-hop relaying has emerged as a key technique for ultra-reliable communications due to its ability to harness spatial location diversity while avoiding interference. In this framework, the user messages are aggregated into a single packet and broadcast to all the receivers in multiple phases, thus allowing the stronger receivers to relay the packet to the weaker receivers. Prior implementations of the above framework, however, typically do not leverage the past received signals to improve message decoding. This paper proposes using incremental redundancy coding with coordinated decoding across the multiple phases, in conjunction with transmission using space-time coding, to enable higher achievable rate overall. The resulting scheme provides significant improvement over the existing methods. Moreover, we propose an extension that incorporates multi-cell interference management.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115913113","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024417
Yongzhi Wu, Chong Han
Providing high-bandwidth and fast-speed links, wireless local area networks (WLANs) in the Terahertz (THz) band have huge potential for varieties of bandwidth-intensive indoor applications. However, due to the specific phenomena in the THz band, including severe molecular absorption, human- body blockage, small-scale fading, analysis on the interference, coverage and achievable rate at the downlink is still a challenging problem. In this paper, by using the tool of stochastic geometry, the exact distribution for the received signal power and the approximated distribution for the interference with its analytical moments at an arbitrary user equipment (UE) are derived. More- over, semi-closed-form expressions for the coverage probability and the average achievable rate are investigated. The theoretical derivations are validated with Monte-Carlo simulations. Finally, numerical results demonstrate that narrower beam-width of main lobe at directional antennas and more access points (APs) can enhance the received signal power and the total interference, and effectively influence the coverage and average achievable rate.
{"title":"Interference and Coverage Analysis for Indoor Terahertz Wireless Local Area Networks","authors":"Yongzhi Wu, Chong Han","doi":"10.1109/GCWkshps45667.2019.9024417","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024417","url":null,"abstract":"Providing high-bandwidth and fast-speed links, wireless local area networks (WLANs) in the Terahertz (THz) band have huge potential for varieties of bandwidth-intensive indoor applications. However, due to the specific phenomena in the THz band, including severe molecular absorption, human- body blockage, small-scale fading, analysis on the interference, coverage and achievable rate at the downlink is still a challenging problem. In this paper, by using the tool of stochastic geometry, the exact distribution for the received signal power and the approximated distribution for the interference with its analytical moments at an arbitrary user equipment (UE) are derived. More- over, semi-closed-form expressions for the coverage probability and the average achievable rate are investigated. The theoretical derivations are validated with Monte-Carlo simulations. Finally, numerical results demonstrate that narrower beam-width of main lobe at directional antennas and more access points (APs) can enhance the received signal power and the total interference, and effectively influence the coverage and average achievable rate.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116537546","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
扫码关注我们
求助内容：
应助结果提醒方式：