Sharif Digital Repository

In recent years, flash memory solid state disks (SSDs) have shown a great potential to change storage infrastructure because of its advantages of high speed and high throughput random access. This promising storage, however, greatly suffers from performance loss because of frequent ''erase-before-write'' and ''garbage collection'' operations. Thus, novel circuit-level, architectural, and algorithmic techniques are currently explored to address these limitations. In parallel with others, current study investigates replacing shared buses in multi-channel architecture of SSDs with an interconnection network to achieve scalable, high throughput, and reliable SSD storage systems. Roughly... 

In this study, an efficient handover algorithm based on the received signal strength (RSS) prediction is presented for two-tier macro-femtocell networks in which, because of the fading effects of channel and short coverage range of femtocells, ping-pong handovers may take place. In the proposed approach, first each mobile station (MS) uses the recursive least square algorithm for predicting the RSS from the candidate base stations (BSs) including both femtocell and macrocell BSs. Then, according to the predicted RSS values, several future values of signal-to-interference plus noise ratio (SINR) are calculated. Afterwards, the candidate list of BSs is pruned according to the estimated future... 

We consider the effect of caching in wireless networks where fading is the dominant channel effect. First, we propose a one-hop transmission strategy for cache-enabled wireless networks, which is based on exploiting multi-user diversity gain. Then, we derive a closed-form result for throughput scaling of the proposed scheme in large networks, which reveals the inherent trade-off between cache memory size and network throughput. Our results show that substantial throughput improvements are achievable in networks with sources equipped with large cache size. We also verify our analytical result through simulations  

Many applications in wireless networks impose locally distributed traffic on the network. We consider the effect of traffic localization on throughput of large wireless networks in the scaling sense. We show that by careful exploitation of traffic localization, one can enhance the throughput of various schemes in wireless networks. Also, the important case of Small World traffic distribution in wireless networks is addressed. In this type of traffic, in addition to the local traffic, a non-negligible amount of global traffic should be handled by the network. It is shown that a non-negligible amount of network-wide traffic can be tolerated by network without any performance degradation in the... 

