Sharif Digital Repository

In this study, the authors consider the secrecy of a one-receiver, two-eavesdropper broadcast channel (BC) with three degraded message sets. Consider a three-receiver BC with three messages, where the first message is decoded by all the receivers. The second message is decoded by the first and the second receivers and is to be kept secret from the third receiver. The third message is decoded by the first receiver and is to be kept secret from the second and the third receivers. The authors consider the imperfect secrecy condition at the second receiver, that is, it is allowed to partially decode the third message. However, the perfect secrecy condition at the third receiver, does not allow... 

Considering the weaknesses of cryptography algorithms and the attacks performed against them, cryptography alone cannot guarantee the security of communication in a wireless network. With regard to the developments in wireless communication networks brought about by smart array antennas, security can be sought in the physical layer as well, aiming to restrict the access of the data in a wireless network and limit it to authorized users only in order to further restrain malicious data accesses. In this paper, we analysis a strategy for restricting data access using smart array antennas and present the results in security by a parameter called exposure region. For this strategy afterwards we... 

We provide a framework for modeling and analyzing both qualitative and quantitative aspects of mobile ad hoc network (MANET) protocols above the data-link layer. We extend Restricted Broadcast Process Theory [11,9]: delay functions are assigned to actions, while the semantics captures the interplay of a MANET protocol with stochastic behavior of the data-link and physical layer, and the dynamic topology. A continuous-time Markov chain is derived from our semantic model by resolving non-determinism, using the notion of weak Markovian network bisimilarity. The framework is applied to a leader election algorithm  

The focus of the paper is on cross-layer transmission based on rateless coding for relay networks. In the proposed method, rateless coding is used at the packet level and a separate physical layer coding is used at the physical layer. As rateless codes are originally designed and optimized for erasure channels, using these codes at the physical layer can lead to significant performance degradation. The proposed scheme has the advantage of a cross-layer design which uses a rateless code at the packet level modeled by an erasure channel. Based on the analysis and simulation results provided in this paper, the cross-layer scheme results in earlier successful decoding at the destination  

In this paper we study slotted ALOHA random access optical code division multiple access packet-switching networks with a chip-level receiver structure. We use generalized optical orthogonal codes (GOOCs) and the overlapping pulse position modulation (OPPM) signaling technique to improve system performance. The impact of physical layer parameters such as the GOOC cross-correlation value and the OPPM overlapping index on key performance benchmarks such as network throughput and delay are analyzed. We also study the stability of the network based on the number of backlogged users, using the expected state drift. It has been shown that using GOOC instead of strict optical orthogonal codes... 

This paper focuses on cross-layer transmission based on rateless coding for relay channels. In the proposed method, rateless coding is used at packet level and a separate physical layer coding is used at the physical layer. As rateless codes are originally designed and optimized for erasure channels, using these codes at the physical layer can lead to significant performance degradation. The proposed scheme has the advantage of a cross-layer design which uses a rateless code at the packet level modeled by an erasure channel. Based on the analysis and simulation results provided in this paper, there is an exact tradeoff between physical layer code rate and rateless code depth, and the optimum... 

An enhanced media access control (MAC) layer protocol that uses the signaling method benefits of the physical layer in order to provide different levels of quality to different users in optical code-division multiple-access (OCDMA) packet networks is presented. In the proposed network architecture the users are categorized into two classes of service, one having a higher quality level and the other having a lower quality level. Users of each class transmit at the same power level and different from the other classes users. Also, the MAC of each user estimates the amount of interference on the channel and adjusts the packet transmissions time to improve network performance. Through simulation... 

In traditional wireless networks, physical layer network coding (PNC) exploits the inverse additivity property of broadcast signals in the medium, an idea which is not directly applicable to molecular networks. In this paper, to make the natural XOR operation possible at the physical layer, we exploit the reaction of different molecule types and we propose a PNC scheme in diffusion-based molecular relay networks. For comparison, we consider the straightforward network coding (SNC) scheme in molecular networks. Assuming the ligand-receptor binding process at the receivers, we investigate the error performance of both schemes. It is observed that in addition to the simplicity of the proposed... 

Node cooperation can protect wireless networks from eavesdropping by using the physical characteristics of wireless channels rather than cryptographic methods. Allocating the proper amount of power to cooperative nodes is a challenging task. In this paper, we use three cooperative nodes, one as relay to increase throughput at the destination and two friendly jammers to degrade eavesdropper’s link. For this scenario, the secrecy rate function is a non-linear non-convex problem. So, in this case, exact optimization methods can only achieve suboptimal solution. In this paper, we applied different meta-heuristic optimization techniques, like Genetic Algorithm (GA), Partial Swarm Optimization... 

This letter presents an efficient polar code-based physical layer encryption (PLE) scheme with a short key length in comparison to the conventional symmetric key cryptosystems. By using the properties of polar codes, we consider several efficient techniques to reduce the key length and the computational overhead of the presented PLE scheme. Moreover, the results of the security analyses show that the proposed scheme has a high level of security against conventional attacks on the PLE schemes. In fact, reducing the key length and the computational overhead of the presented PLE scheme has no effect on its security level, which makes it suitable for secure mobile communication devices with... 

This paper presents a novel approach for power allocation and cooperative node selection to enhance physical layer security in presence of an eavesdropper in a wireless network. Our network consists of a source–destination pair and a number of cooperative nodes which can be used as relays to increase throughput at the destination, or as friendly jammers to confuse eavesdropper. First, we introduce a low complexity method, for which relay−jammer selection and power allocation are performed, simultaneously. Then, we propose self-adaptive genetic algorithm to solve the non-linear non-convex programing problem. Using the proposed method, the number of friendly jammers that ensure the secrecy... 

Node cooperation approaches improve physical layer security in wireless networks without applying data encryption. Selecting the appropriate nodes to cooperate as relays or friendly jammers, to degrade eavesdropper's link, is a challenging problem which has attracted a lot of attention in recent years. Various approaches, based on conventional exhaustive search, have been suggested for optimal relay-jammer selection and power allocation in the literature. The complexity of these methods is proportional to the number of intermediate nodes. As the number of intermediate nodes exceeds a specific bound, conventional exhaustive search appears infeasible due to high computational complexity. In... 

In this paper, we investigate the achievable secrecy rate in a relay channel where the source and the destination wish to keep the information confidential from an untrusted relay (potential eavesdropper). The relay has no energy supply, and harvests its required energy for relaying from its received signals. For radio-frequency (RF) Energy Harvesting (EH) at the relay, we adopt power splitting (PS) approach. We study the problem of achieving positive secrecy rates between the transmitter and the receiver while making use of an untrusted relay. Energy limitation at the relay makes the problem more interesting. Because, the relay must choose either to eavesdrop the signal to be able to decode... 

Chemical reactions are a prominent feature of molecular communication (MC) systems, with no direct parallels in wireless communications. While chemical reactions may be used inside the transmitter nodes, receiver nodes or the communication medium, we focus on its utility in the medium in this paper. Such chemical reactions can be used to perform computation over the medium as molecules diffuse and react with each other (physical-layer computation). We propose the use of chemical reactions for the following purposes: (i) to reduce signal-dependent observation noise of receivers by reducing the signal density, (ii) to realize molecular physical-layer network coding (molecular PNC) by...