Proceedings ArticleDOI
A routing protocol for packet radio networks
Shree Murthy,J.J. Garcia-Luna-Aceves +1 more
- pp 86-95
TLDR
Simulation results indicate that WRP is the most efficient of the algorithms simulated in a wireless environment.Abstract:
: The authors present a new distance-vector routing protocol for a packet radio network. The new distributed routing protocol, Wireless Routing Protocol (WRP), works on the notion of second-to-last hop node to a destination. WRP reduces the number of cases in which a temporary routing loop can occur and also provides a mechanism for the reliable transmission of update messages. The performance of WRP has been compared quantitatively by simulations with that of distributed Bellman-Ford (DBF), DUAL (a loop-free, distance-vector algorithm), and an ideal link-state algorithm (ILS) that represents the state of the art of Internet routing in a highly dynamic environment. The simulation results indicate that WRP is the most efficient of the algorithms simulated in a wireless environment.read more
Citations
More filters
Proceedings ArticleDOI
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Journal ArticleDOI
A review of routing protocols for mobile ad hoc networks
TL;DR: In this article, a wide range of routing protocols have been proposed in the literature and a performance comparison of all routing protocols and suggest which protocols may perform best in large networks is provided.
Journal ArticleDOI
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
TL;DR: A new multiaccess protocol based on the original MACA protocol with the adition of a separate signalling channel that conserves battery power at nodes by intelligently powering off nodes that are not actively transmitting or receiving packets.
Proceedings ArticleDOI
On calculating connected dominating set for efficient routing in ad hoc wireless networks
TL;DR: In this paper, the authors proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances.
Journal ArticleDOI
Signal stability-based adaptive routing (SSA) for ad hoc mobile networks
TL;DR: A distributed adaptive routing protocol for finding and maintaining stable routes based on signal strength and location stability in an ad hoc network is proposed and an architecture for its implementation is presented.
References
More filters
Book
Data networks
TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.
Proceedings ArticleDOI
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
OSPF Version 2
TL;DR: This memo documents version 2 of the OSPF protocol, a link-state routing protocol designed to be run internal to a single Autonomous System.
Journal ArticleDOI
A distributed routing algorithm for mobile wireless networks
TL;DR: A loop-free, distributed routing protocol for mobile packet radio networks intended for use in networks where the rate of topological change is not so fast as to make “flooding” the only possible routing method, but not so slow to make one of the existing protocols for a nearly-static topology applicable.
Journal ArticleDOI
Loop-free routing using diffusing computations
TL;DR: A family of distributed algorithms for the dynamic computation of the shortest paths in a computer network or internet is presented, validated, and analyzed, and these algorithms are shown to converge in finite time after an arbitrary sequence of link cost or topological changes.