Hybrid opto-digital signal processing in 112 Gbit/s DP-16QAM and DP-QDB transmission for long-haul large-$$\hbox {A}_\mathrm{eff}$$ pure-silica-core fiber links

In this work, we investigate the energy efficiency in optical code division multiplexing access (OCDMA) networks with forward error correction (FEC). We have modeled the energy efficiency considering the capacity of information transmitted and the network power consumption. The proposed network power consumption model considers the optical transmitter, receiver, optical amplifiers, FEC and network infrastructure as encoders, decoders, star coupler and network control in the overall optical power network consumption balance. Furthermore, an expression relating the signal-to-noise-plus-interference ratio gain for forward error correction with low-density parity-check code scheme considering the power consumption and bandwidth occupancy has been derived. Numerical results for OCDMA networks with aggregated FEC procedure have revealed the viability of the FEC deployment aiming to increase the overall energy efficiency of OCDMA networks.     

Analysis of Multi-Server Scheduling Paradigm for Service Guarantees during Network Mobility

Multi-server scheduling of traffic flows over heterogeneous wireless channels affix fresh concerns of inter-packet delay variations and associated problems of out-of-sequence reception, buffer management complexity, packet drops and re-ordering overhead. In this paper, we have presented an exclusive multi-server scheduling algorithm that is specifically tuned for mobile routers equipped with multiple wireless interfaces and has attained multiple care-of-address registrations with its home agent (HA). The proposed adaptive, Self-clocked, Multi-server (ASM) scheduling algorithm is based on predetermined transmission deadlines for each arrived packet at the mobile router. The mobile flows receive desired service levels in accordance with their negotiated service rates and are only constraint by the cumulative capacity of all active links. The major challenge lies in the handling of asymmetric channels to stitch into a unified virtual channel of higher capacity with reliable service guarantees during mobility. The sorted list of transmission schedules is used to assign physical channels in increasing order of their availability. This approach specifically encapsulates the physical layer disconnections during the handovers and ensures continuous service to ongoing flows. The proposed scheduling scheme is supplemented by an analytical model and simulations to verify its efficacy. The simulation results demonstrate higher degree of reliability and scalability of service provisioning to flows during mobility.     

MDP-Based Network Selection Scheme by Genetic Algorithm and Simulated Annealing for Vertical-Handover in Heterogeneous Wireless Networks

The hybrid algorithm for real-time vertical handover using different objective functions has been presented to find the optimal network to connect with a good quality of service in accordance with the user’s preferences. Markov processes are widely used in performance modelling of wireless and mobile communication systems. We address the problem of optimal wireless network selection during vertical handover, based on the received information, by embedding the decision problem in a Markov decision process (MDP) with genetic algorithm (GA), we use GA to find a set of optimal decisions that ensures the best trade-off between QoS based on their priority level. Then, we emerge improved genetic algorithm (IGA) with simulated annealing (SA) as leading methods for search and optimization problems in heterogeneous wireless networks. We formulate the vertical handoff decision problem as a MDP, with the objectives of maximizing the expected total reward and minimizing average number of handoffs. A reward function is constructed to assess the QoS during each connection, and the AHP method are applied in an iterative way, by which we can work out a stationary deterministic handoff decision policy. As it is, the characteristics of the current mobile devices recommend using fast and efficient algorithms to provide solutions near to real-time. These constraints have moved us to develop intelligent algorithm that avoid the slow and massive computations. This paper compares the formulation and results of five recent optimization algorithms: artificial bee colony, GA, differential evolution, particle swarm optimization and hybrid of (GA–SA). Simulation results indicated that choosing the SA rules would minimize the cost function, and also that, the IGA–SA algorithm could decrease the number of unnecessary handovers, and thereby prevent the ‘Ping-Pong’ effect.     

EMI Shielding Characteristics of Electrically Conductive Polymer Blends of PS/PANI in Microwave and IR Region

Conductive polymeric blends (CPBs) of polystyrene and polyaniline (PS/PANI) were prepared by solution casting method in various compositions. Film thickness of CPBs was achieved?～?250 micron. PS/PANI blend films were analyzed for electromagnetic interference (EMI) shielding characteristics in microwave and near-infrared (NIR) regions. PS/PANI blends showed remarkable features. Most mobile telecommunications use GHz frequency range and shielding effectiveness was observed in 9 GHz to 18 GHz. In 9 GHz to 18 GHz frequency range, 45 dB shielding effectiveness was measured. CPBs were also analyzed in the NIR region and showed transmittance of <1%. Microwaves and NIR radiation are the most abundant in the environment and cause damage to human health. Both types of radiation causes serious damage to electronic devices as well.

     

