Performance Analysis of a node self-locating scheme in DTN routing algorithms

Wang xing-fu; Wei ping-qing; Miao fu-you; Xiong yan

doi:10.7523/j.issn.2095-6134.2008.3.011

Journal of University of Chinese Academy of Sciences >

2008 , Vol. 25 >Issue 3: 367 - 371

DOI: https://doi.org/10.7523/j.issn.2095-6134.2008.3.011

Performance Analysis of a node self-locating scheme in DTN routing algorithms

Wang xing-fu ,
Wei ping-qing ,
Miao fu-you ,
Xiong yan

Expand

Department of Computer Science & Technology, University of Science and Technology of China,
Anhui 230027, China

Received date: 1900-01-01

Revised date: 1900-01-01

Online published: 2008-05-15

Fold

Abstract

Probabilistic route algorithm of DTN（Delay Tolerant Network） in “MobySpace” needs to locate the node in advance. But it is hard to know in advance how a node moves. A scheme of self-location, in which all coordinates of a node are adjusted gradually by a adjusting parameter while the node is moving, is proposed in this paper. Finally all coordinates will fluctuate in a usable range. The simulation shows that the scheme is able to find a proper value of adjusting parameter to make the routing algorithm in DTN stable and transplantable.

Cite this article

Wang xing-fu , Wei ping-qing , Miao fu-you , Xiong yan . Performance Analysis of a node self-locating scheme in DTN routing algorithms[J]. Journal of University of Chinese Academy of Sciences, 2008 , 25(3) : 367 -371 . DOI: 10.7523/j.issn.2095-6134.2008.3.011

Options

Outlines

模态框（Modal）标题

Abstract

Cite this article