Search

With the advancement of solid-state devices for lighting, illumination is on the verge of being completely restructured. This revolution comes with numerous advantages and viable opportunities that can transform the world of wireless communications for the better. Solid-state LEDs are rapidly replacing the contemporary incandescent and fluorescent lamps. In addition to their high energy efficiency, LEDs are desirable for their low heat generation, long lifespan, and their capability to switch on and off at an extremely high rate. The ability of switching between different levels of luminous intensity at such a rate has enabled the inception of a new communication technology referred to as visible light communication (VLC). With this technology, the LED lamps are additionally being used for data transmission. This paper provides a tutorial and a survey of VLC in terms of the design, development, and evaluation techniques as well as current challenges and their envisioned solutions. The focus of this paper is mainly directed towards an indoor setup. An overview of VLC, theory of illumination, system receivers, system architecture, and ongoing developments are provided. We further provide some baseline simulation results to give a technical background on the performance of VLC systems. Moreover, we provide the potential of incorporating VLC techniques in the current and upcoming technologies such as fifth-generation (5G), beyond fifth-generation (B5G) wireless communication trends including sixth-generation (6G), and intelligent reflective surfaces (IRSs) among others.

The UAV is emerging as one of the greatest technology developments for rapid network coverage provisioning at affordable cost. The aim of this paper is to outsource network coverage of a specific area according to a desired quality of service requirement and to enable various entities in the network to have intelligence to make autonomous decisions using blockchain and auction mechanisms. In this regard, by considering a multiple-UAV network where each UAV is associated to its own controlling operator, this paper addresses two major challenges: the selection of the UAV for the desired quality of network coverage and the development of a distributed and autonomous real-time monitoring framework for the enforcement of service level agreement (SLA). For a suitable UAV selection, we employ a reputation-based auction mechanism to model the interaction between the business agent who is interested in outsourcing the network coverage and the UAV operators serving in closeby areas. In addition, theoretical analysis is performed to show that the proposed auction mechanism attains a dominant strategy equilibrium. For the SLA enforcement and trust model, we propose a permissioned blockchain architecture considering Support Vector Machine (SVM) for real-time autonomous and distributed monitoring of UAV service. In particular, smart contract features of the blockchain are invoked for enforcing the SLA terms of payment and penalty, and for quantifying the UAV service reputation. Simulation results confirm the accuracy of theoretical analysis and efficacy of the proposed model.

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.

Inspired by its success in financial sectors, the blockchain technique is emerging as an enabling technology for secure distributed control and management of wireless networks. In order to fully benefit from this distributed ledger technology, its limitations, cost, complexity and empowerment also have to be critically appraised. Depending on the specific context of the problem to be solved, these limitations have been handled to some extent through a clear dichotomy in the blockchain architectures, namely by conceiving both permissioned and permissionless blockchains. Permissionless blockchain requires massive computing power to achieve consensus, while its permissioned counterpart is energy efficient but would require trusted participants. To combine these benefits by gaining trust at a high energy efficiency, a novel mechanism is proposed for automatically learning the trust level of users in a public blockchain network and granting them access to a private blockchain network. In this context, machine learning is a very powerful tool capable of automatically learning the trust level. We have proposed reinforcement learning for bridging the dichotomy of blockchains in terms of striking a trust vs complexity trade-off in an unknown environment. Benefits and limitations of various forms of blockchain techniques are analyzed, followed by their reinforcement-aided evolution. We demonstrate that the proposed reinforcement learning aided blockchain is capable of supporting high-integrity autonomous operation and decision making in wireless networks. The win-win amalgamation of these techniques has been demonstrated for striking a compelling balance between the benefits of permissioned and permissionless blockchain networks through the case-study of the proposed blockchain based unmanned aerial vehicle aided wireless networks.

This paper considers a network of source nodes that transmit data packets to a destination node via relay nodes over erasure channels by using random linear network coding. The probability that the destination node will fail to recover the packets of all source nodes has been bounded and approximated in the literature for the case of relay nodes that randomly assign only nonzero values to the coefficients of linear combinations of data packets. The paper argues for the necessity of giving relay nodes the choice to also assign the zero value to coefficients when arithmetic operations are over finite fields of small size, e.g. GF(2). Alternative probability mass functions for the coefficients are considered, and expressions for the decoding failure probability are re-derived.

Opportunistic relaying has the potential to achieve full diversity gain, while random linear network coding (RLNC) can reduce latency and energy consumption. In recent years, there has been a growing interest in the integration of both schemes into wireless networks in order to reap their benefits, while considering security concerns. This paper considers a multi-relay network, where relay nodes employ RLNC to encode confidential data and transmit coded packets to a destination in the presence of an eavesdropper. Four relay selection protocols are studied covering a range of network capabilities, such as the availability of the eavesdropper’s channel state information or the possibility to pair the selected relay with a node that intentionally generates interference. For each case, expressions for the probability that a coded packet will not be recovered by a receiver, which can be either the destination or the eavesdropper, are derived. Based on those expressions, a framework is developed that characterizes the probability of the eavesdropper intercepting a sufficient number of coded packets and partially or fully recovering the confidential data. Simulation results confirm the validity and accuracy of the theoretical framework and unveil the security-reliability trade-offs attained by each RLNC-enabled relay selection protocol.

This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed, whereby packets at the relay nodes are combined using two methods; packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using random linear network coding. An analytical framework that characterizes the performance of the proposed scheme is developed, compared to simulation results, and benchmarked against a counterpart scheme that is based on orthogonal multiple access.

This paper considers a multi-source multi-relay network, in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it can recover the packets of all source nodes. The links between source-to-relay nodes and relay-to-destination nodes are modeled as packet erasure channels. Improved bounds on the probability of decoding failure are presented, which are markedly close to simulation results and notably better than previous bounds. Examples demonstrate the tightness and usefulness of the new bounds over the old bounds., 4 pages, 5 figures, accepted for publication in IEEE Communications Letters

This paper considers the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node, over packet erasure channels. Intra-session network coding is used at the source nodes and inter-session network coding is employed at the relay node to combine the recovered source packets of both source nodes. In this work, we investigate the performance of the network-coded system in terms of the probability that the destination node will successfully recover the source packets of the two source nodes. We build our analysis on fundamental probability expressions for random matrices over finite fields and we derive upper bounds on the system performance for the case of systematic and non-systematic network coding. Simulation results show that the upper bounds are very tight and accurately predict the decoding probability at the destination node. Our analysis also exposes the clear benefits of systematic network coding at the source nodes compared to non-systematic transmission., Comment: Proc. ICC 2015, Workshop on Cooperative and Cognitive Mobile Networks (CoCoNet), to appear

This letter considers a network comprising a transmitter, which employs random linear network coding to encode a message, a legitimate receiver, which can recover the message if it gathers a sufficient number of linearly independent coded packets, and an eavesdropper. Closed-form expressions for the probability of the eavesdropper intercepting enough coded packets to recover the message are derived. Transmission with and without feedback is studied. Furthermore, an optimization model that minimizes the intercept probability under delay and reliability constraints is presented. Results validate the proposed analysis and quantify the secrecy gain offered by a feedback link from the legitimate receiver., Comment: IEEE Communications Letters, to appear