Sharif Digital Repository

This paper presents an analytical study of average delay and throughput in a two-way relay network exploiting network coding to exchange source packets, where arrival and departure of packets are stochastic. In this case, a fundamental problem for the relay node is whether to wait in order to obtain a coding opportunity, leading to reduction of the number of transmissions, or sending a packet (coded/uncoded) whenever it has a transmission opportunity, leading to reduction of the packet delay. In order to address the fundamental trade-off between packet delay and transmission power, we develop three network coding schemes based on power-delay constraint of the application. We devise a... 

The authors investigate the content distribution among the vehicles of a cluster in a vehicular ad-hoc network, exploiting network coding. The vehicles collaborate to disseminate the coded data packets, received from a roadside info-station based on IEEE 802.11 medium access control (MAC) protocol. Two types of network coding are considered: random linear network coding (RLNC) over a large finite field and random XORed network coding (RXNC). An analytical model is proposed to address the effect of random access MAC as well as the correlation among received coded packets on the performance of content distribution. First, a p-persistent carrier sense multiple access approximation for IEEE... 

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

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

In this paper, we propose an analytical approach to compute the probability of connectivity for one-dimensional ad hoc networks. The proposed analysis gives the exact probability of connectivity for an arbitrary distribution of nodes, provided that nodes are independently and identically distributed. We conduct separate analyses for two cases; in the first case, the number of nodes varies by time under a stationary distribution and in the second case, there is a fixed (known) number of nodes in the network. Using the approaches presented in this work, we are able to derive closed-form formulas for the probability of connectivity for some spatial distributions, while for more complicated... 

In this paper, we focus on a cognitive network scenario, comprised of a multi-hop IEEE 802.11-based WLAN overlaid on a cellular network. In this scenario, the wireless nodes in a WLAN, i.e., cognitive nodes, use the downlink frequency channels of the cellular network opportunistically, such that at each packet transmission all idle channels have been exploited. In order to evaluate the capability of the considered cognitive network scenario, we propose an open queueing network model such that different packet transmission phases are mapped onto different queueing nodes. We also map different types of collisions, i.e., collision on control signals as well as collision on data transmission due... 

In this study, the authors propose an analytical model to evaluate the maximum stable throughput for unicast services in vehicular ad hoc networks. In this respect, the authors employ two queueing networks (QNs) to model the mobility patterns of the vehicles as well as the multi-hop packet transmission scenario. In the proposed model, the authors map the features of IEEE 802.11, as well as the details of multi-hop packet transmission, regarding the dynamic status of vehicles, onto suitable parameters of the QNs. In the authors' modelling approach, they take the details of MAC and routing schemes into account by classifying the vehicles based on their mobility patterns and considering their... 

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 propose an analytical model to evaluate the maximum stable throughput of a cognitive IEEE 802.11-based WLAN sharing the downlink band of a cellular network. Our model has been found on an open queueing network which includes both asymmetric and non-saturated aspects of secondary nodes as well as the time-varying nature of the channel due to intermittent primary nodes. By mapping the details of MAC scheme of the cognitive WLAN, regarding the dynamic nature of spectrum opportunities, onto suitable parameters of the proposed queueing network and writing the corresponding traffic equations, we are able to find the maximum stable throughput, i.e., the maximum rate of packet... 

In this paper, we evaluate how traffic-load dependent vehicle routing at intersections is able to improve the connectivity status of all streets. To this end, we consider a VANET scenario, comprised of several streets and intersections. Then, we focus on two vehicle routing algorithms, one based on the distance to destination, i.e., traffic-load independent (TLI) algorithm, and another one based on both distance to destination and traffic load status of the local streets, i.e., traffic-load dependent (TLD) algorithm. By employing a simple mobility model based on an open BCMP queueing network, we derive the spatial traffic distribution at two cases. Afterwards, we propose a simple algorithm... 

In this paper, we evaluate the effect of power randomization on the saturation throughput of a WLAN comprised of four classes of users, corresponding to four access categories (ACs) of IEEE 802.11e EDCA. To this end, we consider a specific number of power levels for all users. By some simplifications, we find the probability distributions for the power levels at each class in order to optimize the saturation throughput of a specific class. We evaluate the effect of such optimization onto the saturation throughput of other ACs as well as the saturation throughput of the whole network. Finally, we present some numerical results to show the effect of our optimization in different conditions  

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

In this paper, we evaluate the saturation throughput for an IEEE 802.11 based wireless network considering capture effect at the receiver, while nodes transmit with random powers. In this respect, we consider a scenario consisting of a specific number of wireless nodes. Then, we derive the transmission as well as collision probabilities with respect to the perfect capture effect. In order to maximize the saturation throughput we set up an optimization problem and obtain how to compute optimum values for the probabilities corresponding to different power levels. By providing the numerical results, we deduce that power randomization may lead to a significant improvement in saturation... 

In this paper, we propose a new packet prioritization scheme in order to exploit the full-duplex (FD) capability of the access point (AP) more efficiently, in an asymmetric IEEE 802.11-based WLAN, i.e., only the AP has the in-band FD communications capability. In this respect, we consider a modified version of IEEE 802.11 MAC protocol such that at any transmission opportunity in which AP has the role of the transmitter or the receiver, it does the best to select a partner packet to be simultaneously received or transmitted, respectively. The key feature of our proposed partner packet selection scheme is to reduce the idle time intervals that in an FD transmission opportunity, due to... 

In this paper, we propose a data offloading algorithm in a network comprised of a macro base station and a few number of WiFi access points with overlapped coverage areas. The main goal of our algorithm is how to assign offloaded mobile stations (MSs) to access points (APs). Our approach in proposing the algorithm is based on mapping the problem onto finding a suitable matching algorithm, in order to minimize the average delay of the offloaded packets as one of the main QoS parameters on the one hand and to maximize the utility of the APs on the other hand. The utility of each AP is considered to be a combination of monetary benefit due to offloading service and the cost due to extra energy... 

Frame aggregation (FA) mechanisms improve the throughput of WLANs. In this paper, the effect of the FA mechanism on the throughput of wireless local area networks (WLANs) has been investigated. To this end, we propose an analytical model in order to analyze an IEEE 802.11n network comprised of an access point (AP) and several conventional nodes (CNs), all in the coverage area of each other. With respect to the heavier download traffic compared to the upload one, in our scenario, only the AP uses an FA mechanism and the other nodes use the basic IEEE 802.11 standard. In our proposed analytical model, the maximum downlink (DL) throughput is derived. Regarding the asymmetry among nodes, our... 

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