Proceedings ArticleDOI
Source-initiated adaptive routing algorithm (SARA) for autonomous wireless local area networks
R.S. Ramanujan,S. Takkella,J.C. Bonney,K.J. Thurber +3 more
- pp 109-118
TLDR
The design of a routing protocol called source-initiated adaptive routing algorithm (SARA), for AWLAN environments that may contain asymmetric links, supports two different modes of protocol operation: one optimized for symmetric networks and the other providing additional capabilities needed for operation in asymmetric networks at a higher cost.Abstract:
Conventional routing protocols used in wireline and wireless networks are not designed to operate in an autonomous (or ad hoc) wireless local area network (AWLAN) environment with asymmetric (i.e. unidirectional) links. This paper presents the design of a routing protocol called source-initiated adaptive routing algorithm (SARA), for AWLAN environments that may contain asymmetric links. To allow efficient operation in a symmetric network while ensuring correct operation in asymmetric networks, SARA supports two different modes of protocol operation: one optimized for symmetric networks and the other providing additional capabilities needed for operation in asymmetric networks at a higher cost. The ability of SARA to adapt its mode of operation and optimize its execution for each network environment is one of its major advantages and distinguishes it from existing routing protocols for, wireless networks. Furthermore, within each of its operating modes, SARA supports best-effort as well as policy-based routing.read more
Citations
More filters
Proceedings ArticleDOI
Real-world experiences with an interactive ad hoc sensor network
TL;DR: Several techniques for reducing packet loss are explored, including quality-based routing and passive acknowledgment, and an empirical evaluation of the effect of these techniques on packet loss and data freshness are presented.
Patent
Method and apparatus for congestion-aware routing in a computer interconnection network
TL;DR: In this paper, an example of a method for a first router to adaptively determine status within a network is presented. But the method for the first router may comprise determining status information regarding the second router located in the network, and transmitting the status information to the third router, which may be indirectly coupled to one another.
Proceedings ArticleDOI
Techniques for intrusion-resistant ad hoc routing algorithms (TIARA)
TL;DR: The TIARA mechanisms described seek to limit the damage sustained by ad hoc networks from intrusion attacks and allow for continued network operation at an acceptable level during such attacks, thereby providing a comprehensive defense against intruders.
Journal Article
An Efficient Cluster-Based Routing Algorithm in Ad Hoc Networks with Unidirectional Links *
TL;DR: This paper takes the advantages of multi-hop acknowledgement and the clustering technique to design an efficient hybrid routing protocol in ad hoc networks with unidirectional links and demonstrates the stability and efficiency of the proposed protocol.
Proceedings ArticleDOI
Intrusion-resistant ad hoc wireless networks
TL;DR: A new approach for building intrusion resistant ad hoc networks using wireless router extensions (WRE) that relies on extending the capabilities of existing ad hoc routing algorithms to handle intruders without modifying these algorithms.
References
More filters
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
An efficient routing protocol for wireless networks
TL;DR: WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm, DUAL, and an Ideal Link-state Algorithm.
Routing Information Protocol
TL;DR: This document specifies a routing protocol, based on the Routing Information Protocol, for the Simple Internet Protocol (SIP), as defined in [3], and a companion document will define the SNMP MIB objects for SIP-RIP (TBD).