Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.2052
DC FieldValueLanguage
dc.contributor.authorUdugama, Asanga-
dc.contributor.authorDede, Jens-
dc.contributor.authorFörster, Anna-
dc.contributor.authorKuppusamy, Vishnupriya-
dc.contributor.authorKuladinithi, Koojana-
dc.contributor.authorTimm-Giel, Andreas-
dc.contributor.authorVatandas, Zeynep-
dc.date.accessioned2019-02-26T06:28:36Z-
dc.date.available2019-02-26T06:28:36Z-
dc.date.issued2019-01-29-
dc.identifier.citationFuture Internet 2 (11): 29 (2019-01-29)de_DE
dc.identifier.issn1999-5903de_DE
dc.identifier.urihttp://hdl.handle.net/11420/2056-
dc.description.abstractOpportunistic networks have recently seen increasing interest in the networking community. They can serve a range of application scenarios, most of them being destination-less, i.e., without a-priori knowledge of who is the final destination of a message. In this paper, we explore the usage of data popularity for improving the efficiency of data forwarding in opportunistic networks. Whether a message will become popular or not is not known before disseminating it to users. Thus, popularity needs to be estimated in a distributed manner considering a local context. We propose KEETCHI, a data forwarding protocol based on Q-Learning to give more preference to popular data rather than less popular data. Our extensive simulation comparison between KEETCHI and the well known EPIDEMIC protocol shows that the network overhead of data forwarding can be significantly reduced while keeping the delivery rate the same.en
dc.language.isoende_DE
dc.publisherMDPIde_DE
dc.relation.ispartofFuture Internetde_DE
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.subjectopportunistic networkingde_DE
dc.subjectpopularityde_DE
dc.subjectOMNeT++de_DE
dc.subjectOPSde_DE
dc.subjectorganic data disseminationde_DE
dc.subjectKeetchide_DE
dc.subjectEpidemicde_DE
dc.subject.ddc380: Handel, Kommunikation, Verkehrde_DE
dc.subject.ddc600: Technikde_DE
dc.titleMy smartphone tattles: considering popularity of messages in opportunistic data disseminationde_DE
dc.typeArticlede_DE
dc.identifier.urnurn:nbn:de:gbv:830-882.027179-
dc.identifier.doi10.15480/882.2052-
dc.type.diniarticle-
dc.subject.ddccode600-
dc.subject.ddccode380-
dcterms.DCMITypeText-
tuhh.identifier.urnurn:nbn:de:gbv:830-882.027179-
tuhh.oai.showtruede_DE
tuhh.abstract.englishOpportunistic networks have recently seen increasing interest in the networking community. They can serve a range of application scenarios, most of them being destination-less, i.e., without a-priori knowledge of who is the final destination of a message. In this paper, we explore the usage of data popularity for improving the efficiency of data forwarding in opportunistic networks. Whether a message will become popular or not is not known before disseminating it to users. Thus, popularity needs to be estimated in a distributed manner considering a local context. We propose KEETCHI, a data forwarding protocol based on Q-Learning to give more preference to popular data rather than less popular data. Our extensive simulation comparison between KEETCHI and the well known EPIDEMIC protocol shows that the network overhead of data forwarding can be significantly reduced while keeping the delivery rate the same.de_DE
tuhh.publisher.doi10.3390/fi11020029-
tuhh.publication.instituteKommunikationsnetze E-4de_DE
tuhh.identifier.doi10.15480/882.2052-
tuhh.type.opus(wissenschaftlicher) Artikel-
tuhh.institute.germanKommunikationsnetze E-4de
tuhh.institute.englishKommunikationsnetze E-4de_DE
tuhh.gvk.hasppnfalse-
openaire.rightsinfo:eu-repo/semantics/openAccessde_DE
dc.type.driverarticle-
dc.rights.ccbyde_DE
dc.rights.ccversion4.0de_DE
dc.type.casraiJournal Article-
tuhh.container.issue2de_DE
tuhh.container.volume11de_DE
tuhh.container.startpageArt.-Nr. 29de_DE
dc.relation.projectOpportunistic Networks-
dc.rights.nationallicensefalsede_DE
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.creatorGNDUdugama, Asanga-
item.creatorGNDDede, Jens-
item.creatorGNDFörster, Anna-
item.creatorGNDKuppusamy, Vishnupriya-
item.creatorGNDKuladinithi, Koojana-
item.creatorGNDTimm-Giel, Andreas-
item.creatorGNDVatandas, Zeynep-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.creatorOrcidUdugama, Asanga-
item.creatorOrcidDede, Jens-
item.creatorOrcidFörster, Anna-
item.creatorOrcidKuppusamy, Vishnupriya-
item.creatorOrcidKuladinithi, Koojana-
item.creatorOrcidTimm-Giel, Andreas-
item.creatorOrcidVatandas, Zeynep-
item.openairetypeArticle-
item.grantfulltextopen-
crisitem.author.deptKommunikationsnetze E-4-
crisitem.author.deptKommunikationsnetze E-4-
crisitem.author.deptKommunikationsnetze E-4-
crisitem.author.orcid0000-0001-8159-5146-
crisitem.author.orcid0000-0002-8422-265X-
crisitem.author.orcid0000-0001-5755-2672-
crisitem.author.orcid0000-0002-8583-7648-
crisitem.author.orcid0000-0001-6083-4048-
crisitem.author.orcid0000-0002-5998-6113-
crisitem.author.orcid0000-0001-5047-1175-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications with fulltext
Files in This Item:
File Description SizeFormat
futureinternet-11-00029.pdfVerlags-PDF3,24 MBAdobe PDFThumbnail
View/Open
Show simple item record

Page view(s)

204
Last Week
0
Last month
3
checked on Jul 6, 2020

Download(s)

129
checked on Jul 6, 2020

Google ScholarTM

Check

Note about this record

Export

This item is licensed under a Creative Commons License Creative Commons