Design and Simulation of a Wide-Beam High-Power Parabolic Antenna with Dual-Source

For resolving the essential problem that the beam is too narrow in the application of the high-power UWB (Ultra-Wideband) antenna with single-source, a novel wide-beam high-power parabolic antenna with dual-source has been designed, and the edge of the paraboloid was cut in order to reduce the size of the antenna. Radiation properties of this proposed antenna are studied with finite-difference time-domain (FDTD) numerical method. The radiation properties of the proposed antenna can be improved by changing the structure of the parabolic antenna and adjusting the angle between the source and the axis of the antenna. The result shows that the beam-width has been improved significantly under the precondition of maintaining the peak power, and also the size of the antenna was minished by cutting the edge of the paraboloid.     

Cross-Interaction Between Au/Sn and Cu/Sn Interfacial Reactions

The cross-interaction between Sn/Cu and Sn/Au interfacial reactions in an Au/Sn/Cu sandwich structure was studied. Field-emission electron probe microanalysis (FE-EPMA) revealed that the Cu content in the three Au-Sn phases (AuSn, AuSn₂, and AuSn₄) was very low, less than 1 at.%. This means␣that Cu from the opposite Cu foil did not participate in the interfacial reaction at the Sn/Au interface. On the opposite Sn/Cu side, Au-substituted (Cu,Au)₆Sn₅ formed within the initial 1 min of reflow. With prolonged reflow, the Au content in the Au-substituted (Cu,Au)₆Sn₅ increased and it transformed into a Cu-substituted (Au,Cu)Sn phase with 25 at.% Cu after 1 min of reflow at 250°C. The x-ray diffraction (XRD) pattern confirmed the phase transformation of Au-substituted (Cu,Au)₆Sn₅ to Cu-substituted (Au,Cu)Sn phase. In addition, there was greater Au consumption in the Au/Sn/Cu sandwich joint structure than in the single Au/Sn reaction case, due to some of the Au participating in the opposite Sn/Cu interfacial reaction.     

An Optically Pumped Far-Infrared Folded Mirror-Less Cavity

A compact and efficient mirror-less cavity is presented for an optically pumped 192-μm far-infrared laser. With a gold-coated mirror and 30°-inclined anti-reflection coated Ge plate serving as highly reflective mirrors, a folded mirror-less CH₃F cavity is achieved. Maximum energy of 0.72 mJ is obtained with the pump energy of 600 mJ, which gives an energy increment of 75% in comparison with the previous 1.85-m mirror-less system. The beam divergence angle of the FIR radiation from this folded mirror-less cavity is measured to be 14.2 mrad.     

A Convex Programming for Range Assignment to Optimize Lifetime in Network-Coding-Based-Wireless-Sensor Networks

Wireless sensor networks (WSNs) are known to be highly energy-constrained and  consequently lifetime is a critical metric in their design and implementation. Range assignment by adjusting the transmission powers of nodes create a energy-efficient topology for such networks while preserving other network issues, however, it may effect on the performance of other techniques such as network coding. This paper addresses the problem of lifetime optimization for WSNs where the network employs both range assignment and network-coding-based multicast. We formulate the problem and then reformulated it as convex optimization that offer a numerous theoretical or conceptual advantages. The proposed programming leads to efficient or distributed algorithms for solving the problem. Simulation results show that the proposed optimized mechanism decreases end-to-end delay and improve lifetime as compared by other conventional ones.     

Millimeter-Wave Beam Multiplexing Method Using Subarray Type Hybrid Beamforming of Interleaved Configuration with Inter-subarray Coding

A millimeter-wave beam multiplexing method using a subarray type interleaved configuration hybrid beamforming with inter-subarray coding is proposed. By multiplexing of adequate directional beams, the proposed method can reduce inter-beam interference and create multiple beams of a theoretical maximum gain that an array antenna can generate. As results of performance comparison in subarray type beamforming with the feasibility, it is shown that channel capacity of the interleaved configuration with inter-subarray coding is larger than that of the localized configuration. Particularly, in user dense environments, the interleaved configuration is effective. Therefore, we think that the interleaved configuration is suitable for millimeter-wave beam multiplexing.     

SDN-based wireless user management system

