• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhao Guangsong, Chen Ming, and Zuo Qingyun. Data Dissemination Based on System Utility in Cooperative Delay Tolerant Networks[J]. Journal of Computer Research and Development, 2013, 50(6): 1217-1226.
Citation: Zhao Guangsong, Chen Ming, and Zuo Qingyun. Data Dissemination Based on System Utility in Cooperative Delay Tolerant Networks[J]. Journal of Computer Research and Development, 2013, 50(6): 1217-1226.

Data Dissemination Based on System Utility in Cooperative Delay Tolerant Networks

More Information
  • Published Date: June 14, 2013
  • Data dissemination in delay tolerant networks (DTNs) has been extensively studied in recent years. The end-to-end path between any two nodes in DTNs suffers intermittence frequently, so the nodes exploit the store-carry-forward routing paradigm to communicate with others. When two nodes come into contact with each other, how to select data objects for buffering is a critical problem for each node, which affects the data dissemination performance of the system. Nodes in DTNs usually lack the global network information, so they cannot make the global optimal selection of data objects for buffering. In order to solve this problem, the global optimization problem is converted to an optimization problem under each contact, and the new problem can be formulated as 0-1 knapsack problem in this paper. A heuristic algorithm is proposed to solve this 0-1 knapsack problem and instructs nodes to selectively buffer data objects for maximizing the gain in system utility even when nodes maintain local network information. Furthermore, this paper investigates the relationship between the decisions made by the nodes and the scope of network information they maintain. Extensive trace-driven simulations based on MIT trace are conducted to evaluate the performance of our heuristic algorithm. The results demonstrate that our heuristic algorithm can achieve better performance than SocialCast algorithm. And the simulation results also show that the larger scope of network information the nodes maintain, the better performance our heuristic algorithm can achieve.
  • Related Articles

    [1]Bai Tian, Xiao Mingyu. Computational Complexity of Feedback Set and Subset Feedback Set Problems: A Survey[J]. Journal of Computer Research and Development, 2025, 62(1): 104-118. DOI: 10.7544/issn1000-1239.202330693
    [2]Jiang Luyu, Ouyang Dantong, Zhang Qi, Tai Ran, Zhang Liming. Incremental Information Interaction-Based Method for Enumerating MUSes[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202440326
    [3]Ouyang Dantong, Jia Fengyu, Liu Siguang, Zhang Liming. An Algorithm Based on Extension Rule For Solving #SAT Using Complementary Degree[J]. Journal of Computer Research and Development, 2016, 53(7): 1596-1604. DOI: 10.7544/issn1000-1239.2016.20150032
    [4]Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
    [5]Qiu Jiangtao, Tang Changjie, Zeng Tao, Liu Yintian. Strategy of Revising Rules for Association Text Classification[J]. Journal of Computer Research and Development, 2009, 46(4): 683-688.
    [6]Zhong Yong, Qin Xiaolin, and Bao Lei. An Association Rule Mining Algorithm of Multidimensional Sets[J]. Journal of Computer Research and Development, 2006, 43(12): 2117-2123.
    [7]Xiong Zhongmin, Hao Zhongxiao. An Approach to Termination Decision for a Rule Set Based on Activation Path and Conditional Formula[J]. Journal of Computer Research and Development, 2006, 43(5): 901-907.
    [8]Hao Zhongxiao, Xiong Zhongmin. An Efficient Algorithm for Computing an Irreducible Rule Set in Active Database[J]. Journal of Computer Research and Development, 2006, 43(2): 281-287.
    [9]Hao Zhongxiao, Ren Chao, Zhao Lingqiang. Termination Analysis of Active Rule Based on Dependency Set[J]. Journal of Computer Research and Development, 2005, 42(12): 2199-2205.
    [10]Tian Daxin, Liu Yanheng, Li Yongli, Tang Yi. A Fast Matching Algorithm and Conflict Detection for Packet Filter Rules[J]. Journal of Computer Research and Development, 2005, 42(7): 1128-1135.

Catalog

    Article views (809) PDF downloads (412) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return