Multicast Network Security with Asymmetric Cooperative Relaying

International Journal of Wireless Information Networks - This paper exhibits the confidentiality performance study of a cooperative multicast network consisting of $${\mathcal {K}}$$ asymmetric...     

Routing in Distributed Cognitive Radio Networks: A Survey

Cognitive Radio Networks (CRNs) have been receiving significant research attention recently due to their ability to solve issues associated with spectrum congestion and underutilization. In a CRN, unlicensed users (or Secondary Users, SUs) are able to exploit and use underutilized licensed channels, but they must evacuate the channels if any interference is caused to the licensed users (or Primary Users, PUs) who own the channels. Due to the dynamicity of spectrum availability in CRNs, design of protocols and schemes at different layers of the SU’s network stack has been challenging. In this article, we focus on routing and discuss the challenges and characteristics associated with it. Subsequently, we provide an extensive survey on existing routing schemes in CRNs. Generally speaking, there are three categories of challenges, namely channel-based, host-based, and network-based. The channel-based challenges are associated with the operating environment, the host-based with the SUs, and the network-based with the network-wide SUs. Furthermore, the existing routing schemes in the literature are segregated into three broad categories based on the relationship between PUs and SUs in their investigation, namely intra-system, inter-system, and hybrid-system; and within each category, they are further categorized based on their types, namely Proactive, Reactive, Hybrid, and Adaptive Per-hop. Additionally, we present performance enhancements achieved by the existing routing schemes in CRNs. Finally, we discuss various open issues related to routing in CRNs in order to establish a foundation and to spark new interests in this research area.     

Power Control for Cognitive Radio Networks: A Game Theoretic Approach

In communication industry one of the most rapidly growing area is wireless technology and its applications. The efficient access to radio spectrum is a requirement to make this communication feasible for the users that are running multimedia applications and establishing real-time connections on an already overcrowded spectrum. In recent times cognitive radios (CR) are becoming the prime candidates for improved utilization of available spectrum. The unlicensed secondary users share the spectrum with primary licensed user in such manners that the interference at the primary user does not increase from a predefined threshold. In this paper, we propose an algorithm to address the power control problem for CR networks. The proposed solution models the wireless system with a non-cooperative game, in which each player maximize its utility in a competitive environment. The simulation results shows that the proposed algorithm improves the performance of the network in terms of high SINR and low power consumption.

     

A novel robust FPGA routing switch box design for ultra low power applications

Fabrication cost of application-specific integrated circuits (ASICs) is exponentially rising in deep submicron region due to rapidly rising non-recurring engineering cost. Field programmable gate arrays (FPGAs) provide an attractive alternative to ASICs but consume an order of magnitude higher power. There is a need to explore ways of reducing FPGA power consumption so that they can also be employed in ultra low power (ULP) applications instead of ASICs. Subthreshold region of operation is an ideal choice for ULP low-throughput FPGAs. The routing of an FPGA consumes most of the chip area and primarily determines the circuit delay and power consumption. There is a need to design moderate-speed ULP routing switches for subthreshold FPGA. This article proposes a novel subthreshold FPGA routing switch box (SB) that utilises the leakage voltage through transistor as biasing voltage which shows 69%, 61.2% and 30% improvement in delay, power delay product and delay variation, respectively, over conventional routing SB.     

PAPR Reduction in OFDM Systems Based on Autoregressive Filtering

Orthogonal frequency division multiplexing (OFDM) has a very high peak-to-average power ratio (PAPR) that causes a severe nonlinear distortion in practical hardware implementation of high power amplifiers (HPA). In this article, a new PAPR reduction method is proposed based on autoregressive (AR) error filtering. This method proposes the use of signal whitening property of error filtering as a preprocessing step to remove the predictable content of stationary stochastic processes which can reduce the autocorrelation of input data sequences and is shown to be a very effective solution for the PAPR problem in OFDM systems. It is shown that the proposed method can achieve a significant reduction in PAPR without degrading the error performance or power spectral levels. It is also shown that the proposed method is applicable to any modulation scheme and can work for any number of subcarriers under both additive white Gaussian noise and wireless Rayleigh fading channel.     

PbS and CdS Quantum Dot‐Sensitized Solid‐State Solar Cells: “Old Concepts,New Results”

