Skip to main content

Performance analysis of multi-hop framed ALOHA systems with virtual antenna arrays


We consider a multi-hop virtual multiple-input-multiple-output system, which uses the framed ALOHA technique to select the radio resource at each hop. In this scenario, the source, destination and relaying nodes cooperate with neighboring devices to exploit spatial diversity by means of the concept of virtual antenna array. We investigate both the optimum number of slots per frame in the slotted structure and once the source-destination distance is fixed, the impact of the number of hops on the system performance. A comparison with deterministic, centralized re-use strategies is also presented. Outage probability, average throughput, and energy efficiency are the metrics used to evaluate the performance. Two approximated mathematical expressions are given for the outage probability, which represent lower bounds for the exact metric derived in the paper.

1 Introduction

Multiple-input multiple-output (MIMO) systems are well known for their capability to obtain high spectral efficiency in the presence of fading channels [1, 2]. On the other hand, the need to install multiple antennas in portable devices can be problematic for economic and practical reasons. To extend the advantages of MIMO systems to devices characterized by a reduced number of antennas, the idea of deploying a virtual (or distributed) (V-MIMO) architecture appears to be very promising [35]. Cooperation among nodes is a fundamental aspect of V-MIMO systems, since nodes cooperate to create virtual antenna arrays (VAAs) [4]. V-MIMO systems take also advantage from the use of nodes equipped with two radio transceivers: a long-range wireless system, which can be used for inter-VAA communication, and a short-range radio interface, which can be used for intra-VAA communication [3, 4, 6].

Virtual MIMO systems can be applied in the context of both centralized and decentralized networks. The performance of virtual MIMO system applied to a cellular-based architecture in the presence of a limited amount of feedback information is evaluated in terms of throughput-fairness trade-off [7]. The impact of channel estimation errors on the performance of relay-assisted virtual MIMO systems is discussed in [8].

The case of multi-hop systems is of particular interest, as V-MIMO techniques can improve significantly the performance in terms of throughput compared to conventional single-input, single-output or SISO schemes [919]. In this contest, distributed radio resource assignment techniques, being much simpler, are to be preferred to centralized schemes. The topic of resource allocation, when deterministic (and centralized) multiple access control (MAC) techniques are used for inter-VAA communication, is studied in [3, 4, 6, 18]. The overall resource pool, available for inter-VAA communication, is assumed to be fractionated into orthogonal radio resources for inter-VAA links in [3, 4, 18], and the performance of the considered V-MIMO scheme is investigated. As far as distributed radio resource assignment techniques are considered, the impact of non-orthogonal reuse of radio resources in a multi-hop V-MIMO system with a fixed number of relays has been investigated in [6]. In that paper, the presence of interference caused by non-orthogonal reuse of resources has been quantified, and its effect on the source-destination performance has been studied.

It is well known that MIMO technology can improve the performance of conventional random-access schemes in terms of reliability and throughput. In particular, the use of MIMO detection techniques to combine signals sampled at successive time slots can reduce (or eliminate) the effect of collisions. This important result has motivated the research of network diversity multiple-access (NDMA) schemes that can obtain a good performance when the channel coherent time is in the order of the packet slot duration [20, 21]. Among the random access schemes, ALOHA has been recently proposed for MIMO systems in [2224]. More precisely, a scenario composed of an access point (AP), and multiple transmitting nodes is considered in [22]. The key idea of [22] is that nodes use framed ALOHA (FA), but the possible multiple transmissions over the same slot are not treated as collisions. In the event of collision, some nodes are selected to act as relays and retransmit the signal they received during the collision in a specific time slot. The different signals received by the AP are then processed using standard detection strategies (i.e., using maximum likelihood techniques). To alleviate the performance degradation which occurs in NDMA schemes when coherent time is larger than the packet slot duration, an adaptive space-time diversity framed ALOHA scheme, which works with MIMO systems with two transmit and an arbitrary number of receive antennas, is proposed in [23]. Multiplexing/diversity MIMO trade-off is considered in the context of wireless local area networks performance optimization with MIMO channels [24]. The paper proposes a joint optimization of MAC layer parameters and the multiplexing-diversity trade-off at the physical layer. Two different MAC protocols are studied: carrier sense multiple access with collision avoidance (CSMA/CA) and slotted ALOHA. CSMA is also used in [25] for distributed scheduling in multi-hop networks with MIMO links. An adaptive CSMA protocol, which adjusts the link rate based on local queue information, is also proposed in [25].

To the authors’ knowledge, there are no papers in the literature addressing the performance of multi-hop V-MIMO systems where random access-based MAC schemes are used for inter-VAA communication. Motivated by this consideration, a decentralized MAC scheme is considered in this paper. In particular, the resources are assigned to each hop independently, through a framed ALOHA procedure: the time axis is split into frames, each composed of a given number of slots. Assuming perfect synchronization among nodes, each VAA in the multi-hop chain selects one slot randomly, resulting in possible interference among VAAs selecting the same slot. It is well known that this approach provides worse performance than the case of a centralized procedure implementing a perfect deterministic reuse of the time slots. On the other hand, implementation of framed ALOHA is much simpler than that of a centralized algorithm since resources are independently selected by nodes at each hop. Centralized assignment of the resources, in fact, requires the exchange of many control packets among nodes, and it is not applicable in many cases, as for example wireless sensor networks [26, 27].

