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.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}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024643
Ziyi Li, Leifeng Ruan, Chengqiang Yao, Yao Dong, Na Cui
This paper investigates a 5G layer 2 network software architecture design on Intel architecture with best practice. We consider to utilize both CPU and hardware acceleration units to implement layer 2 protocols according to 3rd Generation Partnership Project (3GPP). By considering different split options in centralized unit and distributed unit, the proposed software architecture is proved to be able to suit for both scenarios, as well as small cell and macro cell deployment scenarios. Numerical results show that the proposed architecture can be realized on Intel® Xeon® processors with pretty good performance, with high throughput, minimum latency and minimum CPU costs.
{"title":"A Best Practice of 5G Layer 2 Network on Intel Architecture","authors":"Ziyi Li, Leifeng Ruan, Chengqiang Yao, Yao Dong, Na Cui","doi":"10.1109/GCWkshps45667.2019.9024643","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024643","url":null,"abstract":"This paper investigates a 5G layer 2 network software architecture design on Intel architecture with best practice. We consider to utilize both CPU and hardware acceleration units to implement layer 2 protocols according to 3rd Generation Partnership Project (3GPP). By considering different split options in centralized unit and distributed unit, the proposed software architecture is proved to be able to suit for both scenarios, as well as small cell and macro cell deployment scenarios. Numerical results show that the proposed architecture can be realized on Intel® Xeon® processors with pretty good performance, with high throughput, minimum latency and minimum CPU costs.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"1 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":"116760719","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}
The Tactile Internet, as a promising communication infrastructure, will be rapidly developed in the 5G era. It supports real-time human-to-machine interactions through delivery of touch and sensation information. The realization of Tactile Internet is associated with the demands of ultra-reliable and ultra-low latency connectivity, which is an important issue needing to be handled. Device-to-device (D2D) communication is a short-distance ultra-low latency transmission mode in 5G, which is capable of D2D edge nodes communicating with each other directly without an infrastructure of access point. In addition, D2D communication can reuse the licensed band resources under the management of the base station. Therefore, to meet the reliability and latency demands, D2D can be advocated as a significant component of the Tactile Internet. This paper focuses on a reliability design of D2D which can support ultra-high reliability and ultra-low latency connectivity in the Tactile Internet. Specifically, we firstly simulate the reliability of D2D communication as a birth and death process. Then, we propose a redundant D2D transmission scheme, which enhances D2D reliability under the conditions of latency and resources. Finally, we design a dynamic programming (DP) algorithm to solve the problem of redundant D2D link selection. Simulation results about the transmission reliability and latency show that our proposed scheme can have better performance than the competing schemes, which can satisfy connectivity requirements of the Tactile Internet.
{"title":"Ultra-Reliability Connectivity with Redundant D2D Transmission Scheme for Tactile Internet","authors":"Zhe Yuan, Xin Wei, Jianxin Chen, B. Kang, Wenqin Zhuang, Liang Zhou","doi":"10.1109/GCWkshps45667.2019.9024454","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024454","url":null,"abstract":"The Tactile Internet, as a promising communication infrastructure, will be rapidly developed in the 5G era. It supports real-time human-to-machine interactions through delivery of touch and sensation information. The realization of Tactile Internet is associated with the demands of ultra-reliable and ultra-low latency connectivity, which is an important issue needing to be handled. Device-to-device (D2D) communication is a short-distance ultra-low latency transmission mode in 5G, which is capable of D2D edge nodes communicating with each other directly without an infrastructure of access point. In addition, D2D communication can reuse the licensed band resources under the management of the base station. Therefore, to meet the reliability and latency demands, D2D can be advocated as a significant component of the Tactile Internet. This paper focuses on a reliability design of D2D which can support ultra-high reliability and ultra-low latency connectivity in the Tactile Internet. Specifically, we firstly simulate the reliability of D2D communication as a birth and death process. Then, we propose a redundant D2D transmission scheme, which enhances D2D reliability under the conditions of latency and resources. Finally, we design a dynamic programming (DP) algorithm to solve the problem of redundant D2D link selection. Simulation results about the transmission reliability and latency show that our proposed scheme can have better performance than the competing schemes, which can satisfy connectivity requirements of the Tactile Internet.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"58 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":"115161965","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.9024408
Zeyu Hu, Zexu Li, Yong Li
With the increasing amount of data in wireless network, the problem of energy consumption becomes more serious due to energy requirement for massive data transmission. This paper proposes an energy-efficient resource allocation algorithm with dynamic cache, which can adjust the caching strategy dynamically according to the channel state to reduce energy consumption under the constraint of smooth video streaming. The mathematical models of energy consumption for video transmission and decision selection are established, respectively. Given the dynamic channel environment, an on-line algorithm using reinforcement learning is proposed. In order to reduce the overall energy consumption of the system, and maintain the balance of energy consumption between transmission and calculation, the model of the off-line part is trained by using the neural network, and the calculation accuracy is adjusted adaptively. The simulation results show that the proposed algorithm can improve the total energy efficiency of the system effectively.
{"title":"Energy-Efficient Resource Allocation with Dynamic Cache Using Reinforcement Learning","authors":"Zeyu Hu, Zexu Li, Yong Li","doi":"10.1109/GCWkshps45667.2019.9024408","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024408","url":null,"abstract":"With the increasing amount of data in wireless network, the problem of energy consumption becomes more serious due to energy requirement for massive data transmission. This paper proposes an energy-efficient resource allocation algorithm with dynamic cache, which can adjust the caching strategy dynamically according to the channel state to reduce energy consumption under the constraint of smooth video streaming. The mathematical models of energy consumption for video transmission and decision selection are established, respectively. Given the dynamic channel environment, an on-line algorithm using reinforcement learning is proposed. In order to reduce the overall energy consumption of the system, and maintain the balance of energy consumption between transmission and calculation, the model of the off-line part is trained by using the neural network, and the calculation accuracy is adjusted adaptively. The simulation results show that the proposed algorithm can improve the total energy efficiency of the system effectively.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"26 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":"115266369","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.9024374
A. Al-Habob, O. Dobre, A. G. Armada
In this paper, we consider sequential task offloading to multiple mobile-edge computing servers to providing ultra-reliable low- latency mobile edge computing. The task consists of a set of sub-tasks, with a general dependency model among sub-tasks. Our objective is to minimize both latency and offloading failure probability by scheduling sub-tasks to servers. We formulate an optimization problem with constraints over binary scheduling decision variables. A genetic algorithm is devised to solve the formulated optimization problems. Simulation results show that the proposed algorithm provides performance close to the optimal solution, which is obtained through exhaustive search.
{"title":"Sequential Task Scheduling for Mobile Edge Computing Using Genetic Algorithm","authors":"A. Al-Habob, O. Dobre, A. G. Armada","doi":"10.1109/GCWkshps45667.2019.9024374","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024374","url":null,"abstract":"In this paper, we consider sequential task offloading to multiple mobile-edge computing servers to providing ultra-reliable low- latency mobile edge computing. The task consists of a set of sub-tasks, with a general dependency model among sub-tasks. Our objective is to minimize both latency and offloading failure probability by scheduling sub-tasks to servers. We formulate an optimization problem with constraints over binary scheduling decision variables. A genetic algorithm is devised to solve the formulated optimization problems. Simulation results show that the proposed algorithm provides performance close to the optimal solution, which is obtained through exhaustive search.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"20 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":"123076069","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
扫码关注我们
求助内容：
应助结果提醒方式：