du.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Community-based message opportunistic transmission
Dalarna University, School of Technology and Business Studies, Information Systems.ORCID iD: 0000-0003-3681-8173
Nanchang Hangkong University.
Nanchang Hangkong University.
Nanchang Hangkong University.
Show others and affiliations
2016 (English)In: Transforming Healthcare Through Information Systems: Proceedings of the 24th International Conference on Information Systems Development, 2016, Vol. 17, 79-93 p.Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
2016. Vol. 17, 79-93 p.
Series
Lecture Notes in Information Systems and Organisation, ISSN 2195-4968, E-ISSN 2195-4976 ; 17
Keyword [en]
Encounter probability; Message opportunistic transmission; Mobile social networks; Transmission probability
National Category
Computer and Information Science
Research subject
Complex Systems – Microdata Analysis
Identifiers
URN: urn:nbn:se:du-19638DOI: 10.1007/978-3-319-30133-4_6ISBN: 978-3-319-30132-7 (print)ISBN: 978-3-319-30133-4 (electronic)OAI: oai:DiVA.org:du-19638DiVA: diva2:859372
Conference
24th International Conference on Information Systems Development (ISD), Harbin, China, 25-27 August, 2015
Available from: 2015-10-06 Created: 2015-10-06 Last updated: 2017-03-31Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Song, William Wei
By organisation
Information Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 413 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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