The degradation of end-to-end quality of service (QoS) on mobile users is becoming a common issue for IEEE 802.11 infrastructure-based networks in crowded areas. This research tackles the issue by employing an SDN framework on an integrated wireless/wired environment. Thereby, we present the development and implementation of a system that performs user management by analyzing the network load from the OpenFlow statistics, as well as the wireless information collected from the associated users. In order to analyse the behaviour of the proposed user migration algorithm, we evaluate the system under scenarios with different traffic load and user session duration. From the experiments, we observed that in several cases wireless users get a considerable QoS improvement at the application layer (up to 30% improvement in throughput and up to 20% in delay in our simulations) once the system is activated. Based on the results, we present an analysis on how and when user migration in multi-access point IEEE 802.11 networks can be most effective.     

EPEC: an efficient privacy-preserving energy consumption scheme for smart grid communications

In this paper, we propose an efficient privacy-preserving energy consumption scheme with updating certificates, called EPEC, for secure smart grid communications. Specifically, the proposed EPEC scheme consists of four phases: gateways initialization, party registration, privacy-preserving energy consumption, and updating certificates. Based on the bilinear pairing, the identity-based encryption, and the strategy of updating certificates, EPEC can achieve data privacy, gateway privacy, and is robust to data replay attack, availability attack, modification attack, man-in-the-middle attack, and Sybil attack. Through extensive performance evaluations, we demonstrate the effectiveness of EPEC in terms of transmission delay performance at the HAN gateway and average delivery ratio, by implementing three types of curves including, the Barreto–Naehrig curve with modulus 256 bits, the Kachisa–Schaefer–Scott curve with modulus 512 bits, and the Barreto–Lynn–Scott curve with modulus 640 bits.     

The JDTDOA algorithm applied to signal recovery: a performance analysis

This article suggests a novel method to retrieve a narrowband signal sent in a multipath environment with a delay spread considering ISI between symbols. The proposed method does not require any preamble nor known signal. Using the joint direction and time delay of arrivals estimation algorithm developed in prior work, the directions and time delays of arrival in the multipath channel are jointly estimated and associated while keeping a low computational cost. In this process, a MVDR beamformed copy of each arriving signal is created. The quality of these “pseudo copies” is evaluated and compared to the original direct and reflected signals in this work. Another beamforming method, the Moore–Penrose pseudoinverse, with better retrieval of the direct and reflected signals is also proposed. Using a simple delay-and-sum operation on the previously beamformed copies, it is possible to substantially improve the the system’s performance in terms of bit error rate. An approach using oversampling on the array antenna is introduced to improve performance. Numerical simulations are discussed to support theory.     

Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier

Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain algebraic induced key relations, e.g., affine functions or polynomials of bounded degree. In this work, we show that it is possible to go beyond the algebraic barrier and achieve security against arbitrary key relations, by restricting the number of tampering queries the adversary is allowed to ask for. The latter restriction is necessary in case of arbitrary key relations, as otherwise a generic attack of Gennaro et al. (TCC 2004) shows how to recover the key of almost any cryptographic primitive. We describe our contributions in more detail below. (1) We show that standard ID and signature schemes constructed from a large class of \(\Sigma \)-protocols (including the Okamoto scheme, for instance) are secure even if the adversary can arbitrarily tamper with the prover’s state a bounded number of times and obtain some bounded amount of leakage. Interestingly, for the Okamoto scheme we can allow also independent tampering with the public parameters. (2) We show a bounded tamper and leakage resilient CCA-secure public key cryptosystem based on the DDH assumption. We first define a weaker CCA-like security notion that we can instantiate based on DDH, and then we give a general compiler that yields CCA security with tamper and leakage resilience. This requires a public tamper-proof common reference string. (3) Finally, we explain how to boost bounded tampering and leakage resilience [as in (1) and (2) above] to continuous tampering and leakage resilience, in the so-called floppy model where each user has a personal hardware token (containing leak- and tamper-free information) which can be used to refresh the secret key. We believe that bounded tampering is a meaningful and interesting alternative to avoid known impossibility results and can provide important insights into the security of existing standard cryptographic schemes.     

Random waypoint mobility model in cellular networks

In this paper we study the so-called random waypoint (RWP) mobility model in the context of cellular networks. In the RWP model the nodes, i.e., mobile users, move along a zigzag path consisting of straight legs from one waypoint to the next. Each waypoint is assumed to be drawn from the uniform distribution over the given convex domain. In this paper we characterise the key performance measures, mean handover rate and mean sojourn time from the point of view of an arbitrary cell, as well as the mean handover rate in the network. To this end, we present an exact analytical formula for the mean arrival rate across an arbitrary curve. This result together with the pdf of the node location, allows us to compute all other interesting measures. The results are illustrated by several numerical examples. For instance, as a straightforward application of these results one can easily adjust the model parameters in a simulation so that the scenario matches well with, e.g., the measured sojourn times in a cell.