liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
1 - 7 av 7
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Angelakis, Vangelis
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Avgouleas, Ioannis
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Pappas, Nikolaos
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Yuan, Di
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Flexible allocation of heterogeneous resources to services on an IoT device2015Ingår i: 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Institute of Electrical and Electronics Engineers (IEEE), 2015, s. 99-100Konferensbidrag (Refereegranskat)
    Abstract [en]

    In the Internet of Things (IoT), devices and gateways may be equipped with multiple, heterogeneous network interfaces which should be utilized by a large number of services. In this work, we model the problem of assigning services' resource demands to a device's heterogeneous interfaces and give a Mixed Integer Linear Program (MILP) formulation for it. For meaningful instance sizes the MILP model gives optimal solutions to the presented computationally-hard problem. We provide insightful results discussing the properties of the results on the properties of the derived solutions with respect to the splitting of services to different interfaces.

  • 2.
    Avgouleas, Ioannis
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    IoT Networking Resource Allocation and Cooperation2017Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    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.

    Delarbeten
    1. Probabilistic Cooperation of a Full-Duplex Relay in Random Access Networks
    Öppna denna publikation i ny flik eller fönster >>Probabilistic Cooperation of a Full-Duplex Relay in Random Access Networks
    2017 (Engelska)Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 5, s. 7394-7404Artikel i tidskrift (Refereegranskat) 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.

    Ort, förlag, år, upplaga, sidor
    IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2017
    Nyckelord
    Cooperative communication; relays; relay networks; multiaccess communication; multiple access interference; internet of things (IoT); internet; wireless sensor networks (WSNs); body sensor networks (BSNs)
    Nationell ämneskategori
    Datorsystem
    Identifikatorer
    urn:nbn:se:liu:diva-139423 (URN)10.1109/ACCESS.2016.2642540 (DOI)000403140800053 ()
    Anmärkning

    Funding Agencies|European Union [609094, 612361]

    Tillgänglig från: 2017-08-07 Skapad: 2017-08-07 Senast uppdaterad: 2019-11-08
    2. Allocation of Heterogeneous Resources of an IoT Device to Flexible Services
    Öppna denna publikation i ny flik eller fönster >>Allocation of Heterogeneous Resources of an IoT Device to Flexible Services
    Visa övriga...
    2016 (Engelska)Ingår i: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 3, nr 5, s. 691-700Artikel i tidskrift (Refereegranskat) Published
    Abstract [en]

    Internet-of-Things (IoT) devices can be equipped with multiple heterogeneous network interfaces. An overwhelmingly large amount of services may demand some or all of these interfaces available resources. Herein, we present a precise mathematical formulation of assigning services to interfaces with heterogeneous resources in one or more rounds. For reasonable instance sizes, the presented formulation produces optimal solutions for this computationally hard problem. We prove the NP-completeness of the problem and develop two algorithms to approximate the optimal solution for big instance sizes. The first algorithm allocates the most demanding service requirements first, considering the average cost of interfaces resources. The second one calculates the demanding resource shares and allocates the most demanding of them first by choosing randomly among equally demanding shares. Finally, we provide simulation results giving insight into services splitting over different interfaces for both cases.

    Ort, förlag, år, upplaga, sidor
    Institute of Electrical and Electronics Engineers (IEEE), 2016
    Nyckelord
    Internet of Things (IoT); mixed integer linear programming; network interfaces; optimization; resource management; scheduling algorithms
    Nationell ämneskategori
    Kommunikationssystem
    Identifikatorer
    urn:nbn:se:liu:diva-135000 (URN)10.1109/JIOT.2016.2535163 (DOI)000393047800006 ()
    Anmärkning

    Funding Agencies|Excellence Center at Linkoping-Lund in Information Technology; European Union [324515, 612316, 609094]

    Tillgänglig från: 2017-03-06 Skapad: 2017-03-06 Senast uppdaterad: 2019-11-08Bibliografiskt granskad
  • 3.
    Avgouleas, Ioannis
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Angelakis, Vangelis
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Pappas, Nikolaos
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Utilizing multiple full-duplex relays in wireless systems with multiple packet reception2014Ingår i: 2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), IEEE, 2014, s. 193-197Konferensbidrag (Refereegranskat)
    Abstract [en]

    Relay nodes with physical layer cooperation have been used extensively to assist users' transmissions in wireless networks. This network level cooperation has been lately been gaining popularity and analytical expressions of the performance of a network with up to two relay nodes exist in recent literature. In this work, we give simulation results outlining the potential network level benefits of using multiple full-duplex relay nodes. We examine configurations where multiple full-duplex transceivers offer consistent improvement and provide guidelines on using them different network conditions.

  • 4.
    Avgouleas, Ioannis M.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Cooperation and Resource Allocation in Wireless Networking towards the IoT2019Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    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.

    Delarbeten
    1. Allocation of Heterogeneous Resources of an IoT Device to Flexible Services
    Öppna denna publikation i ny flik eller fönster >>Allocation of Heterogeneous Resources of an IoT Device to Flexible Services
    Visa övriga...
    2016 (Engelska)Ingår i: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 3, nr 5, s. 691-700Artikel i tidskrift (Refereegranskat) Published
    Abstract [en]

    Internet-of-Things (IoT) devices can be equipped with multiple heterogeneous network interfaces. An overwhelmingly large amount of services may demand some or all of these interfaces available resources. Herein, we present a precise mathematical formulation of assigning services to interfaces with heterogeneous resources in one or more rounds. For reasonable instance sizes, the presented formulation produces optimal solutions for this computationally hard problem. We prove the NP-completeness of the problem and develop two algorithms to approximate the optimal solution for big instance sizes. The first algorithm allocates the most demanding service requirements first, considering the average cost of interfaces resources. The second one calculates the demanding resource shares and allocates the most demanding of them first by choosing randomly among equally demanding shares. Finally, we provide simulation results giving insight into services splitting over different interfaces for both cases.

    Ort, förlag, år, upplaga, sidor
    Institute of Electrical and Electronics Engineers (IEEE), 2016
    Nyckelord
    Internet of Things (IoT); mixed integer linear programming; network interfaces; optimization; resource management; scheduling algorithms
    Nationell ämneskategori
    Kommunikationssystem
    Identifikatorer
    urn:nbn:se:liu:diva-135000 (URN)10.1109/JIOT.2016.2535163 (DOI)000393047800006 ()
    Anmärkning

    Funding Agencies|Excellence Center at Linkoping-Lund in Information Technology; European Union [324515, 612316, 609094]

    Tillgänglig från: 2017-03-06 Skapad: 2017-03-06 Senast uppdaterad: 2019-11-08Bibliografiskt granskad
    2. Virtual Network Functions Scheduling under Delay-Weighted Pricing
    Öppna denna publikation i ny flik eller fönster >>Virtual Network Functions Scheduling under Delay-Weighted Pricing
    2019 (Engelska)Ingår i: IEEE Networking Letters, E-ISSN 2576-3156, s. 1-1Artikel i tidskrift (Refereegranskat) Epub ahead of print
    Abstract [en]

    We consider a cost minimization problem for High Volume Servers (HVS) equipped with Virtual Machines (VMs) to serve Virtual Network Functions (VNF) demands for resources. Given a scheduling period, a central scheduler decides which VM to use for each VNF demand. Each VM can be activated or disabled with different costs. Each VNF has a delay-weighted pricing function to indicate its completion time tolerance. We prove the NP-completeness of the problem and develop an algorithm based on Lagrangian relaxation and subgradient optimization to deal with this computational complexity. Finally, our numerical results demonstrate our algorithm’s effectiveness compared to two benchmarks.

    Nyckelord
    Optimization, Linear programming, Resource management, Pricing, Network function virtualization, Complexity theory, Servers
    Nationell ämneskategori
    Datorteknik
    Identifikatorer
    urn:nbn:se:liu:diva-161731 (URN)10.1109/LNET.2019.2937237 (DOI)
    Tillgänglig från: 2019-11-08 Skapad: 2019-11-08 Senast uppdaterad: 2019-11-08Bibliografiskt granskad
    3. Probabilistic Cooperation of a Full-Duplex Relay in Random Access Networks
    Öppna denna publikation i ny flik eller fönster >>Probabilistic Cooperation of a Full-Duplex Relay in Random Access Networks
    2017 (Engelska)Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 5, s. 7394-7404Artikel i tidskrift (Refereegranskat) 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.

    Ort, förlag, år, upplaga, sidor
    IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2017
    Nyckelord
    Cooperative communication; relays; relay networks; multiaccess communication; multiple access interference; internet of things (IoT); internet; wireless sensor networks (WSNs); body sensor networks (BSNs)
    Nationell ämneskategori
    Datorsystem
    Identifikatorer
    urn:nbn:se:liu:diva-139423 (URN)10.1109/ACCESS.2016.2642540 (DOI)000403140800053 ()
    Anmärkning

    Funding Agencies|European Union [609094, 612361]

    Tillgänglig från: 2017-08-07 Skapad: 2017-08-07 Senast uppdaterad: 2019-11-08
  • 5.
    Avgouleas, Ioannis
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Pappas, Nikolaos
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Angelakis, Vangelis
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Cooperative Wireless Networking with Probabilistic On/Off Relaying2015Ingår i: 2015 IEEE 81ST VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), IEEE , 2015Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this work, we investigate the operation of energy efficient relay nodes assisting the transmission of packets from a number of users to a destination node. We study the impact of switching randomly a fraction of the relays on and off to the aggregate throughput, the average queue size and delay per packet of systems with relays transmitting in either Full-or Half-Duplex mode and under different channel transmissions characteristics. Furthermore, we prove analytically and illustrate via simulation means how these network metrics are affected.

  • 6.
    Avgouleas, Ioannis
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Pappas, Nikolaos
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Angelakis, Vangelis
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Scheduling Services on an IoT Device Under Time-Weighted Pricing2017Ingår i: Conference Proceedings IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC): Workshop on "Communications for Networked Smart Cities", IEEE conference proceedings, 2017, s. 1-5Konferensbidrag (Refereegranskat)
    Abstract [en]

    The emerging vision of smart cities necessitates the use of Internet of Things (IoT) network devices to implement sustainable solutions that will improve the operations of urban areas. A massive amount of smart cities services may demand allocation of computational resources, such as processing power or storage, that IoT devices offer. Within this context, we present an IoT network device comprising interfaces with one specific computational resource available. The efficient utilization of available IoT resources would improve the Quality of Service (QoS) of the IoT network that serves the smart city. All resource allocations must be completed within a given scheduling window and every service is parametrized by a pricing weight function to indicate its tolerance to be served at the beginning of the scheduling window. We propose a mathematical optimization formulation to minimize the total cost of allocating all demands within the scheduling window considering the tolerance level of each service at the same time. Moreover, we prove that the problem is computationally hard and we provide numerical results to gain insight into the impact of different pricing weight functions on the allocations’ distribution within the scheduling window.

  • 7.
    Avgouleas, Ioannis
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Yuan, Di
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Pappas, Nikolaos
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Angelakis, Vangelis
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Virtual Network Functions Scheduling under Delay-Weighted Pricing2019Ingår i: IEEE Networking Letters, E-ISSN 2576-3156, s. 1-1Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We consider a cost minimization problem for High Volume Servers (HVS) equipped with Virtual Machines (VMs) to serve Virtual Network Functions (VNF) demands for resources. Given a scheduling period, a central scheduler decides which VM to use for each VNF demand. Each VM can be activated or disabled with different costs. Each VNF has a delay-weighted pricing function to indicate its completion time tolerance. We prove the NP-completeness of the problem and develop an algorithm based on Lagrangian relaxation and subgradient optimization to deal with this computational complexity. Finally, our numerical results demonstrate our algorithm’s effectiveness compared to two benchmarks.

1 - 7 av 7
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf