Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876210
Yen-Chun Chiu, Po-Ching Lin
Software-defined networking (SDN) allows network administrators to manage network flows easily from a centralized controller. However, it also leads to new security threats to applications, controllers, OpenFlow switches, topology management and so on. In this work, we design a method to detect disobedient forwarding in the flow table by compromising a switch. To enhance detection efficiency and minimize additional network traffic, we reduce the number of detection packets necessary by aggregating the flow entries. This method selects the flow entries whose match fields can compose a valid packet from multiple switches. The switches on which the entries are form a path that allows the packet to travel through for rapid detection. We evaluate the efficiency of this detection method for various topology types in typical data center networks by Mininet simulation. The experimental results demonstrate that this method can examine the forwarding correctness of around 3 flow entries simultaneously for each detection packet in fat-tree topology. Furthermore, the scale of the network topology does not affect the efficiency of the method significantly.
{"title":"Rapid detection of disobedient forwarding on compromised OpenFlow switches","authors":"Yen-Chun Chiu, Po-Ching Lin","doi":"10.1109/ICCNC.2017.7876210","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876210","url":null,"abstract":"Software-defined networking (SDN) allows network administrators to manage network flows easily from a centralized controller. However, it also leads to new security threats to applications, controllers, OpenFlow switches, topology management and so on. In this work, we design a method to detect disobedient forwarding in the flow table by compromising a switch. To enhance detection efficiency and minimize additional network traffic, we reduce the number of detection packets necessary by aggregating the flow entries. This method selects the flow entries whose match fields can compose a valid packet from multiple switches. The switches on which the entries are form a path that allows the packet to travel through for rapid detection. We evaluate the efficiency of this detection method for various topology types in typical data center networks by Mininet simulation. The experimental results demonstrate that this method can examine the forwarding correctness of around 3 flow entries simultaneously for each detection packet in fat-tree topology. Furthermore, the scale of the network topology does not affect the efficiency of the method significantly.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126177958","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876225
Mohamed Abdelraheem, Mustafa ElNainay
Dynamic Spectrum access (DSA) is a promising solution to solve the spectrum scarcity problem by allowing unlicensed user (a.k.a Secondary User (SU)) to access the licensed spectrum in a way that does not harm the spectrum owner (a.k.a Primary User (PU)). The SU's performance can be further enhanced by utilizing cooperative transmission via an intermediate relay instead of using direct transmission. In this paper, we study the effect of the PU activity pattern on the performance of SU in cooperative opportunistic network. The interaction between the primary and secondary transmissions are modeled using discrete time Markov chain in cooperative and non-cooperative secondary transmissions modes. By using this model, we quantify the effect of the PU transmission pattern on the SU transmission performance. The results show that the cooperative transmission has a superior performance over the direct transmission. Moreover, the gap in the performance increases as the PU channel utilization level increases and/or the PU packets become more discontinuous.
{"title":"An analytical study of the Primary User activity pattern effect on the performance of cooperative opportunistic networks","authors":"Mohamed Abdelraheem, Mustafa ElNainay","doi":"10.1109/ICCNC.2017.7876225","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876225","url":null,"abstract":"Dynamic Spectrum access (DSA) is a promising solution to solve the spectrum scarcity problem by allowing unlicensed user (a.k.a Secondary User (SU)) to access the licensed spectrum in a way that does not harm the spectrum owner (a.k.a Primary User (PU)). The SU's performance can be further enhanced by utilizing cooperative transmission via an intermediate relay instead of using direct transmission. In this paper, we study the effect of the PU activity pattern on the performance of SU in cooperative opportunistic network. The interaction between the primary and secondary transmissions are modeled using discrete time Markov chain in cooperative and non-cooperative secondary transmissions modes. By using this model, we quantify the effect of the PU transmission pattern on the SU transmission performance. The results show that the cooperative transmission has a superior performance over the direct transmission. Moreover, the gap in the performance increases as the PU channel utilization level increases and/or the PU packets become more discontinuous.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124640340","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876121
R. Barrett, Andre Facey, Welile Nxumalo, Joshua Rogers, Phil Vatcher, M. St-Hilaire
In this paper, we first propose a simple Dynamic Traffic Diversion (DTD) algorithm for Software Defined Networks (SDN). After implementing the algorithm inside the controller, we then compare the results obtained under two different test environments: 1) a testbed using real Cisco equipment and 2) a network emulation using Mininet. From the results, we get two key messages. First, we can clearly see that dynamically diverting important traffic on a backup path will prevent packet loss and reduce jitter. Finally, the two test environments provide relatively similar results. The small differences could be explained by the early field trial image that was used on the Cisco equipment and by the many setting parameters that are available in both environments.
{"title":"Dynamic Traffic Diversion in SDN: testbed vs Mininet","authors":"R. Barrett, Andre Facey, Welile Nxumalo, Joshua Rogers, Phil Vatcher, M. St-Hilaire","doi":"10.1109/ICCNC.2017.7876121","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876121","url":null,"abstract":"In this paper, we first propose a simple Dynamic Traffic Diversion (DTD) algorithm for Software Defined Networks (SDN). After implementing the algorithm inside the controller, we then compare the results obtained under two different test environments: 1) a testbed using real Cisco equipment and 2) a network emulation using Mininet. From the results, we get two key messages. First, we can clearly see that dynamically diverting important traffic on a backup path will prevent packet loss and reduce jitter. Finally, the two test environments provide relatively similar results. The small differences could be explained by the early field trial image that was used on the Cisco equipment and by the many setting parameters that are available in both environments.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124796547","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876217
Yahav Biran, G. Collins, Syed Azam, J. Dubow
Energy and resource utilization efficiency are two of the most significant differentiators in the contemporary Cloud computing marketplace. This paper addresses both of these from system of systems architectural and optimization viewpoints. Our approach will allow multiple cloud providers to optimally utilize compute resources. It will do this by (1) lowering the datacenters deployments per provider ratio, share and (2) scheduling available energy via aggregators and (3) lastly to employ, where appropriate, more renewable and carbon free engines. This is an embodiment of a cloud-federation, and will be treated as a System of Systems. This new cloud federation SoS paradigm will develop a new control methodology that is both financially attractive and energetically and environmentally advantageous. It supports dynamic expansion and contraction of computing capabilities for handling sudden variations in service demand. As is expected, the constituent cloud services retain independent ownership, objectives, funding, and sustainability means. While individual system behavior within the SoS is independently managed, the SoS as control structure might introduce cascading effect that impacts the overall SoS behavior. This paper analyzes the core SoS requirements, concept synthesis, and functional architecture. Finally, we suggest a physical architecture that simulates some of the main SoS emergent behavior to diminish unwanted outcomes while encouraging desirable results.
{"title":"Federated Cloud computing as System of Systems","authors":"Yahav Biran, G. Collins, Syed Azam, J. Dubow","doi":"10.1109/ICCNC.2017.7876217","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876217","url":null,"abstract":"Energy and resource utilization efficiency are two of the most significant differentiators in the contemporary Cloud computing marketplace. This paper addresses both of these from system of systems architectural and optimization viewpoints. Our approach will allow multiple cloud providers to optimally utilize compute resources. It will do this by (1) lowering the datacenters deployments per provider ratio, share and (2) scheduling available energy via aggregators and (3) lastly to employ, where appropriate, more renewable and carbon free engines. This is an embodiment of a cloud-federation, and will be treated as a System of Systems. This new cloud federation SoS paradigm will develop a new control methodology that is both financially attractive and energetically and environmentally advantageous. It supports dynamic expansion and contraction of computing capabilities for handling sudden variations in service demand. As is expected, the constituent cloud services retain independent ownership, objectives, funding, and sustainability means. While individual system behavior within the SoS is independently managed, the SoS as control structure might introduce cascading effect that impacts the overall SoS behavior. This paper analyzes the core SoS requirements, concept synthesis, and functional architecture. Finally, we suggest a physical architecture that simulates some of the main SoS emergent behavior to diminish unwanted outcomes while encouraging desirable results.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128215771","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876218
Anandeshwar Singh, Y. Viniotis
In an IoT cloud, the message broker service offered to customers allows customer's devices and applications to connect and interact with cloud applications and other devices. The service is governed by Service Level Agreements (SLA) that specify, among other requirements, the volume of messages served during an enforcement period. For simplicity, SLAs do not take into account detailed information about message arrival patterns or service times, making enforcement of the SLA a challenging problem for the providers. In this paper, we propose a resource allocation mechanism (that uses buffering, scheduling and rate limiting) to meet the SLA. We verify that the solution achieves conformance, analyze the tradeoffs of the solution and evaluate via simulation the effects of system parameters such as capacity and enforcement period.
{"title":"Resource allocation for IoT applications in cloud environments","authors":"Anandeshwar Singh, Y. Viniotis","doi":"10.1109/ICCNC.2017.7876218","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876218","url":null,"abstract":"In an IoT cloud, the message broker service offered to customers allows customer's devices and applications to connect and interact with cloud applications and other devices. The service is governed by Service Level Agreements (SLA) that specify, among other requirements, the volume of messages served during an enforcement period. For simplicity, SLAs do not take into account detailed information about message arrival patterns or service times, making enforcement of the SLA a challenging problem for the providers. In this paper, we propose a resource allocation mechanism (that uses buffering, scheduling and rate limiting) to meet the SLA. We verify that the solution achieves conformance, analyze the tradeoffs of the solution and evaluate via simulation the effects of system parameters such as capacity and enforcement period.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130090861","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876101
Chen Jiang, Wenhao Wu, Z. Ding
Multimedia Broadcast Multicast Service (MBMS)1 is an efficiency cellular strategy for shared content delivery, widely popular in Long Term Evolution (LTE) networks. Typical multimedia IP packets possess redundantly large headers, relying on Robust Header Compression (ROHC) for efficiency boost. This work investigates the adaptation of ROHC schemes for MBMS. We formulate and solve the optimization problem of transmission efficiency maximization in point-to-multipoint (P-t-M) transmission mode. Based on this solution, we propose a new MBMS scheme, namely point-to-multigroup (P-t-MG) transmission in which MBMS aim user groups. We provide a grouping and parameter optimization algorithm for P-t-MG to achieve high efficiency under total radio resource constraints. Numerical results demonstrate the advantage of the optimized P-t-M and the P-t-MG schemes over conventional MBMS.
{"title":"IP packet header compression and user grouping for LTE Multimedia Broadcast Multicast Services","authors":"Chen Jiang, Wenhao Wu, Z. Ding","doi":"10.1109/ICCNC.2017.7876101","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876101","url":null,"abstract":"Multimedia Broadcast Multicast Service (MBMS)1 is an efficiency cellular strategy for shared content delivery, widely popular in Long Term Evolution (LTE) networks. Typical multimedia IP packets possess redundantly large headers, relying on Robust Header Compression (ROHC) for efficiency boost. This work investigates the adaptation of ROHC schemes for MBMS. We formulate and solve the optimization problem of transmission efficiency maximization in point-to-multipoint (P-t-M) transmission mode. Based on this solution, we propose a new MBMS scheme, namely point-to-multigroup (P-t-MG) transmission in which MBMS aim user groups. We provide a grouping and parameter optimization algorithm for P-t-MG to achieve high efficiency under total radio resource constraints. Numerical results demonstrate the advantage of the optimized P-t-M and the P-t-MG schemes over conventional MBMS.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132382530","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876198
Jyotirmoy Banik, Ricardo Arjona, M. Tacca, M. Razo, A. Fumagalli, Kumaran Vijayasankar, Arvind Kandhalu
IEEE 802.15.4e is emerging as a robust standard for industrial Internet of Things. This standard is particularly effective for low power, multi-hop networks, and typically supports applications with low throughput. However, with the advances in energy harvesting, the need for supporting better performing solutions is also gaining momentum. This paper presents and analyses a modified link scheduling algorithm for IEEE 802.15.4e based solutions. Three approaches are considered. With the first approach, only the gateway node is equipped with multiple radios. With the second approach, non-gateway nodes are equipped with multiple radios as well. With the third approach, multiple single radio gateways are considered. Results from simulations have been presented to demonstrate the improvement in performance compared to the typical single radio, single gateway deployments.
{"title":"Improving performance in industrial Internet of Things using multi-radio nodes and multiple gateways","authors":"Jyotirmoy Banik, Ricardo Arjona, M. Tacca, M. Razo, A. Fumagalli, Kumaran Vijayasankar, Arvind Kandhalu","doi":"10.1109/ICCNC.2017.7876198","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876198","url":null,"abstract":"IEEE 802.15.4e is emerging as a robust standard for industrial Internet of Things. This standard is particularly effective for low power, multi-hop networks, and typically supports applications with low throughput. However, with the advances in energy harvesting, the need for supporting better performing solutions is also gaining momentum. This paper presents and analyses a modified link scheduling algorithm for IEEE 802.15.4e based solutions. Three approaches are considered. With the first approach, only the gateway node is equipped with multiple radios. With the second approach, non-gateway nodes are equipped with multiple radios as well. With the third approach, multiple single radio gateways are considered. Results from simulations have been presented to demonstrate the improvement in performance compared to the typical single radio, single gateway deployments.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132021257","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876187
E. Oki, Bijoy Chand Chatterjee
The rapid growth in world-wide communications and the rapid adoption of the Internet has significantly modified our way of life. The traffic behavior is changing rapidly and the increasing mobility of traffic sources makes grooming more complex. To fulfill the needs of the future Internet, optical transmission and networking technologies are moving toward to the goals of greater efficiency, flexibility, and scalability. Recently, elastic optical networks (EONs), which adopt flexgrid technology, have been shown to be a promising candidate for future high-speed optical communication. An EON has the potential to allocate spectrum to lightpaths according to the bandwidth requirements of clients. This paper presents the EON, and provides possible scopes for the future research. Finally, the paper addresses a number of research challenges and open issues presented by elastic networks.
{"title":"Design and control in elastic optical networks: Issues, challenges, and research directions","authors":"E. Oki, Bijoy Chand Chatterjee","doi":"10.1109/ICCNC.2017.7876187","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876187","url":null,"abstract":"The rapid growth in world-wide communications and the rapid adoption of the Internet has significantly modified our way of life. The traffic behavior is changing rapidly and the increasing mobility of traffic sources makes grooming more complex. To fulfill the needs of the future Internet, optical transmission and networking technologies are moving toward to the goals of greater efficiency, flexibility, and scalability. Recently, elastic optical networks (EONs), which adopt flexgrid technology, have been shown to be a promising candidate for future high-speed optical communication. An EON has the potential to allocate spectrum to lightpaths according to the bandwidth requirements of clients. This paper presents the EON, and provides possible scopes for the future research. Finally, the paper addresses a number of research challenges and open issues presented by elastic networks.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131690298","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876271
Minseok Jang, Myong-Soon Park, Sayed Chhattan Shah
Mobile automated video surveillance systems deployed in mobile environments are used to monitor and analyze numerous situations and take necessary actions in real time. These systems include various mobile nodes equipped with numerous sensors and involve application of sophisticated image and video processing algorithms. The execution of these algorithms requires a vast amount of computing and storage resources. To address the issue a traditional approach is to send collected data to an application on a cloud accessible through an infrastructure-based system such as cellular network. This approach has several issues such as high transmission energy consumption and communication latency. In addition, this approach cannot be used in situations where pre-existing communication infrastructure is not available. This paper focuses on a recent approach in which multiple mobile devices interconnected through a mobile ad hoc network are combined to create a virtual supercomputing node called a mobile ad hoc cloud which is then used to support execution of automated video surveillance application. In order to fulfil real-time requirements associated with automated video surveillance application, a task allocation scheme has been proposed. Compared to existing schemes, proposed scheme focuses on deadline-oriented tasks and energy efficiency.
{"title":"A mobile ad hoc cloud for automated video surveillance system","authors":"Minseok Jang, Myong-Soon Park, Sayed Chhattan Shah","doi":"10.1109/ICCNC.2017.7876271","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876271","url":null,"abstract":"Mobile automated video surveillance systems deployed in mobile environments are used to monitor and analyze numerous situations and take necessary actions in real time. These systems include various mobile nodes equipped with numerous sensors and involve application of sophisticated image and video processing algorithms. The execution of these algorithms requires a vast amount of computing and storage resources. To address the issue a traditional approach is to send collected data to an application on a cloud accessible through an infrastructure-based system such as cellular network. This approach has several issues such as high transmission energy consumption and communication latency. In addition, this approach cannot be used in situations where pre-existing communication infrastructure is not available. This paper focuses on a recent approach in which multiple mobile devices interconnected through a mobile ad hoc network are combined to create a virtual supercomputing node called a mobile ad hoc cloud which is then used to support execution of automated video surveillance application. In order to fulfil real-time requirements associated with automated video surveillance application, a task allocation scheme has been proposed. Compared to existing schemes, proposed scheme focuses on deadline-oriented tasks and energy efficiency.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121473785","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876171
Chen Chen, Yue Dong, Xiang Cheng, Na Yi
Antenna subset modulation has been proposed as a physical layer security technique for millimeter-wave (mmWave) wireless communications. In antenna subset modulation, the transmitter selects a subset of antennas at the symbol rate to differ the sidelobes of the nonuniform arrays in undesired directions and orients the mainlobe in the target direction by steer beamforming. In this paper, we propose an optimized antenna subset selection based on an iterative fast Fourier transform (FFT) algorithm for large-scale arrays. The analysis shows that the computational complexity of our proposed algorithm is significantly reduced compared with existing algorithms. Apart from the low computational complexity, simulation results show that the proposed algorithm has smaller sidelobes than other existing algorithms. Even if an eavesdropper is sufficiently sensitive, it is impossible to recover information when the sidelobes is small. Therefore, our proposed algorithm can provide more security with low computational complexity.
{"title":"An iterative FFT-based antenna subset modulation for secure millimeter wave communications","authors":"Chen Chen, Yue Dong, Xiang Cheng, Na Yi","doi":"10.1109/ICCNC.2017.7876171","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876171","url":null,"abstract":"Antenna subset modulation has been proposed as a physical layer security technique for millimeter-wave (mmWave) wireless communications. In antenna subset modulation, the transmitter selects a subset of antennas at the symbol rate to differ the sidelobes of the nonuniform arrays in undesired directions and orients the mainlobe in the target direction by steer beamforming. In this paper, we propose an optimized antenna subset selection based on an iterative fast Fourier transform (FFT) algorithm for large-scale arrays. The analysis shows that the computational complexity of our proposed algorithm is significantly reduced compared with existing algorithms. Apart from the low computational complexity, simulation results show that the proposed algorithm has smaller sidelobes than other existing algorithms. Even if an eavesdropper is sufficiently sensitive, it is impossible to recover information when the sidelobes is small. Therefore, our proposed algorithm can provide more security with low computational complexity.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121553855","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
扫码关注我们
求助内容：
应助结果提醒方式：