Title :
Recursive analysis of ad hoc networks with packet queueing, channel contention and hybrid ARQ
Author :
Levorato, Marco ; Tomasin, Stefano ; Zorzi, Michele
Author_Institution :
Dept. of Inf. Eng., Univ. of Padova, Padova
fDate :
Jan. 27 2008-Feb. 1 2008
Abstract :
In this paper we present a recursive algorithm to compute some important performance metrics for wireless networks, such as throughput, channel occupancy, average number of packets in the queue and service time. Our model comprises packet queuing, channel access contention, backoff and hybrid automatic retransmission request (HARQ) error control. The analysis is carried out recursively to reduce the computational complexity and makes use of semi-Markov processes and renewal theory. We present results showing that the proposed model is able to accurately predict the aforementioned metrics even for networks with many nodes, where traditional analysis requires infeasible complexity to account for the overall network status.
Keywords :
Markov processes; ad hoc networks; automatic repeat request; computational complexity; queueing theory; wireless channels; ad hoc networks; channel access contention; computational complexity; hybrid ARQ; hybrid automatic retransmission request error control; packet queueing; performance metrics; recursive analysis; renewal theory; semi-Markov processes; wireless networks; Ad hoc networks; Automatic repeat request; Computational complexity; Computer networks; Error correction; Measurement; Predictive models; Queueing analysis; Throughput; Wireless networks;
Conference_Titel :
Information Theory and Applications Workshop, 2008
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-2670-6
DOI :
10.1109/ITA.2008.4601098