End-to-End BER Analysis of Space Shift Keying in Decode-and-Forward Cooperative Relaying

Space shift keying (SSK) is a special case of spatial modulation (SM), which is a relatively new modulation technique that is getting recognized to be attractive in multi-antenna communications. Our new contribution in this paper is an analytical derivation of exact closed-form expression for the end-to-end bit error rate (BER) performance of SSK in decode-and-forward (1)1,) cooperative relaying. An incremental relaying (IR) scheme with selection combining (SC) at the destination is considered. In SSK, since the information is carried by the transmit antenna index, traditional selection combining methods based on instantaneous SNRs can not be directly used. To overcome this problem, we propose to do selection between direct and relayed paths based on the Euclidean distance between columns of the channel matrix. With this selection metric, an exact analytical expression for the end-to-end BER is derived in closed-form. Analytical results are shown to match with simulation results.

BER Analysis of Space Shift Keying in Cooperative Multi-hop Multi-branch DF Relaying

Space shift keying (SSK) is an attractive modulation technique for multi-antenna communications. In SSK, only one among the available transmit antennas is activated during one channel use, and the index of the chosen transmit antenna conveys information. In this paper, we analyze the performance of SSK in multi-hop, multi-branch cooperative relaying systems. We consider the decode-and-forward relaying protocol, where a relay forwards the decoded symbol if it decodes the symbol correctly from the received signal. We derive closed-form expressions for the end-to-end bit error rate of SSK in this system. Analytical and simulation results match very well.

Cooperative Communication of UAV to Perform Multi-task Using Nature Inspired Techniques

In this paper, the approach for assigning cooperative communication of Uninhabited Aerial Vehicles (UAV) to perform multiple tasks on multiple targets is posed as a combinatorial optimization problem. The multiple task such as classification, attack and verification of target using UAV is employed using nature inspired techniques such as Artificial Immune System (AIS), Particle Swarm Optimization (PSO) and Virtual Bee Algorithm (VBA). The nature inspired techniques have an advantage over classical combinatorial optimization methods like prohibitive computational complexity to solve this NP-hard problem. Using the algorithms we find the best sequence in which to attack and destroy the targets while minimizing the total distance traveled or the maximum distance traveled by an UAV. The performance analysis of the UAV to classify, attack and verify the target is evaluated using AIS, PSO and VBA.

Performance Analysis of a Cooperative MAC Protocol of Wireless Ad Hoc Networks

Different medium access control (MAC) layer protocols, for example, IEEE 802.11 series and others are used in wireless local area networks. They have limitation in handling bulk data transfer applications, like video-on-demand, videoconference, etc. To avoid this problem a cooperative MAC protocol environment has been introduced, which enables the MAC protocol of a node to use its nearby nodes MAC protocol as and when required. We have found on various occasions that specified cooperative MAC establishes cooperative transmissions to send the specified data to the destination. In this paper we propose cooperative MAC priority (CoopMACPri) protocol which exploits the advantages of priority value given by the upper layers for selection of different paths to nodes running heterogeneous applications in a wireless ad hoc network environment. The CoopMACPri protocol improves the system throughput and minimizes energy consumption. Using a Markov chain model, we developed a model to analyse the performance of CoopMACPri protocol; and also derived closed-form expression of saturated system throughput and energy consumption. Performance evaluations validate the accuracy of the theoretical analysis, and also show that the performance of CoopMACPri protocol varies with the number of nodes. We observed that the simulation results and analysis reflects the effectiveness of the proposed protocol as per the specifications.

Energy-efficient, delay-constrained, QoS-aware broadcast for cooperative wireless sensor networks

The problem of delay-constrained, energy-efficient broadcast in cooperative wireless networks is NP-complete. While centralised setting allows some heuristic solutions, designing heuristics in distributed implementation poses significant challenges. This is more so in wireless sensor networks (WSNs) where nodes are deployed randomly and topology changes dynamically due to node failure/join and environment conditions. This paper demonstrates that careful design of network infrastructure can achieve guaranteed delay bounds and energy-efficiency, and even meet quality of service requirements during broadcast. The paper makes three prime contributions. First, we present an optimal lower bound on energy consumption for broadcast that is tighter than what has been previously proposed. Next, iSteiner, a lightweight, distributed and deterministic algorithm for creation of network infrastructure is discussed. iPercolate is the algorithm that exploits this structure to cooperatively broadcast information with guaranteed delivery and delay bounds, while allowing real-time traffic to pass undisturbed.

Secure Transmission in Cooperative Networks with Weak Eavesdroppers

In this letter, we propose a scheme to improve the secrecy rate of cooperative networks using Analog Network Coding (ANC). ANC mixes the signals in the air; the desired signal is then separated out, from the mixed signals, at the legitimate receiver using techniques like self interference subtraction and signal nulling, thereby achieving better secrecy rates. Assuming global channel state information, memoryless adversaries and the decode-and-forward strategy, we seek to maximize the average secrecy rate between the source and the destination, subject to an overall power budget. Then, exploiting the structure of the optimization problem, we compute its optimal solution. Finally, we use numerical evaluations to compare our scheme with the conventional approaches.

