New spray and wait protocol with node activity in heterogeneous delay tolerant networks

被引:0
作者
Wu Jiagao
Ye Ke
Zhu Yiji
Liu Linfeng
机构
[1] College of Computer, Nanjing University of Posts and Telecommunications
[2] Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks
基金
中国国家自然科学基金;
关键词
delay tolerant network(DTN); routing protocol; spray and wait; node activity; mathematical model;
D O I
暂无
中图分类号
TN915.04 [通信规程、通信协议];
学科分类号
0810 ; 081001 ;
摘要
The spray and wait protocol is a classic copy-limited spraying protocol in delay tolerant networks, in which, the binary spray mode can be improved for heterogeneous delay tolerant networks. In this article, a new conception of node activity was defined to weigh the importance of nodes in aspect of message dissemination in the whole network. A new spray and wait protocol with node activity was proposed to improve the performance in heterogeneous delay tolerant networks. A mathematical model used under varieties of the spraying protocols was also proposed to analyze the expected delay of the protocol. Simulations show that the spray token proportion with node activity is optimal and the new protocol is of better performance than other related protocols. Therefore, this protocol has high efficiency and good scalability.
引用
收藏
页码:60 / 68
页数:9
相关论文
共 5 条
  • [1] An overview of the internet of underwater things
    Carmen Domingo, Mari
    [J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2012, 35 (06) : 1879 - 1890
  • [2] Efficient routing in intermittently connected mobile networks[J] . Thrasyvoulos Spyropoulos,Konstantinos Psounis,Cauligi S. Raghavendra. IEEE/ACM Transactions on Networking (TON) . 2008 (1)
  • [3] Performance modeling of epidemic routing[J] . Xiaolan Zhang,Giovanni Neglia,Jim Kurose,Don Towsley. Computer Networks . 2006 (10)
  • [4] The message delay in mobile ad hoc networks[J] . Robin Groenevelt,Philippe Nain,Ger Koole. Performance Evaluation . 2005 (1)
  • [5] Routing in a delay tolerant network
    Jain, S
    Fall, K
    Patra, R
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) : 145 - 157