Network performance is evaluated in terms of ergodic capacity, outage probability, average throughput, and energy efficiency. The model presented in this paper is based on the works presented in [28, 29] and it represents a generalization and integration of those contained in the two conference papers.

The contribution of this paper can be summarized as follows:

  • We showed the behavior of the outage probability by varying different system parameters, and compare framed ALOHA with a deterministic centralized assignment of radio resources.

  • We identified the optimum number of slots per frame in the slotted structure of ALOHA;

  • We evaluated the impact of the number of hops on the performance when the source-destination distance and the other system parameters are set.

  • We discussed the trade-off between source-destination throughput and overall energy spent by nodes.

  • We provided some upper bounds on the outage probability. Numerical results will show that these bounds are rather tight.

The remainder of the paper is organized as follows. Section 2 describes the channel model considered, the reference scenario, the framed ALOHA protocol, and the communication within the multi-hop VAA-based network. Section 3 provides the mathematical model to derive the ergodic capacity of the multi-hop V-MIMO system, while Section 4 reports the derivation of the performance metrics: outage probability, average throughput, and energy efficiency. Finally, Sections 5 and 6 report the numerical results and conclusions, respectively.

2 System description and scenario

2.1 Notations

Throughout the paper, vectors and matrices are indicated in bold, I is the identity matrix, [A]T denotes the transpose of A. {ai,j}i,j=1,…,M is an M ×M matrix with elements ai,j={A}i,j. ABdiag(A,B) is the direct sum of matrices [30]. E · denotes expectation, and {E} denotes the probability of the event E. u(x) indicates the unit step function, equal to one for x>0 and zero otherwise.

2.2 Propagation and connectivity models

The channel model we consider accounts for the power loss due to propagation effects including a distance-dependent path loss and random channel fluctuations. We assume that the received power, PR, is given by

P R = P T x β f k

where PT is the transmitted power, k is the average power loss at x=1 m, being x the link distance, β is the attenuation coefficient which commonly ranges from 2 to 5; finally, f is a short-term random fading component. Rayleigh fading is considered for the inter-VAA links, so that f is exponentially distributed with unit mean.

We define Lk· x β as the averaged (with respect to fading) loss (in linear scale). By introducing the logarithmic scale, we obtain

L[dB]= k 0 + k 1 lnx,

where k0=ζ lnk and k1=ζ·β, where ζ10/ln10.

Note that, for each air interface (intra- and inter-VAA), we could have different values of the transmitted power (PT) and propagation parameters (k0, k1).

The channel is assumed to be ergodic. Under such assumption, the source-destination ergodic capacity can be considered as one of the main performance metrics [31].

2.3 Reference scenario and assumptions

We consider a multi-hop V-MIMO system (see Figure 1), where a source node (node S in the figure) transmits data to a destination node (node D), via multiple relay nodes (R1,R2,..RZ−1), being Z the number of hops in the network.

Figure 1
figure 1

The virtual MIMO communication system.

In the following, source, relays and destination nodes will be denoted as main nodes. The distance between the source main node and the destination main node will be denoted as DSD, while d will be the distance between the main nodes of two subsequent VAAs in the multi-hop chain. We assume that adjacent VAAs are equally separated in distance (i.e., d=DSD/Z).

A random number of ancillary nodes is distributed in non-overlapped arbitrary areas, A, around the main nodes, according to a homogeneous Poisson point process (PPP) [32]. According to such distribution, the probability of having one node in the infinitesimal area δA is ρ′δA, where ρ′ denotes the nodes’ density [32]. Owing to the possible presence of mechanisms such as sleeping schedules implemented at nodes, only a subset of the ancillary nodes are simultaneously active; we denote ρ as the density of the active nodes.

As largely adopted in the literature, we assume that nodes are equipped with two air interfaces: a short-range air interface, which is characterized by a high data rate and low energy consumption and used for the communication within VAA (intra-VAA communication), and a long-range air interface, which is characterized by a lower data rate and used for the inter-VAA communication [3, 4, 6].

The main and ancillary nodes may cooperate to create VAAs at the source (s-VAA), at the Z−1 relays (r i -VAA, with i{1,..,Z−1}) and at the destination (d-VAA). In particular, we assume that an ancillary node could be part of the VAA only if the main node-ancillary node path loss, L, is lower than a given threshold, Ltha, representing the maximum loss tolerable by the short-range communication system. VAAs are formed before each data transmission. We assume that the path loss between main and ancillary node, L, is constant during each inter-VAA transmission phase. Short-range wireless interface is used to track possible changes in the propagation characteristics and identify the new set of collaborating nodes. The new set of cooperating nodes will be active during the subsequent transmission phase. Using the propagation model given in (1), the results that ancillary nodes may communicate with the main node only if their distance is lower than d th = e ( L th k 0 ) / k 1 and the mean number of candidate cooperating nodes, denoted as N hereafter, can be written as ρπ d th 2 . We assume that the distances source-relay, relay-relay, and relay-destination are much larger than the distance between a main node and its cooperating nodes. With this assumption, the VAAs do not overlap and each ancillary node can communicate only with a unique main node. Moreover, depending on the short-range air interface used, there could exists a maximum number of cooperating nodes a main node can actually handle; this maximum number will be denoted as M in the following. Finally, we assume that a decode and forward (DF) strategy is implemented at the relays [4].

