This paper presents a novel spectrum sensing technique based on selection diversity combining in cognitive radio networks. In general, a selection diversity combining scheme requires a period to select an optimal element, and spectrum sensing requires a period to detect a target signal. We consider that both these periods are required for the spectrum sensing based on selection diversity combining. However, conventional techniques do not consider both the periods. Furthermore, spending a large amount of time in selection and signal detection increases their accuracy. Because the required period for spectrum sensing based on selection diversity combining is the summation of both the periods, their lengths should be considered while developing selection diversity combining based spectrum sensing for a constant period. In reference to this, we discuss the spectrum sensing technique based on selection diversity combining. Numerical examples are shown to validate the effectiveness of the presented design techniques.

This paper presents a novel statistic computation technique for energy detection-based spectrum sensing with multiple antennas. The presented technique computes the statistic for signal detection after combining all the signals. Because the computation of the statistic for all the received signals is not required, the presented technique reduces the computational complexity. Furthermore, the absolute value of all the received signals are combined to prevent the attenuation of the combined signals. Because the statistic computations are not required for all the received signals, the reduction of the computational complexity for signal detection can be expected. Furthermore, the presented technique does not need to choose anything, such as the binary phase rotator in the conventional technique, and therefore, the performance degradation due to wrong choices can be avoided. Numerical examples indicate that the spectrum sensing performances of the presented technique are almost the same as those of conventional techniques despite the complexity of the presented technique being less than that of the conventional techniques.

A triple-band CP rectenna for ambient RF energy harvesting is presented in this paper. A simple broadband CP slot antenna has been proposed with the bandwidth of 51.1% operating from 1.53 to 2.58GHz, which can cover GSM-1800, UMTS-2100 and 2.45GHz WLAN bands. Accordingly, a triple-band rectifying circuit is designed to convert RF energy in the above bands, with the maximum RF-DC conversion efficiency of 42.5% at a relatively low input power of -5dBm. Additionally, the rectenna achieves the maximum conversion efficiency of 12.7% in the laboratory measurements. The measured results show a good performance in the laboratory measurements.

A lumped element kinetic inductance detector (LeKID) relying on a superconducting resonator is a promising candidate for sensing high energy particles such as neutrinos, X-rays, gamma-rays, alpha particles, and the particles found in the dark matter owing to its large-format capability and high sensitivity. To develop a high energy camera, we formulated design rules based on the experimental results from niobium (Nb)-based LeKIDs at 1 K irradiated with alpha-particles of 5.49 MeV. We defined the design rules using the electromagnetic simulations for minimizing the crosstalk. The neighboring pixels were fixed at 150 µm with a frequency separation of 250 MHz from each other to reduce the crosstalk signal as low as the amplifier-limited noise level. We examined the characteristics of the Nb-based resonators, where the signal decay time was controlled in the range of 0.5-50 µs by changing the designed quality factor of the detectors. The amplifier noise was observed to restrict the performance of our device, as expected. We improved the energy resolution by reducing the filling factor of inductor lines. The best energy resolution of 26 for the alpha particle of 5.49 MeV was observed in our device.

This paper investigates the secrecy energy efficiency maximization (SEEM) problem in a simultaneous wireless information and power transfer (SWIPT) system, wherein a legitimate user (LU) exploits the power splitting (PS) scheme for simultaneous information decoding (ID) and energy harvesting (EH). To prevent interference from eavesdroppers on the LU, artificial noise (AN) is incorporated into the confidential signal at the transmitter. We maximize the secrecy energy efficiency (SEE) by joining the power of the confidential signal, the AN power, and the PS ratio, while taking into account the minimum secrecy rate requirement of the LU, the required minimum harvested energy, the allowed maximum radio frequency transmission power, and the PS ratio. The formulated SEEM problem involves nonconvex fractional programming and is generally intractable. Our solution is Lagrangian relaxation method than can transform the original problem into a two-layer optimization problem. The outer layer problem is a single variable optimization problem with a Lagrange multiplier, which can be solved easily. Meanwhile, the inner layer one is fractional programming, which can be transformed into a subtractive form solved using the Dinkelbach method. A closed-form solution is derived for the power of the confidential signal. Simulation results verify the efficiency of the proposed SEEM algorithm and prove that AN-aided design is an effective method for improving system SEE.

