• English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • français 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Ouvrir une session
Voir le document 
  •   Accueil de DSpace
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • Voir le document
  •   Accueil de DSpace
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • Voir le document
JavaScript is disabled for your browser. Some features of this site may not work without it.
Tout DSpace
  • Communautés & Collections
  • Par date de publication
  • Auteurs
  • Titres
  • Sujets

Optimal selfishness-aware device-assisted content delivery in cellular networks

Thumbnail
Auteur
Poularakis K., Tassiulas L.
Date
2016
Language
en
DOI
10.1109/WCNC.2014.6952686
Sujet
Energy utilization
Polynomial approximation
Wireless networks
Cellular network
Cellular operators
Device-to-Device communications
Limited capacity
Matching problems
Mobile data offloading
Performance benefits
Routing problems
Mobile telecommunication systems
Institute of Electrical and Electronics Engineers Inc.
Afficher la notice complète
Résumé
Utilization of device-to-device communication links provides an alternative way for mitigating the skyrocketing mobile data growth that challenges cellular operators nowadays. Namely, the owners of these devices can serve requests of their neighbors for the files that are stored at their caches. However, users are unwilling in general to serve requests of others, since data transmission incurs energy consumption. The issue is further perplexed, if one considers realistic parameters such as the limited capacity of the device's battery. In this work, we explicitly take into account the above aspects and formulate the content request routing problem aiming to minimize the load of the macrocellular base station. This problem is challenging to solve due to its discrete nature. We derive an optimal polynomial-time solution based on a reduction to a matching problem. Besides, we present a light-weight distributed algorithm for its solution. Simulation results reveal the performance benefits of our approach. © 2014 IEEE.
URI
http://hdl.handle.net/11615/78330
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [19735]
htmlmap 

 

Parcourir

Tout DSpaceCommunautés & CollectionsPar date de publicationAuteursTitresSujetsCette collectionPar date de publicationAuteursTitresSujets

Mon compte

Ouvrir une sessionS'inscrire
Help Contact
DepositionAboutHelpContactez-nous
Choose LanguageTout DSpace
EnglishΕλληνικά
htmlmap