2.4 Framed ALOHA

We assume that a framed ALOHA protocol is used by the different VAAs to access the channel [33]; the whole amount of radio resources available for inter-VAA communication is divided among R unitary resources. In other words, each frame has R time slots. Therefore, once a VAA has data to be transmitted, the main node of the VAA will select randomly one out of the R available time slots in the next frame and will communicate the choice to its cooperating nodes. All nodes of a given VAA (cooperating nodes plus the main node) will simultaneously access the channel by using the same unitary resource, selected with probability 1/R. We also assume an out-of-band signalling mechanism is used for synchronization between the transmitter VAA and the receiver VAA.

Since time slot selection is made independently at VAA level, there is a nonzero probability that other links use the same time slot, causing interference.

2.5 The communication in the multi-hop chain

We assume that all the VAAs (s-VAA, r i -VAAs (with i{1,..,Z−1}) and d-VAA) are formed before data transmission. During the phase of VAA creation, each main node selects the slot to the used for the inter-VAA communication. Large scale effects (i.e., path-loss) are supposed to be slowly varying compared to the data packet length. Under such assumption, the set of cooperating nodes remains constant during the packet transmission.

Using the short-range radio interface, the main nodes transmit a query to ancillary nodes, and those nodes that receive the query reply with an acknowledgement, becoming candidate cooperating nodes. Then, the main nodes randomly select M nodes, among all the candidates, to cooperate with. Being ancillary nodes distributed according to a PPP, the number of candidate cooperating devices at a given node follows a Poisson distribution. The number of nodes actually cooperating at the source, the i th relay and at the destination, will be denoted as nS, n R i , and nD, respectively.

Once all the VAAs are formed, the communication between source (main) node and destination (main) node is performed according to the following steps:

  1. 1.

    The source main node will transmit the data, together with the slot to be used, to the n S cooperating nodes, using the short-range air interface (intra-VAA communication).

  2. 2.

    The n S+1 nodes of the s-VAA transmit data towards the first relay through the V-MIMO channel, using the long-range interface (inter-VAA communication).

  3. 3.

    The n R 1+1 nodes of the r 1-VAA cooperate to decode the received data, meaning that the data is send (through the short-range interface) from the n R 1 nodes to the main node, which will decode it.

  4. 4.

    The main node at the r 1-VAA sends the data to be forwarded, together with the slot to be used, to the n R 1 cooperating nodes, which will forward it towards the second relay.

  5. 5.

    The previous two steps are repeated until the data reach the last relay.

  6. 6.

    The n D+1 nodes of the d-VAA receive data from the last relay and cooperate to decode it.

In this paper, we focus on inter-VAA performance, which uses long-range air interface. Data transmission between main and cooperating nodes can be performed either via broadcast transmission (all nodes receive all data), or using a given multiple access scheme; this aspect, which is related to intra-VAA communication, is out of the scope of this paper.

More specifically, the exchange of information between main node and ancillary node for signaling, synchronization and data transmission (intra-VAA transmission) uses the short-range radio interface. This solution also minimizes possible delays since the two transmission phases (intra- and inter-VAA communications) can occur in parallel. For this reason, delays or other possible overhead due to cooperation aspects have not been considered.

3 Analysis of the ergodic capacity for a V-MIMO system

3.1 Capacity of a generic link

In this section we focus on a generic hop (the th hop) of our scenario and assume that the link is affected by the presence of other I() VAAs, acting as interferers. We denote n R ( ) as the number of nodes (cooperating and main) at the receiver VAA, n Tj() with j(0,…,I()) as the number of transmit nodes of the desired (j=0) and of the interfering (j=1,…,I()) VAAs. We denote n T I ( ) = j = 1 I ( ) n T j ( ) as the total number of transmit nodes interfering on the th hop. We assume that nodes belonging to the same VAA transmit the same amount of power. Under such hypothesis, the ergodic capacity in the th hop in the case of uncorrelated Rayleigh fading is given by [34]

C ̄ n T 0 ( ) , n T I ( ) , n R ( ) , P ( ) ( ) = I n T 0 ( ) + n T I ( ) , n R ( ) , Ψ ~ ( ) I n T I ( ) , n R ( ) , Ψ ( ) ,

where P ( ) = [ P 0 ( ) , P 1 ( ) , , P I ( ) ( ) ] T , and P 0 ( ) , P 1 ( ) ,, P I ( ) ( ) are the averaged (over fading) power levels, received by the VAA, transmitted by the desired user ( P 0 ( ) ), and by the I() interferers. I( n T , n R ,Θ) is the ergodic capacity of a single link MIMO system with nT transmit and nR receive antennas, when all the available radio resources are allocated to such link. The elements of the diagonal matrix Θ are the averaged power levels received by the VAA. More specifically [34],

Ψ ( ) = P 1 ( ) σ N 2 I n T 1 P 2 ( ) σ N 2 I n T 2 P I ( ) σ N 2 I n T I


