5 research outputs found

    ํ˜‘๋ ฅ ์žฌ๋ฐ์„ ์ด์šฉํ•œ ์ค‘๊ณ„ ๋„คํŠธ์›Œํฌ์˜ ๋ณด์•ˆ ํ†ต์‹ ์„ ์œ„ํ•œ ์ตœ์ ํ™” ๋ฐ ํ• ๋‹น ๊ธฐ๋ฒ•

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์ „๊ธฐยท์ •๋ณด๊ณตํ•™๋ถ€, 2019. 2. ์ด์žฌํ™.Physical layer security is a promising technology in the upcoming fifth generation (5G) wireless communication because the wireless communication is vulnerable to eavesdrop and it is complex to encrypt a data signal. In physical layer security, secure transmission is satisfied by using the physical characteristics of the wireless channel. Cooperative jamming is one of the efficient techniques to enhance secrecy performance in physical layer security. In cooperative jamming, a cooperating node transmits a jamming signal to interfere the eavesdropper. However, this jamming signal effects not only the eavesdropper but also the destination, which degrades the secrecy performance and causes waste of transmit power. It means the jamming signal transmission needs to be designed properly with optimization and power allocation to enhance security. The dissertation consists of two main results. First, we investigate a two-hop relay network consists of a source, an AF relay, a destination, and an eavesdropper. In this network, cooperative jamming is utilized in which the destination and the source transmit jamming signals in phase 1 and 2, respectively. At the destination, its own jamming signal transmitted in phase 1 is perfectly cancelled, and the jamming signal from the source has negligible strength due to the weak channel condition from the source to destination. We propose an optimal source power allocation for the network to enhance the secrecy performance based on the channel knowledge available at the source. Simulation results show that the proposed source power allocation scheme achieves higher secrecy rate and lower secrecy outage probability than the fixed power allocation schemes. Second, we investigate a two-hop relay network consists of a source, multiple AF relays, a destination, and an eavesdropper. In this network, one relay is selected out of the relays to forwards the data signals. Also, cooperative jamming is utilized in which the destination and the source transmit jamming signals in phase 1 and 2, respectively. We propose power allocation and relay selection scheme to minimize secrecy outage probability with the total power constraint and the power constraints for each phases, respectively. In total power constraint case, power allocation and relay selection problem is formulated and it is divided into a master problem and a subproblem by using the primal decomposition method. Simulation results show that the proposed scheme achieves lower secrecy outage probability than the conventional jamming power allocation scheme as well as without jamming scheme.๋ฌผ๋ฆฌ ๊ณ„์ธต ๋ณด์•ˆ์€ ๋ฌด์„ ํ†ต์‹ ์˜ ๋ณด์•ˆ์— ๋Œ€ํ•œ ์ทจ์•ฝ์ ๊ณผ ์•”ํ˜ธํ™”์˜ ๋ณต์žก์„ฑ์ด๋ผ๋Š” ํŠน์ง•์œผ๋กœ ์ธํ•˜์—ฌ, 5์„ธ๋Œ€(5G) ์ด๋™ํ†ต์‹ ์„ ์œ„ํ•œ ํ•ต์‹ฌ ๊ธฐ์ˆ ๋กœ ๊ฐ„์ฃผ๋˜๊ณ  ์žˆ๋‹ค. ๋ฌผ๋ฆฌ ๊ณ„์ธต ๋ณด์•ˆ์€ ๋ฌด์„  ์ฑ„๋„์˜ ๋ฌผ๋ฆฌ์  ํŠน์„ฑ์„ ์ด์šฉํ•˜์—ฌ ๋ณด์•ˆ ํ†ต์‹ ์„ ๊ฐ€๋Šฅํ•˜๊ฒŒ ํ•œ๋‹ค. ํ˜‘๋ ฅ ์žฌ๋ฐ(cooperative jamming)์€ ๋ฌผ๋ฆฌ ๊ณ„์ธต ๋ณด์•ˆ์—์„œ์˜ ๋ณด์•ˆ ์„ฑ๋Šฅ์„ ํ–ฅ์ƒ์‹œํ‚ค๋Š” ํšจ๊ณผ์ ์ธ ๊ธฐ์ˆ ๋กœ, ํ˜‘๋ ฅ ๋…ธ๋“œ๊ฐ€ ์žฌ๋ฐ ์‹ ํ˜ธ๋ฅผ ์ „์†กํ•จ์œผ๋กœ์จ ๋„์ฒญ์ž๋ฅผ ๋ฐฉํ•ดํ•˜๊ณ , ๋ณด์•ˆ์„ ๋‹ฌ์„ฑํ•œ๋‹ค. ๊ทธ๋Ÿฌ๋‚˜, ์ด๋Ÿฌํ•œ ์žฌ๋ฐ ์‹ ํ˜ธ๋Š” ๋„์ฒญ์ž ๋ฟ ์•„๋‹ˆ๋ผ ์ˆ˜์‹ ๋‹จ ์—ญ์‹œ ๋ฐฉํ•ดํ•˜๊ฒŒ ๋˜๋ฏ€๋กœ ๊ณผ๋„ํ•œ ์žฌ๋ฐ ์‹ ํ˜ธ ์ „์†ก์€ ๋ณด์•ˆ ์„ฑ๋Šฅ ํ–ฅ์ƒ์— ์ง€์žฅ์„ ์ฃผ๊ณ  ์ „๋ ฅ์„ ๋‚ญ๋น„ํ•˜๊ฒŒ ๋œ๋‹ค. ๋”ฐ๋ผ์„œ ๋ณด์•ˆ ์„ฑ๋Šฅ์„ ํ–ฅ์ƒ์‹œํ‚ค๊ธฐ ์œ„ํ•ด์„œ๋Š” ์žฌ๋ฐ ์‹ ํ˜ธ์˜ ์ „๋ ฅ ํ• ๋‹น ๋ฐ ์ตœ์ ํ™”๋ฅผ ํ•˜๋Š” ๊ฒƒ์ด ํ•„์ˆ˜์ ์ด๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ์˜ ๋‘ ๊ฐ€์ง€ ์ฃผ์š”ํ•œ ์—ฐ๊ตฌ ๊ฒฐ๊ณผ๋Š” ๋‹ค์Œ๊ณผ ๊ฐ™๋‹ค. ์ฒซ์งธ, ํ•˜๋‚˜์˜ ์†ก์‹ ๋‹จ, ์ฆํญ ํ›„ ์žฌ์ „์†ก ์ค‘๊ณ„๊ธฐ, ์ˆ˜์‹ ๋‹จ ๋ฐ ๋„์ฒญ์ž๊ฐ€ ์กด์žฌํ•˜๋Š” ์ค‘๊ณ„ ๋„คํŠธ์›Œํฌ๋ฅผ ๋ถ„์„ํ•œ๋‹ค. ์ด ๋•Œ ์ˆ˜์‹ ๋‹จ ๋ฐ ์†ก์‹ ๋‹จ์ด ํ˜‘๋ ฅ ์žฌ๋ฐ์„ ํ†ตํ•ด ๊ฐ๊ฐ ์ฒซ ๋ฒˆ์งธ ๋ฐ ๋‘ ๋ฒˆ์งธ ํŽ˜์ด์ฆˆ์—์„œ ์žฌ๋ฐ ์‹ ํ˜ธ๋ฅผ ์ „์†กํ•˜๋„๋ก ํ•œ๋‹ค. ์ˆ˜์‹ ๋‹จ์ด ์ฒซ ๋ฒˆ์งธ ํŽ˜์ด์ฆˆ์— ์ „์†กํ•œ ์žฌ๋ฐ ์‹ ํ˜ธ๋Š” ์ค‘๊ณ„๊ธฐ๋ฅผ ํ†ตํ•ด ์ฆํญ๋˜์ง€๋งŒ ์ˆ˜์‹ ๋‹จ์ด ์ œ๊ฑฐํ•  ์ˆ˜ ์žˆ์œผ๋ฉฐ, ์†ก์‹ ๋‹จ์˜ ์žฌ๋ฐ ์‹ ํ˜ธ๋Š” ์†ก์‹ ๋‹จ๊ณผ ์ˆ˜์‹ ๋‹จ ์‚ฌ์ด์˜ ์ฑ„๋„์ด ์•ฝํ•˜๊ธฐ ๋•Œ๋ฌธ์— ์ˆ˜์‹ ๋‹จ์— ๋ฏธ์น˜์ง€ ๋ชปํ•œ๋‹ค. ์ด ๋•Œ ๋ณธ ๋„คํŠธ์›Œํฌ์—์„œ ๋„คํŠธ์›Œํฌ์˜ ๋ณด์•ˆ ์ „์†ก๋ฅ (secrecy rate) ๋ฐ ๋ณด์•ˆ ๋ถˆ๋Šฅ ํ™•๋ฅ (secrecy outage probability)์„ ํ–ฅ์ƒ์‹œํ‚ค๋Š” ์†ก์‹ ๋‹จ์˜ ๊ฐ ํŽ˜์ด์ฆˆ ๋ณ„ ์ „์†ก ์ „๋ ฅ์„ ์†ก์‹ ๋‹จ์ด ๊ฐ€์ง„ ์ฑ„๋„ ์ •๋ณด๋ฅผ ํ†ตํ•ด ์ตœ์ ํ™”ํ•œ๋‹ค. ๋ชจ์˜ ์‹คํ—˜์„ ํ†ตํ•ด ์ œ์•ˆํ•œ ์ „๋ ฅ ํ• ๋‹น ๊ธฐ๋ฒ•์ด ๋‹ค๋ฅธ ๊ณ ์ • ์ „๋ ฅ ํ• ๋‹น ๊ธฐ๋ฒ•์— ๋น„ํ•ด ๋†’์€ ๋ณด์•ˆ ์ „์†ก๋ฅ ๊ณผ ๋‚ฎ์€ ๋ณด์•ˆ ๋ถˆ๋Šฅ ํ™•๋ฅ ์„ ๋‹ฌ์„ฑํ•จ์„ ํ™•์ธํ•œ๋‹ค. ๋‘˜์งธ, ํ•˜๋‚˜์˜ ์†ก์‹ ๋‹จ, ๋‹ค์ˆ˜์˜ ์ฆํญ ํ›„ ์žฌ์ „์†ก ์ค‘๊ณ„๊ธฐ๋“ค, ํ•˜๋‚˜์˜ ์ˆ˜์‹ ๋‹จ ๋ฐ ๋„์ฒญ์ž๊ฐ€ ์กด์žฌํ•˜๋Š” ์ค‘๊ณ„ ๋„คํŠธ์›Œํฌ๋ฅผ ๋ถ„์„ํ•œ๋‹ค. ๋‹ค์ˆ˜์˜ ์ค‘๊ณ„๊ธฐ ์ค‘ ํ•˜๋‚˜์˜ ์ค‘๊ณ„๊ธฐ๊ฐ€ ์„ ํƒ๋˜์–ด ์‹ ํ˜ธ๋ฅผ ์ „์†กํ•˜๊ฒŒ ๋˜๋ฉฐ, ํ˜‘๋ ฅ ์žฌ๋ฐ์„ ํ†ตํ•ด ์ˆ˜์‹ ๋‹จ ๋ฐ ์†ก์‹ ๋‹จ์ด ์žฌ๋ฐ ์‹ ํ˜ธ๋ฅผ ์ „์†กํ•œ๋‹ค. ์ด ๋•Œ ๋„คํŠธ์›Œํฌ์˜ ๋ณด์•ˆ ๋ถˆ๋Šฅ ํ™•๋ฅ ์„ ์ตœ์†Œํ™”ํ•˜๊ธฐ ์œ„ํ•œ ์ค‘๊ณ„๊ธฐ ์„ ํƒ ๋ฐ ์ „๋ ฅ ํ• ๋‹น ๊ธฐ๋ฒ•์„ ๋‹ค์–‘ํ•œ ์ „๋ ฅ ์ œํ•œ์— ๋งž๊ฒŒ ๋ถ„์„ํ•œ๋‹ค. ๋„คํŠธ์›Œํฌ ์ „์ฒด ์ „๋ ฅ์ด ์ œํ•œ๋œ ๊ฒฝ์šฐ์—์„œ๋Š” ์ค‘๊ณ„๊ธฐ ์„ ํƒ ๋ฐ ์ „๋ ฅ ํ• ๋‹น ๋ฌธ์ œ๋ฅผ ํ’€๊ธฐ ์œ„ํ•ด ๋‘ ๊ฐœ์˜ ๋ถ€๋ฌธ์ œ(subproblem) ๋กœ ๋ถ„ํ• ํ•œ๋‹ค. ๋ชจ์˜ ์‹คํ—˜์„ ํ†ตํ•ด ์ œ์•ˆํ•œ ๊ธฐ๋ฒ•์ด ๊ธฐ์กด์˜ ๊ธฐ๋ฒ• ๋ฐ ์žฌ๋ฐ ์‹ ํ˜ธ๋ฅผ ์ „์†กํ•˜์ง€ ์•Š๋Š” ๊ธฐ๋ฒ•์— ๋น„ํ•ด ๋‚ฎ์€ ๋ณด์•ˆ ๋ถˆ๋Šฅ ํ™•๋ฅ ์„ ๋‹ฌ์„ฑํ•จ์„ ํ™•์ธํ•œ๋‹ค.Abstract i 1 Introduction 1 1.1 Background and Related Work 2 1.1.1 Physical Layer Security 2 1.1.2 Cooperative Jamming 3 1.2 Outline of Dissertation 5 1.3 Notations 6 2 Source Power Allocation for Cooperative Jamming in Amplify-and- Forward Relay Network with Eavesdropper 9 2.1 System Model 10 2.2 Source Power Allocation 16 2.2.1 Full CSI for All Links 16 2.2.2 Full CSI for Desired Links only 18 2.3 Simulation Results 23 2.3.1 Identical Channel Condition 23 2.3.2 Non-identical Channel Condition 32 2.3.3 Multiple Antenna Eavesdropper 50 2.4 Summary 50 3 Power Allocation and Relay Selection for Cooperative Jamming in AF Relay Network with Multiple Relays and an Eavesdropper 53 3.1 System Model 55 3.2 Secrecy Outage Probability Analysis 61 3.3 Power Allocation and Relay Selection 66 3.3.1 Total Power Constraint 66 3.3.2 Power Constraints for Each Phases 68 3.4 Numerical Results 70 3.4.1 Multiple Antenna Eavesdropper 86 3.5 Extension to Multiple Relay Selection 86 3.6 Summary 88 4 Conclusion 89 4.1 Summary 89 4.2 Future Works 90 A Obtainment of Optimal Values of alpha in R1 and R2 92 Bibliography 95 Korean Abstract 104Docto

    Physical layer security solutions against passive and colluding eavesdroppers in large wireless networks and impulsive noise environments

    Get PDF
    Wireless networks have experienced rapid evolutions toward sustainability, scalability and interoperability. The digital economy is driven by future networked societies to a more holistic community of intelligent infrastructures and connected services for a more sustainable and smarter society. Furthermore, an enormous amount of sensitive and confidential information, e.g., medical records, electronic media, financial data, and customer files, is transmitted via wireless channels. The implementation of higher layer key distribution and management was challenged by the emergence of these new advanced systems. In order to resist various malicious abuses and security attacks, physical layer security (PLS) has become an appealing alternative. The basic concept behind PLS is to exploit the characteristics of wireless channels for the confidentiality. Its target is to blind the eavesdroppers such that they cannot extract any confidential information from the received signals. This thesis presents solutions and analyses to improve the PLS in wireless networks. In the second chapter, we investigate the secrecy capacity performance of an amplify-andforward (AF) dual-hop network for both distributed beamforming (DBF) and opportunistic relaying (OR) techniques. We derive the capacity scaling for two large sets; trustworthy relays and untrustworthy aggressive relays cooperating together with a wire-tapper aiming to intercept the message. We show that the capacity scaling in the DBF is lower bounded by a value which depends on the ratio between the number of the trustworthy and the untrustworthy aggressive relays, whereas the capacity scaling of OR is upper bounded by a value depending on the number of relays as well as the signal to noise ratio (SNR). In the third chapter, we propose a new location-based multicasting technique, for dual phase AF large networks, aiming to improve the security in the presence of non-colluding passive eavesdroppers. We analytically demonstrate that the proposed technique increases the security by decreasing the probability of re-choosing a sector that has eavesdroppers, for each transmission time. Moreover, we also show that the secrecy capacity scaling of our technique is the same as for broadcasting. Hereafter, the lower and upper bounds of the secrecy outage probability are calculated, and it is shown that the security performance is remarkably enhanced, compared to the conventional multicasting technique. In the fourth chapter, we propose a new cooperative protocol, for dual phase amplify-andforward large wireless sensor networks, aiming to improve the transmission security while taking into account the limited capabilities of the sensor nodes. In such a network, a portion of the K relays can be potential passive eavesdroppers. To reduce the impact of these untrustworthy relays on the network security, we propose a new transmission protocol, where the source agrees to share with the destination a given channel state information (CSI) of source-trusted relay-destination link to encode the message. Then, the source will use this CSI again to map the right message to a certain sector while transmitting fake messages to the other sectors. Adopting such a security protocol is promising because of the availability of a high number of cheap electronic sensors with limited computational capabilities. For the proposed scheme, we derived the secrecy outage probability (SOP) and demonstrated that the probability of receiving the right encoded information by an untrustworthy relay is inversely proportional to the number of sectors. We also show that the aggressive behavior of cooperating untrusted relays is not effective compared to the case where each untrusted relay is trying to intercept the transmitted message individually. Fifth and last, we investigate the physical layer security performance over Rayleigh fading channels in the presence of impulsive noise, as encountered, for instance, in smart grid environments. For this scheme, secrecy performance metrics were considered with and without destination assisted jamming at the eavesdropperโ€™s side. From the obtained results, it is verified that the SOP, without destination assisted jamming, is flooring at high signal-to-noise-ratio values and that it can be significantly improved with the use of jamming

    Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

    Full text link
    Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

    Enable Reliable and Secure Data Transmission in Resource-Constrained Emerging Networks

    Get PDF
    The increasing deployment of wireless devices has connected humans and objects all around the world, benefiting our daily life and the entire society in many aspects. Achieving those connectivity motivates the emergence of different types of paradigms, such as cellular networks, large-scale Internet of Things (IoT), cognitive networks, etc. Among these networks, enabling reliable and secure data transmission requires various resources including spectrum, energy, and computational capability. However, these resources are usually limited in many scenarios, especially when the number of devices is considerably large, bringing catastrophic consequences to data transmission. For example, given the fact that most of IoT devices have limited computational abilities and inadequate security protocols, data transmission is vulnerable to various attacks such as eavesdropping and replay attacks, for which traditional security approaches are unable to address. On the other hand, in the cellular network, the ever-increasing data traffic has exacerbated the depletion of spectrum along with the energy consumption. As a result, mobile users experience significant congestion and delays when they request data from the cellular service provider, especially in many crowded areas. In this dissertation, we target on reliable and secure data transmission in resource-constrained emerging networks. The first two works investigate new security challenges in the current heterogeneous IoT environment, and then provide certain countermeasures for reliable data communication. To be specific, we identify a new physical-layer attack, the signal emulation attack, in the heterogeneous environment, such as smart home IoT. To defend against the attack, we propose two defense strategies with the help of a commonly found wireless device. In addition, to enable secure data transmission in large-scale IoT network, e.g., the industrial IoT, we apply the amply-and-forward cooperative communication to increase the secrecy capacity by incentivizing relay IoT devices. Besides security concerns in IoT network, we seek data traffic alleviation approaches to achieve reliable and energy-efficient data transmission for a group of users in the cellular network. The concept of mobile participation is introduced to assist data offloading from the base station to users in the group by leveraging the mobility of users and the social features among a group of users. Following with that, we deploy device-to-device data offloading within the group to achieve the energy efficiency at the user side while adapting to their increasing traffic demands. In the end, we consider a perpendicular topic - dynamic spectrum access (DSA) - to alleviate the spectrum scarcity issue in cognitive radio network, where the spectrum resource is limited to users. Specifically, we focus on the security concerns and further propose two physical-layer schemes to prevent spectrum misuse in DSA in both additive white Gaussian noise and fading environments

    Stability of secure routing protocol in ad hoc wireless network.

    Get PDF
    The contributions of this research are threefold. First, it offers a new routing approach to ad hoc wireless network protocols: the Enhanced Heading-direction Angle Routing Protocol (EHARP), which is an enhancement of HARP based on an on-demand routing scheme. We have added important features to overcome its disadvantages and improve its performance, providing the stability and availability required to guarantee the selection of the best path. Each node in the network is able to classify its neighbouring nodes according to their heading directions into four different zone-direction group. The second contribution is to present a new Secure Enhanced Heading-direction Angle Routing Protocol (SEHARP) for ad hoc networks based on the integration of security mechanisms that could be applied to the EHARP routing protocol. Thirdly, we present a new approach to security of access in hostile environments based on the history and relationships among the nodes and on digital operation certificates. We also propose an access activity diagram which explains the steps taken by a node. Security depends on access to the history of each unit, which is used to calculate the cooperative values of each node in the environment
    corecore