An accurate analysis of the nonlinear power amplifier effects on SC-FDMA signals

Wireless Networks - Single carrier-frequency division multiple access (SC-FDMA) is a multiple access technique in broadband wireless networks which has been adapted by 3GPP for uplink transmission...     

Nature‐inspired meta‐heuristic algorithms for solving the load balancing problem in the software‐defined network

The growth of the networks has difficult network management. Recently, a concept called software‐defined network (SDN) has been proposed to address this issue, which makes network management more adaptable. Control and forwarding planes are separated in SDN. The control plane is a centralized logical controller that controls the network. The forwarding plane that consists of transfer devices is responsible for transmitting packets. Because the network resources are limited, optimizing the use of resources in the networks is an important issue. Load balancing improves the balanced distribution of loads across multiple resources in order to maximize the reliability and network resources efficiency. SDN controllers can create an optimal load balancing compared to traditional networks because they have a network global view. The load‐balancing problem can be solved using many different nature‐inspired meta‐heuristic techniques because it has the NP‐complete nature. Hence, for solving load balancing problem in SDN, nature‐inspired meta‐heuristic techniques are important methods. However, to the best of our knowledge, there is not a survey or systematic review on studying these matters. Accordingly, in the area of the load balancing in the SDN, this paper reviews systematically the nature‐inspired meta‐heuristic techniques. Also, this study demonstrates advantages and disadvantages regarded of the chosen nature‐inspired meta‐heuristic techniques and considers their algorithms metrics. Moreover, to apply better load balancing techniques in the future, the important challenges of these techniques have been investigated.     

Frame time-hopping patterns in multirate optical CDMA networks using conventional and multicode schemes

A class of generalized optical orthogonal codes (OOCs), namely, frame time-hopping (FTH) patterns with an extremely large cardinality, are studied for implementing multirate and multiservice (MR/MS) optical CDMA (OCDMA) networks. Conventional MR/MS methods, namely variable spreading rate and parallel mapping, are considered. Using FTH patterns, the problem of low OOC code cardinality in conventional MR/MS schemes is removed. Moreover, several new multicode methods, using subcode concatenation scheme, are proposed for MR/MS OCDMA. The proposed multicode schemes present flexibility for supporting MR/MS applications such as lower implementation complexity and cost, less need for service synchronization, and finally lower link power budget. Multiple-access performances of the systems are evaluated using saddle-point approximation methods considering photodetector shot-noise, dark current, and circuit thermal noise. The results show that the conventional parallel mapping outperforms the other schemes in high received powers, and the proposed multicode method, using Walsh subcode along with difference modulation, presents the best performance in low received powers for the cases considered.     

Design and Optimization of Full Comparator Based on Quantum‐Dot Cellular Automata

Quantum‐dot cellular automata (QCA) is one of the few alternative computing platforms that has the potential to be a promising technology because of higher speed, smaller size, and lower power consumption in comparison with CMOS technology. This letter proposes an optimized full comparator for implementation in QCA. The proposed design is compared with previous works in terms of complexity, area, and delay. In comparison with the best previous full comparator, our design has 64% and 85% improvement in cell count and area, respectively. Also, it is implemented with only one clock cycle. The obtained results show that our full comparator is more efficient in terms of cell count, complexity, area, and delay compared to the previous designs. Therefore, this structure can be simply used in designing QCA‐based circuits.     

Simple,fast, and accurate parametric modeling of the coupling and external quality factor for microstrip filter design using active learning method

In the realization step of any microstrip filter according to the required electrical characteristics, coupling factors and external quality factor (Q_ext) are related to the physical parameters of the structure using time consuming full wave simulations. This paper presents a simple, fast, and accurate parametric model of the coupling between the coupled square open loop resonators (SOLRs) and Q_ext of these resonators versus physical parameters of the structure and substrate characteristics utilizing active learning method (ALM). In the modeling process the multi-dimensional functions of coupling factor and Q_ext are broken down into their simpler aspects, their behaviors are extracted and then final model will be constructed by combining these simpler aspects. ALM allows the overall model for coupling factor and Q_ext to be developed through the use of small number of initial data. Once the modeling process is completed it provides a fast and accurate prediction of the required physical parameters for a given coupling factor and Q_ext. Using the constructed model for a distinct SOLR, which its accuracy was validated by comparison with the full wave simulation results a filter was designed and fabricated. Good agreement between measured and simulated response confirms the accuracy of the modeling procedure.     

Wireless Brain Computer Interface for Smart Home and Medical System

Wireless Personal Communications - The number of aged and disabled people has been increasing worldwide. To look after these people is a big challenge in this era. However, scientists overcome the...     

Performance improvement of OFDM systems using compressive sensing with group LASSO signal reconstruction algorithm

Wireless Networks - Orthogonal frequency division multiplexing (OFDM) has been investigated for the high-speed transmission of data in radio frequency and optical wireless communications. The OFDM...     

BSLPSDN: Base station location privacy via software-defined networking (SDN) in wireless sensor networks

Base station's location privacy in a wireless sensor network (WSN) is critical for information security and operational availability of the network. A key part of securing the base station from potential compromise is to secure the information about its physical location. This paper proposes a technique called base station location privacy via software-defined networking (SDN) in wireless sensor networks (BSLPSDN). The inspiration comes from the architecture of SDN, where the control plane is separated from the data plane, and where control plane decides the policy for the data plane. BSLPSDN uses three categories of nodes, namely, a main controller to instruct the overall operations, a dedicated node to buffer and forward data, and lastly, a common node to sense and forward the packet. We employ three kinds of nodes to collaborate and achieve stealth for the base station and thus protecting it against the traffic-analysis attacks. Different traits of the WSN including energy status and traffic density can actively be monitored by BSLPSDN, which positively affects the energy goals, expected life of the network, load on common nodes, and the possibility of creating diversion in the wake of an attack on the base station. We incorporated multiple experiments to analyze and evaluate the performance of our proposed algorithm. We use single controller with multiple sensor nodes and multiple controllers with multiple sensor nodes to show the level of anonymity of BS. Experiments show that providing BS anonymity via multiple controllers is the best method both in terms of energy and privacy.