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 dy...

W e first introduce a simple distance-vector protocol f o r routing in networks having unidirectional links. The protocol can be seen as a n adaptation for these networks of the strategy as used in the popular RIP protocol. T h e protocol comprises two m a i n algorithms, one f o r collecting “from” information, and the other one for generating and propagating ((to” information. However, the tr...

This paper considers the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Our routing scheme is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Remote Routing (TRR). TRR is activated when the destination is remote and uses location of the destination obtained either via location management or by location tracking. TLR acts when ...

Many routing protocols in mobile ad-hoc networks have been developed by many researchers. One of ad-hoc routing protocol types is the on-demand routing that establishes a route to a destination node only when required. However, most of on-demand routing protocols reestablish a new route after a route break. In this paper, we propose a new route maintenance algorithm to avoid route breaks becaus...

Ad hoc wireless networks are growing in popularity and usefulness, however they rely on broadcasting as a fundamental process for routing. Improvements to broadcasting have made ad hoc networks more feasible, but sometimes benefit only specific situations. A history and comparison of broadcasting implementations will be explored, as well as how they relate to some key ad hoc on-demand routing p...

We present a novel scheme for conserving energy in multi-rate multi-hop wireless networks such as 802.11. In our approach, energy conservation is achieved by controlling the rebroadcast times of Route Request (RREQ) packets during path discovery in on-demand wireless routing protocols. The scheme is cross-layer in nature. At the network layer, the RREQ rebroadcast delay is controlled by the ene...

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...

Zone Routing Protocol (ZRP) provides a flexible solution for discovering and maintaining routes in the MANET. By adopting the idea of Fisheye State Routing in ZRP, a more efficient protocol called Fisheye Zone Routing Protocol (FZRP) was proposed in the paper. FZRP provides the advantage of a larger zone with only a little increase of the maintenance overhead. Two levels of routing zone are def...

Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing strategies to arbitrary topologies, this paper presents a classification framework for distributed routing algorithms. Using this framework, ideas previously presented in a topologyspecific context may be applied to new net...

The distance vector routing protocol satisfies the following property. If this protocol is used to route a sequence of data messages from a source to a destination, then these data messages will follow the same shortest-distance path from the source to the destination. In this paper, we show how to modify this protocol, without adding new messages, in order to satisfy the following load balanci...