• Jan 05, 2017 News![CFP] 2017 the annual meeting of IJFCC Editorial Board, ICCTD 2017, will be held in Paris, France during March 20-22, 2017.   [Click]
  • Mar 24, 2016 News! IJFCC Vol. 4, No. 4 has been indexed by EI (Inspec).   [Click]
  • Mar 24, 2017 News!Vol.6, No.1 has been published with online version.   [Click]
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Nancy Y. Liu
    • Abstracting/ Indexing: Google Scholar, Engineering & Technology Digital Library, and Crossref, DOAJ, Electronic Journals LibraryEI (INSPEC, IET).
    • E-mail:  ijfcc@ejournal.net 
Editor-in-chief
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
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 ISSN: 2010-3751
doi: 10.18178/ijfcc.2015.4.5.406

A Community-Based Data Dissemination Scheme in Opportunistic Networks

Chun-Chih Lo, I-Hsun Chuang, Pey-Wen Lai, Bing-Jie Guo, and Yau-Hwang Kuo
Abstract—In opportunistic networks, data are often delivered by dissemination-based routing approaches using the store-carry-and-forward concept. However, the heavy overheads incurred by these approaches lead to inefficient data delivery. Generally, users in an area usually demand similar data, called “locality of demand”, and this area is referred to as a community. Based on such property, this paper presents a community-based data dissemination (ComD) scheme to improve the data delivery efficiency in the opportunistic network. By delivering data to appropriate communities, users can obtain what they are actually interested in. Moreover, the ComD also uses the cooperative caching technique to reduce transmission redundancy. To optimize system utility, the proposed delivery model is formulated as a multiple knapsack problem to determine which data should be carried, and a greedy-based method is adopted to reduce the computational complexity. Simulation results show ComD can significantly improves the system utility and delivery rate under various situations.

Index Terms—Opportunistic networks, community-based data dissemination, cooperative cache.

Chun-Chih Lo, I-Hsun Chuang, Pey-Wen Lai, Bing-Jie Guo, and Yau-Hwang Kuo are with the Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan (e-mail: cobrageo@cad.csie.ncku.edu.tw, jacky@cad.csie.ncku.edu.tw, pwlai0802@cad.csie.ncku.edu.tw, leewon@cad.csie.ncku.edu.tw, kuoyh@cad.csie.ncku.edu.tw).
Yau-Hwang Kuo is with the Department of Computer Science, National Chengchi University, Taipei, Taiwan.

[PDF]

Cite: 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.

Copyright © 2008-2016. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net