The University of Southampton
University of Southampton Institutional Repository

Throughput Analysis of Stop-and-Wait Automatic Repeat Request Scheme for Network Coding Nodes

Throughput Analysis of Stop-and-Wait Automatic Repeat Request Scheme for Network Coding Nodes
Throughput Analysis of Stop-and-Wait Automatic Repeat Request Scheme for Network Coding Nodes
This contribution analyzes the steady-state throughput of general network coding nodes, when data is transmitted based on stop-and-wait automatic repeat request (SW-ARQ) scheme. The state transition of network coding nodes employing SW-ARQ is analyzed, which shows that the operations of network coding nodes can be modelled by a finite state machine. Therefore, the throughput expressions of general network coding nodes can be derived based on the properties of finite state machines. Furthermore, the throughput performance of network coding nodes is investigated either by simulations or by evaluation of the expressions obtained. It can be shown that the simulation results converge closely to the numerical results and justify the effectiveness of our analytical expressions obtained.
Qin, Yang
878d3de3-2ab5-401f-a5fd-eaaed7188abf
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Qin, Yang
878d3de3-2ab5-401f-a5fd-eaaed7188abf
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7

Qin, Yang and Yang, Lie-Liang (2010) Throughput Analysis of Stop-and-Wait Automatic Repeat Request Scheme for Network Coding Nodes. IEEE VTC2010 Spring, Taipei, Taiwan. 15 - 18 May 2010.

Record type: Conference or Workshop Item (Paper)

Abstract

This contribution analyzes the steady-state throughput of general network coding nodes, when data is transmitted based on stop-and-wait automatic repeat request (SW-ARQ) scheme. The state transition of network coding nodes employing SW-ARQ is analyzed, which shows that the operations of network coding nodes can be modelled by a finite state machine. Therefore, the throughput expressions of general network coding nodes can be derived based on the properties of finite state machines. Furthermore, the throughput performance of network coding nodes is investigated either by simulations or by evaluation of the expressions obtained. It can be shown that the simulation results converge closely to the numerical results and justify the effectiveness of our analytical expressions obtained.

Text
05494088.pdf - Version of Record
Download (510kB)

More information

Published date: May 2010
Additional Information: Event Dates: 16-19 May 2010
Venue - Dates: IEEE VTC2010 Spring, Taipei, Taiwan, 2010-05-15 - 2010-05-18
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 272637
URI: http://eprints.soton.ac.uk/id/eprint/272637
PURE UUID: dce4197a-0a21-4c7c-a037-783320ba81a6
ORCID for Lie-Liang Yang: ORCID iD orcid.org/0000-0002-2032-9327

Catalogue record

Date deposited: 05 Aug 2011 16:36
Last modified: 30 Sep 2020 01:33

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×