Secure D2D Communication in Large-Scale Cognitive Cellular Networks with Wireless Power Transfer

In this paper, we investigate secure device-to-device (D2D) communication in energy harvesting large-scale cognitive cellular networks. The energy constrained D2D transmitter harvests energy from multi-antenna equipped power beacons (PBs), and communicates with the corresponding receiver using the spectrum of the cellular base stations (BSs). We introduce a power transfer model and an information signal model to enable wireless energy harvesting and secure information transmission. In the power transfer model, we propose a new power transfer policy, namely, best power beacon (BPB) power transfer. To characterize the power transfer reliability of the proposed policy, we derive new closed-form expressions for the exact power outage probability and the asymptotic power outage probability with large antenna arrays at PBs. In the information signal model, we present a new comparative framework with two receiver selection schemes: 1) best receiver selection (BRS), and 2) nearest receiver selection (NRS). To assess the secrecy performance, we derive new expressions for the secrecy throughput considering the two receiver selection schemes using the BPB power transfer policies. We show that secrecy performance improves with increasing densities of PBs and D2D receivers because of a larger multiuser diversity gain. A pivotal conclusion is reached that BRS achieves better secrecy performance than NRS but demands more instantaneous feedback and overhead.

Secure D2D Communication in Large-Scale Cognitive Cellular Networks: A Wireless Power Transfer Model

In this paper, we investigate secure device-to-device (D2D) communication in energy harvesting large-scale cognitive cellular networks. The energy constrained D2D transmitter harvests energy from multiantenna equipped power beacons (PBs), and communicates with the corresponding receiver using the spectrum of the primary base stations (BSs). We introduce a power transfer model and an information signal model to enable wireless energy harvesting and secure information transmission. In the power transfer model, three wireless power transfer (WPT) policies are proposed: 1) co-operative power beacons (CPB) power transfer, 2) best power beacon (BPB) power transfer, and 3) nearest power beacon (NPB) power transfer. To characterize the power transfer reliability of the proposed three policies, we derive new expressions for the exact power outage probability. Moreover, the analysis of the power outage probability is extended to the case when PBs are equipped with large antenna arrays. In the information signal model, we present a new comparative framework with two receiver selection schemes: 1) best receiver selection (BRS), where the receiver with the strongest channel is selected; and 2) nearest receiver selection (NRS), where the nearest receiver is selected. To assess the secrecy performance, we derive new analytical expressions for the secrecy outage probability and the secrecy throughput considering the two receiver selection schemes using the proposed WPT policies. We presented Monte carlo simulation results to corroborate our analysis and show: 1) secrecy performance improves with increasing densities of PBs and D2D receivers due to larger multiuser diversity gain; 2) CPB achieves better secrecy performance than BPB and NPB but consumes more power; and 3) BRS achieves better secrecy performance than NRS but demands more instantaneous feedback and overhead. A pivotal conclusion- is reached that with increasing number of antennas at PBs, NPB offers a comparable secrecy performance to that of BPB but with a lower complexity.

Optimal Power Allocation for Multiuser Secure Communication in Cooperative Relaying Networks

We consider a cooperative relaying network in which a source communicates with a group of users in the presence of one eavesdropper. We assume that there are no source-user links and the group of users receive only retransmitted signal from the relay. Whereas, the eavesdropper receives both the original and retransmitted signals. Under these assumptions, we exploit the user selection technique to enhance the secure performance. We first find the optimal power allocation strategy when the source has the full channel state information (CSI) of all links. We then evaluate the security level through: i) ergodic secrecy rate and ii) secrecy outage probability when having only the statistical knowledge of CSIs.

Beamforming and interference cancellation in D2D communication underlaying cellular networks