We propose a novel cooperative transmission scheme called Convolutional Network-Coded Cooperation (CNCC) for a network including N sources, one M-antenna relay, and one common destination. The source-relay (S-R) channels are assumed to be Nakagami-m fading, while the source-destination (S-D) and the relay-destination (R-D) channels are considered Rayleigh fading. The CNCC scheme exploits the generator matrix of a good (N + M', N,v) systematic convolutional code, with the free distance of dfree designed over GF(2), as the network coding matrix which is run by the network's nodes, such that the systematic symbols are directly transmitted from the sources, and the parity symbols are sent by the... 

This paper presents an analytical study of the stable throughput for multiple broadcast sessions in a multi-hop wireless tandem network with random access. Intermediate nodes leverage on the broadcast nature of wireless medium access to perform inter-session network coding among different flows. This problem is challenging due to the interaction among nodes, and has been addressed so far only in the saturated mode where all nodes always have packet to send, which results in infinite packet delay. In this paper, we provide a novel model based on multi-class queueing networks to investigate the problem in unsaturated mode. We devise a theoretical framework for computing maximum stable... 

We study the trade-off between throughput and memory footprint of embedded software that is synthesized from acyclic static dataflow (task graph) specifications targeting distributed memory multiprocessors. We identify iteration overlapping as a knob in the synthesis process by which one can trade application throughput for its memory requirement. Given an initial processor assignment and non-overlapped task schedule, we formally present underlying properties of the problem, such as constraints on a valid iteration overlapping, maximum possible throughput, and minimum memory footprint. Moreover, we develop an effective algorithm for generation of a rich set of design points that provide a... 

In this paper, we study the impact of sensing error and channel fading on the decision process of a multiple secondary user network in a primary network whose channel occupancy states are modelled as a Bernoulli process. We present a randomized access strategy to maximize total secondary network throughput. The proposed method guarantees that the probability of collision between primary and secondary users in each channel is less than the predefined value of P c = ξ. To find the optimal access strategy, we formulate secondary network throughput as an optimization problem. Then, using the KKT method to find the solution, we break the original problem into multiple sub-problems. Then, we... 

Interference control is one of the fundamental challenges in resource allocation of femtocell networks that use orthogonal frequency-division multiple access (OFDMA). In this paper, a method is proposed that reduces the interference between femtocells. This method is implemented by the femtocells in a self organizing manner and increases frequency reuse factor. Thus, the network throughput will increase and the fairness between femtocells remains reasonable we also propose a mechanism that can be applied increase the frequency resources assigned to each femtocell. These new frequencies can be used when femtocells require more frequency resources to carry higher traffic loads. Results of... 

Exponential backoff is an intrinsic feature of MAC-layer standards of most types of ad hoc networks. It leads to random access channels with memory. In this paper we propose a new network coding-based packet forwarding scheme suitable for multiple unicast scenarios in downlink direction of a wireless network. The wireless nodes as well as the access point attempt to access the channel, based on slotted Aloha with exponential backoff. In the proposed scheme we convert multiple unicast scenario to a combination of several anycast and a multicast scenarios. By proposing an open multiclass queueing network, we are able to derive the maximum stable download throughput of the network. The... 

A novel high-throughput device based on 96-micro-solid phase extraction (96-μ-SPE) system was constructed for multiresidue determination of nine pesticides in aquatic samples. The extraction procedure was performed on a commercially available 96-well plate system. The extraction module consisted of 96 pieces of 1cm×3cm of cylindrically shaped stainless steel meshes. The prepared meshes were fixed in a home-made polytetrafluoroethylene-based constructed ninety-six holes block for possible simultaneous immersion of meshes into the center of individual wells. Dodecyl methacrylate and ethylene glycol dimethacrylate was copolymerized as a monolithic polymer and placed in the cylindrically shaped... 

In this study, the average throughput maximisation of a secondary user (SU) by optimising its spectrum sensing time is formulated, assuming that a priori knowledge of the presence and absence probabilities of the primary users (PUs) is available. The energy consumed to find a transmission opportunity is evaluated, and a discussion on the impacts of the number of PUs on SU throughput and consumed energy are presented. To avoid the challenges associated with the analytical method, as a second solution, a systematic adaptive neural network-based sensing time optimisation approach is also proposed. The proposed scheme is able to find the optimum value of the channel sensing time without any... 

Multivariate curve resolution-particle swarm optimization (MCR-PSO) algorithm is proposed to exploit pure chromatographic and spectroscopic information from multi-component hyphenated chromatographic signals. This new MCR method is based on rotation of mathematically unique PCA solutions into the chemically meaningful MCR solutions. To obtain a proper rotation matrix, an objective function based on non-fulfillment of constraints is defined and is optimized using particle swarm optimization (PSO) algorithm. Initial values of rotation matrix are calculated using local rank analysis and heuristic evolving latent projection (HELP) method. The ability of MCR-PSO in resolving the chromatographic... 

Effective spectrum sensing strategies enable cognitive radios (CRs) to identify and opportunistically transmit on under-utilized spectral resources. In this paper, sequential channel sensing problems for single and multiple secondary users (SUs) networks are effectively modeled through finite state Markovian processes. More specifically, a model for single user case is introduced and its performance is validated through analytical analysis. Then, in order to address multiple SUs case, this model is extended to include the modified p-persistent access (MPPA) protocol. Since the scheme utilized experiences a high level of collision among the SUs, to mitigate the problem appropriately,... 

In recent years, flash memory olid state disks (SSDs) have shown a great potential to change storage infrastructure because of its advantages of high speed and high throughput random access. This promising storage, however, greatly suffers from performance loss because of frequent ''erase-before-write'' and ''garbage collection'' operations. Thus, novel circuit-level, architectural, and algorithmic techniques are currently explored to address these limitations. In parallel with others, current study investigates replacing shared buses in multi-channel architecture of SSDs with an interconnection network to achieve scalable, high throughput, and reliable SSD storage systems. Roughly speaking,... 

High throughput AES encryption/decryption is a necessity for many of modern embedded systems. This article presents a high performance yet cost efficient AES system. Maestro can be used in a wide range of embedded applications with various requirements and limitations. Maestro is about one million times faster than the pure software implementation. The Maestro architecture is composed of two major components; the soft processor aimed at system initialization and control, and the hardware AES engine for high performance AES encryption/decryption. A ten stage implicit pipelined architecture is considered for the AES engine. Two novel techniques are proposed in design of AES engine which enable... 

This paper presents the first silicon-proven implementation of a lattice reduction (LR) algorithm, which achieves maximum likelihood diversity. The implementation is based on a novel hardware-optimized due to the Lenstra, Lenstra, and Lovász (LLL) algorithm, which significantly reduces its complexity by replacing all the computationally intensive LLL operations (multiplication, division, and square root) with low-complexity additions and comparisons. The proposed VLSI design utilizes a pipelined architecture that produces an LR-reduced matrix set every 40 cycles, which is a 60% reduction compared to current state-of-the-art LR field-programmable gate array implementations. The 0.13-μm CMOS... 

Powerful spectrum sensing schemes enable cognitive radios (CRs) to find transmission opportunities in spectral resources allocated exclusively to primary users. In this paper, the problem of maximizing the average throughput of a cognitive radio system through optimizing its spectrum sensing time is investigated, and a systematic neural network-based optimization approach is proposed which avoids challenges associated with the conventional analytical solutions. The proposed method exploits a novel learning and optimization cycle to enable an effective cooperation between two kinds of well-known artificial neural networks and finds the optimum value of the channel sensing time without any... 

Designing proper spectrum decision schemes for cognitive radios (CRs) improves spectral usage efficiency as well as CR network throughput. One of the key effecting factors of the CR network throughput is the spectrum sensing sequences of the secondary users (SUs). In this paper, the SUs throughput maximization through appropriately selecting the sensing sequences of the SUs, called sensing matrix (SM), is investigated. More specifically, first the average throughput of the CR network is evaluated for a given SM in the case of error-free channel sensing. Then, an optimization problem is formulated with the aim to maximize the network throughput by finding the optimal SM. In order to avoid... 

In this paper, we focus on a cognitive network scenario, comprised of a WLAN overlaid on a network with time-scheduled primary users. WiMAX is an example of such primary networks. For time-scheduled primary users simple On-Off traffic model with exponential durations is not valid anymore. In this scenario, the cognitive nodes (CNs) hear downlink map (DL-MAP) and thus, know the frequency and time locations of all allocated slots at each frame. Then, cognitive nodes contend with each other in order to transmit their fixed size packets based on IEEE 802.11 MAC protocol. Since the number of empty slots at each frame is variable each packet transmission in cognitive network prolongs a random...