To solve the problem of the self-deployment of heterogeneous directional wireless sensor networks in 3D space, this paper proposes a weighted Voronoi diagram-based self-deployment algorithm (3DV-HDDA) in 3D space. To improve the network coverage ratio of the monitoring area, the 3DV-HDDA algorithm uses the weighted Voronoi diagram to move the sensor nodes and introduces virtual boundary torque to rotate the sensor nodes, so that the sensor nodes can reach the optimal position. This work also includes an improvement algorithm (3DV-HDDA-I) based on the positions of the centralized sensor nodes. The difference between the 3DV-HDDA and the 3DV-HDDA-I algorithms is that in the latter the movement of the node is determined by both the weighted Voronoi graph and virtual force. Simulations show that compared to the virtual force algorithm and the unweighted Voronoi graph-based algorithm, the 3DV-HDDA and 3DV-HDDA-I algorithms effectively improve the network coverage ratio of the monitoring area. Compared to the virtual force algorithm, the 3DV-HDDA algorithm increases the coverage from 75.93% to 91.46% while the 3DV-HDDA-I algorithm increases coverage from 76.27% to 91.31%. When compared to the unweighted Voronoi graph-based algorithm, the 3DV-HDDA algorithm improves the coverage from 80.19% to 91.46% while the 3DV-HDDA-I algorithm improves the coverage from 72.25% to 91.31%. Further, the energy consumption of the proposed algorithms after 60 iterations is smaller than the energy consumption using a virtual force algorithm. Experimental results demonstrate the accuracy and effectiveness of the 3DV-HDDA and the 3DV-HDDA-I algorithms.

This paper proposes a successive interference cancellation (SIC) of independent component analysis (ICA) aided spatial division multiple access (SDMA) for Gaussian filtered frequency shift keying (GFSK) in Bluetooth low energy (BLE) systems. The typical SDMA scheme requires estimations of channel state information (CSI) using orthogonal pilot sequences. However, the orthogonal pilot is not embedded in the BLE packet. This fact motivates us to add ICA detector into BLE systems. In this paper, focusing on the covariance matrix of ICA outputs, SIC can be applied with Cholesky decomposition. Then, in order to address the phase ambiguity problems created by the ICA process, we propose a differential detection scheme based on the MAP algorithm. In practical scenarios, it is subject to carrier frequency offset (CFO) as well as symbol timing offset (STO) induced by the hardware impairments present in the BLE peripherals. The packet error rate (PER) performance is evaluated by computer simulations when BLE peripherals simultaneously communicate in the presence of CFO and STO.

The decentralized energy network is one of the promising solutions as a next-generation power grid. In this system, each house has a photovoltaic (PV) panel as a renewable energy source and a battery which is an essential component to balance between generation and demand. The common objective of the battery management on such systems is to minimize only the purchased energy from a power company, but battery degradation caused by charge/discharge cycles is also a serious problem. This paper proposes a State-of-Health (SOH) aware system-level battery management methodology for the decentralized energy network. The power distribution problem is often solved with mixed integer programming (MIP), and the proposed MIP formulation takes into account the SOH model. In order to minimize the purchased energy and reduce the battery degradation simultaneously, the optimization problem is divided into two stages: 1) the purchased energy minimization, and 2) the battery aging factor reducing, and the trade-off exploration between the purchased energy and the battery degradation is available. Experimental results show that the proposed method achieves the better trade-off and reduces the battery aging cost by 14% over the baseline method while keeping the purchased energy minimum.

Near real-time periodic tasks, which are popular in multimedia streaming applications, have deadline periods that are longer than the input intervals thanks to buffering. For such applications, the conventional frame-based schedulings cannot realize the optimal scheduling due to their shortsighted deadline assumptions. To realize globally energy-efficient executions of these applications, we propose a novel task scheduling algorithm, which takes advantage of the long deadline period. We confirm our approach can take advantage of the longer deadline period and reduce the average power consumption by up to 18%.

This paper studies the joint optimization of precoding, transmit power and data rate allocation for energy-efficient full-duplex (FD) cloud radio access networks (C-RANs). A new nonconvex problem is formulated, where the ratio of total sum rate to total power consumption is maximized, subject to the maximum transmit powers of remote radio heads and uplink users. An iterative algorithm based on successive convex programming is proposed with guaranteed convergence to the Karush-Kuhn-Tucker solutions of the formulated problem. Numerical examples confirm the effectiveness of the proposed algorithm and show that the FD C-RANs can achieve a large gain over half-duplex C-RANs in terms of energy efficiency at low self-interference power levels.

In this paper, we consider the clustering problem of independent general subspaces. That is, with given data points lay near or on the union of independent low-dimensional linear subspaces, we aim to recover the subspaces and assign the corresponding label to each data point. To settle this problem, we take advantages of both greedy strategy and energy minimization strategy to propose a simple yet effective algorithm based on the assumption that an m-branched (i.e., perfect m-ary) tree which is constructed by collecting m-nearest neighbor points in each node has a high probability of containing the near-exact subspace. Specifically, at first, subspace candidates are enumerated by multiple m-branched trees. Each tree starts with a data point and grows by collecting nearest neighbors in the breadth-first search order. Then, subspace proposals are further selected from the enumeration to initialize the energy minimization algorithm. Eventually, both the proposals and the labeling result are finalized by iterative re-estimation and labeling. Experiments with both synthetic and real-world data show that the proposed method can outperform state-of-the-art methods and is practical in real application.

