liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Performance analysis of a cooperative wireless network with adaptive relays
Univ Patras, Greece.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-4416-7702
2019 (English)In: Ad hoc networks, ISSN 1570-8705, E-ISSN 1570-8713, Vol. 87, p. 157-173Article in journal (Refereed) Published
Abstract [en]

In this work, we investigate a slotted-time relay assisted cooperative random access wireless network with multipacket (MPR) reception capabilities. MPR refers to the capability of a wireless node to successfully receive packets from more than two other modes that transmit simultaneously at the same slot. We consider a network of N saturated sources that transmit packets to a common destination node with the cooperation of two infinite capacity relay nodes. The relays assist the sources by forwarding the packets that failed to reach the destination. Moreover, the relays have also packets of their own to transmit to the destination. We further assume that the relays employ a state-dependent retransmission control mechanism. In particular, a relay node accordingly adapts its transmission probability based on the status of the other relay. Such a protocol is towards self-aware networks and leads to substantial performance gains in terms of delay. We investigate the stability region and the throughput performance for the full MPR model. Moreover, for the asymmetric two-sources, two-relay case we derive the generating function of the stationary joint queue-length distribution with the aid of the theory of boundary value problems. For the symmetric case, we obtain explicit expressions for the average queueing delay in a relay node without solving a boundary value problem. Extensive numerical examples are presented and provide insights on the system performance. (C) 2018 Elsevier B.V. All rights reserved.

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2019. Vol. 87, p. 157-173
Keywords [en]
Queueing analysis; Adaptive transmissions; Random-access; Multi-packet reception; Boundary value problem; Delay analysis; Throughput
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:liu:diva-156929DOI: 10.1016/j.adhoc.2018.12.007ISI: 000464089100012OAI: oai:DiVA.org:liu-156929DiVA, id: diva2:1318697
Available from: 2019-05-28 Created: 2019-05-28 Last updated: 2019-05-28

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Pappas, Nikolaos
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
In the same journal
Ad hoc networks
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf