Sharif Digital Repository

In this paper, a chaos-based communication system in the presence of unknown transmission delay is studied. First, under master/slave configurations, two chaotic Chen systems as the slaves are synchronized with a master one via unidirectional coupling. Then at the transmitter, information of an image is embedded within a slave-one signal and the resultant signal along with another one which is used to determine the transmission delay is transmitted to the receiver. At the receiver, using the received signals and the slave-two counterpart signal, the image is recovered. The performance of the proposed method is experimentally illustrated  

We consider a cooperative wireless communication network comprising two full-duplex (FD) nodes transmitting to a common destination based on slotted Aloha protocol. Each node has exogenous arrivals and also may relay some of the unsuccessfully transmitted packets of the other node. In this article, we find the optimal static policies of nodes in order to minimize the sum of the average transmission delays, while the average transmission delay of each node is constrained. The static policy of each node specifies the probability of accepting an unsuccessfully transmitted packet of the other node and how the node prioritizes its transmissions. We show that in the optimal policies, just the node... 

Flooding algorithm is one of the most significant algorithms used in sensor networks. Although simple, this algorithm causes a large amount of energy and bandwidth to be wasted. The most important application of flooding is RREQ flooding in initial step of most routing algorithms. Although simple, this algorithm causes a large amount of energy and bandwidth to be wasted. Most previous efficient flooding algorithms use location information which is impossible for simple node in sensor network. Some others are not suitable for RREQ flooding due to eliminating redundant retransmissions. We present a modified flooding that simultaneously decreases energy consumption as well as network delay.... 

In this letter, we consider a cache-enabled cloud radio access network with single-antenna base stations and single-antenna mobile users. Each base station can access the central processor of the network via a separate backhaul link with limited capacity. We utilize the interference alignment scheme as the transmission strategy between base stations and users. By assuming a block transmission scheme, we define a related data transmission delay. We derive the transmission delay and network power consumption. At last, we solve the problem of joint optimization of data transmission delay and network power consumption using DC programming algorithm. In our numerical results, we investigate the... 

We consider a slotted Aloha-based wireless communication network comprising a source and an active relay, both transmitting to a common destination. The relay node is able to relay the unsuccessfully transmitted packets of the source node, if it can detect them. We find the analytical closed form optimal static relaying policy in order to minimize the average transmission delay (ATD) of source packets, while ATD of its own packets is constrained. A static relaying policy is determined by acceptance and relaying probabilities of the relay node. According to acceptance probability, the relay node decides whether to accept an unsuccessfully transmitted packet from source or not, while the... 

In this paper, we show how time-sharing method may reduce transmission delay in the dynamic index coding scenario. We propose a novel time-shared dynamic index coding transmission scheme that achieves the maximum index coding gain for a complete bi-directional side information graph and formulate a constrained optimization problem to tune the transmission scheme for the minimum transmission delay. A closed-form solution is presented for the special case of two-user. We also use analytical and simulation results to provide graphical intuition for the obtained results  

The rapid developments in wireless communications have introduced the vehicular ad hoc networks as an efficient tool to improve the safety of traffic through Dedicated Short Range Communications systems on highways. This paper addresses the broadcast mode of the 802.11p protocol and it quantitatively analyzes the impact of the highway vehicular traffic on its performance in terms of the packet delivery ratio and the packet transmission delay. To this aim, we propose to consider the number of the contending vehicles as a traffic-dependent stochastic counting process, which can be computed by analyzing the inter-vehicle spacing distribution in different traffic conditions. Based on the... 

In this paper, we derive optimal policies for cooperation of a wireless node in relaying the packets of a source node, in a random access environment. In our scenario, the source node sends its packets by its harvested energy and the relay node exploits its harvested energy in relaying the source packets not detected successfully at the destination. The relaying policies determine whether the relay node accepts or rejects the unsuccessfully transmitted source packets and how the relay node prioritizes the accepted source packets to its own packets. The optimization goal is to minimize the average transmission delay of source packets with and without a constraint on the average transmission... 

This paper is concerned with tracking state trajectory at remote controller, stability and performance of linear time-invariant noiseless dynamic systems with multiple observations over the packet erasure network subject to random packet dropout and transmission delay that does not necessarily use feedback channel full time. Three cases are considered in this paper: (1) without feedback channel, (2) with feedback channel intermittently and (3) with full time availability of feedback channel. For all three cases, coding strategies that result in reliable tracking of state trajectory at remote controller with asymptotically zero mean absolute estimation error are presented. Asymptotic mean... 

Dynamic Index coding as a generalization of the traditional index coding problem, deals with transmission of some dynamic data flows in the presence of side information. For a dynamic index coding system, the set of average flow rates for which the system can be stable is named Code-Constraint Capacity region. In this paper, we identify the code-constraint capacity region for a dynamic index coding problem with complete bi-directional side information graph. Furthermore, we introduce the concept of Dynamic Index Coding Gain to quantify the improvement resulted from the dynamic index coding with respect to uncoded transmissions. We also provide some corollaries about system performance... 

Recently, routing with disjoint paths has received much attention to provide more performance and fault tolerance. On the other hand, WK-recursive mesh network has been studied extensively due to its favorable properties such as high degree of stability and resilience. The connectivity of a network is an important measure of fault tolerance, while the diameter represents the worst-case transmission delay between two arbitrary nodes. In this paper, we propose one-to-one and one-to-many disjoint routings mechanisms for WK-recursive mesh networks to further exhibit the performance and fault tolerance of such networks. © 2008 IEEE  

In this article, we consider an energy harvesting cooperative network comprised of two data sources and one relay. All nodes transmit based on a predefined slotted Aloha protocol in a random access environment. The main challenge we study is to find how the relay node must share its energy between two sources to optimize their QoS metrics, i.e., throughput and average transmission delay (ATD), separately. Thus, according to our multi-source scenario, we encounter a multi-objective optimization problem (MOOP). Since the relay does not prioritize between two sources, in order to solve the MOOP, we optimize equal-weight linear aggregation of the QoS metrics of two sources. Interestingly, we... 

In this paper, we propose a new architecture for nanophotonic Networks on Chip (NoC), named 2D-HERT, which consists of optical data and control planes. The proposed data plane is built upon a new topology and all-optical switches that passively route optical data streams based on their wavelengths. Utilizing wavelength routing method, the proposed deterministic routing algorithm, and Wavelength Division Multiplexing (WDM) technique, the proposed data plane eliminates the need for optical resource reservation at the intermediate nodes. For resolving end-point contention, we propose an all-optical request-grant arbitration architecture which reduces optical losses compared to the alternative... 

We study transmission rate control and performance delay in cognitive radio (CR) links from a cross-layer perspective. We assume a hierarchical CR network where the secondary users (SU) access the spectrum band in an opportunistic and noncooperative way. The SU goal is to transmit a fixed-size file (fixed amount of data packets) during the sojourn time of the primary users (PU's) idle state. We assume that the SU's support frames retransmission through an automatic repeat request (ARQ) mechanism. By formulating the problem as a Markov decision process, we demonstrate that there is always an optimal stationary rate adaptation policy, and we propose a simple algorithm to obtain it. We derive... 

This paper proposes new architectures for data and control planes in a nanophotonic networks-on-chip (NoC) with the key advantages of scalability to large scale networks, constant node degree, and simplicity. Moreover, we propose a minimal deterministic routing algorithm for the data network which leads to small and simple photonic switches. Built upon the proposed novel topology, we present a scalable all-optical NoC, referred to as 2D-HERT, which offers passive routing of optical data streams based on their wavelengths. Utilizing wavelength routing method, Wavelength Division Multiplexing (WDM) technique, and a new all-optical control architecture, our proposed optical NoC eliminates the... 

The paper proposes a scalable wavelength-switched optical NoC, named as SWS-ONoC. The proposed architecture is built upon a novel all-optical router which passively routes optical data streams based on their wavelengths. Utilizing wavelength routing method, SWS-ONoC eliminates electrical transactions for optical resource reservation and hence, reduces latency and area overheads of the electrical units. The proposed architecture benefits from Wavelength Division Multiplexing (WDM) scheme to efficiently route multicast optical packets concurrent with unicast data streams. Performing a series of simulation-based experiments, we study efficiency of the proposed architecture, its power and energy... 

We propose a new optical reconfigurable Network-on-Chip (NoC), named ReFaT ONoC (Reconfigurable Flat and Tree Optical NoC). ReFaT is a dynamically reconfigurable architecture, which customizes the topology and routing paths based on the application characteristics. ReFaT, as an all-optical NoC, routes optical packets based on their wavelengths. For this purpose, we propose a novel architecture for the optical switch, which eliminates the need for optical resource reservation, and thus avoids the corresponding latency and area overheads. As a key idea for dynamic reconfiguration, each application is mapped to a specific set of wavelengths and utilizes its dedicated routing algorithm. We... 

This paper presents a supervisory multi-agent control policy over an acoustic communication network subject to imperfections (packet dropout and transmission delay) for localisation of an underwater flow source (e.g., source of chemical pollution, fresh water, etc.) with an unknown location at the bottom of the ocean. A two-loop control policy combined with a coding strategy for reliable communication is presented to perform the above task. A simulator is developed and used to evaluate the trade-offs between quality of communication, transmission delay and control for a fleet of autonomous underwater vehicles supervised over a noisy acoustic communication network by an autonomous surface...