A Channel Borrowing Approach for Cluster-based Hierarchical Wireless Sensor Networks

Mobile Networks and Applications - In Wireless Sensor Networks (WSNs), energy-efficient routing is required to conserve the scarce resources of these networks. Various energy-efficient routing...     

BN–Graphene Composites Generated by Covalent Cross‐Linking with Organic Linkers

Composites of boron nitride (BN) and carboxylated graphene are prepared for the first time using covalent cross‐linking employing the carbodiimide reaction. The BN_1–xG_x (x ≈ 0.25, 0.5, and 0.75) obtained are characterized using a variety of spectroscopic techniques and thermogravimetric analysis. The composites show composition‐dependent electrical resistivity, the resistivity decreasing with increase in graphene content. The composites exhibit microporosity and the x ≈ 0.75 composite especially exhibits satisfactory performance with high stability as an electrode in supercapacitors. The x ≈ 0.75 composite is also found to be a good electrocatalyst for the oxygen reduction reaction in fuel cells.     

A modified rain attenuation prediction model for tropical V‐band satellite earth link

Radio wave propagation plays a very important part in the design and eventually dictates performance of space communication systems. Over time, the requirements of satellite communication have grown extensively where higher capacity communications systems are needed. Escalating demands of microwave and millimetre wave communications are causing frequency spectrum congestion. Hence, existing and future satellite system operators are planning to employ frequency bands well above 10 GHz. The challenge in operating at such high frequencies for communication purposes is that there exists stronger electromagnetic interaction between the radio signals and atmospheric hydrometeors. Such instances will degrade the performance of such high frequency satellite communication systems. The development of a revised model for a better‐improved rain fade prediction of signal propagations in tropical region is considered very important. Researchers and engineers can employ the model to accurately plan the future high frequencies satellite services. Copyright © 2014 John Wiley & Sons, Ltd.     

System-level reliability assessment of mixed-signal convergent microsystems

The next-generation convergent microsystems, based on system-on-package (SOP) technology, require up-front system-level design-for-reliability approaches and appropriate reliability assessment methodologies to guarantee the reliability of digital, optical, and radio frequency (RF) functions, as well as their interfaces. Systems approach to reliability requires the development of: i) physics-based reliability models for various failure mechanisms associated with digital, optical, and RF Functions, and their interfaces in the system; ii) design optimization models for the selection of suitable materials and processing conditions for reliability, as well as functionality; and iii) system-level reliability models understanding the component and functional interaction. This paper presents the reliability assessment of digital, optical, and RF functions in SOP-based microsystems. Upfront physics-based design-for-reliability models for various functional failure mechanisms are presented to evaluate various design options and material selection even before the prototypes are made. Advanced modeling methodologies and algorithms to accommodate material length scale effects due to enhanced system integration and miniaturization are presented. System-level mixed-signal reliability is discussed thorough system-level reliability metrics relating component-level failure mechanisms to system-level signal integrity, as well as statistical aspects.     

A new radix-2/8 FFT algorithm for length-q/spl times/2/sup m/ DFTs

In this paper, a new radix-2/8 fast Fourier transform (FFT) algorithm is proposed for computing the discrete Fourier transform of an arbitrary length N=q/spl times/2/sup m/, where q is an odd integer. It reduces substantially the operations such as data transfer, address generation, and twiddle factor evaluation or access to the lookup table, which contribute significantly to the execution time of FFT algorithms. It is shown that the arithmetic complexity (multiplications+additions) of the proposed algorithm is, in most cases, the same as that of the existing split-radix FFT algorithm. The basic idea behind the proposed algorithm is the use of a mixture of radix-2 and radix-8 index maps. The algorithm is expressed in a simple matrix form, thereby facilitating an easy implementation of the algorithm, and allowing for an extension to the multidimensional case. For the structural complexity, the important properties of the Cooley-Tukey approach such as the use of the butterfly scheme and in-place computation are preserved by the proposed algorithm.     

Recovery error bounds on compressed sensing of noisy signals

Compressed sensing is an emerging technique in the field of digital signal acquisition. It promises almost exact recovery of high‐dimensional signals from a very small set of measurements. However, this technique is challenged by the task of recovering signals immersed in noise. In this paper, we derive upper and lower bounds on mean squared recovery error of noisy signals. These bounds are valid for any number of acquired measurements and at any signal‐to‐noise ratio. This work is highly useful for the design of any compressed sensing‐based real world application by quantifying recovery error entailed with realistic digital signal acquisition scenarios. Copyright © 2013 John Wiley & Sons, Ltd.     

Improved aquila optimization-based parameter evaluation framework and meta-heuristic algorithm in radio-over-fiber SpatialMux multi-input multi-output long-term evolution system