Super resolution (SR) image reconstruction has attracted increasing attention these years and many SR image reconstruction algorithms have been proposed for restoring a high-resolution image from one or multiple low-resolution images. However, how to objectively evaluate the quality of SR reconstructed images remains an open problem. Although a great number of image quality metrics have been proposed, they are quite limited to evaluate the quality of SR reconstructed images. Inspired by this, this paper presents a blind quality index for SR reconstructed images using first- and second-order structural degradation. First, the SR reconstructed image is decomposed into multi-order derivative magnitude maps, which are effective for first- and second-order structural representation. Then, log-energy based features are extracted on these multi-order derivative magnitude maps in the frequency domain. Finally, support vector regression is used to learn the quality model for SR reconstructed images. The results of extensive experiments that were conducted on one public database demonstrate the superior performance of the proposed method over the existing quality metrics. Moreover, the proposed method is less dependent on the number of training images and has low computational cost.

For cloud data center, Virtual Machine (VM) consolidation is an effective way to save energy and improve efficiency. However, inappropriate consolidation of VMs, especially aggressive consolidation, can lead to performance problems, and even more serious Service Level Agreement (SLA) violations. Therefore, it is very important to solve the tradeoff between reduction in energy use and reduction of SLA violation level. In this paper, we propose two Host State Detection algorithms and an improved VM placement algorithm based on our proposed Host State Binary Decision Tree Prediction model for SLA-aware and energy-efficient consolidation of VMs in cloud data centers. We propose two formulas of conditions for host state estimate, and our model uses them to build a Binary Decision Tree manually for host state detection. We extend Cloudsim simulator to evaluate our algorithms by using PlanetLab workload and random workload. The experimental results show that our proposed model can significantly reduce SLA violation rates while keeping energy cost efficient, it can reduce the metric of SLAV by at most 98.12% and the metric of Energy by at most 33.96% for real world workload.

Energy consumption is one of the important issues in communication networks, and it is expected that network devices such as network interface cards will be turned off to decrease the energy consumption. Moreover, fast failure recovery is an important issue in large-scale communication networks to minimize the impact of failure on data transmission. In order to realize both low energy consumption and fast failure recovery, a method called LE-MRC (Low-Energy based Multiple Routing Configurations) has been proposed. However, LE-MRC can degrade network robustness because some links ports are turned off for reducing the energy consumption. Nevertheless, network robustness is also important for maintaining the performance of data transmission and the network functionality. In this paper, for realizing both low energy consumption and fast failure recovery while maintaining network robustness, we propose Robustness and Low-Energy based Multiple Routing Configurations (RLE-MRC). In RLE-MRC, some links are categorized into unnecessary links, and those links are turned off to lower the energy consumption. In particular, the number of excluded links is determined based on the network robustness. As a result, the energy consumption can be reduced so as not to degrade the network robustness significantly. Simulations are conducted on some network topologies to evaluate the performance of RLE-MRC. We also use ns-3 to evaluate how the performance of data transmission and network robustness are changed by using RLE-MRC. Numerical examples show that the low energy consumption and the fast failure recovery can be achieved while maintaining network robustness by using RLE-MRC.

This paper proposes an energy efficiency (EE) maximized resource allocation (RA) algorithm in orthogonal frequency division multiple access (OFDMA) downlink networks with multiple relays, where a novel opportunistic subcarrier pair based decode-and-forward (DF) protocol with beamforming is used. Specifically, every data transmission is carried out in two consecutive time slots. During every transmission, multiple parallel paths, including relayed paths and direct paths, are established by the proposed RA algorithm. As for the protocol, each subcarrier in the 1st slot can be paired with any subcarrier in 2nd slot to best utilize subcarrier resources. Furthermore, for each relayed path, multiple (not just single or all) relays can be chosen to apply beamforming at the subcarrier in the 2nd slot. Each direct path is constructed by an unpaired subcarrier in either the 1st or 2nd slot. In order to guarantee an acceptable spectrum efficiency, we also introduce a minimum rate constraint. The EE-maximized problem is a highly nonlinear optimization problem, which contains both continuous, discrete variables and has a fractional structure. To solve the problem, the best relay set and resource allocation for a relayed path are derived first, then we design an iterative algorithm to find the optimal RA for the network. Finally, numerical experiments are taken to demonstrate the effectiveness of the proposed algorithm, and show the impact of minimum rate requirement, user number and circuit power on the network EE.

