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.
