Research note: A distance-vector routing protocol for networks with unidirectional links

Authors:
F. C. M. Lau; Guihai Chen; Hao Huang; Li Xie
Affiliations:
Department of Computer Science and Information Systems, The University of Hong Kong, Hong Kong, People's Republic of China;Department of Computer Science and Information Systems, The University of Hong Kong, Hong Kong, People's Republic of China and National KeyLab of Novel Software Technology, Nanjing University, Nan ...;National KeyLab of Novel Software Technology, Nanjing University, Nanjing, People's Republic of China;National KeyLab of Novel Software Technology, Nanjing University, Nanjing, People's Republic of China
Venue:
Computer Communications
Year:
2000

Citing 1
Cited 2

Unidirectional links prove costly in wireless ad hoc networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications

Channel access scheduling in Ad Hoc networks with unidirectional links

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Traffic-predicting a routing algorithm using time series models

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.24

Visualization

Abstract

We propose a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting ''from'' information, and the other one for generating and propagating ''to'' information. Like the RIP protocol, this one can handle dynamic changes and tolerate node and link failures in the network.