Journal of South China University of Technology(Natural Science Edition) ›› 2012, Vol. 40 ›› Issue (3): 57-63.

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

DTN Routing Algorithm Based on Gradient and Fuzzy Neural Network

Zhang Wen-zhu  Zhao Bei   

  1. State Key Laboratory of Integrated Service Networks,Xidian University,Xi’an 710071,Shaanxi,China
  • Received:2011-07-19 Revised:2011-10-11 Online:2012-03-25 Published:2012-02-01
  • Contact: 张文柱(1970-) ,男,博士,副教授,主要从事无线网络通信协议设计及性能评估、认知无线电研究. E-mail:wzzhang1@mail.xidian.edu.cn
  • About author:张文柱(1970-) ,男,博士,副教授,主要从事无线网络通信协议设计及性能评估、认知无线电研究.
  • Supported by:

    国家自然科学基金资助项目( 61072068) ; 国家“973”计划项目( 2009CB320404) ; 国家杰出青年科学基金资助项目( 60725105) 

Abstract:

Efficient routing algorithm is the key to guaranteeing the performance of delay-tolerant network ( DTN) . In order to improve the efficiency of DTN routing algorithms,a routing algorithm based on gradient and fuzzy neural network decision is proposed. This algorithm improves the vector for network description by adopting the own information of a node and the link state information between two nodes,which enables a comprehensive description of the network. Moreover,it provides accurate measurement for routing decisions by combining the dynamic average of limited historical information with an accurate prediction and by adaptively maintaining the components of the vector. In addition,fuzzy RBF ( Radical Basis function) neural network is employed in the algorithm for routing decision so as to result in an intelligent routing decision-making process,and,the successful multi-hop packet transmission probability is used to guide the forwarding along the gradient,thus improving the packet forwarding efficiency. Simulated results indicate that the proposed algorithm achieves better performance than epidemic and context-aware routing algorithms under the same network conditions.

Key words: delay-tolerant network, routing algorithm, gradient, fuzzy neural network

CLC Number: