Sharif Digital Repository

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... 

In this paper, we propose a new scenario in order to increase the total throughput of a WLAN. In this scenario, some secondary users (SUs) are considered in a primary WLAN such that SUs cooperate with primary users (PUs) in transmitting the primary packets. Each SU sends its packets as well as the primary packets collided at the access point, but overheard successfully at the SU, by random access the primary WLAN. We show that SUs cooperation is able to compensate their adverse effect in the WLAN, so total throughput in the WLAN increases without a significant degrading effect for the stability region of PUs. To this end, we use an analytical model based on open queueing networks. By solving... 

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... 

In this paper, we propose a new model to evaluate the behavior of cognitive radios (CRs). In this model, we consider a specific number of primary users having independent probabilistic on-off behavior. In addition, a specific number of opportunistic cognitive radios in saturation mode is assumed. We consider contention for CRs in order to occupy an inactive primary channel independently according to a simple MAC scheme. Our model is based on a closed BCMP state-dependent queueing network. We map contention of the CRs and the behavior of primary users on suitable parameters of the queueing network. By solving the network, we obtain the steady state behavior of CRs, then we find the efficient... 

In this paper, we propose a new packet routing scheme, i.e., a combined digital and analog network coding scheme (DNC-ANC) suitable for multiple unicast scenario. In this respect, we consider a random access WLAN comprised of single and multi-hop unicast sessions. Then we modify the MAC scheme in order to enable ANC. In order to evaluate the effect of the proposed DNC-ANC scheme analytically, we employ an open queueing network and map the details of MAC as well as routing schemes onto its suitable parameters. By writing the corresponding traffic equations and applying the stability condition, we are able to find the maximum stable throughput for the considered scenario. Finally, we will show... 

In this paper, we compute lower and upper bounds for the throughput capacity of an ad hoc network overlaid on a cellular network. The ad hoc network is comprised of a specific number of wireless cognitive nodes that opportunistically exploit the inactive frequency channels in the cellular network. In this respect, we employ a model recently proposed for single-channel mobile ad-hoc network after some minor modifications. The proposed framework consists of two queueing networks, a closed BCMP queueing network comprised of M/G/∞nodes capable of mobility modeling, and an open BCMP queueing network comprised of symmetric M/G/1 nodes capable of modeling the packet transmission process. By... 

In this paper, we propose a new modeling approach for analytical evaluation of normalized throughput and average backoff time for IEEE 802.11 MAC standard in non-saturation mode and with Poisson arrivals. To this end, we map different stages of distributed coordinated function (DCF) onto different components of a closed multi-class BCMP queueing network with arbitrary service time distribution. At the last part of the paper, we illustrate the applicability of the proposed approach by some numerical results in both saturation and non-saturation modes and obtain average backoff time for different arrival rates. © 2007 IEEE  

A novel active queue management (AQM) method is proposed. This method, named NN-RED, is based on the use of a neural network for early congestion prediction. By simulations, it is demonstrated that the performance of the proposed approach is better than the random early detection (RED) method that is currently known as one of the best AQM methods in solving congestion problems. © The Institution of Engineering and Technology 2007  

Packet-level observations are representative of the high sensitivity of TCP/RED computer network behavior with respect to network/RED parameter variations. That is, while we do not have any control on network parameters, mis-choosing of the RED parameters results in complex non-periodic oscillations in the router queue length that may damage the Quality of Service requirements. Characterizing the nature of such behaviors, however, helps the network designers to modify the RED design method in order to achieve better overall performance. In this paper, we first investigate the effect of variations in different RED parameters on the network behavior and then seek for the origin of such complex... 

In this paper, we develop a multi-objective model to optimally control the lead time of a multistage assembly system, using an interactive method. The multistage assembly system is modelled as an open queueing network, whose service stations represent manufacturing or assembly operations. It is assumed that the product order arrives according to a Poisson process. In each service station, there is either one or infinite number of servers (machines) with exponentially distributed processing time, in which the service rate (capacity) is controllable. The transport times between the service stations are independent random variables with generalized Erlang distributions. The problem is... 

We study queueing systems where customers have strict deadlines until the end of their service. An analytic method is given for the analysis of a class of such queues, namely, M(n)/M/1 + G models with ordered service. These are single-server queues with state-dependent Poisson arrival process, exponential service times, FCFS service discipline, and general customer impatience. We derive a closed-form solution for the conditional probability density function of the offered sojourn time, given the number of customers in the system. This is a novel result that has not been seen before. Using this result, we show how the probability measure induced by the offered sojourn time is computed, and... 

In this paper, we propose a general mobility model suitable for wireless multimedia networks. Our model is based on splitting a region into subregions. Furthermore, we make an analogy between subregions as well as their inter-connections with a multi-class Jackson queueing network comprising of infinite-server nodes. The main attribute of such a network is due to its product-form stationary distribution. Using this model, we are able to obtain a closed analytical form for the spatial traffic distribution corresponding to a specific number of network-connected users with different classes of service and mobility in a typical region. Also, we show the flexibility obtained by the proposed... 

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... 

In this paper, we evaluate the effect of energy constraints on the performance of a simple network comprised of wireless nodes with energy harvesting capability. In this scenario, wireless nodes contend with each other based on slotted Aloha protocol in order to transmit a packet. Packet transmission occurs provided that enough energy exists in the energy buffer. We propose an analytical model based on a closed queueing network (QN) to include details of data and energy buffers as well as random access MAC protocol. We show how energy limitation affects the MAC design parameters, e.g., contention window size, in order to optimize the performance of the network. Moreover, we evaluate the... 

In this paper, we analyze the saturation throughput of a cognitive WLAN overlaid on a primary OFDMA TDD network (e.g., LTE or WiMAX). In this scenario, after the contention among the secondary nodes, the winner node transmits its data packet in the empty resource blocks (RBs) of downlink and uplink subframes of the primary network. Regarding the OFDMA structure as well as time-scheduled resources in the primary network, the time duration of opportunities for the secondary network does not follow simple exponential on-off pattern. To model the dynamic behavior of opportunities for secondary nodes as well as contentions to exploit the opportunities, we propose an analytical model comprised of...