• Jan 04, 2024 News!IJFCC will adopt Article-by-Article Work Flow
  • Aug 10, 2026 News!Vol.15, No.2 has been published with online version.   [Click]
  • Mar 30, 2026 News!Vol.15, No.1 has been published with online version.   [Click]
General Information
    • ISSN: 2010-3751 (Print)
    • Frequency: Semi-annual
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Pascal Lorenz
    • Executive Editor: Ms. Fanny Fang
    • Abstracting/ Indexing: Crossref, Electronic Journals Library, Google Scholar, EBSCO, etc.
    • E-mail:  editor@ijfcc.org
    • Article Processing Charge: 500 USD
Editor-in-chief

Prof. Pascal Lorenz
University of Haute Alsace, France
 
It is my honor to be the Editor-in-Chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.

IJFCC 2015 Vol.4(5): 305-310
doi: 10.18178/ijfcc.2015.4.5.406

A Community-Based Data Dissemination Scheme in Opportunistic Networks

Chun-Chih Lo 1 , I-Hsun Chuang 1 , Pey-Wen Lai 1 , Bing-Jie Guo 1 , Yau-Hwang Kuo 1,2

  • 1 Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan.
  • 2 Department of Computer Science, National Chengchi University, Taipei, Taiwan.

Abstract

In opportunistic networks, data are often deliveredby dissemination-based routing approaches using thestore-carry-and-forward concept. However, the heavyoverheads incurred by these approaches lead to inefficient datadelivery. Generally, users in an area usually demand similardata, called “locality of demand”, and this area is referred to asa community. Based on such property, this paper presents acommunity-based data dissemination (ComD) scheme toimprove the data delivery efficiency in the opportunisticnetwork. By delivering data to appropriate communities, userscan obtain what they are actually interested in. Moreover, theComD also uses the cooperative caching technique to reducetransmission redundancy. To optimize system utility, theproposed delivery model is formulated as a multiple knapsackproblem to determine which data should be carried, and agreedy-based method is adopted to reduce the computationalcomplexity. Simulation results show ComD can significantlyimproves the system utility and delivery rate under varioussituations.

Keywords

  • Opportunistic networks
  • community-baseddata dissemination
  • cooperative cache
406-F077

How to Cite

Copied

Chun-Chih Lo, I-Hsun Chuang, Pey-Wen Lai, Bing-Jie Guo, and Yau-Hwang Kuo, "A Community-Based Data Dissemination Scheme in Opportunistic Networks," International Journal of Future Computer and Communication, vol. 4, no. 5, pp. 305-310, 2015. https://doi.org/ 10.18178/ijfcc.2015.4.5.406

Copyright & License

Copyright © 2015 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Copyright © 2012-2026. International Journal of Future Computer and Communication. Unless otherwise stated.

E-mail: editor@ijfcc.org