MIMO Decode-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming

In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers P-S and P-R, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.

MIMO Decode-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming

In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers P-S and P-R, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.

Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory

We propose a new approach to clustering. Our idea is to map cluster formation to coalition formation in cooperative games, and to use the Shapley value of the patterns to identify clusters and cluster representatives. We show that the underlying game is convex and this leads to an efficient biobjective clustering algorithm that we call BiGC. The algorithm yields high-quality clustering with respect to average point-to-center distance (potential) as well as average intracluster point-to-point distance (scatter). We demonstrate the superiority of BiGC over state-of-the-art clustering algorithms (including the center based and the multiobjective techniques) through a detailed experimentation using standard cluster validity criteria on several benchmark data sets. We also show that BiGC satisfies key clustering properties such as order independence, scale invariance, and richness.

Crystal chemistry and photomechanical behavior of 3,4-dimethoxycinnamic acid: correlation between maximum yield in the solid-state topochemical reaction and cooperative molecular motion

A new monoclinic polymorph, form II (P2(1)/c, Z = 4), has been isolated for 3,4-dimethoxycinnamic acid (DMCA). Its solid-state 2 + 2 photoreaction to the corresponding alpha-truxillic acid is different from that of the first polymorph, the triclinic form I (P (1) over bar, Z = 4) that was reported in 1984. The crystal structures of the two forms are rather different. The two polymorphs also exhibit different photomechanical properties. Form I exhibits photosalient behavior but this effect is absent in form II. These properties can be explained on the basis of the crystal packing in the two forms. The nanoindentation technique is used to shed further insights into these structure-property relationships. A faster photoreaction in form I and a higher yield in form II are rationalized on the basis of the mechanical properties of the individual crystal forms. It is suggested that both Schmidt-type and Kaupp-type topochemistry are applicable for the solid-state trans-cinnamic acid photodimerization reaction. Form I of DMCA is more plastic and seems to react under Kaupp-type conditions with maximum molecular movements. Form II is more brittle, and its interlocked structure seems to favor Schmidt-type topochemistry with minimum molecular movement.

Short-Time Beta Relaxation in Glass-Forming Liquids Is Cooperative in Nature

Temporal relaxation of density fluctuations in supercooled liquids near the glass transition occurs in multiple steps. Using molecular dynamics simulations for three model glass-forming liquids, we show that the short-time beta relaxation is cooperative in nature. Using finite-size scaling analysis, we extract a growing length scale associated with beta relaxation from the observed dependence of the beta relaxation time on the system size. We find, in qualitative agreement with the prediction of the inhomogeneous mode coupling theory, that the temperature dependence of this length scale is the same as that of the length scale that describes the spatial heterogeneity of local dynamics in the long-time alpha-relaxation regime.

Biomass to liquid transportation fuel via Fischer Tropsch synthesis - Technology review and current scenario

Current global energy scenario and the environmental deterioration aspect motivates substituting fossil fuel with a renewable energy resource - especially transport fuel. This paper reviews the current status of trending biomass to liquid (BTL) conversion processes and focuses on the technological developments in Fischer Tropsch (FT) process. FT catalysts in use, and recent understanding of FT kinetics are explored. Liquid fuels produced via FT process from biomass derived syngas promises an attractive, clean, carbon neutral and sustainable energy source for the transportation sector. Performance of the FT process with various catalysts, operating conditions and its influence on the FT products are also presented. Experience from large scale commercial installations of FT plants, primarily utilizing coal based gasifiers, are discussed. Though biomass gasification plants exist for power generation via gas engines with power output of about 2 MWe; there are only a few equivalent sized FT plants for biomass derived syngas. This paper discusses the recent developments in conversion of biomass to liquid (BTL) transportation fuels via FT reaction and worldwide attempts to commercialize this process. All the data presented and analysed here have been consolidated from research experiences at laboratory scale as well as from industrial systems. Economic aspects of BTL are reviewed and compared. (C) 2015 Elsevier Ltd. All rights reserved.

A Research on New Method of Transportation Technics for Heavy Oil and Practice in Oil Field

介绍一种可应用于高粘度稠油管输的新工艺。即用自行研制的蒸汽引射器采用无界引射方式,将蒸汽直接注入到输油管道中,利用蒸汽释放的热量提高稠油温度降低粘度,从而达到降低稠油输送压降的目的,它比间接加热输送工艺所用的蒸汽量或耗煤量大大减少。方法在辽河油田输油管线上进行了工业现场试验,取得了很好的效果。

Experimental study and simulation principles of an oil-gas multiphase transportation system

Presented is an experimental study on the performance of an oil-gas multiphase transportation system, especially on the multiphase flow patterns, multiphase pumping and multiphase metering of the system. A dynamic simulation analysis is conducted to deduce simulation parameters of the system and similarity criteria under simplified conditions are obtained. The reliability and feasibility of two-phase flow experiment with oil and natural gas simulated by water and air are discussed by using the similarity criteria.