du.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • 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
Community-based message opportunistic transmission
Högskolan Dalarna, Akademin Industri och samhälle, Informatik.ORCID-id: 0000-0003-3681-8173
Nanchang Hangkong University.
Nanchang Hangkong University.
Nanchang Hangkong University.
Visa övriga samt affilieringar
2016 (Engelska)Ingår i: Transforming Healthcare Through Information Systems: Proceedings of the 24th International Conference on Information Systems Development, 2016, Vol. 17, s. 79-93Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Mobile Social Networks (MSNs) is a kind of opportunistic networks, which is composed of a large number of mobile nodes with social characteristic. Up to now, the prevalent communitybased routing algorithms mostly select the most optimal social characteristic node to forward messages. But they almost don't consider the effect of community distribution on mobile nodes and the time-varying characteristic of network. These algorithms usually result in high consumption of network resources and low successful delivery ratio if they are used directly in mobile social networks. We build a time-varying community-based network model, and propose a community-aware message opportunistic transmission algorithm (CMOT) in this paper. For inter-community messages transmission, the CMOT chooses an optimal community path by comparing the community transmission probability. For intra-community in local community, messages are forwarded according to the encounter probability between nodes. The simulation results show that the CMOT improves the message successful delivery ratio and reduces network overhead obviously, compared with classical routing algorithms, such as PRoPHET, MaxProp, Spray and Wait, and CMTS.

Ort, förlag, år, upplaga, sidor
2016. Vol. 17, s. 79-93
Serie
Lecture Notes in Information Systems and Organisation, ISSN 2195-4968, E-ISSN 2195-4976 ; 17
Nyckelord [en]
Encounter probability; Message opportunistic transmission; Mobile social networks; Transmission probability
Nationell ämneskategori
Data- och informationsvetenskap
Forskningsämne
Komplexa system - mikrodataanalys
Identifikatorer
URN: urn:nbn:se:du-19638DOI: 10.1007/978-3-319-30133-4_6ISBN: 978-3-319-30132-7 (tryckt)ISBN: 978-3-319-30133-4 (digital)OAI: oai:DiVA.org:du-19638DiVA, id: diva2:859372
Konferens
24th International Conference on Information Systems Development (ISD), Harbin, China, 25-27 August, 2015
Tillgänglig från: 2015-10-06 Skapad: 2015-10-06 Senast uppdaterad: 2018-01-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Song, William Wei

Sök vidare i DiVA

Av författaren/redaktören
Song, William Wei
Av organisationen
Informatik
Data- och informationsvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 471 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • 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