Unidirectional links prove costly in wireless ad hoc networks
Ravi Prakash · 1999
Most of the routing algorithms for ad-hoc networks assume that all wireless links are bidirectional. In reality, some links may be unidirectional. The presence of such links can jeopardize the performance of the existing routing algorithms. In this paper we show that routing protocols that account for unidirectional links will require nodes to exchange O(n 2 ) information with each other, where n is the number of nodes in the network. We also present modifications to distance vector based routing algorithms to make them work in ad-hoc networks with unidirectional links. 1 Introduction The mobility pattern of the nodes in an ad-hoc network is often non-deterministic. Hence, the network topology is always in a flux. There has been a significant amount of effort towards developing routing algorithms for such networks. These algorithms can be classified into (a) cluster-based algorithms, and (b) flat algorithms. In cluster-based algorithms [1, 2, 5, 6], at regular intervals, a sub...