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
Probabilistic Cooperation of a Full-Duplex Relay in Random Access Networks
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
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
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
2017 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 5, p. 7394-7404Article in journal (Refereed) Published
Abstract [en]

In this paper, we analyze the probabilistic cooperation of a full-duplex relay in a multiuser random-access network. The relay is equipped with on/off modes for the receiver and the transmitter independently. These modes are modeled as probabilities by which the receiver and the transmitter are activated. We provide analytical expressions for the performance of the relay queue, such as arrival and service rates, stability conditions, and the average queue size. We optimize the relays operation setup to maximize the network-wide throughput while, simultaneously, we keep the relays queue stable and lower the relays receptions and transmissions. Furthermore, we study the effect of the SINR threshold and the self-interference coefficient on the per-user and network-wide throughput. For low SINR threshold, we show under which circumstances it is beneficial to switch off the relay completely, or switch off the relays receiver only.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2017. Vol. 5, p. 7394-7404
Keywords [en]
Cooperative communication; relays; relay networks; multiaccess communication; multiple access interference; internet of things (IoT); internet; wireless sensor networks (WSNs); body sensor networks (BSNs)
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:liu:diva-139423DOI: 10.1109/ACCESS.2016.2642540ISI: 000403140800053OAI: oai:DiVA.org:liu-139423DiVA, id: diva2:1129802
Note

Funding Agencies|European Union [609094, 612361]

Available from: 2017-08-07 Created: 2017-08-07 Last updated: 2019-11-08
In thesis
1. IoT Networking Resource Allocation and Cooperation
Open this publication in new window or tab >>IoT Networking Resource Allocation and Cooperation
2017 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

The Internet of Things (IoT) promises that "anything that can be connected, will be connected". It comprises of Information and Communication Technologies that interconnect billions of physical and visual things with some "basic" intelligence. The emerging IoT services will be able to react with minimal human intervention and further contribute to the big data era that requires real-time, ultrareliable, ubiquitous, scalable, and heterogeneous operation.

This thesis is the result of our investigations on problems dealing with the evolution of such technologies. First, we explore the potential of using relay i.e., intermediate, nodes that assist users to transmit their packets in a a cellular network. Paper I provides insights into how adapting the cooperation of the relay's receiver and transmitter optimizes the network-wide throughput while the relay's queue stability is guaranteed.

The next part of the thesis copes with the resource allocation of services on IoT devices equipped with multiple network interfaces. The resources are heterogeneous and can be split among dierent interfaces. Additionally, they are not interchangeable. In paper II, we develop optimization models for this resource allocation problem, prove the complexity of the models, and derive results that give intuition into the problems. Moreover, we propose algorithms that approximate the optimal solution and show under which circumstances this is possible.

Finally, in paper III, we present a resource allocation problem specically for smart cities services. In comparison to the previous problem denition, resources are of one type but the IoT network device can oer capacities that vary over time. Furthermore, services have a tolerance regarding their preferred scheduling, namely, their allocation over time. We parametrize each service with a pricing function to indicate its tolerance to be served at the beginning of the scheduling window. We prove that the problem is computationally hard and provide numerical results to gain insight into how different pricing weight functions impact the allocations' distribution within the scheduling window.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2017. p. 20
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1785
National Category
Communication Systems Telecommunications Computer Engineering Computer Sciences Computer Systems
Identifiers
urn:nbn:se:liu:diva-139891 (URN)LiU-TEK-LIC-2017 (Local ID)9789176854617 (ISBN)LiU-TEK-LIC-2017 (Archive number)LiU-TEK-LIC-2017 (OAI)
Supervisors
Funder
EU, FP7, Seventh Framework Programme, FP7/2007-2013: Grant 609094 (RERUM), 612361 (SOrBet), 324515 (MESH-WISE), 645705 (DECADE), 318992 (WINDOW)
Available from: 2017-08-21 Created: 2017-08-21 Last updated: 2019-05-09Bibliographically approved
2. Cooperation and Resource Allocation in Wireless Networking towards the IoT
Open this publication in new window or tab >>Cooperation and Resource Allocation in Wireless Networking towards the IoT
2019 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The Internet of Things (IoT) should be able to react with minimal human intervention and contribute to the Artificial Intelligence (AI) era requiring real-time and scalable operation under heterogeneous network infrastructures. This thesis investigates how cooperation and allocation of resources can contribute to the evolution of future wireless networks supporting the IoT.

First, we examine how to allocate resources to IoT services which run on devices equipped with multiple network interfaces. The resources are heterogeneous and not interchangeable, and their allocation to a service can be split among different interfaces. We formulate an optimization model for this allocation problem, prove its complexity, and derive two heuristic algorithms to approximate the solution in large instances of the problem.

The concept of virtualization is promising towards addressing the heterogeneity of IoT resources by providing an abstraction layer between software and hardware. Network function virtualization (NFV) decouples traditional network operations such a routing from proprietary hardware platforms and implements them as software entities known as virtualized network functions (VNFs). In the second paper, we study how VNF demands can be allocated to Virtual Machines (VMs) by considering the completion-time tolerance of the VNFs. We prove that the problem is NP-complete and devise a subgradient optimization algorithm to provide near-optimal solutions. Our numerical results demonstrate the effectiveness of our algorithm compared to two benchmark algorithms.

Furthermore, we explore the potential of using intermediate nodes, the so-called relays, in IoT networks. In the third paper, we study a multi-user random-access network with a relay node assisting users in transmitting their packets to a destination node. We provide analytical expressions for the performance of the relay's queue and the system throughput. We optimize the relay’s operation parameters to maximize the network-wide throughput while maintaining the relay's queue stability. A stable queue at relay guarantees finite delay for the packets. Furthermore, we study the effect of the wireless links' signal-to-interference-plusnoise ratio (SINR) threshold and the self-interference (SI) cancellation on the per-user and network-wide throughput.

Additionally, caching at the network edge has recently emerged as an encouraging solution to offload cellular traffic and improve several performance metrics of the network such as throughput, delay and energy efficiency. In the fourth paper, we study a wireless network that serves two types of traffic: cacheable and non-cacheable traffic. In the considered system, a wireless user with cache storage requests cacheable content from a data center connected with a wireless base station. The user can be assisted by a pair of wireless helpers that exchange non-cacheable content as well. We devise the system throughput and the delay experienced by the user and provide numerical results that demonstrate how they are affected by the non-cacheable packet arrivals, the availability of caching helpers, the parameters of the caches, and the request rate of the user.

Finally, in the last paper, we consider a time-slotted wireless system that serves both cacheable and non-cacheable traffic with the assistance of a relay node. The latter has storage capabilities to serve both types of traffic. We investigate how allocating the storage capacity to cacheable and non-cacheable traffic affects the system throughput. Our numerical results provide useful insights into the system throughput e.g., that it is not necessarily beneficial to increase the storage capacity for the non-cacheable traffic to realize better throughput at the non-cacheable destination node.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2019. p. 42
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 2016
National Category
Communication Systems
Identifiers
urn:nbn:se:liu:diva-161732 (URN)10.3384/diss.diva-161732 (DOI)9789175190044 (ISBN)
Public defence
2019-12-03, K3, Kåkenhus, Campus Norrköping, Norrköping, 13:15 (English)
Opponent
Supervisors
Available from: 2019-11-08 Created: 2019-11-08 Last updated: 2019-11-08Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Avgouleas, IoannisPappas, NikolaosYuan, DiAngelakis, Vangelis
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
In the same journal
IEEE Access
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 186 hits
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