Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024443
C. Castro, R. Elschner, José Machado, T. Merkle, C. Schubert, R. Freund
In this paper, we evaluate the transmission performance of a real-time 100 Gb/s digital-coherent THz wireless link, operating on a 300-GHz carrier over a LoS distance of 0.5 m in a 2x2 MIMO configuration. Using a 100 Gb/s Ethernet traffic generator, we evaluate throughput, frame losses and latency for different frame sizes and payloads. The link shows a stable long-term performance as reported by pre-FEC BER measurements taken from the real-time modem's DSP over a period of 96 hours.
{"title":"Ethernet Transmission over a 100 Gb/s Real-Time Terahertz Wireless Link","authors":"C. Castro, R. Elschner, José Machado, T. Merkle, C. Schubert, R. Freund","doi":"10.1109/GCWkshps45667.2019.9024443","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024443","url":null,"abstract":"In this paper, we evaluate the transmission performance of a real-time 100 Gb/s digital-coherent THz wireless link, operating on a 300-GHz carrier over a LoS distance of 0.5 m in a 2x2 MIMO configuration. Using a 100 Gb/s Ethernet traffic generator, we evaluate throughput, frame losses and latency for different frame sizes and payloads. The link shows a stable long-term performance as reported by pre-FEC BER measurements taken from the real-time modem's DSP over a period of 96 hours.","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":"130590468","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.9024522
Christian Killer, B. Rodrigues, B. Stiller
The increasing number of Distributed Denial-of-Service (DDoS) attacks leads to a growing research and development interest in DDoS defense systems. As a response to the increasingly distributed nature of DDoS attacks, many organizations have demonstrated willingness to exchange information concerning threats, incidents, and mitigation strategies. Blockchain is, in this regard, a viable threat sharing platform, where different organizations can interact in a verifiable manner. This paper tackles the security visualization and management issue in a blockchain-based collaborative defense platform, defining an interactive dashboard displaying on-going threat mitigation status and enabling security analysts to react on threats on an individual or group level. The dashboard was implemented and evaluated on real hardware emulating the exchange of threats between three isolated Autonomous Systems (AS).
{"title":"Threat Management Dashboard for a Blockchain Collaborative Defense","authors":"Christian Killer, B. Rodrigues, B. Stiller","doi":"10.1109/GCWkshps45667.2019.9024522","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024522","url":null,"abstract":"The increasing number of Distributed Denial-of-Service (DDoS) attacks leads to a growing research and development interest in DDoS defense systems. As a response to the increasingly distributed nature of DDoS attacks, many organizations have demonstrated willingness to exchange information concerning threats, incidents, and mitigation strategies. Blockchain is, in this regard, a viable threat sharing platform, where different organizations can interact in a verifiable manner. This paper tackles the security visualization and management issue in a blockchain-based collaborative defense platform, defining an interactive dashboard displaying on-going threat mitigation status and enabling security analysts to react on threats on an individual or group level. The dashboard was implemented and evaluated on real hardware emulating the exchange of threats between three isolated Autonomous Systems (AS).","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"53 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":"122322575","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.9024695
Yuan Wu, Daohang Wang, Xu Xu, L. Qian, Liang Huang, Wei-dang Lu
Mobile edge computing (MEC) has been envisioned as a promising scheme to address the explosive growth of computation-hungry mobile applications in future cellular systems. In this paper, we investigate the secrecy-driven energy-efficient computation offloading via MEC. Specifically, we take the secrecy-outage into account when an eavesdropper overhears the mobile terminal's (MT's) offloaded data to the edge server (ES) and formate a joint optimization of the MT's computation offloading, radio transmission, and secrecy-outage level, with the objective of minimizing the MT's energy consumption for completing its required workload. Despite the non-convexity of the joint optimization problem, we propose an efficient algorithm to find the optimal offloading solution. Based on the optimal solution for an arbitrary offloading pair of MT and ES, we further consider the scenario of multi-MT and multi-ES, and investigate the optimal pairing between the MTs and ESs for computation offloading, with the objective of minimizing all MTs' total energy consumption. Exploiting the matching structure of the pairing problem, we propose an efficient auction-based time-division scheduling algorithm to find the optimal pairing solution. Numerical results are provided to validate the effectiveness and efficiency of our proposed algorithms and the advantage of our computation offloading with secrecy-provisioning.
{"title":"Secrecy-Driven Energy-Efficient Multi-User Computation Offloading via Mobile Edge Computing","authors":"Yuan Wu, Daohang Wang, Xu Xu, L. Qian, Liang Huang, Wei-dang Lu","doi":"10.1109/GCWkshps45667.2019.9024695","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024695","url":null,"abstract":"Mobile edge computing (MEC) has been envisioned as a promising scheme to address the explosive growth of computation-hungry mobile applications in future cellular systems. In this paper, we investigate the secrecy-driven energy-efficient computation offloading via MEC. Specifically, we take the secrecy-outage into account when an eavesdropper overhears the mobile terminal's (MT's) offloaded data to the edge server (ES) and formate a joint optimization of the MT's computation offloading, radio transmission, and secrecy-outage level, with the objective of minimizing the MT's energy consumption for completing its required workload. Despite the non-convexity of the joint optimization problem, we propose an efficient algorithm to find the optimal offloading solution. Based on the optimal solution for an arbitrary offloading pair of MT and ES, we further consider the scenario of multi-MT and multi-ES, and investigate the optimal pairing between the MTs and ESs for computation offloading, with the objective of minimizing all MTs' total energy consumption. Exploiting the matching structure of the pairing problem, we propose an efficient auction-based time-division scheduling algorithm to find the optimal pairing solution. Numerical results are provided to validate the effectiveness and efficiency of our proposed algorithms and the advantage of our computation offloading with secrecy-provisioning.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"6 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":"129578134","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.9024397
Christopher Scherb, Samuel Emde, Claudio Marxer, C. Tschudin
Limited energy capacity and computation power is a common characteristic of mobile but connected devices. Edge computing, i.e. outsourcing computation task to close-by stationary service providers, is a widespread approach to still deploy computation-intensive applications on such devices. However, if moving at high speed (like for instance vehicles or trains), the contact time with network access points are very short (in the range of 3-5sec). Based on this fact, we identify the two challenging situations which are expected to happen very frequently and therefore should be considered when designing the communication system's architecture: (a) A client is connected via different network access points when scheduling a computation and when the result is ready for delivery. (b) A client's network access point changes (potentially several times) while uploading computation arguments or downloading computation results. In this paper, we pursue an information-centric and named-function networking approach to tackle these challenges.
{"title":"Data Upload in Mobile Edge Computing over ICN","authors":"Christopher Scherb, Samuel Emde, Claudio Marxer, C. Tschudin","doi":"10.1109/GCWkshps45667.2019.9024397","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024397","url":null,"abstract":"Limited energy capacity and computation power is a common characteristic of mobile but connected devices. Edge computing, i.e. outsourcing computation task to close-by stationary service providers, is a widespread approach to still deploy computation-intensive applications on such devices. However, if moving at high speed (like for instance vehicles or trains), the contact time with network access points are very short (in the range of 3-5sec). Based on this fact, we identify the two challenging situations which are expected to happen very frequently and therefore should be considered when designing the communication system's architecture: (a) A client is connected via different network access points when scheduling a computation and when the result is ready for delivery. (b) A client's network access point changes (potentially several times) while uploading computation arguments or downloading computation results. In this paper, we pursue an information-centric and named-function networking approach to tackle these challenges.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"18 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":"129657168","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.9024605
Bingying Xu, Xiaodong Xu, Ruolan Zhu
With the evolution of fifth-generation (5G) communication systems toward to heterogeneous ultra-dense networks (H-UDNs). Device-to-device (D2D) communications have been proposed as a promising technology to improve system capacity and user experiences. However, in moving D2D-enabled H- UDNs, it will cause heavy system overhead from the frequent mode selection between D2D mode and cellular mode. In this paper, in order to achieve a trade off between the advantages of D2D communications and system overhead, we propose a Gradient Boosted Trees (GBT) based multi-attribute D2D mode selection decision strategy. The proposed strategy combines Received Signal Strength (RSS), the Signal to Interference plus Noise Ratio (SINR) and moving angle of users to assist base stations (BSs) in selecting the optimal communication mode for user equipments (UEs) in mode selection decision process. Simulation results show that our proposed strategy brings improvements to the mode selection performance, which can be reflected in reducing the mode selection probability and increasing the D2D mode dwell time. Moreover, the system overhead is further reduced and system throughput increases significantly.
{"title":"Gradient Boosted Trees Based Mode Selection Decision for Moving D2D-Enabled Heterogeneous Ultra-Dense Networks","authors":"Bingying Xu, Xiaodong Xu, Ruolan Zhu","doi":"10.1109/GCWkshps45667.2019.9024605","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024605","url":null,"abstract":"With the evolution of fifth-generation (5G) communication systems toward to heterogeneous ultra-dense networks (H-UDNs). Device-to-device (D2D) communications have been proposed as a promising technology to improve system capacity and user experiences. However, in moving D2D-enabled H- UDNs, it will cause heavy system overhead from the frequent mode selection between D2D mode and cellular mode. In this paper, in order to achieve a trade off between the advantages of D2D communications and system overhead, we propose a Gradient Boosted Trees (GBT) based multi-attribute D2D mode selection decision strategy. The proposed strategy combines Received Signal Strength (RSS), the Signal to Interference plus Noise Ratio (SINR) and moving angle of users to assist base stations (BSs) in selecting the optimal communication mode for user equipments (UEs) in mode selection decision process. Simulation results show that our proposed strategy brings improvements to the mode selection performance, which can be reflected in reducing the mode selection probability and increasing the D2D mode dwell time. Moreover, the system overhead is further reduced and system throughput increases significantly.","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":"129799533","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.9024473
Zhiqiang Chen, Z. Liu, Yilong Hui, Wengang Li, Changle Li, T. Luan, Guoqiang Mao
The 5G networks are expected to support autonomous driving to enhance driving experience and travel efficiency. Toward this goal, the valuable data generated by the complex and dynamic transportation system need to be collected. In this paper, we propose a roadside sensor-based vehicle counting scheme for collecting traffic flow information in complex traffic environment. In the scheme, the roadside sensor can sense the magnetic data, where the magnetic flux magnitude will be changed if a vehicle passes though the sense coverage of the sensor. Based on this, we first analyze the change of the magnetic signals in the complex traffic environment and process the magnetic signals collected by the roadside sensor. Then, an integrated algorithm is designed to detect and count the traffic flow by considering the features of the collected signals. After this, we carry out experiments to evaluate the performance of the proposed vehicle counting scheme and analyze the vehicle counting error. According to the features of the error, we further design the error compensation strategy to correct the experiment results. Experimental verification results show that the vehicle counting accuracy before and after the error compensation in the complex traffic environment are 97.07% and 98.5%, respectively.
{"title":"Roadside Sensor Based Vehicle Counting Incomplex Traffic Environment","authors":"Zhiqiang Chen, Z. Liu, Yilong Hui, Wengang Li, Changle Li, T. Luan, Guoqiang Mao","doi":"10.1109/GCWkshps45667.2019.9024473","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024473","url":null,"abstract":"The 5G networks are expected to support autonomous driving to enhance driving experience and travel efficiency. Toward this goal, the valuable data generated by the complex and dynamic transportation system need to be collected. In this paper, we propose a roadside sensor-based vehicle counting scheme for collecting traffic flow information in complex traffic environment. In the scheme, the roadside sensor can sense the magnetic data, where the magnetic flux magnitude will be changed if a vehicle passes though the sense coverage of the sensor. Based on this, we first analyze the change of the magnetic signals in the complex traffic environment and process the magnetic signals collected by the roadside sensor. Then, an integrated algorithm is designed to detect and count the traffic flow by considering the features of the collected signals. After this, we carry out experiments to evaluate the performance of the proposed vehicle counting scheme and analyze the vehicle counting error. According to the features of the error, we further design the error compensation strategy to correct the experiment results. Experimental verification results show that the vehicle counting accuracy before and after the error compensation in the complex traffic environment are 97.07% and 98.5%, respectively.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"66 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":"131229619","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.9024467
Chao Zhang, Jin Jiang, Yufei Zhao, Xuefeng Jiang
Orbital Angular Momentum (OAM) has been considered as a new dimension in wireless transmission. In Multiple Input Multiple Output (MIMO) system, OAM can also be utilized as the new Degrees of Freedom (DoF) to manipulate the beamforming instead of the traditional Channel State Information (CSI) feedback, so that the computation complexity of the beamforming dramatically decreases, as well as the capacity of the transmission is maintained approaching the upper bound of the MIMO system. For example, this beamforming manipulation with OAM is extremely efficient in the Line of Sight (LoS) MIMO system. In this paper, the mathematical model of the DoF in beamforming manipulation in MIMO with OAM is established. The computation complexity is evaluated, and compared in LoS environment within MIMO, MIMO-OAM, and OAM. The quantitatively simulation confirms the fact that MIMO-OAM has the best trade-off between the capacity and the computation complexity, which gives a consolidated evidence that the MIMOOAM scheme can be adopted as an efficient beamforming scheme in LoS backhaul links between the base station and the self backhaul small cell station, or Near Field Communications (NFC) directly between mobile terminals. Due to these promising applications, MIMO-OAM may become one of the candidate technologies in Beyond 5G (B5G) mobile communications.
{"title":"New Degrees of Freedom for Beamforming Manipulation in MIMO Transmission with OAM","authors":"Chao Zhang, Jin Jiang, Yufei Zhao, Xuefeng Jiang","doi":"10.1109/GCWkshps45667.2019.9024467","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024467","url":null,"abstract":"Orbital Angular Momentum (OAM) has been considered as a new dimension in wireless transmission. In Multiple Input Multiple Output (MIMO) system, OAM can also be utilized as the new Degrees of Freedom (DoF) to manipulate the beamforming instead of the traditional Channel State Information (CSI) feedback, so that the computation complexity of the beamforming dramatically decreases, as well as the capacity of the transmission is maintained approaching the upper bound of the MIMO system. For example, this beamforming manipulation with OAM is extremely efficient in the Line of Sight (LoS) MIMO system. In this paper, the mathematical model of the DoF in beamforming manipulation in MIMO with OAM is established. The computation complexity is evaluated, and compared in LoS environment within MIMO, MIMO-OAM, and OAM. The quantitatively simulation confirms the fact that MIMO-OAM has the best trade-off between the capacity and the computation complexity, which gives a consolidated evidence that the MIMOOAM scheme can be adopted as an efficient beamforming scheme in LoS backhaul links between the base station and the self backhaul small cell station, or Near Field Communications (NFC) directly between mobile terminals. Due to these promising applications, MIMO-OAM may become one of the candidate technologies in Beyond 5G (B5G) mobile communications.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"57 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":"134224540","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.9024428
D. Brites, Mingkui Wei
Phishing is a type of malicious attack that involves the fooling of unsuspecting victims into providing or sharing personal information such as names, addresses, and banking information, which may lead to damages to the individual such as identity theft and financial losses. To combat phishing attacks, there have been many strides toward the use of newer technologies instead of conventional approaches such as personnel training and physical security. These technologies involve a proactive approach towards identifying Phishing websites that utilize machine learning and have become more and more efficient. In this paper, a more proactive and online machine learning approach is proposed that utilize features that have been well-accepted among industries and academia. Within the algorithm, prioritizing of features will be broken up into layers, and the output of the tool will be a digital tag that could be included in web browsers for quick identification and classification. If a site is tagged, the website owner will have the opportunity to legitimize the website through a detailed informational session and will allow them to fix any features that may be classified as malevolent in nature.
{"title":"PhishFry - A Proactive Approach to Classify Phishing Sites Using SCIKIT Learn","authors":"D. Brites, Mingkui Wei","doi":"10.1109/GCWkshps45667.2019.9024428","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024428","url":null,"abstract":"Phishing is a type of malicious attack that involves the fooling of unsuspecting victims into providing or sharing personal information such as names, addresses, and banking information, which may lead to damages to the individual such as identity theft and financial losses. To combat phishing attacks, there have been many strides toward the use of newer technologies instead of conventional approaches such as personnel training and physical security. These technologies involve a proactive approach towards identifying Phishing websites that utilize machine learning and have become more and more efficient. In this paper, a more proactive and online machine learning approach is proposed that utilize features that have been well-accepted among industries and academia. Within the algorithm, prioritizing of features will be broken up into layers, and the output of the tool will be a digital tag that could be included in web browsers for quick identification and classification. If a site is tagged, the website owner will have the opportunity to legitimize the website through a detailed informational session and will allow them to fix any features that may be classified as malevolent in nature.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"48 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":"133200433","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.9024412
Asmaa Ali, H. Hassanein
Greenhouses are proliferating across Canada. Greenhouse crop production requires considerable attention. The only way to maintain the production growth is by controlling the greenhouse atmosphere and monitoring the plants so that they remain healthy in the greenhouse. In this paper, we utilize a Wireless Visual Sensor Network (WVSN) with machine learning and image processing to observe any deficiency, pest, or disease presenting on the leaves of the plants. We distribute camera sensors throughout the greenhouse. Each camera sensor node captures an image from inside the greenhouse and use machine learning and image processing techniques to detect the presence of fungus. When a fungus is detected, the camera sensor node sends a message to the sensor node via the wireless sensor network to measure the humidity and then send a message to the actuator to re-set accordingly. This paper demonstrates how Hough forest machine learning and image processing can be successful in detecting fungus present on crop plant leaves from the images taken from camera sensors in the greenhouse. Cross-validation was applied to measure the performance of the system. The results are highly promising. There was a 94% success rate in detecting the fungus.
{"title":"A Fungus Detection System for Greenhouses Using Wireless Visual Sensor Networks and Machine Learning","authors":"Asmaa Ali, H. Hassanein","doi":"10.1109/GCWkshps45667.2019.9024412","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024412","url":null,"abstract":"Greenhouses are proliferating across Canada. Greenhouse crop production requires considerable attention. The only way to maintain the production growth is by controlling the greenhouse atmosphere and monitoring the plants so that they remain healthy in the greenhouse. In this paper, we utilize a Wireless Visual Sensor Network (WVSN) with machine learning and image processing to observe any deficiency, pest, or disease presenting on the leaves of the plants. We distribute camera sensors throughout the greenhouse. Each camera sensor node captures an image from inside the greenhouse and use machine learning and image processing techniques to detect the presence of fungus. When a fungus is detected, the camera sensor node sends a message to the sensor node via the wireless sensor network to measure the humidity and then send a message to the actuator to re-set accordingly. This paper demonstrates how Hough forest machine learning and image processing can be successful in detecting fungus present on crop plant leaves from the images taken from camera sensors in the greenhouse. Cross-validation was applied to measure the performance of the system. The results are highly promising. There was a 94% success rate in detecting the fungus.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"62 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":"129433839","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.9024423
S. Bhattacharjee
This paper studies physical layer security (PLS) based secure multicasting to a group of cell- edge users in the presence of a passive eavesdropper. In this view, the base station (BS) hires a pair of users from another multicast group located in its vicinity to perform simultaneous relaying and jamming for improving the reception reliability of the weaker users while ensuring minimum interception. The network is modeled using the spectrum efficient CR-NOMA framework whereby the cell-center group designated as secondary user multicast group (SU-MG) is incentivized with spectrum access opportunity for assisting the cell-edge group viewed as primary user multicast group (PU-MG). A secure cooperative multicast NOMA (SCMNOMA) protocol is proposed, and comparative performance analysis in terms of secrecy outage probability (SOP) is presented considering different strategies of relay and jammer selection. Numerical results highlight the importance of the joint selection of the best jammer and the best relay and sharing of total power between them for enhancing the SOP performance of the PUMG. Furthermore, the SOP reduces when the selected relay aims to minimize the interception from the eavesdropper rather than maximizing the capacity of the PU-MG.
{"title":"Friendly Jamming Assisted Secure Cooperative Multicasting in Cognitive Radio-NOMA Networks","authors":"S. Bhattacharjee","doi":"10.1109/GCWkshps45667.2019.9024423","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024423","url":null,"abstract":"This paper studies physical layer security (PLS) based secure multicasting to a group of cell- edge users in the presence of a passive eavesdropper. In this view, the base station (BS) hires a pair of users from another multicast group located in its vicinity to perform simultaneous relaying and jamming for improving the reception reliability of the weaker users while ensuring minimum interception. The network is modeled using the spectrum efficient CR-NOMA framework whereby the cell-center group designated as secondary user multicast group (SU-MG) is incentivized with spectrum access opportunity for assisting the cell-edge group viewed as primary user multicast group (PU-MG). A secure cooperative multicast NOMA (SCMNOMA) protocol is proposed, and comparative performance analysis in terms of secrecy outage probability (SOP) is presented considering different strategies of relay and jammer selection. Numerical results highlight the importance of the joint selection of the best jammer and the best relay and sharing of total power between them for enhancing the SOP performance of the PUMG. Furthermore, the SOP reduces when the selected relay aims to minimize the interception from the eavesdropper rather than maximizing the capacity of the PU-MG.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":" 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132075695","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
扫码关注我们
求助内容：
应助结果提醒方式：