Ψ ~ ( ) = P 0 ( ) σ N 2 I n T 0 Ψ ( ) ,

where σ N 2 is the thermal noise power. Note that the eigenvalues of the matrices Ψ() and Ψ ~ ( ) have multiplicities larger than one.

We refer to [6] for the derivation of I( n T , n R ,Θ) for the sake of brevity.

3.2 Ergodic capacity between source and destination

In the presence of a Z-hop communication protocol, the ergodic capacity from source to destination, denoted by C ̄ S,D , can be evaluated as the minimum of the values of the ergodic capacity in each link. By considering that each VAA uses one out of the R available resources [4], the source-destination ergodic capacity can be written as

C ̄ S,D =min 1 R C ̄ n T 0 ( ) , n T I ( ) , n R ( ) , P ( ) ( ) = 1 , .. , Z

where C ̄ n T 0 ( ) , n T I ( ) , n R ( ) , P ( ) ( ) is given by (3).

From (6) it can be noted that the parameter R impacts on C ̄ S,D as follows: on one hand the term 1/R increases by getting R smaller, on the other hand a decreasing of R causes more interference (on average), therefore the capacity of the generic link gets smaller. This leads to the existence of an optimum value of R, as shown in the numerical results.

We assume that the contribution of an interfering VAA is significant only if its distance from the receiver VAA is lower than p·d, where p is a suitable integer, which depends on the propagation environment. Therefore, when p=1, only one-hop distant interferers are accounted for, whereas in the case p=2, one-hop and two-hop distant interferers are considered by the model. The latter assumption implies that there exists a maximum number of interfering VAAs on link , denoted as I max ( ) .

3.3 Outage probability definition

Since the number of cooperating nodes is a random variable (rv), there is a nonzero probability that the source-destination mean capacity, C ̄ S,D , is lower than a given value, C0, where the threshold C0 depends on the specific application considered. Under such condition, we can introduce the following outage probability definition:

P out { C ̄ S,D < C 0 }.

4 Performance analysis

We now derive the metrics used to assess the performance of our VAA-based Framed ALOHA system: (a) the outage probability, as defined in (7); (b) the average throughput, and (c) the energy efficiency.

4.1 Outage probability

By applying the total probability theorem and by defining E= [ n S , n R 1 , , n R Z 1 , n D , I ( 1 ) , , I ( Z ) ] T and e=[s,r1,…,rZ−1,d,i(1),…,i(Z)]T, the outage probability can be evaluated as

P out = ¯ e u C 0 C ̄ S,D | E = e { E = e } = ¯ e u C 0 C ̄ S,D | E = e = 1 Z { I ( ) = i ( ) } × { n S = s } { n D = d } k = 1 Z 1 { n R , k = r k } ,


¯ e s = 1 M + 1 r 1 = 1 M + 1 r Z 1 = 1 M + 1 d = 1 M + 1 i ( 1 ) = 0 I max ( 1 ) i ( 2 ) = 0 I max ( 2 ) i ( Z ) = 0 I max ( Z ) ,

where C ̄ S,D is given by (6) and I max ( ) is the maximum number of interfering VAAs at the th hop.

It is easy to show that the number of interfering VAAs has a binomial distribution, whose probability function is

{ I ( ) = i ( ) }= I max ( ) i ( ) 1 R i ( ) 1 1 R I max ( ) i ( ) .

Note that I max ( ) depends on and p and can be written as

I max ( ) = p + 1 for < p 2 p 1 for p Z ( p + 1 ) p + Z 2 for Z ( p + 1 ) < < Z 1 p 1 for Z 1 .

Since the number of cooperating nodes is limited to a maximum value M, the distribution of the rvs nS, nD, and nR,k (k=1,…,Z−1) is no longer Poisson, but can be written as

Q(i,N)= P ( i 1 , N ) for i M 1 l = 0 M 1 P ( l , N ) for i > M ,

where P(i,N) N i i ! e N is the Poisson distribution with parameter N.

Although exact, the evaluation of (8) becomes cumbersome as the number of hops increases. This can be easily understood by observing that the number of sums in (8) is equal to Z(Z+1) and the complexity of the computation also depends on M and p. Therefore, we propose two simpler approximated expressions for the outage probability. First, we can assume that the VAA size is independent at each hop.b Under this assumption, an approximate expression for the outage probability can be written as

P out,A ( app ) =1 = 1 Z 1 P out ( ) ,

where P out ( ) is the probability that the capacity of the th link is lower than the threshold C0, which varies with , due to its dependance on the term I max ( ) . We also assume that all nodes transmit with the same power level, PT, so that the averaged (over fading) power received by a given node located at distance x is PTxβ/k. Using the total probability theorem and defining m I max ( ) , Ω ( ) = [ I ( ) , n T 0 ( ) , n T 1 ( ) , , n T m ( ) , n R ( ) ] T and ω= [i,a0,a1,…,a m ,r]T, the outage probability at the th hop can be written as

P out ( ) = ¯ ω u C 0 1 R C ̄ a 0 , a I , r , P ( ) | Ω ( ) = ω ( ) { Ω ( ) = ω } = ¯ ω u C 0 1 R C ̄ a 0 , a I , r , P ( ) | Ω ( ) = ω ( ) { I ( ) = i } × Q ( a 0 , N ) i = 1 m Q ( a i , N ) Q ( r , N ) ,

