Associativity-Based Routing for Ad Hoc Mobile Networks

  title={Associativity-Based Routing for Ad Hoc Mobile Networks},
  author={Chai Keong Toh},
  journal={Wireless Personal Communications},
  • C. Toh
  • Published 1 March 1997
  • Computer Science, Business
  • Wireless Personal Communications
This paper presents a new, simple and bandwidth-efficient distributed routing protocol to support mobile computing in a conference size ad-hoc mobile network environment. Unlike the conventional approaches such as link-state and distance-vector distributed routing algorithms, our protocol does not attempt to consistently maintain routing information in every node. In an ad-hoc mobile network where mobile hosts (MHs) are acting as routers and where routes are made inconsistent by MHs' movement… 
Performance Improvement of Associativity-Based Routing Protocol for Mobile Ad Hoc Networks
This paper proposed the modification and improvement of ABR protocol by including the position information of mobile hosts into its algorithm, which can reduce routing overhead of route discovery process and increase more beneficial performance for mobile ad hoc networks.
Source routing in Mobile Ad hoc NETworks (MANETs)
Simulation results show that in high mobility (pause time 0s) scenarios, CBRP outperforms DSR and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq.
Routing Convenant For Mobile Ad-Hoc Networks based on Pragmatic Cluster
A new routing protocol for mobile adhoc networks to significantly reduce the control overheads such as route query packets as well as the flooding time for collecting the network topology information at a destination is proposed.
Ad hoc mobile multicast routing using the concept of long-lived routes
The associativity-based ad hoc multicast (ABAM) routing protocol is proposed and the simulation results reveal that under different mobility scenarios and multicast group size, ABAM has low communication overhead and yields better throughput performance.
A comparative study of routing protocols in MANETs
An attempt has been made to compare the performance of prominent on-demand reactive routing protocols for mobile ad hoc networks (AODV and TORA), along with the traditional proactive DSDV protocol.
Efficient clustering-based routing protocol in mobile ad-hoc networks
A new routing protocol for mobile ad-hoc networks that is not sensitive to changing network topology, has shorter transfer delay, reasonable control overheads and appreciable throughput, and exhibits all these desirable characteristics without compromising on other important performance measures is proposed.
Distributed mobility-aware route selection for wireless ad hoc networks
  • S. Abhyankar, D. Agrawal
  • Computer Science, Business
    Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326)
  • 2002
A mobility metric, which exploits nonrandom behaviors of mobility patterns, is used to select more stable routes and reduce the routing overhead caused by user mobility in a distributed mobility-aware route selection scheme.
Robust cross-layer routing protocol for Mobile Ad hoc NETworks
The DXFP protocol has been compared with the two currently most used routing protocols for MANET, i.e. DSR (Dynamic Source Routing) and AODV (Ad hoc On-demand Distance Vector), showing significant improvements in performance and robustness.
Performance Comparison of Routing Protocols in Mobile Ad Hoc Networks
A comprehensive survey of routing protocols that are available in recent literature with classification is given and portrayals of the protocols with exchanges of preferences and drawbacks of the various routing protocols are given.


Dynamic Source Routing in Ad Hoc Wireless Networks
This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
This paper investigates modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP, to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks.
A distributed routing algorithm for mobile wireless networks
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.
A distributed routing algorithm for mobile radio networks
  • S. Corson, A. Ephremides
  • Computer Science
    IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'
  • 1989
The results show that, when the rate of topological change becomes very high, flooding is preferable to the other alternatives, and for lower rate of change, the performance of the new algorithm is encouraging in that it has been generally superior to that of the alternative protocols.
Multicluster, mobile, multimedia radio network
A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented. The proposed network supports multimedia traffic and relies on both time
A Failsafe Distributed Routing Protocol
The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe.
Layer net: a new self-organizing network protocol
A protocol is proposed for the generation and operation of a self-organizing multihop radio network, which is capable of creating its own topology and transmission schedules dynamically and in a
A wireless broadband ad-hoc ATM local-area network
The theory, design and ongoing prototyping of a wireless ATM LAN/PBX capable of supporting mobile users with multi-Mb/s access rates and multi-Gb/s aggregate capacities and a new wireless VP/VC concept and a Homing Algorithm are described to provide ATM cell routing and connections in the network.
A testbed for mobile networked computing
An experimental testbed system, SWAN (Seamless Wireless ATM Network), to mimic this emerging networking environment with a networking subsystem, FAWN (Flexible Adapter for Wireless Networking) that interfaces the standard PCMCIA bus to an RF modem.
A distributed architecture for multimedia in dynamic wireless networks
The paper presents a self-organizing wireless mobile radio networking multimedia support that provides an instant infrastructure for real-time traffic transmission and a stable and loop-free routing protocol is implemented.