Analysis of Energy Efficiency and Area Throughput in Large Scale MIMO Systems with MRT and ZF Precoding

The large-scale multiple input multiple output (LS-MIMO) systems are equipped with a large number of antennas at the base station. These systems are capable of serving a larger number of user terminals, with massive gains in the form of energy and bandwidth efficiency. The energy efficiency of LS-MIMO system depends on the overall power consumption and data rate. In this paper, we have improved the energy efficiency of the LS-MIMO system by using maximum ratio transmission/combining and zero forced linear pre-coding schemes in single and multi-cell scenarios. We have jointly considered the uplink and downlink communications to propose an improved, more practical and more realistic power consumption model. The proposed model deliberates the power required for the power amplifier, linear processing and the circuit components at the base stations and user terminals. The outcome of this work provides a significant improvement in terms of energy efficiency and area throughput. The analytical results illustrate that the LS-MIMO systems achieve the maximum energy efficiency and area throughput wherein larger number of transmit antennas are installed at the base station to serve comparatively greater number of users terminals. The mathematical results depict the similar performance for imperfect channel state information in multi-cell setups. All aspects of power consumption during bidirectional communication are considered to provide precise results. Hence, the improvements in simulations results support the accuracy of the proposed model.     

Seamless vertical handoff using modified weed optimization algorithm for heterogeneous wireless networks

In the global scenario, a variety of wireless access networks are available. Different types of applications such as real time, nonreal time, and high bandwidth availability are used for heterogeneous wireless networks. Therefore, it is necessary for a service provider to make an appropriate connection support. For better performance, connections are to be exchanged among the different networks using seamless vertical handoff (VHO). The proposed algorithm shows the effect of optimization technique, which involves handoff decision process using vertical handoff triggering and selection of the network. The handoff triggering is initiated by using the received signal strength (RSS). In traditional method, handoff triggering is initiated by using RSS only. This method, modified weed optimization (M-WO) algorithm, reduces the unnecessary handoff by considering both RSS and velocity of the mobile node in handoff triggering. The parameters such as battery lifetime, handoff call dropping rate, load, dynamic weights adaptation and so on are to be considered individually or combined to make an effective network selection process. This paper highlights a novel effect ofM-WOalgorithm for decision making during the VHO. Our effort is to essentially optimize the system load, so that it reduces the handoff call dropping rate and the battery power consumption of the mobile node (MN). Weight of each QoS metrics is adjusted along with the networks changing conditions to trace the M-WO. Therefore, the novel VHO decision-making algorithm is superior to the existing SSF and OPTG methods. The simulation results show that the performance ofM-WOalgorithm is far better than SSF andOPTGmethods in terms of load, handoff call dropping rate and battery lifetime of MN.     

Reproducible Circularly Secure Bit Encryption: Applications and Realizations

We give generic constructions of several fundamental cryptographic primitives based on a new encryption primitive that combines circular security for bit encryption with the so-called reproducibility property (Bellare et al. in Public key cryptography—PKC 2003, vol. 2567, pp. 85–99, Springer, 2003). At the heart of our constructions is a novel technique which gives a way of de-randomizing reproducible public-key bit encryption schemes and also a way of reducing one-wayness conditions of a constructed trapdoor function family (TDF) to circular security of the base scheme. The main primitives that we build from our encryption primitive include k-wise one-way TDFs (Rosen and Segev in SIAM J Comput 39(7):3058–3088, 2010), chosen-ciphertext-attack-secure encryption and deterministic encryption. Our results demonstrate a new set of applications of circularly secure encryption beyond fully homomorphic encryption and symbolic soundness. Finally, we show the plausibility of our assumptions by showing that the decisional Diffie–Hellman-based circularly secure scheme of Boneh et al. (Advances in cryptology—CRYPTO 2008, vol. 5157, Springer, 2008) and the subgroup indistinguishability-based scheme of Brakerski and Goldwasser (Advances in cryptology—CRYPTO 2010, vol. 6223, pp. 1–20, Springer, 2010) are both reproducible.     

OVSF Code Sharing and Reducing the Code Wastage Capacity in WCDMA

The non quantized nature of user rate wastes the code capacity in Orthogonal Variable Spreading Factor Codes (OVSF) based Code Division Multiple Access (CDMA) systems. The code sharing scheme in multi code CDMA is proposed to minimize the code rate wastage. The scheme combines the unused (wastage) capacity of already occupied codes to reduce the code blocking problem. Simulation results are presented to show the superiority of the proposed code assignment scheme as compared to existing schemes.

A Reliable Multicast Routing Protocol Based on Recovery Points and FEC in Mobile Ad-hoc Networks

