Performance analysis of an opportunistic multi‐user cognitive network with multiple primary users

Consider a multi‐user underlay cognitive network where multiple cognitive users concurrently share the spectrum with a primary network with multiple users. The channel between the secondary network is assumed to have independent but not identical Nakagami‐m fading. The interference channel between the secondary users (SUs) and the primary users is assumed to have Rayleigh fading. A power allocation based on the instantaneous channel state information is derived when a peak interference power constraint is imposed on the secondary network in addition to the limited peak transmit power of each SU. The uplink scenario is considered where a single SU is selected for transmission. This opportunistic selection depends on the transmission channel power gain and the interference channel power gain as well as the power allocation policy adopted at the users. Exact closed form expressions for the moment‐generating function, outage performance, symbol error rate performance, and the ergodic capacity are derived. Numerical results corroborate the derived analytical results. The performance is also studied in the asymptotic regimes, and the generalized diversity gain of this scheduling scheme is derived. It is shown that when the interference channel is deeply faded and the peak transmit power constraint is relaxed, the scheduling scheme achieves full diversity and that increasing the number of primary users does not impact the diversity order. Copyright © 2014 John Wiley & Sons, Ltd.     

Throughput performance of slotted DS/CDMA ALOHA with packetcombining over generalised fading channels

A time diversity automatic repeat-request (ARQ) scheme is investigated for a slotted narrowband DS/CDMA wireless data network over a Nakagami fading channel. Numerical results reveal that the proposed adaptive retransmission diversity with packet combining provides a considerable advantage over the conventional slotted DS/CDMA ALOHA at the expense of a slight increase in implementation complexity     

Antenna subset selection at multi‐antenna relay with adaptive modulation

In this paper, we proposed several antenna selection schemes for cooperative diversity systems with adaptive transmission. The proposed schemes were based on dual‐hop relaying where a relay with multiple‐antenna capabilities at reception and transmission is deployed between the source and the destination nodes. We analyzed the performance of the proposed schemes by quantifying the average spectral efficiency and the outage probability. We also investigated the trade‐off of performance and complexity by comparing the average number of active antennas, path estimations, and signal‐to‐noise ratio comparisons of the different proposed schemes. Copyright © 2011 John Wiley & Sons, Ltd.     

Efficient Broadcasting in Mobile Ad Hoc Networks

This paper presents two efficient flooding algorithms based on 1-hop neighbor information. In the first part of the paper, we consider sender-based flooding algorithms, specifically the algorithm proposed by Liu et al. In their paper, Liu et al. propose a sender-based flooding algorithm that can achieve local optimality by selecting the minimum number of forwarding nodes in the lowest computational time complexity O(n logn), where n is the number of neighbors. We show that this optimality only holds for a subclass of sender-based algorithms. We propose an efficient sender-based flooding algorithm based on 1-hop neighbor information that reduces the time complexity of computing forwarding nodes to O(n). In Liu's algorithm, n nodes are selected to forward the message in the worst case, whereas in our proposed algorithm, the number of forwarding nodes in the worst case is 11. In the second part of the paper we propose a simple and highly efficient receiver-based flooding algorithm. When nodes are uniformly distributed, we prove that the probability of two neighbor nodes broadcasting the same messageneighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases. The analytical results are confirmed using simulation.     

Side-Channel Information Characterisation Based on Cascade-Forward Back-Propagation Neural Network

Traditional cryptanalysis assumes that an adversary only has access to input and output pairs, but has no knowledge about internal states of the device. However, the advent of side-channel analysis showed that a cryptographic device can leak critical information. In this circumstance, Machine learning is known as a powerful and promising method of analysing of side-channel information. In this paper, an experimental investigation on a FPGA implementation of elliptic curve cryptography (ECC) was conducted to explore the efficiency of side-channel information characterisation based on machine learning techniques. In this work, machine learning is used in terms of principal component analysis (PCA) for the preprocessing stage and a Cascade-Forward Back-Propagation Neural Network (CFBP) as a multi-class classifier. The experimental results show that CFBP can be a promising approach in characterisation of side-channel information.     

Efficient Resource Management for Cloud-enabled Video Surveillance over Next Generation Network

