Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Handling asymmetry in power heterogeneous ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited
Journal of Parallel and Distributed Computing
Security-aware routing and localization for a directional mission critical network
IEEE Journal on Selected Areas in Communications
A new routing protocol in ad hoc networks with unidirectional links
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
| Hi-index | 0.00 |
Most of the routing algorithms for ad hoc networks assume that all wireless links are bidirectional. In reality, some links may be unidirectional. In this paper we show that the presence of such links can jeopardize the performance of the existing distance vector routing algorithms. We also present modifications to distance vector based routing algorithms to make them work in ad hoc networks with unidirectional links. For a network of n nodes, neighbors exchange n x n matrices to propagate routing information. This results in loop-free routes.