Sharif Digital Repository

Multi-hop random access networks have received much attention because of their distributed nature which facilitates deploying many new applications over the sensor and computer networks. Recently, utility maximisation framework is applied in order to optimise performance of such networks; however, proposed algorithms result in large transmission delays. In this study, the authors will analyse delay in random access multi-hop networks and solve the delay-constrained utility maximisation problem. We define the network utility as a combination of rate utility and energy cost functions and solve the following two problems: 'optimal medium access control with link delay constraint' and, 'optimal... 

Regarding the dynamic nature of cognitive radio networks and the delay of the central decision algorithms due to collecting necessary information in a multi-hop wireless network, distributed resource allocation algorithms are of crucial importance. In this paper we propose a new distributed resource allocation algorithm that properly selects link/frequency in a multi-hop cognitive radio network for delay sensitive applications. This algorithm, uses the locally collected information from neighboring nodes to make suitable routing decisions regarding the dynamic environment and the behavior of the neighbors. We consider the delay as the routing criterion, consisting the queueing delay and the... 

Wireless Sensor Network (WSN) should be capable of fulfilling its mission, in a timely manner and without loss of important information. In this paper, we propose a new analytical model for calculating RRT (Reliable Real-Time) degree in multihop WSNs, where RRT degree describes the percentage of real-time data that the network can reliably deliver on time from any source to its destination. Also, packet loss probability is modeled as a function of the probability of link failure when the buffer is full and the probability of node failure when node's energy is depleted. Most of the network properties are considered as random variables and a queuing theory based model is derived. In this... 

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

Server workloads benefit from execution on many-core processors due to their massive request-level parallelism. A key characteristic of server workloads is the large instruction footprints. While a shared last-level cache (LLC) captures the footprints, it necessitates a low-latency network-on-chip (NOC) to minimize the core stall time on accesses serviced by the LLC. As strict quality-of-service requirements preclude the use of lean cores in server processors, we observe that even state-of-the-art single-cycle multi-hop NOCs are far from ideal because they impose significant NOC-induced delays on the LLC access latency, and diminish performance. Most of the NOC delay is due to per-hop... 

In this letter, we analytically evaluate the end-to-end bit error rate (BER) of point-to-point multi-hop underwater wireless optical communication (UWOC) systems with respect to all degrading effects of the UWOC channel, namely absorption, scattering, and turbulence-induced fading. To do so, we first derive the BER expression of a single-hop UWOC link as the building block for end-to-end BER evaluation. We also apply Gauss-Hermite quadrature formula to obtain the closed-form solution for the system BER in the case of lognormal underwater fading channel. Numerical results demonstrate that multi-hop transmission, by alleviating channel impairments, can significantly improve the system... 

In this paper, we propose a new delayed data offloading scheme by exploiting full-duplex (FD) device-to-device (D2D) communications. To this end, we consider a scenario in which a common file is requested by a subset of users in different times and with different maximum tolerable delays. Moreover, a maximum specific bandwidth is dedicated for data transmission. In order to send the file in the specific bandwidth, we use multicasting alongside FD D2D communications. Thanks to the fact that users have different deadlines, we divide them into non-overlapping groups, i.e., coalitions, to receive the file in distinct intervals. In order to guarantee the tolerable delay of all users, a coalition... 

Wireless Sensor Network (WSN) should be capable of fulfilling its mission, in a timely manner and without loss of important information. In this paper, we propose a new analytical model for calculating RRT (Reliable Real-Time) degree in multihop WSNs, where RRT degree describes the percentage of real-time data that the network can reliably deliver on time from any source to its destination. Also, packet loss probability is modeled as a function of the probability of link failure when the buffer is full and the probability of node failure when node's energy is depleted. Most of network properties are considered as random variables and a queuing-theory based model is derived. In this model,... 

As multi-hop wireless networks are attracting more attention, the need to evaluate their performance becomes essential. In order to evaluate the performance metrics of multi-hop wireless networks, including sending and receiving rates of a node as well as the collision probability, a model based on Stochastic Reward Nets (SRNs) is proposed. The proposed SRN models a typical node in such networks, considered as a general template to be applied to any wireless node. The SRN model of a single node is designed to take transmission effects of all neighboring nodes into account, while ignoring the ones whose transmission has no effect on the node under-study. Applying the proposed SRN to each node... 

The IEEE 802.11 contention-based distributed coordination function has been used in ad hoc networks, and so far, a comprehensive mathematical analysis of such multihop systems has not been reported in the literature due to complicating factors such as hidden terminals and the unreachability problem. In this paper, we propose a new analytical model based on the parallel space-time Markov chain for IEEE 802.11 medium access control (MAC) in multihop ad hoc networks. The proposed scheme is able to model the hidden-terminal and unreachability phenomena. Extensive evaluation is conducted to demonstrate the accuracy of the proposed framework. © 2009 IEEE  

In this paper, an underwater wireless sensor network (UWSN) is modeled with the help of queueing theory in order to evaluate the maximum stable throughput of the network. To this end, a new scenario for multi-layer mobile UWSN is considered. Then, a new MAC algorithm comprised of random access scheme (like MACAW) and CDMA-based data transmission along with a simplified routing algorithm is proposed. In order to analyze the considered UWSN scenario, we propose two related queueing networks, one for modeling the wireless node mobility and the other for representing the process of multi-hop packet transmission according to considered MAC and routing algorithms. Finally, the maximum stable... 

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

Lifetime is the most important concern in wireless sensor networks due to limited battery power of sensor nodes. In this paper, we focus on designing an energy-efficient and energy-aware routing algorithm, LLR, to increase the operational lifetime of multi-hop wireless sensor networks in the presence of unreliable communication links. Our proposed protocol utilizes a parameter, Broadcasting Delay, in each node associated with the hop parameters passed by a route request packet to select long lifetime paths in the network. The key point in Broadcasting Delay formulation is that it includes both node and link specific parameters. We use two different scenarios: either the link layer... 

We study the problem of optimizing the symbol error probability (SEP) performance of cluster-based cooperative wireless sensor networks (WSNs). It is shown in the literature that an efficient relay selection protocol based on simple geographical information of the nodes to execute the cooperative diversity transmission, can significantly improve the SEP performance at the destination of such networks. Also, a similar analysis on the optimal power allocation for the source and the relay exists in the literature. However, we propose that to achieve the minimum SEP at the destination, a joint optimization of power allocation and relay selection should be accomplished. To this aim, we... 

Although flooding and its variants are widely deployed for broadcasting by different applications, there are limited results on a complete and comprehensive analytical framework describing their behavior in general cases. We have previously published results which provide an upper bound for the performance of flooding when flooded packets have the highest serving priority. In this paper, using a different and simpler approach, we develop an analytical framework for analysis of flooding in general cases where flooding packets do not receive any special priority treatment in the network. The analysis is performed for a static multi-hop ad hoc wireless network using CSMA as its MAC layer. The... 

Intermittent connectivity is an intrinsic feature of vehicular ad hoc networks (VANETs) in sparse situations. This type of network is in fact an example of delay and disruption tolerant networks (DTNs). In this paper, we focus on a typical two-way street and analytically evaluate the maximum stable throughput and the average delay for packet forwarding along the street. To this end, we map the mobility patterns of the vehicles with different speeds onto suitable parameters of a BCMP queueing network and derive the location density of vehicles. Then, we employ another queueing network in order to model opportunistic multi-hop packet forwarding along the street with respect to the...