Congestion control strategy for opportunistic network based on message values

被引：3
作者：
机构：
[1] Nanjing University of Posts and Telecommunications
[2] College of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications
来源：
Zhang, D.-Y. (zhangdy@njupt.edu.cn) | 1600年 / Academy Publisher卷 / 09期
基金：
中国国家自然科学基金;
关键词：
Congestion control; Opportunistic network; Receiving value; Storage value;
D O I：
10.4304/jnw.9.5.1132-1138
中图分类号：
O211 [概率论（几率论、或然率论）];
学科分类号：
摘要：
To solve the congestion problem in opportunistic networks, a congestion control strategy based on message deleting and transferring(DATM) is proposed. The congested node calculates the storage value of each message according to the forwarding probability and TTL of message, then deletes the message with the minimum storage value and transfers the message with the minimum forwarding probability to neighboring nodes. The neighboring nodes calculate the receiving value of the message according to the forwarding probability and free buffer capacity of this message. The congested node transfers the message to the neighboring node with the maximum receiving value. The message will be deleted when there is no neighboring node to receive it. The algorithm is more targeted at deleting messages. Besides, it combines the strategy of transferring message. Therefore, it can deal with the congestion more efficiently. The message arrival rate is improved significantly and the end-to-end delay is also reduced to some extent. © 2014 ACADEMY PUBLISHER.
引用
收藏
页码：1132 / 1138
页数：6
相关论文
共 12 条
  • [1] Xiong Y.-P., Sun L.-M., Opportunity network, Journal of Software, 20, 1, pp. 124-137, (2009)
  • [2] Boldrini C., Conti M., Iacopini I., Et al., Exploiting Users' Social Relations to Forward Data in Opportunistic Networks: The HiBOP Solution, Pervasive and Mobile Computing, 4, 5, pp. 633-657, (2008)
  • [3] Ye H., Chen Z.-G., ON-CRP: Replacement strategy study on Opportunity network cache, Journal of Communication, 31, 5, pp. 98-107, (2010)
  • [4] Dimitriou S., Tsaoussidis T., Effective buffer and storage management in DTN nodes, Proc of IEEE International Conference On Ultra Modern Telecommunications, pp. 1-3, (2009)
  • [5] Seligmanl M., Fall K., Mundur P., Storage routing for DTN congestion control, Wireless Communications and Mobile Computing, 7, pp. 1183-1196, (2007)
  • [6] Coe E., Raghavendra C., Token Based Congestion Control for DTNs, Aerospace Conference, pp. 1-7, (2010)
  • [7] Seligman M., Fall K., Mundur P., Storage routing for DTN congestion control, Wireless Communications and Mobile Computing, 7, pp. 1183-1196, (2007)
  • [8] Zhang D.-Y., Cui L., Domain-Epidemic Spray and Forward Routing algorithm of Opportunistic Networks, International Journal of Information and Communication Technology Journal (IJICT)
  • [9] Tournoux P.-U., Et al., The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing, INFOCOM IEEE, pp. 1116-1124, (2009)
  • [10] Seligman M., Alternative Custodians For Congestion Control In Delay Tolerant Networks, (2006)
12