This paper presents an analytical performance investigation of both beamforming (BF) and interference cancellation (IC) strategies for a device-to-device (D2D) communication system underlaying a cellular network with an M-antenna base station (BS). We first derive new closed-form expressions for the ergodic achievable rate for BF and IC precoding strategies with quantized channel state information (CSI), as well as, perfect CSI. Then, novel lower and upper bounds are derived which apply for an arbitrary number of antennas and are shown to be sufficiently tight to the Monte-Carlo results. Based on these results, we examine in detail three important special cases including: high signal-to-noise ratio (SNR), weak interference between cellular link and D2D link, and BS equipped with a large number of antennas. We also derive asymptotic expressions for the ergodic achievable rate for these scenarios. Based on these results, we obtain valuable insights into the impact of the system parameters, such as the number of antennas, SNR and the interference for each link. In particular, we show that an irreducible saturation point exists in the high SNR regime, while the ergodic rate under IC strategy is verified to be always better than that under BF strategy. We also reveal that the ergodic achievable rate under perfect CSI scales as log2M, whilst it reaches a ceiling with quantized CSI.

Efficient Path Key Establishment For Wireless Sensor Networks

Key pre-distribution schemes have been proposed as means to overcome Wireless Sensor Networks constraints such as limited communication and processing power. Two sensor nodes can establish a secure link with some probability based on the information stored in their memories though it is not always possible that two sensor nodes may set up a secure link. In this paper, we propose a new approach that elects trusted common nodes called ”Proxies” which reside on an existing secure path linking two sensor nodes. These sensor nodes are used to send the generated key which will be divided into parts (nuggets) according to the number of elected proxies. Our approach has been assessed against previously developed algorithms and the results show that our algorithm discovers proxies more quickly which are closer to both end nodes, thus producing shorter path lengths. We have also assessed the impact of our algorithm on the average time to establish a secure link when the transmitter and receiver of the sensor nodes are ”ON”. The results show the superiority of our algorithm in this regard. Overall, the proposed algorithm is well suited for Wireless Sensor Networks.

An overview of wireless networks in control and monitoring

This paper provides an overview of the current field in wireless networks for monitoring and control. Alternative wireless technologies are introduced, together with current typical industrial applications. The focus then shifts to wireless Ethernet and the specialised requirements for wireless networked control systems (WNCS) are discussed. This is followed by a brief look at some current WNCS research, including reduced communication control.

Network formation under mutual consent and costly communication

We consider two different approaches to describe the formation of social networks under mutual consent and costly communication. First, we consider a network-based approach; in particular Jackson–Wolinsky’s concept of pairwise stability. Next, we discuss a non-cooperative game-theoretic approach, through a refinement of the Nash equilibria of Myerson’s consent game. This refinement, denoted as monadic stability, describes myopically forward looking behavior of the players. We show through an equivalence that the class of monadically stable networks is a strict subset of the class of pairwise stable networks that can be characterized fully by modifications of the properties defining pairwise stability.

Capacity and resource allocation of cooperative MIMO in ad hoc networks

Cooperative MIMO (Multiple Input–Multiple Output) allows multiple nodes share their antennas to emulate antenna arrays and transmit or receive cooperatively. It has the ability to increase the capacity for future wireless communication systems and it is particularly suited for ad hoc networks. In this study, based on the transmission procedure of a typical cooperative MIMO system, we first analyze the capacity of single-hop cooperative MIMO systems, and then we derive the optimal resource allocation strategy to maximize the end-to-end capacity in multi-hop cooperative MIMO systems. The study shows three implications. First, only when the intra-cluster channel is better than the inter-cluster channel, cooperative MIMO results in a capacity increment. Second, for a given scenario there is an optimal number of cooperative nodes. For instance, in our study an optimal deployment of three cooperative nodes achieve a capacity increment of 2 bps/Hz when compared with direct transmission. Third, an optimal resource allocation strategy plays a significant role in maximizing end-to-end capacity in multi-hop cooperative MIMO systems. Numerical results show that when optimal resource allocation is applied we achieve more than 20% end-to-end capacity increment in average when compared with an equal resource allocation strategy.

Free-space optoelectronic switching cores with MPLS for SANs over WDM ring networks

With increasing demands on storage devices in the modern communication environment, the storage area network (SAN) has evolved to provide a direct connection allowing these storage devices to be accessed efficiently. To optimize the performance of a SAN, a three-stage hybrid electronic/optical switching node architecture based on the concept of a MPLS label switching mechanism, aimed at serving as a multi-protocol label switching (MPLS) ingress label edge router (LER) for a SAN-enabled application, has been designed. New shutter-based free-space multi-channel optical switching cores are employed as the core switch fabric to solve the packet contention and switching path conflict problems. The system-level node architecture design constraints are evaluated through self-similar traffic sourced from real gigabit Ethernet network traces and storage systems. The extension performance of a SAN over a proposed WDM ring network, aimed at serving as an MPLS-enabled transport network, is also presented and demonstrated.

