By Topic

Recursive analysis of ad hoc networks with packet queueing, channel contention and hybrid ARQ

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Marco Levorato ; Department of Information Engineering, University of Padova, via Gradenigo 6/B, 35131 Italy ; Stefano Tomasin ; Michele Zorzi

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.

Published in:

Information Theory and Applications Workshop, 2008

Date of Conference:

Jan. 27 2008-Feb. 1 2008