Design of Concentric Circular Antenna Array with Central Element Feeding Using Particle Swarm Optimization with Constriction Factor and Inertia Weight Approach and Evolutionary Programing Technique

In this paper the maximum sidelobe level (SLL) reductions without and with central element feeding in various designs of three-ring concentric circular antenna arrays (CCAA) are examined using a real-coded Evolutionary Programming (EP) to finally determine the global optimal three-ring CCAA design. Standard real-coded Particle Swarm Optimization (PSO) and real-coded Particle Swarm Optimization with Constriction Factor and Inertia Weight Approach (PSOCFIWA) are also employed for comparative optimization but both prove to be suboptimal. This paper assumes non-uniform excitation weights and uniform spacing of excitation elements in each three-ring CCAA design. Among the various CCAA designs, the design containing central element and 4, 6 and 8 elements in three successive concentric rings proves to be such global optimal design set with global minimum SLL (−39.66 dB) as determined by Evolutionary Programming.     

Broadband DOA estimation using “Spatial-Only” modelingof array data

Most of the existing techniques for DOA estimation of broadband sources use both spatial and temporal modeling. This may lead to increased complexity besides a large algorithmic delay. We propose a technique that employs only spatial information in the form of a single spatial array covariance matrix. Assuming the source to have an ideal bandpass power spectral density, we formulate two subspace-based search functions for the estimation of the DOAs of broadband sources. One of these employs a multidimensional search in the parameter space, whereas the other requires a MUSIC like one-dimensional (1-D) search. The multidimensional cost function is shown to be consistent, yields performance close to the Cramer-Rao (CR) bound, and is insensitive to correlation between sources. Both the proposed methods are shown to be robust to deviations from the assumption of ideal bandpass power spectral density used in their formulation     

Q-MOHRA: QoS Assured Multi-objective Hybrid Routing Algorithm for Heterogeneous WSN

Quality of Service (QoS) assurance in Wireless Sensor Network (WSN) is a tough task, and it is more exciting due to the scarcity of resources. The requirement of different WSN applications running over has different constraints. In QoS, routing protocol the network has to balance the traffic. This paper presents a novel heuristic routing algorithm known as QoS assured Multi-objective Hybrid Routing Algorithm (Q-MOHRA) for Heterogeneous WSN. Q-MOHRA takes into account the link (energy, hop count, link quality indicator etc.) and path (jitter) metrics for optimal path selection. The performance of Q-MOHRA is evaluated through intensive simulation and equated with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-objective Routing Algorithm (DyMORA). The metrics such as average energy consumption, residual energy, packet delivery ratio, jitter, and normalized routing load are used for comparison. The performance of Q-MOHRA has been observed to outclass SHRP and DyMORA. It improves the packet delivery ratio by 24.31% as compared to SHRP and 11.86% as compared to DyMORA. Q-MOHRA outperforms DyMORA in terms of average energy consumption by a factor of 8.27%.     

One-, two-, and three-photon pumped lasing in a novel liquid dye salt system

We report the observation of one-, two-, and three-photon pumped lasing in the same medium, a novel liquid dye salt system when excited by pulsed 0.532-, 1.06-, and /spl sim/1.49-/spl mu/m coherent radiation pulses, respectively. Since the gain medium is a liquid and not a solution, it contains a significantly higher effective dye concentration and, therefore, is highly suitable for multiphoton pumped lasing and optical power limiting applications. The lasing spectra, temporal waveforms, near- and far-field intensity distributions, and output/input efficiency were measured under the conditions of one-, two-, and three-photon pump configurations.     

Maximum Lifetime Routing Problem in Duty-Cycling Sensor Networks

In order to extend the lifetime of a wireless sensor network, the energy consumption of individual sensor nodes need to be minimized. This can be achieved by minimizing the idle listening time with duty cycling mechanism and/or minimizing the number of communications per node. The nodes will have different relay loads for different routing strategies: therefore, the routing problem is important factor in minimization of the number of communications per node. In this paper, we investigate achievable network lifetime with a routing mechanism on top of an existing duty-cycling scheme. To this end, we formulated the routing problem for duty-cycling sensor network as a linear programming problem with the objective of maximizing the network lifetime. Using the developed linear programming formulation, we investigate the relationship between network lifetime and duty-cycling parameter for different data generation rates and determine the minimum duty-cycling parameter that meets the application requirements. To the best of our knowledge, this is the first mathematical programming formulation which addresses the maximum lifetime routing problem in duty-cycling sensor network. In order to illustrate the application of the analytical model, we solved the problem for different parameter settings.     

Floating Point CGRA based Ultra-Low Power DSP Accelerator

Journal of Signal Processing Systems - Coarse Grained Reconfigurable Arrays (CGRAs) are emerging as energy efficient accelerators providing a high grade of flexibility in both academia and...     

Enumeration of multiprocessing events and reliability computation of a multiprocessor system

In order to execute a task, a valid multiprocessor should have at least two good processors, one memory module and a perfect interconnection between them. In this paper a systematic procedure is given to compute the reliability of a multiprocessor system by generating explicitly all the possible multiprocessing events from the connection matrix of the system. Three types of interconnection network are considered between the processors and the shared memory. These are multiple-bus, crossbar and multiport memories. The algorithms presented for the enumeration of events can easily be implemented on the computer. Manual computation is also easy.     

C5: A Step Towards Smart World with Enhanced Holistic Wellbeing

Wireless Personal Communications - Internet of things (IoTs) has been the smartest technology proven worldwide these days. The application products of IoTs are Mobile ad hoc network (MANET) and...     

Toward Stable Cycling of a Cost-Effective Cation-Disordered Rocksalt Cathode via Fluorination

The recently developed Li-excess cation-disordered rock salts (DRXs) exhibit an excellent chemical diversity for the development of alternative Co/Ni-free high-energy cathodes. Herein, the synthesis of a highly fluorinated DRX cathode, Li_1.2Mn_0.6Ti_0.2O_1.8F_0.2, based on cost-effective and earth-abundant transition metals, via a solid-state reaction, is reported. The fluorinated DRX cathode using ammonium fluoride precursor exhibits more uniform particle size and delivers a specific discharge capacity of 233 mAh g⁻¹ and specific energy of 754 Wh kg⁻¹, with 206 mAh g⁻¹ retained after 200 cycles. The combined synchrotron X-ray absorption spectroscopy and resonant inelastic X-ray scattering spectroscopy analysis reveals that the remarkable cycling performance is attributed to the high fluorination and thus enhanced Mn content, enabling the utilization of more Mn redox than the oxide analog. This study demonstrates a great promise to develop next-generation cost-effective DRX cathodes with enhanced capacity retention for high-energy Li-ion batteries.     

Benefits of the use of impairment constraint routing in optical networks

In transparent optical networks, the optical signal accumulates the effects of all physical impairments present along the path it traverses. The conventional selection of signal paths based on e.g. shortest path routing without considering the signal quality and its association with the physical impairments does not always provide the optimum solution in terms of network performance such as blocking and resource utilization. This paper proposes an impairment constraint based routing algorithm to achieve an optimal combination of physical and networking performance taking into account all physical linear impairments including noise, chromatic and polarization mode dispersion, crosstalk and filter concatenation effects in an integrated approach. The performance of a typical metropolitan area network is examined and the improvement achieved when using the proposed approach compared to the conventional shortest path routing is demonstrated.