The Analogical Peacock Hypothesis: The Sexual Selection of Mind-Reading and Relational Cognition in Human Communication

This integrative review presents a novel hypothesis as a basis for integrating two evolutionary viewpoints on the origins of human cognition and communication, the sexual selection of human mental capacities, and the social brain hypothesis. This new account suggests that mind-reading social skills increased reproductive success and consequently became targets for sexual selection. The hypothesis proposes that human communication has three purposes: displaying mind-reading abilities, aligning and maintaining representational parity between individuals to enable displays, and the exchange of propositional information. Intelligence, creativity, language, and humor are mental fitness indicators that signal an individual’s quality to potential mates, rivals, and allies. Five features central to the proposed display mechanism unify these indicators, the relational combination of concepts, large conceptual knowledge networks, processing speed, contextualization, and receiver knowledge. Sufficient between-mind alignment of conceptual networks allows displays based upon within-mind conceptual mappings. Creative displays communicate previously unnoticed relational connections and novel conceptual combinations demonstrating an ability to read a receiver’s mind. Displays are costly signals of mate quality with costs incurred in the developmental production of the neural apparatus required to engage in complex displays and opportunity costs incurred through time spent acquiring cultural knowledge. Displays that are fast, novel, spontaneous, contextual, topical, and relevant are hard-to-fake for lower quality individuals. Successful displays result in elevated social status and increased mating options. The review addresses literatures on costly signaling, sexual selection, mental fitness indicators, and the social brain hypothesis; drawing implications for nonverbal and verbal communication.

Multi-access communication system in a highly reverberant environment

We investigate by numerical EM simulation the potential communication channel capacity of a reverberant environment using the time reversal approach, excited at 2.4 GHz by ON-OFF keyed RF pulse excitation. It is shown that approximately 725 1.25MHz propagation channels can be allocated with the cavity contains a 4×4 ? or 1×1 ? LOS obstruction positioned between the transceiver antenna and the time reversal unit. Furthermore the results show that two co-located transceiver dipoles separated by a spacing of 3?/4 can successfully resolve a 10ns pulse. Our findings suggest that different independent channels with identical operating frequency can be realized in an enclosed environment such as ventilation duct or underground tunnel. This suggests that there is a possibility of implementing a parallel channel radio link with the minimum inter-antenna spacing of 3?/4 between the transceivers in a rich multipath environment. © 2012 IEEE.

Circular Polarization Modulation for Digital Communication Systems

Conventional approaches of digital modulation schemes make use of amplitude, frequency and/or phase as modulation characteristic to transmit data. In this paper, we exploit circular polarization (CP) of the propagating electromagnetic carrier as modulation attribute which is a novel concept in digital communications. The requirement of antenna alignment to maximize received power is eliminated for CP signals and these are not affected by linearly polarized jamming signals. The work presents the concept of Circular Polarization Modulation for 2, 4 and 8 states of carrier and refers them as binary circular polarization modulation (BCPM), quaternary circular polarization modulation (QCPM) and 8-state circular polarization modulation (8CPM) respectively. Issues of modulation, demodulation, 3D symbol constellations and 3D propagating waveforms for the proposed modulation schemes are presented and analyzed in the presence of channel effects, and they are shown to have the same bit error performance in the presence of AWGN compared with conventional schemes while provide 3dB gain in the flat Rayleigh fading channel.

Design and Implementation of a Measurement-Based Policy-Driven Resource Management Framework For Converged Networks

This paper presents the design and implementation of a measurement-based QoS and resource management framework, CNQF (Converged Networks’ QoS Management Framework). CNQF is designed to provide unified, scalable QoS control and resource management through the use of a policy-based network
management paradigm. It achieves this via distributed functional entities that are deployed to co-ordinate the resources of the transport network through centralized policy-driven decisions supported by measurement-based control architecture. We present the CNQF architecture, implementation of the
prototype and validation of various inbuilt QoS control mechanisms using real traffic flows on a Linux-based experimental test bed.