Professional Documents
Culture Documents
Abstract--Cooperative wireless networks supporting multiple increases, while aggravating queuing delay at the relay nodes
services necessitate the application of a robust bandwidth gives rise to higher end-to-end transmission time [4]. Thus,
allocation policy to ensure Quality of Service (QoS) provision buffer traffic load in the cooperative nodes has a critical
to different applications. In this work, a load dependent impact on the network performance parameters such as
bandwidth allocation technique is presented considering traffic throughput, delay and jitter.
priority and buffer load in the relay nodes of a cooperative Data packets of different applications require distinct
communication network. An analytical approach for treatment by the network according to their Quality of
bandwidth sharing is provided along with a delay analysis, Service (QoS) characteristics and their priority. For example,
verifying that the proposed scheme can efficiently provide
critical emergency communications data calls should be
traffic differentiation, satisfying, also, the QoS requirements in
terms of bandwidth, packet transmission rate and delay. The
favoured during the resource allocation process, satisfying
results obtained by the analysis are validated via simulations, their QoS requirements. In this perspective, multiple services
confirming the improved network performance in terms of support in a cooperative wireless network should involve the
throughput and delay. development of an efficient resource allocation scheme in
conjunction with a prioritization mechanism for handling
Buffer load; delay; MAC; QoS; Simulation; Cooperative different traffic types. Appropriate techniques providing
wireless network access and efficient medium sharing are mandatory.
In recent literature, various Medium Access Control
I. INTRODUCTION (MAC) protocols for cooperative networks have been
presented. In [5], the CoopMac protocol has been introduced
Cooperative communications are based on the based on a set of new characteristics applied on the data and
improvement of the performance of a wireless network control plane of the well known IEEE 802.11 MAC protocol.
achieved by the cooperation among different nodes and the In [6], the relay enabled Distributed Coordination Function
adoption of spatial diversity [1, 2]. The cooperation among (rDCF) has been presented, which is based on the
nodes of a wireless communication system leads to improved accessibility of the relay nodes to forward data packets of
system capacity, optimal spectrum use and increase of other nodes. Furthermore, a new protocol called Cooperative
system reliability, since bit error rate and outage probabilities MAC (CMAC) has been proposed in [3]. CMAC exploits the
are decreased [1, 3]. In a cooperative relay communication spatial diversity of cooperative communications through a
system, each node transmits its own data and collaborates retransmission technique of partially correct frames that are
with other relay nodes, accepting and forwarding combined to reconstruct the initial one. The above protocols
appropriately packets received towards a destination node. are variants of the IEEE 802.11 MAC protocol, which has
Data packets arriving from other nodes are queued in the certain performance limitations in terms of bandwidth
relay buffers of each node. The overall system throughput sharing when applied to cooperative networks.
Qi (t ) z pi Li (t ) , (1) z p1 L1 (t ) cz p2 L2 (t ) . (3)
waiting time is equal to the average delay (d). Hence, for S1 = b - S2;
flow i it holds if ( S1 > L1 )
1 1 S1 = L1;
di
PGR 0 Li (t )dt
PGR 0 (Gi (t ) f i (t ))dt
(12)
}
1 ( PGR PTR ) L1 -= S1;
PGR 0
( ai t f i
'
( t )t ) dt .
2 PGR L2 -= S2;
} while <TERMINATION CONDITION>
III. MODEL VALIDATION AND ANALYSIS
The accuracy of the analysis presented is validated by the
To validate the proposed resource allocation technique an convergence of the simulation results to the analytical ones,
appropriate simulator has been developed in C#. In the as demonstrated in Fig. 1 for the PTRs ratio. Illustrative
performed simulations two priority levels have been numerical examples for variable number of operation cycles
considered. The actual PTR of ith buffer and the total are presented using different values for the ratio a1 a 2 and
number of bits transmitted considering all buffers are
denoted by Si and b , respectively. The number of bits priority levels ratio z p1 z p 2 . The values of the network
entering the first or the second buffer is denoted by a1 and parameters employed are: b 1000 , a 2 1000 , z 2 and
a 2 , respectively. The simulator operation is implemented p2 4 . Note that the continuous lines correspond to the
via consecutive allocation cycles as follows. simulation results, while dots are assigned to the results
obtained by the analytical formulas provided in Section II.
Simulation Loop for Bandwidth Allocation As demonstrated in Fig. 1, the PTRs ratio obtained by
do simulations has a slight divergence from the numerical
{ results, when a low number of simulation cycles is
L1 += a1; performed. However, when the number of cycles increases,
L2 += a2; an excellent agreement between both results is observed.
Q1 = Math.Pow( z, p1 ) * L1;
IV. NUMERICAL RESULTS AND DISCUSSION
Q2 = Math.Pow( z, p2 ) * L2;
normQ1 = Q1 / (Q1 + Q2); Numerical results for two cooperative network scenarios
normQ2 = Q2 / (Q1 + Q2); are presented in this section, employing the proposed
S1 = normQ1 * b; bandwidth allocation technique. The examined cooperative
S2 = normQ2 * b; network involves source nodes which communicate with an
if ( S1 > L1 ) out of range destination node through intermediate relay
{ nodes. A traffic flow of different priority and rate is
generated from each source node and their packets are
S1 = L1;
buffered in the respective relay nodes before their
S2 = b - S1; transmission to the destination. The respective packet buffers
if ( S2 > L2 ) are considered to have infinite capacity, which is a common
S2 = L2; assumption when analyzing related queuing schemes [9].
} The presented evaluation scenario examines the resource
else if ( S2 > L2 ) allocation among the relay nodes when they share a common
{ medium to communicate with the destination node.
S2 = L2;