where a I j = 1 I ( ) a j , Q(i,N) is given by (11), and

¯ ω i = 0 m a 0 = 1 M + 1 a 1 = 1 M + 1 a m = 1 M + 1 r = 1 M + 1 .

We define a= [a1,a2,..,a m ]T, P I ( ) = [ P 1 ( ) , P 2 ( ) , .. , P m ( ) ] T , and F(t), with an m ×m matrix having t elements per column equal to ‘1’ and the remaining elements equal to ‘0’, such that the different columns contain all the possible, non repeated, combinations of the positions of the ‘1’. We also denote as fj,(t) the j th column of F(t), that is, F(t)= [f1,(t)f2,(t),(t)].

As an example, in the case of m=3, we have that F ( 1 ) = 1 0 0 0 1 0 0 0 1 and F ( 2 ) = 1 0 1 1 1 0 0 1 1 . Expression (13) can be simplified using the following identity

u C 0 1 R C ̄ a 0 , a I , r , P ( ) | Ω ( ) = ω ( ) { I ( ) = i } = 1 R i 1 1 R m i j = 1 m i u C 0 1 R C ̄ a 0 , a T · f j , ( i ) , r , [ P 0 ( ) , P I ( ) T · f j , ( i ) ] ( )

In the case of i=0 (i.e., no interferers), the sum in (15) is equal to u C 0 1 R C ̄ a 0 , r , [ P 0 ( ) ] ( ) , with Ψ ~ = P 0 σ N 2 I n T 0 . In the case of i=m, the sum (15) is equal to u C 0 1 R C ̄ a 0 , i = 1 m a i , r , [ P 0 ( ) , .. , P m ( ) ] ( ) .

Approximation (12) can be further simplified by neglecting the fact that some VAA links close to the source and destination will be affected by a reduced number of interferers compared to VAA links located in the center of the transmission chain (i.e., we neglect border effects). This can be easily understood by looking at (10), where the maximum number of interfering VAAs is evaluated as a function of . Under such assumption, P out ( ) = P ̂ out , and the upper bound for the overall outage probability can be written as

P out,B ( app ) =1 1 P ̂ out Z ,

where P ̂ out represents the outage probability of each link. P ̂ out can be evaluated using (13) with m=2p−1. The impact of approximations A and B will be evaluated through the numerical results.

4.2 Average throughput

Another metric considered in this paper is the average throughput, T, defined as the source-destination throughput averaged over nodes’ location and normalized with respect to the channel bandwidth. This metric can be evaluated as

T= i = 1 n max 1 f( c i ) c i + 1 i = 1 n max 1 f c i c n max [bit/s/Hz],

where f( c i ){ C ̄ S,D = c i }=F( c i )F( c i 1 ) is the probability function of C ̄ S,D , and F(c i ) is the complementary cumulative function of C ̄ S,D given by

F( c i )={ C ̄ S,D c i }= P in =1 P out

where, obviously, for the outage probability we can use the exact formula, Pout (given by (8)), or one of its approximations, P out,A ( app ) or P out,B ( app ) . Finally, c n max is the maximum value the average capacity may assume.

4.3 Energy efficiency

We evaluate the energy efficiency, defined as

ξ T E ¯ = T T p 2 ( N + 1 ) P T Z [bit/s/Hz/J],

where E ¯ is the (average) energy required to transmit a packet from source to destination; T p is the transmission time of the packet, N is the mean number of cooperating nodes in a VAA (therefore, N+1 is the average size of a VAA).

ξ is related to the energy efficiency of the multi-hop V-MIMO system and represents the ratio between the average throughput obtainable and the energy spent for the transmission of a packet from source to destination through the Z hops. To evaluate E ¯ , we have assumed that the same amount of energy is necessary to transmit or receive a packet (this justifies the term 2 at the denominator of (19)); this assumption appears to be reasonable for many hardware platforms.c

5 Numerical results

Results are obtained by considering, if not otherwise specified, ρ=2·10−2m−2, σ N 2 =8·1 0 15 W, and M=4. We consider two different channel models for intra-VAA and inter-VAAs communication. In the former case, we set k0=41 dB, k1=13.03 (β=3), and Lth=70 dB; while in the case of the inter-VAA communication channel, we set k0=15 dB and we vary β (k1) for the inter-VAAs transmission (Lth is not fixed in this case, since we assume that the different VAAs are always connected). The signal-to-noise ratio (SNR) γ is defined as P 0 / σ N 2 , being P0 the averaged (over fading) useful receive power, which is given by PTdβ/k.

5.1 Performance of the th hop

In this section we evaluate the performance of the generic th hop, in terms of the complementary outage probability, P in ( ) =1 P out ( ) , where P out ( ) is given by (13), when considering the worst case that is a central link affected by the maximum number of interferers.

