7 research outputs found

    Blockchain-based distributive auction for relay-assisted secure communications

    Get PDF
    Physical layer security (PLS) is considered as a promising technique to prevent information eavesdropping in wireless systems. In this context, cooperative relaying has emerged as a robust solution for achieving PLS due to multipath diversity and relatively lower transmission power. However, relays or the relay operators in the practical environment are unwilling for service provisioning unless they are incentivized for their cost of services. Thus, it is required to jointly consider network economics and relay cooperation to improve system efficiency. In this paper, we consider the problem of joint network economics and PLS using cooperative relaying and jamming. Based on the double auction theory, we model the interaction between transmitters seeking for a particular level of secure transmission of information and relay operators for suitable relay and jammer assignment, in a multiple source-destination networks. In addition, theoretical analyses are presented to justify that the proposed auction mechanism satisfies the desirable economic properties of individual rationality, budget balance, and truthfulness. As the participants in the traditional centralized auction framework may take selfish actions or collude with each other, we propose a decentralized and trustless auction framework based on blockchain technology. In particular, we exploit the smart contract feature of blockchain to construct a completely autonomous framework, where all the participants are financially enforced by smart contract terms. The security properties of the proposed framework are also discussed

    Secure Transmission Design for Cognitive Radio Networks With Poisson Distributed Eavesdroppers

    Get PDF
    In this paper, we study physical layer security in an underlay cognitive radio (CR) network. We consider the problem of secure communication between a secondary transmitter-receiver pair in the presence of randomly distributed eavesdroppers under an interference constraint set by the primary user. For different channel knowledge assumptions at the transmitter, we design four transmission protocols to achieve the secure transmission in the CR network. We give a comprehensive performance analysis for each protocol in terms of transmission delay, security, reliability, and the overall secrecy throughput. Furthermore, we determine the optimal design parameter for each transmission protocol by solving the optimization problem of maximizing the secrecy throughput subject to both security and reliability constraints. Numerical results illustrate the performance comparison between different transmission protocols.ARC Discovery Projects Grant DP15010390

    5G embraces satellites for 6G ubiquitous IoT : basic models for integrated satellite terrestrial networks

    Get PDF
    Terrestrial communication networks mainly focus on users in urban areas but have poor coverage performance in harsh environments, such as mountains, deserts, and oceans. Satellites can be exploited to extend the coverage of terrestrial fifth-generation (5G) networks. However, satellites are restricted by their high latency and relatively low data rate. Consequently, the integration of terrestrial and satellite components has been widely studied, to take advantage of both sides and enable the seamless broadband coverage. Due to the significant differences between satellite communications (SatComs) and terrestrial communications (TerComs) in terms of channel fading, transmission delay, mobility, and coverage performance, the establishment of an efficient hybrid satellite-terrestrial network (HSTN) still faces many challenges. In general, it is difficult to decompose a HSTN into a sum of separate satellite and terrestrial links due to the complicated coupling relationships therein. To uncover the complete picture of HSTNs, we regard the HSTN as a combination of basic cooperative models that contain the main traits of satellite-terrestrial integration but are much simpler and thus more tractable than the large-scale heterogeneous HSTNs. In particular, we present three basic cooperative models, i.e., model X, model L, and model V, and provide a survey of the state-of-the-art technologies for each of them. We discuss future research directions towards establishing a cell-free, hierarchical, decoupled HSTN. We also outline open issues to envision an agile, smart, and secure HSTN for the sixth-generation (6G) ubiquitous Internet of Things (IoT)

    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

    Game-Theoretic Relay Selection and Power Control in Fading Wireless Body Area Networks

    Get PDF
    The trend towards personalized ubiquitous computing has led to the advent of a new generation of wireless technologies, namely wireless body area networks (WBANs), which connect the wearable devices into the Internet-of-Things. This thesis considers the problems of relay selection and power control in fading WBANs with energy-efficiency and security considerations. The main body of the thesis is formed by two papers. Ideas from probability theory are used, in the first paper, to construct a performance measure signifying the energy efficiency of transmission, while in the second paper, information-theoretic principles are leveraged to characterize the transmission secrecy at the wireless physical layer (PHY). The hypothesis is that exploiting spatial diversity through multi-hop relaying is an effective strategy in a WBAN to combat fading and enhance communication throughput. In order to analytically explore the problems of optimal relay selection and power control, proper tools from game theory are employed. In particular, non-cooperative game-theoretic frameworks are developed to model and analyze the strategic interactions among sensor nodes in a WBAN when seeking to optimize their transmissions in the uplink. Quality-of-service requirements are also incorporated into the game frameworks, in terms of upper bounds on the end-to-end delay and jitter incurred by multi-hop transmission, by borrowing relevant tools from queuing theory. The proposed game frameworks are proved to admit Nash equilibria, and distributed algorithms are devised that converge to stable Nash solutions. The frameworks are then evaluated using numerical simulations in conditions approximating actual deployment of WBANs. Performance behavior trade-offs are investigated in an IEEE 802.15.6-based ultra wideband WBAN considering various scenarios. The frameworks show remarkable promise in improving the energy efficiency and PHY secrecy of transmission, at the expense of an admissible increase in the end-to-end latency

    CoMP Aware Radio Resource Management in Integrated PON-OFDM Network

    Get PDF
    Radio resource management (RRM) is an important component of a mobile wireless network that efficiently utilizes the limited radio resources such as spectrum, transmission power, and network infrastructure. Unfortunately, current RRM schemes do not support cooperative multiple point (CoMP), a promising technology that extends coverage, increases capacity, and improves the spectral efficiency of the next generation broadband network, i.e., 4G network. Specifically, to coordinate with CoMP, a RRM scheme should be aware of three main properties of CoMP - cooperative transmitting information, coordinated scheduling transmission, and single interference noise ratio (SINR) improvement. However, few of the existing RRM schemes consider these properties, since they were designed based on the conventional mobile data networks without CoMP technology. In this dissertation, I present a series of new CoMP aware RRM schemes for ensuring users' throughput and maximizing network capacity in an integrated PON-OFDM network, which is a norm of the 4G network and can best implement the CoMP technology. I call the PON-OFDM network with CoMP a CoMP Network (CoMPNet). I provide two classes of RRM schemes for two practical CoMP technologies, cooperative transmission (CT) and coordinated scheduling (CoS), respectively. In the first class, I propose two groups of RRM schemes using the CT technology. In the first group, three OFDM-TDMA based RRM schemes are designed for three different users' moving speeds. The objective of these schemes is to minimize time slot consumption. The RRM schemes in the third group are contrived for an OFDM-FDMA based CoMPNet. I provide four linear programming (LP) based optimal schemes, one for minimizing bandwidth usage, one for minimizing transmission power consumption, and two for balancing resource costs. An optimized resource allocation solution can be obtained by flexibly choosing one of the schemes according to network load. In the second class, I present a sub-optimal RRM scheme for an OFDM-FDMA based CoMPNet. The CoS technology is applied for ICI mitigation. I formulate the system optimal task into constrained optimization problems for maximizing network capacity. To improve the computation efficiency, fast yet effective heuristic schemes are introduced for divide-and-conquer. The proposed heuristic schemes are featured by CoS based timeslots/subcarriers assignment mechanisms, which are further incorporated with intelligent power control schemes. Through simulations, I study the proposed RRM schemes performances and discuss the effect of the CoMP technology. The performance benefits of CoMP on bandwidth saving and capacity increasing are shown by comparing the new schemes with the conventional schemes without CoMP

    On cooperative and malicious behaviors in multirelay fading channels

    No full text
    Multirelay networks exploit spatial diversity by transmitting user's messages through multiple relay paths. Most works in the literature on cooperative or relay networks assume that all terminals are fully cooperative and neglect the effect of possibly e
    corecore