Lead sulfide (PbS) and cadmium sulfide (CdS) quantum dots (QDs) are prepared over mesoporous TiO₂ films by a successive ionic layer adsorption and reaction (SILAR) process. These QDs are exploited as a sensitizer in solid‐state solar cells with 2,2′,7,7′‐tetrakis(N,N‐di‐p‐methoxyphenylamine)‐9,9′‐spirobifluorene (spiro‐OMeTAD) as a hole conductor. High‐resolution transmission electron microscopy (TEM) images reveal that PbS QDs of around 3 nm in size are distributed homogeneously over the TiO₂ surface and are well separated from each other if prepared under common SILAR deposition conditions. The pore size of the TiO₂ films and the deposition medium are found to be very critical in determining the overall performance of the solid‐state QD cells. By incorporating promising inorganic QDs (PbS) and an organic hole conductor spiro‐OMeTAD into the solid‐state cells, it is possible to attain an efficiency of over 1% for PbS‐sensitized solid‐state cells after some optimizations. The optimized deposition cycle of the SILAR process for PbS QDs has also been confirmed by transient spectroscopic studies on the hole generation of spiro‐OMeTAD. In addition, it is established that the PbS QD layer plays a role in mediating the interfacial recombination between the spiro‐OMeTAD⁺ cation and the TiO₂ conduction band electron, and that the lifetime of these species can change by around 2 orders of magnitude by varying the number of SILAR cycles used. When a near infrared (NIR)‐absorbing zinc carboxyphthalocyanine dye (TT1) is added on top of the PbS‐sensitized electrode to obtain a panchromatic response, two signals from each component are observed, which results in an improved efficiency. In particular, when a CdS‐sensitized electrode is first prepared, and then co‐sensitized with a squarine dye (SQ1), the resulting color change is clearly an addition of each component and the overall efficiencies are also added in a more synergistic way than those in PbS/TT1‐modified cells because of favorable charge‐transfer energetics.     

Process simulation for HgCdTe infrared focal plane array flexible manufacturing

The strategy and status of a process simulator for the flexible manufacture of HgCdTe infrared focal plane arrays is described. It has capabilities to simulate Hg vacancy and interstitial effects and cation impurity diffusion, for various boundary conditions in one dimension. Numerical complexity of these problems stems from the necessity of solving diffusion equations for each defect that are coupled to each other via nonlinear interaction terms. The simulator has already led to the prediction of heretofore unexplained experimental data. Current extensions of the one-dimensional simulator planned over the next few years include the addition of Te antisites, antisite-Hg vacancy pairs, and In-Hg vacancy pairs, ion implantation, and various energetic processes (such as ion milling). The sequential effect of various processes will be possible with the input to the simulator looking much like a process run sheet.     

Synchronizable test sequences based on multiple UIO sequences

A test sequence generation method is proposed for testing the conformance of a protocol implementation to its specification in a remote testing system where both external synchronization and input/output operation costs are taken into consideration. The method consists of a set of transformation rules that constructs a duplexU digraph from a given finite state machine (FSM) representation of a protocol specification; and an algorithm that finds a rural postman tour in the duplexU digraph to generate a synchronizable test sequence utilizing multiple UIO sequences. If the protocol satisfies a specific property, namely, the transitions to be tested and the UIO sequences to be employed form a weakly-connected subgraph of the duplexU digraph, the proposed algorithm yields a minimum-cost test sequence. X.25 DTE and ISO Class 0 transport protocols are shown to possess this property. Otherwise, the algorithm yields a test sequence whose cost is within a bound from the cost of the minimum-cost test sequence. The bound for the test sequence generated from the Q.931 network-side protocol is shown to be the cost sum of an input/output operation pair and an external synchronization operation     

Wireless distributed computing in cognitive radio networks

Individual cognitive radio nodes in an ad-hoc cognitive radio network (CRN) have to perform complex data processing operations for several purposes, such as situational awareness and cognitive engine (CE) decision making. In an implementation point of view, each cognitive radio (CR) may not have the computational and power resources to perform these tasks by itself. In this paper, wireless distributed computing (WDC) is presented as a technology that enables multiple resource-constrained nodes to collaborate in computing complex tasks in a distributed manner. This approach has several benefits over the traditional approach of local computing, such as reduced energy and power consumption, reduced burden on the resources of individual nodes, and improved robustness. However, the benefits are negated by the communication overhead involved in WDC. This paper demonstrates the application of WDC to CRNs with the help of an example CE processing task. In addition, the paper analyzes the impact of the wireless environment on WDC scalability in homogeneous and heterogeneous environments. The paper also proposes a workload allocation scheme that utilizes a combination of stochastic optimization and decision-tree search approaches. The results show limitations in the scalability of WDC networks, mainly due to the communication overhead involved in sharing raw data pertaining to delegated computational tasks.