Figure 2 shows P in ( ) as a function of the requirement on the capacity, for different values of R, having set p=2, β=3 and γ=10 dB. Note that the number of transmit and receive antennas of the various hops is a discrete rv; as a consequence, the source-destination capacity is a discrete rv, too. This justifies the step-wise behavior of the curves. All curves show a similar behavior, with P in ( ) monotonically decreasing. P in ( ) increases for smaller R because the SNR is low (10 dB), and the system tends to be noise-limited. As a consequence, interference does not play a major role on the system performance and the behavior of the source-destination capacity mainly depends on the term 1/R (see (6)). Small values of R increase the amount of interference, but this is still negligible compared to thermal noise. On the contrary, the corresponding performance increases since the amount of radio resources available to each VAA link increases as R decreases. When the SNR is large, interference plays a more significant role with respect to noise. The latter behavior is shown in Figure 3, where γ=40 dB is considered. When the capacity threshold is low (approximatively lower than 2 bit/s/Hz), the term 1/R still dominates the behavior of C ̄ S,D , while for larger value of C0, an increase of R allows to decrease the level of interference at each link, resulting in better performance.

Figure 2
figure 2

P in ( ) as a function of C 0 , when γ=10 dB and β=3 .

Figure 3
figure 3

P in ( ) as a function ofC 0, whenγ=40 dB andβ=3.

Figure 4 compares the performance obtained with framed ALOHA to the case of a perfect centralized (deterministic) resource assignment, having set γ=10 dB, β=3, and p=2 in the case of FA. In the case of deterministic resource allocation, we assume that the resources are assigned to the VAAs in order to maximize the distance between two interfering VAAs. More specifically, when R=2, the links (−2), (), (+2) use the first resource and (−3), (−1), (+1) use the second one. As expected, for the values of outage probability of interest (i.e., P in ( ) 0.9), the centralized approach outperforms framed ALOHA. On the other hand, if the capacity requirement is very high, framed ALOHA can provide better performance, thanks to the randomness of the interfering VAAs. On the contrary, in the deterministic case when for example, in R=2, the one-hop distant VAA will interfere with probability equal to one.

Figure 4
figure 4

P in ( ) as a function ofC 0, whenγ=10 dB andβ=3.

Figure 5 shows P in ( ) against R for different values of the capacity requirement and γ, in the case of framed ALOHA with p=2, having set β=3. When C0is small, the optimum value of R is 2; on the other hand, when C0=10 bit/s/Hz, its performance is optimized by choosing R=5. This optimum value is a trade-off between the need of reducing the impact of interference and that of increasing the amount of radio resources to be used. As expected, the optimum R tends to become smaller by decreasing the SNR.

Figure 5
figure 5

P in ( ) as a function ofR whenβ=3, for framed ALOHA.

The impact of the value of p on the system performance is considered in Figure 6, where the complementary outage probability for the generic link, P in ( ) , is shown as a function of C0, when varying p and β. Other parameters are SNR =20 dB and R=2. By increasing β, the corresponding signal to interference ratio increases, as a consequence, the curve related to p=2 approaches the ones related to p=1. Note also that when p=1, P in ( l ) does not depend on β, being the interferer and as useful VAAs at the same distance from the receiver VAA (i.e., the signal to interference ratio does not depend on β). Finally, the curves are approximatively coincident when P in ( ) >0.9, which represents the zone of interest.

Figure 6
figure 6

P in ( ) as a function ofC 0 , whenR=2 andγ=20 dB.

5.2 Performance of the whole transmission chain

This section considers the whole transmission chain by investigating the behavior of the following metrics: (a) the exact overall complementary outage probability, Pin=1−Pout; (b) the approximated overall complementary outage probability, P in,A ( app ) =1 P out,A ( app ) ; and (c) the lower bound for the overall complementary outage probability, P in,B ( app ) =1 P out,B ( app ) .

The tightness of the approximations A and B is shown in Figure 7, where we compare the exact formula for Pin, obtained with (13), with the approximations P in , A ( app ) and P in , B ( app ) (evaluated using (12) and (16), respectively). Due to the computation complexity in evaluating Pingiven by (13), we set p=1 and Z=7; moreover, R=2 and β=3 are set. When the links are assumed to be independent (assumption is used to obtain approximations A and B), a lower complementary outage probability is obtained. This can be justified by observing that in such condition, there is a larger probability to find at least one link in outage. As expected, the curve obtained with approximation A is tighter than approximation B (which neglects border affects).

Figure 7
figure 7

P in and its approximations as a function of C 0 .

In Figure 8 we show the overall complementary outage probability, given by the approximated formulas, P in,A ( app ) and P in,B ( app ) , against Z for different values of C0, having set p=2, γ=20 dB, R=2, and β=3. We can note that the complementary outage probability decreases when Z gets larger and that the two approximations get closer when Z increases and/or C0 decreases.

Figure 8
figure 8

P in , A ( app ) and P in , B ( app ) as a function of Z, whenγ=20 dB and β=3.

In the following figures, we set β=4, p=2, and c n max =10bit/s/Hz, and we use the approximated formula P in,A ( app ) to compute T.