In heterogeneous access network, Multiple-Input Multiple-Output (MIMO) radio-over-fiber (RoF) system is an efficient approach for multiple signal transmission with low cost and complexity. The performance of RoF fronthaul system in MIMO system will be varied with different nonlinear effects. By adjusting various transmission parameters, such as the input signal power or the laser bias current, the nonlinear impacts produced by the RoF system can be reduced. In this paper, a novel algorithm Improved Aquila Optimization (IAO) is proposed to optimize transmission circumstances of MIMO RoF system. It determines the appropriate bias current for both lasers and Radio Frequency (RF) signal power in a short period. The input signals are wavelength multiplexed with Intensity Modulation and Direct Detection (IM/DD) applied. The carrier as well as transmission frequency is governed by the MIMO-Long-Term Evolution (LTE) standard. The proposed system is implemented in MATLAB, and the performance is evaluated. The experimental results show that fast convergence and trade-off between noise and nonlinearity are obtained with varying bandwidth. In the experimental scenario, the maximum Error Vector Magnitude (EVM) of 1.88, 3.14, and signal-to-noise ratio (SNR) of 3.204, and 2.698 was attained for both quadrature phase shift keying (QPSK) and quadrature amplitude modulation (QAM) modulation. [Correction added on 24 April 2023, after first online publication: the SNR values were corrected in the preceding sentence.] For 100 iterations, the processing time was reduced to 0.137 s. When compared with the conventional state-of-the-art approaches, the accuracy and computational complexity of the proposed approach are improved.     

Collision avoidance slot allocation scheme for multi-cluster wireless sensor networks

This paper introduces a collision avoidance slot allocation scheme for Time Division Multiple Access (TDMA) based Medium Access Control (MAC) in multi-cluster wireless sensor networks. TDMA MAC protocols have built-in active-sleep duty cycle that can be leveraged for limiting idle listening. Also, they can overcome the overhearing problem, thus have better energy efficiency. Enabling concurrent intra-cluster communications using a single radio channel is a key issue in TDMA MAC protocols. Using orthogonal frequency channels or different Code Division Multiple Access codes for different adjacent clusters can solve the problem at the expense of cost. In this paper, we propose a new distributed slot allocation protocol called  Coordinated   Time   Slot   Allocation (CTSA) that can reduce collisions significantly using a single radio channel. We use simulations to study the effects of different system parameters on the performance of our proposed protocol. Simulation results show that applying CTSA over clustering protocols can significantly reduce collisions. It also shows fast convergence for our proposed CTSA protocol. In this paper we apply our CTSA scheme to the Low Energy Adaptive Clustering Hierarchy protocol which forms the basis for many cluster based routing protocols. CTSA is also compared with the SRSA algorithm proposed by Wu and Biswas (Wirel Netw 13(5):691–703, 2007) by means of simulation.     

Queue length‐based load balancing in data center networks

Traffic load balancing in data centers is an important requirement. Traffic dynamics and possibilities of changes in the topology (e.g., failures and asymmetries) make load balancing a challenging task. Existing end‐host–based schemes either employ the predominantly used ECN or combine it with RTT to get congestion information of paths. Both congestion signals, ECN and RTT, have limitations; ECN only tells whether the queue length is above or below a threshold value but does not inform about the extent of congestion; similarly, RTT in data center networks is on the scale of up to few hundreds of microseconds, and current data center operating systems lack fine‐grained microsecond‐level timers. Therefore, there is a need of a new congestion signal which should give accurate information of congestion along the path. Furthermore, in end‐host–based schemes, detecting asymmetries in the topology is challenging due to the inability to accurately measure RTT on the scale of microseconds. This paper presents QLLB, an end‐host–based, queue length–based load balancing scheme. QLLB employs a new queue length–based congestion signal that gives an exact measure of congestion along the paths. Furthermore, QLLB uses relative‐RTT to detect asymmetries in the topology. QLLB is implemented in ns‐3 and compared with ECMP, CONGA, and Hermes. The results show that QLLB significantly improves performance of short flows over the other schemes and performs within acceptable level, of CONGA and Hermes, for long flows. In addition, QLLB effectively detects asymmetric paths and performs better than Hermes under high loads.     

SCM: Secure and accountable TLS certificate management

In classical public‐key infrastructure (PKI), the certificate authorities (CAs) are fully trusted, and the security of the PKI relies on the trustworthiness of the CAs. However, recent failures and compromises of CAs showed that if a CA is corrupted, fake certificates may be issued, and the security of clients will be at risk. As emerging solutions, blockchain‐ and log‐based PKI proposals potentially solved the shortcomings of the PKI, in particular, eliminating the weakest link security and providing a rapid remedy to CAs' problems. Nevertheless, log‐based PKIs are still exposed to split‐world attacks if the attacker is capable of presenting two distinct signed versions of the log to the targeted victim(s), while the blockchain‐based PKIs have scaling and high‐cost issues to be overcome. To address these problems, this paper presents a secure and accountable transport layer security (TLS) certificate management (SCM), which is a next‐generation PKI framework. It combines the two emerging architectures, introducing novel mechanisms, and makes CAs and log servers accountable to domain owners. In SCM, CA‐signed domain certificates are stored in log servers, while the management of CAs and log servers is handed over to a group of domain owners, which is conducted on the blockchain platform. Different from existing blockchain‐based PKI proposals, SCM decreases the storage cost of blockchain from several hundreds of GB to only hundreds of megabytes. Finally, we analyze the security and performance of SCM and compare SCM with previous blockchain‐ and log‐based PKI schemes.