The next generation video surveillance systems are expected to face challenges in providing computation support for an unprecedented amount of video streams from multiple video cameras in a timely and scalable fashion. Cloud computing offers huge computation resources for large-scale storage and processing on demand, which are deemed suitable for video surveillance tasks. Cloud also provides quality of service guaranteed hardware and software solutions with the virtual machine (VM) technology using a utility-like service costing model. In cloud-based video surveillance context, the resource requests to handle video surveillance tasks are translated in the form of VM resource requests, which in turn are mapped to VM resource allocation referring to physical server resources hosting the VMs. Due to the nature of video surveillance tasks, these requests are highly time-constrained, heterogeneous and dynamic in nature. Hence, it is very challenging to actually manage the cloud resources from the perspective of VM resource allocation given the stringent requirements of video surveillance tasks. This paper proposes a computation model to efficiently manage cloud resources for surveillance tasks allocation. The proposed model works on optimizing the trade-off between average service waiting time and long-term service cost, and shows that long-term service cost is inversely proportional to high and balanced utilization of cloud resources. Experiments show that our approach provides a near-optimal solution for cloud resource management when handling the heterogeneous and unpredictable video surveillance tasks dynamically over next generation network.     

Equal-gain diversity receiver performance in wireless channels

Performance analysis of equal-gain combining (EGC) diversity systems is notoriously difficult only more so given that the closed-form probability density function (PDF) of the EGC output is only available for dual-diversity combining in Rayleigh fading. A powerful frequency-domain approach is therefore developed in which the average error-rate integral is transformed into the frequency domain, using Parseval's theorem. Such a transformation eliminates the need for computing (or approximating) the EGC output PDF (which is unknown), but instead requires the knowledge of the corresponding characteristic function (which is readily available). The frequency-domain method also circumvents the need to perform multiple-fold convolution integral operations, usually encountered in the calculation of the PDF of the sum of the received signal amplitudes. We then derive integral expressions for the average symbol-error rate of an arbitrary two-dimensional signaling scheme, with EGC reception in Rayleigh, Rician, Nakagami-m (1960), and Nakagami-q fading channels. For practically important cases of second- and third-order diversity systems in Nakagami fading, both coherent and noncoherent detection methods for binary signaling are analyzed using the Appell hypergeometric function. A number of closed-form solutions are derived in which the results put forward by Zhang (see ibid., vol.45, p.270-73, 1997) are shown to be special cases.     

Ballot theorems applied to the transient analysis of nD/D/1 queues

The problem of transporting constant-bit-rate (CBR) traffic through a packet network is analyzed. In the system considered, CBR traffic is packetized and packets from several similar sources are multiplexed on a transmission link. The bit streams are recreated at the receiving end by demultiplexing the packets and then playing out the packets of each CBR stream. Traffic fluctuations may cause gaps to appear in the playout process. Their frequency can be reduced by adding a smoothing delay to each stream. The queueing system analyzed has periodic arrivals and deterministic service times. A method of analysis, based on the ballot theorems of Takacs (1967), is presented to provide steady-state delay distributions as well as a transient analysis of the system to predict the statistics of the time for a gap to develop in the CBR stream as a function of the smoothing delay     

Chlorosis in sugarcane: Associated soil properties,leaf mineral composition,and crop response to iron and manganese

Attempts were made to find out the nature and cause of a widespread sugarcane chlorosis in a cane growing area. Soils from chlorotic and nonchlorotic fields did not differ markedly in pH, CaCO₃, electrical conductivity, organic C, and soil test P, Zn, Cu, and Mn levels, but the chlorotic field soils had relatively more NH₄OAc-extractable K and less clay and DTPA-extractable Fe. Chlorotic and green leaf blades contained about the same concentration of P, S, Mg, Fe, Zn, Cu, and Mo, but the former leaf blades had more K and less Ca and HCl soluble Fe than the green ones. Green leaves of plants that seemed to have naturally recovered in chlorotic fields were higher in Mn. A foliage spray with 2.5% FeSO₄.7H₂O solution resulted in greening of leaves and a field experiment showed marked crop response to Fe and some response to Mn. The results thus suggest that the chlorosis is due to a lime-induced Fe-deficiency with the possibility of some role of Mn in Fe nutrition in calcareous soil conditions.Deceased 22 September 1988     

Integration of GIS and multicriteria decision analysis for urban aquaculture development in Bangladesh

Site selection is a key factor in any aquaculture operation, affecting both success and sustainability as well as solving land or water use conflicts. This study was conducted to identify suitable sites for carp farming development in urban water bodies (UWBs) of Chittagong, Bangladesh using Geographical Information Systems (GIS) based MultiCriteria Evaluation (MCE) of water, soil and infrastructure database. ASTER imagery and 14 thematic layers were analyzed with ENVI and GIS capabilities, and developed a series of GIS models to identify and prioritize the appropriate UWBs for carp farming. The study identified 487 UWBs occupying 362 ha and revealed 280 ha (77%) is the most suitable, 36 ha (10%) is moderately suitable and 46 ha (13%) is not suitable which was consistent with field verification. The results are encouraging for extension of carp culture and diversify the economic activities of the urban dwellers.