In Figure 9 and Figure 10 we show the average throughput, T, and the energy efficiency, ξ, as a function of the number of hops, Z, for different values of DSD> and R, respectively. In the figures we set P T=10 dBm and, once D SD is fixed, the SNR at the VAAs will change by varying Z: by increasing Z, the VAAs distance, d, decreases, resulting in a larger signal-to-noise ratio. Figure 9 shows that the average throughput presents a maximum, which can be explained as follows. For small values of Z, the system is noise-limited, whereas for larger Z the SNR increases and the system becomes interference-limited; hence, an increase of Z causes a decrease of the signal-to-interference ratio. In the case DSD=50 m and R=2, the maximum is not present because the system is mainly interference-limited (few slots are available in the frame, while the SNR is large also for small value of Z). Almost the same holds for the behavior of ξ. Compared to the average throughput case, here the maxima are reached for lower values of Z. This is due to the additional amount of energy spent when Z increases. This also explains the fact that there is no maximum when D SD=50 m.

Figure 9
figure 9

T as a function of Z, when p=2, for different value of D S D and R.

Figure 10
figure 10

ξ as a function of Z, when p=2, for different value of D S D and R.

Finally, ξ as a function of PT, for Z=4 and T p =1 ms and varying DSD, is illustrated in Figure 11. The curves present a maximum, meaning that once DSDand nodes density are fixed, there exists an optimum transmit power maximizing ξ. Such optimum is obtained when the trade-off between energy consumption and SNR is reached.

Figure 11
figure 11

ξ as a function of P T, when p=2 and Z=4, for different value of DSD.

6 Conclusions

A framed ALOHA multi-hop V-MIMO system is investigated. Random location of cooperating nodes as well as propagation environment are considered and their effects on the overall performance are evaluated. Several performance metrics are considered to assess the source-destination performance: outage probability, which is the probability that the capacity between source and destination is smaller than a given threshold, and energy efficiency. The proposed framework allows us to optimize different system parameters, such as the number of relays to be distributed between source and destination nodes, the number of radio resources, R, and the transmit power. Finally, we would underline that the presented framework could be easily extended to the case of other possible contention-based protocols, as carrier sense multiple access-based protocols by properly changing (9) based on the protocol considered.


a As discussed in [6], the use of other models is straightforward.

b Under such assumption, we neglect the correlation existing between the size of the receive VAA at the th link and the size of the transmit VAA at the (+1)th link. More specifically, two uncorrelated sets of cooperative nodes are chosen by each VAA for receive (from the previous VAA) and transmit (to the subsequent VAA) purposes.