Discrete-time chaotic-map truly random number generators: design, implementation, and variability analysis of the zigzag map

In this paper, we introduce a novel discrete chaotic map named zigzag map that demonstrates excellent chaotic behaviors and can be utilized in truly random number generators (TRNGs). We comprehensively investigate the map and explore its critical chaotic characteristics and parameters. We further present two circuit implementations for the zigzag map based on the switched current technique as well as the current-mode affine interpolation of the breakpoints. In practice, implementation variations can deteriorate the quality of the output sequence as a result of variation of the chaotic map parameters. In order to quantify the impact of variations on the map performance, we model the variations using a combination of theoretical analysis and Monte-Carlo simulations on the circuits. We demonstrate that even in the presence of the map variations, a TRNG based on the zigzag map passes all of the NIST 800-22 statistical randomness tests using simple post processing of the output data.     

An Improvement Energy Consumption Policy Using Communication Reduction in Wireless Body Sensor Network

Dedicated short-range communications (DSRC) is an important wireless technology for current and future automotive safety and mitigation of traffic jams. In this work, we have designed a Coplanar waveguide microstrip patch antenna with linear, upper and bottom and side slots for application in DSRC. The patch antenna was designed using glass epoxy substrate (FR4). Various parametric analyses such as the current distribution, reflection coefficient, radiation pattern on E- and H-plane as well as the realized gain (dB) were performed. The results were obtained by simulation using high-frequency structure simulator tool. The proposed antenna covers a frequency band of 5.8–5.9 GHz which is highly dedicated to the DSRC wireless communication technology for enhancement of safety of the automotive transport system. The designed antenna shows a good return loss of ??19 dB at 5.9 GHz.The designed antenna shows a promising gain, return loss and radiation pattern for use in DSRC for automotive transport systems.

     

Unital Design Based Location Service for Subterranean Network Using Long Range Topology

Wireless Personal Communications - Wireless Underground Networks comprise the ability to constantly monitor several physical parameters such as ground temperature, water level and soil condition,...     

Cooperative caching for content dissemination in vehicular networks

The explosive growth of mobile data traffic has made cellular operators to seek low‐cost alternatives for cellular traffic off‐loading. In this paper, we consider a content delivery network where a vehicular communication network composed of roadside units (RSUs) is integrated into a cellular network to serve as an off‐loading platform. Each RSU subjecting to its storage capacity caches a subset of the contents of the central content server. Allocating the suitable subset of contents in each RSU cache such that maximizes the hit ratio of vehicles requests is a problem of paramount value that is targeted in this study. First, we propose a centralized solution in which, we model the cache content placement problem as a submodular maximization problem and show that it is NP‐hard. Second, we propose a distributed cooperative caching scheme, in which RSUs in an area periodically share information about their contents locally and thus update their cache. To this end, we model the distributed caching problem as a strategic resource allocation game that achieves at least 50% of the optimal solution. Finally, we evaluate our scheme using simulation for urban mobility simulator under realistic conditions. On average, the results show an improvement of 8% in the hit ratio of the proposed method compared with other well‐known cache content placement approaches.     

New windowing techniques for variable-size block motioncompensation

The conventional overlapped block motion compensation (OBMC) technique, although effective in reducing the blocking effect for fixed-size partitioned frames, cannot be readily used for a frame partitioned region-wise or using variable-size blocks. The generalised OBMC (GOBMC) method, even though generally applicable, is not very effective in reducing the blocking effect and prediction error. Two windowing techniques are presented to reduce the blocking effect for a frame partitioned region-wise or using variable-size blocks. In the first technique, a virtual re-partitioning operation is employed, which maps a partitioned frame into its corresponding fully partitioned frame at the bottom level of the quadtree so that each resulting block has eight neighbouring blocks. In the second technique, the virtual re-partitioning operation for a given block (region) is carried out adaptively and performed locally; however, blocks (regions) need not always be virtually partitioned to the bottom level. Compared to the GOBMC method, the proposed techniques make use of more pixels in the close vicinity of boundaries of the regions in the windowing operation. Simulation results are included of applying the proposed techniques on a number of MPEG video sequences. These results indicate that the proposed techniques are superior to the GOBMC method in terms of reducing the prediction error as well as the blocking effect