In this paper, we study the power allocation (PA) scheme design for energy efficiency (EE) maximization with discrete-rate adaptive modulation (AM) in the downlink distributed antenna system (DAS). By means of the Karush-Kuhn-Tucker (KKT) conditions, an optimal PA scheme with closed-form expression is derived for maximizing the EE subject to maximum transmit power and target bit error rate (BER) constraints, where the number of active transmit antennas is also derived for attaining PA coefficients. Considering that the optimal scheme needs to calculate the PA of all transmit antennas for each modulation mode, its complexity is extremely high. For this reason, a low-complexity suboptimal PA is also presented based on the antenna selection method. By choosing one or two remote antennas, the suboptimal scheme offers lower complexity than the optimal one, and has almost the same EE performance as the latter. Besides, the outage probability is derived in a performance evaluation. Computer simulation shows that the developed optimal scheme can achieve the same EE as the exhaustive search based approach, which has much higher complexity, and the suboptimal scheme almost matches the EE of the optimal one as well. The suboptimal scheme with two-antenna selection is particularly effective in terms of balancing performance and complexity. Moreover, the derived outage probability is in good agreement with the corresponding simulation.

This paper introduces an energy-efficient transmit design for multiple-input single-output (MISO) energy-harvesting cognitive radio (CR) networks in the presence of external eavesdroppers (Eves). Due to the inherent characteristics of CR network with simultaneous wireless information and power transfer (SWIPT), Eves may illegitimately access the primary user (PU) bands, and the confidential message is prone to be intercepted in wireless communications. Assuming the channel state information (CSI) of the Eves is not perfectly known at the transmitter, our approach to guaranteeing secrecy is to maximize the secrecy energy efficiency (SEE) by jointly designing the robust beamforming and the power splitting (PS) ratio, under the constraints of total transmit power, harvested energy at secondary receiver (SR) and quality of service (QoS) requirement. Specifically, a non-linear energy harvesting (EH) model is adopted for the SR, which can accurately characterize the property of practical RF-EH circuits. To solve the formulated non-convex problem, we first employ fractional programming theory and penalty function to recast it as an easy-to-handle parametric problem, and then deal with the non-convexity by applying S-Procedure and constrained concave convex procedure (CCCP), which enables us to exploit the difference of concave functions (DC) programming to seek the maximum worst-case SEE. Finally, numerical results are presented to verify the performance of the proposed scheme.

In this work, we investigate a joint transmit beamforming and artificial noise (AN) covariance matrix design in a multiple-input multiple-output (MIMO) cognitive radio (CR) downlink network with simultaneous wireless information and power transfer (SWIPT), where the malicious energy receivers (ERs) may decode the desired information and hence can be treated as potential eavesdroppers (Eves). In order to improve the secure performance of the transmission, AN is embedded to the information-bearing signal, which acts as interference to the Eves and provides energy to all receivers. Specifically, this joint design is studied under a practical non-linear energy harvesting (EH) model, our aim is to maximize the secrecy rate at the SR subject to the transmit power budget, EH constraints and quality of service (QoS) requirement. The original problem is not convex and challenging to be solved. To circumvent its intractability, an equivalent reformulation of this secrecy rate maximization (SRM) problem is introduced, wherein the resulting problem is primal decomposable and thus can be handled by alternately solving two convex subproblems. Finally, numerical results are presented to verify the effectiveness of our proposed scheme.

In this paper, we propose a novel group formation scheme which is integrated with an EMGC protocol in order to cope with dynamic group change. It uses a link expiration time and residual energy to form a stable link in a group. It also has a group merging procedure to decrease the number of groups. Furthermore, we develop two additional functions for the protocol, i.e., GL rotation and a stay connection procedure to diminish energy consumption of sensor nodes in the network. Simulation results show that the proposed protocol outperforms MBC, EMGCwoh, and EMGC protocols in terms of data delivery, network lifetime, and energy dissipation per round with various group change probabilities and percentages of groups.

Efficient road-lane detection is expected to be achievable by application of the Hough transform (HT) which realizes high-accuracy straight-line extraction from images. The main challenge for HT-hardware implementation in actual applications is the trade-off optimization between accuracy maximization, power-dissipation reduction and real-time requirements. We report a HT-hardware architecture for road-lane detection with parallelized voting procedure, local maximum algorithm and FPGA-prototype implementation. Parallelization of the global design is realized on the basis of θ-value discretization in the Hough space. Four major hardware modules are developed for edge detection in the original video frames, computation of the characteristic edge-pixel values (ρ,θ) in Hough-space, voting procedure for each (ρ,θ) pair with parallel local-maximum-based peak voting-point extraction in Hough space to determine the detected straight lines. Implementation of a prototype system for real-time road-lane detection on a low-cost DE1 platform with a Cyclone II FPGA device was verified to be possible. An average detection speed of 135 frames/s for VGA (640x480)-frames was achieved at 50 MHz working frequency.