c Through this definition, we do not account for the energy which is not radiated. Though this component is normally relevant, it would only affect ξ through a proper down-scaling. For the purpose of this paper, such down-scaling of the absolute value of ξ is not conceptually relevant.


  1. Foschini GJ: Layered space–time architecture for wireless communication in a fading environment when using multi-element antennas. Bell Labs Tech. J. 1996, 1(2):41-59.

    Article  Google Scholar 

  2. Telatar E: Capacity of multi-antenna Gaussian channels. Eur. Trans. Telecommun. 1999, 10(6):585-595. 10.1002/ett.4460100604

    Article  Google Scholar 

  3. Dohler M, Gkelias A, Aghvami H: Resource allocation for FDMA-based regenerative multi-hop links. IEEE Trans. Wireless Commun. 2004, 3: 1989-1993. 10.1109/TWC.2004.838406

    Article  Google Scholar 

  4. Dohler M, Gkelias A, Aghvami H: A resource allocation strategy for distributed MIMO multi-hop communication systems. IEEE Commun. Lett. 2004, 8: 99-101. 10.1109/LCOMM.2004.823425

    Article  Google Scholar 

  5. Zhang H, Dai H: On the capacity of distributed MIMO systems. In Proceedings of the Conference on Information Sciences and Systems, CISS 2004. Princeton University; March 2004:17-19.

    Google Scholar 

  6. Buratti C, Zanella A: Multi-hop virtual MIMO systems with channel reuse in a Poisson field of nodes. IEEE Trans. Veh. Technol. 2011, 60(5):2060-2069.

    Article  Google Scholar 

  7. Dowhuszko AA, Corral-Briones G, Hamalainen J, Wichman R: On throughput-fairness tradeoff in virtual MIMO systems with limited feedback. EURASIP J. Wireless Comm. Netw. 2009, (ID 102064): 17.

    Google Scholar 

  8. Jimenez V, Ribeiro C, Gameiro A, Armada G: Effects of channel estimation on multiuser virtual MIMO-OFDMA relay-based networks. Eurasip J. Wireless Comm. Netw. 2009, (ID 764784): 13.

    Google Scholar 

  9. Yuan Y, He Z, Chen M: Virtual MIMO-based cross-layer design for wireless sensor networks. IEEE Trans. Veh. Technol. 2006, 55: 856-864. 10.1109/TVT.2006.873837

    Article  Google Scholar 

  10. Li X: Energy efficient wireless sensor networks with transmission diversity. IEEE Electron. Lett 2003, 39: 1753-1755. 10.1049/el:20031103

    Article  Google Scholar 

  11. Cui S, Goldsmith AJ, Bahai A: Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks. IEEE J. Sel. Areas Commun. 2004, 22: 1089-1098. 10.1109/JSAC.2004.830916

    Article  Google Scholar 

  12. Jayaweera SK: Virtual MIMO-based cooperative communication for energy-constrained wireless sensor networks. IEEE Trans. Wireless Commun. 2006., 5(5):

  13. Deng W, Gao X: Three-hop cooperative diversity system and symbol error rate analysis. In Proceedings of International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS 2007). Huaqiao University, Xiamen,; 28 November to 1 December 2007.

    Google Scholar 

  14. Lang Y, Wubben D, Bockelmann C, Kammeyer KD: A closed power allocation solution for outage restricted distributed MIMO multi-hop networks. In Proceedings of the 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WIOPT 2008. Berlin; 1:65-70.

    Google Scholar 

  15. Renzo MD, Graziosi F, Santucci F: On the performance of CSI-assisted cooperative communications over generalized fading channels. Proceedings of IEEE of ICC Beijing, 19–23 May 2008 1001-1007.

    Google Scholar 

  16. Gharavi H, Hu B, Wu N: A design framework for high-density wireless ad-hoc networks achieving cooperative diversity. In Proceedings of IEEE ICC 2010. Cape Town,=; May 2010:23-27.

    Google Scholar 

  17. Coso AD, Spagnolini U, Ibars C: Cooperative distributed MIMO channels in wireless sensor networks. IEEE J. Sel. Areas Commun. 2007, 25: 402-414.

    Article  Google Scholar 

  18. Liang J, Liang Q: Channel selection in virtual MIMO wireless sensor networks. IEEE Trans. Veh. Technol. 2009, 58: 2249-2257.

    Article  Google Scholar 

  19. Bravos G, Kanatas AG: Energy efficiency comparison of MIMO-based and multihop sensor networks. Eurasip J. Wireless Comm. Netw. 2008., 732145:

    Google Scholar 

  20. Tsatsanis MK, Zhang R, Banerjee S: Network-assisted diversity for random access wireless networks. IEEE Trans. Signal Process. 2000, 48(3):702-711. 10.1109/78.824666

    Article  Google Scholar 

  21. Zhang R, Tsatsanis MK: Network-assisted diversity for random access in dispersive channels. IEEE Trans. Commun. 2002, 50(4):623-632. 10.1109/26.996077

    Article  Google Scholar 

  22. Lin R, Petropulu A: A new wireless network medium access protocol based on cooperation. IEEE Trans. Signal Process. 2005, 53(12):4675-4684.

    MathSciNet  Article  Google Scholar 

  23. Guo H, Hu H, Zhang Y, Chen HH: Adaptive space-time diversity Slotted ALOHA over 2×m MIMO multi-access channels. IEEE Trans. Veh. Technol. 2009, 58(7):3271-3282.

    Article  Google Scholar 

  24. Lin Y, Wong V: Cross-layer design of MIMO-enabled WLANs with network utility maximization. IEEE Trans. Veh. Technol. 2009, 58(5):2443-2456.

    Article  Google Scholar 

  25. Qian D, Zheng D, Zhang J, Shroff N: CSMA-Based distributed scheduling in multi-hop MIMO networks under SINR model. In Proceedings of IEEE INFOCOM 29th Annual Joint Conference. San Diego, CA; 1.

    Google Scholar 

  26. Martalò M, Buratti C, Ferrari G, Verdone R: Decentralized detection in IEEE 802.15.4 wireless sensor networks. EURASIP J. Wireless Commun. Netw. 2010., 2010(10):

  27. Martalò M, Buratti C, Ferrari G, Verdone R: Clustered IEEE 802.15.4 sensor networks with data aggregation: energy consumption and probability of error. IEEE Wireless Commun. Lett. 2013, 2: 71-74.

    Article  Google Scholar 

  28. Buratti C, Zanella A, Verdone R: On the capacity of slotted ALOHA-based multi-hop Virtual MIMO systems. In Proceedings of International Conference on Cognitive Radio Oriented Wireless Networks (CROWNCOM) 2010. Cannes; June 2010:9-11.

    Google Scholar 

  29. Buratti C, Zanella A, Verdone R: Throughput analysis of slotted ALOHA multiple hop systems with virtual antenna arrays. In Proceedings of Future Network and Mobile Summit (FUNEMS) 2010. Firenze, Italy; June 2010:16-18.

    Google Scholar 

  30. Horn RA, Johnson CR Cambridge University Press, Cambridge, 1st edn.; 1990.

  31. Cover TA, Thomas JA: Elements of Information Theory. Wiley, New York, 1st edn.; 1991.

    Book  Google Scholar 

  32. Kingman J Oxford University Press, Oxford,; 1993.

  33. Roberts LG: ALOHA packet system with and without slots and capture. ACM SIGCOMM Comput. Commun. 1975, 5(2):28-42. 10.1145/1024916.1024920

    Article  Google Scholar 

  34. Chiani M, Win MZ, Shin H: MIMO networks: the effects of interference. IEEE Trans. Inf. Theory 2010, 56: 336-349.

    MathSciNet  Article  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Chiara Buratti.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ original submitted files for images

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Buratti, C., Zanella, A. & Verdone, R. Performance analysis of multi-hop framed ALOHA systems with virtual antenna arrays. J Wireless Com Network 2013, 118 (2013).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI:


  • Time Slot
  • Outage Probability
  • MIMO System
  • Radio Resource
  • Average Throughput