Multicasting is an essential service for mobile ad-hoc networks. A major challenge for multicasting in mobile ad-hoc networks (MANETs) is the unstable forwarding path. This work presents a reliable multicasting protocol for mobile ad-hoc networks. A virtual backbone is used as a shared structure for multiple sessions. A lost packet recovery scheme is developed for reliable packet transmission, called the Recovery Point (RP) scheme. The RP scheme maintains the data packets received from the source for recovering lost packets for its downstream RPs. In addition, we combine the Forward Error Correction (FEC) technology with our RP scheme to enhance the reliability of our RP scheme. A mergence scheme for RP is also proposed to avoid excessive control overhead. Our RP and FEC based scheme can be used to improve the reliability and efficiency of the traditional non-acknowledged multicasting approach. Experiments were conducted to evaluate the proposed multicasting scheme. The results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio and multicast efficiency. Furthermore, the simulation results also demonstrate that our approach is stable in networks with high mobility.

Eigentargets Versus Kernel Eigentargets: Detection of Infrared Point Targets Using Linear and Nonlinear Subspace Algorithms

The Eigentargets method, based on the linear principal component analysis (LPCA), has been used successfully to detect infrared point targets. LPCA is based only on the second-order correlations without taking higher-order statistics into account. That results in the limitation of Eigentargets in target detection. This paper extends Eigentargets, a linear subspace method, to kernel Eigentargets, a detection method based on a nonlinear subspace algorithm. Because the kernel Eigentargets is capable of capturing the part of higher-order statistics, the better detection performance can be achieved. Moreover, the Gaussian intensity model is modified to generate training samples of infrared point targets.     

A New Modulation for Intrinsically Secure Radio Channel in Wireless Systems

One of the biggest challenges in RFID (radio frequency identification) large scale deployment, such as in warehouse RFID deployment, is the positioning of RFID reader antennas to efficiently locate all the tagged objects distributed at RFID reader environment. This paper has investigated a novel location sensing system based on geometric grid covering algorithm that can use any passive or active RFID standard for positioning or tracking objects inside buildings. This study involves design of RFID reader antenna network which focuses on placing the reader antennas on a grid to cover all the tags distributed at two dimensional planes and position calculation using statistical averages algorithm. The statistical averages algorithm simply computes the location coordinates of the tagged object by statistical average of the reader antenna’s location. The proposed grid of reader antennas can assist in minimizing the actual number of reader antennas required for RFID large scale deployment. The proposed prototype system is a simpler positioning system which presents the solution of placement pattern of RFID reader antennas, gives less complicated mathematical calculation, and is able to provide a high degree of accuracy. The obtained results show that the proposed location sensing system can achieve better positioning accuracy as compared to existing positioning system and in some cases accuracy improvement of about 50% can be reached.

Secure Communications System Through Concurrent AJ and LPD Evaluation

In this paper, a systematic approach and their corresponding metrics for concurrent anti-jamming (AJ) and low probability of detection (LPD) performance evaluations of a secure communications system are investigated. In general, it is necessary to deal simultaneously with adversary threats of both active jamming and passive detection for a secure communications system concern. For independent or concurrent AJ and LPD performance evaluations, a single varying paired and multiple paired fixed collocated jammers/interceptors scenario is explored with real sinc type (sin(x)/x) antenna patterns being considered for the communicators. The error probability with both AJ and LPD being considered simultaneously can be derived as system- and geometry-dependent factors and categorized as system metrics related to jammers, interceptors, and communicators themselves only. Whenever multiple collocated jammers/interceptors are considered, we can observe interesting “smoothed” effects for bit energy to jamming density ratio (E _b /J _o ), when one of these varying jammers/interceptors is approaching or receding. In addition, by means of these system metrics, it is intuitive and straightforward to enhance system performance for the victim or to deteriorate system performance for the adversary, respectively. Moreover, the proposed approach and metrics have also paved one practical way for the developments of the latest emphasized cognitive radio (CR) communications systems, if all the collocated jammers/interceptors on the proposed scenario are replaced with “cooperative” communicators.

低轨星座卫星通信系统中多业务条件下的非充分保证切换策略

该文提出了一种适用于低轨星座卫星通信系统多业务条件下的非充分保证切换策略。该策略在小于一个小区最大驻留时间的时间间隔内为到达小区的呼叫安排和预定信道,在呼叫结束环节作为补充策略对存在切换失败风险的信道进行调整。提出了策略在多业务条件下具体的实施方法,根据实时的切换呼叫性能调整策略的非充分程度。通过仿真,分析比较了不同程度非充分保证切换策略的QoS性能,验证了动态自适应调整非充分程度值的IGH策略的有效性。仿真结果表明,相对于保证切换策略,新策略以存在微小切换失败概率为代价,换取了新呼叫阻塞概率的显著降低,是一种适用于多业务低轨卫星通信系统的信道分配策略。