Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A distributed routing algorithm for mobile wireless networks
Wireless Networks
Signal stability based adaptive routing (SSA) for ad-hoc mobile networks
Signal stability based adaptive routing (SSA) for ad-hoc mobile networks
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scalable routing strategies for large ad hoc wireless networks
Scalable routing strategies for large ad hoc wireless networks
Routing in Ad Hoc Networks of Mobile Hosts
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Capacity Optimization in TDMA Ad-Hoc Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Mobile ad hoc networks are data networks entirely made up of enduser communication terminals (known as nodes). Each node in the network can act as an information sink (i.e. a receiver), a source and a router. All nodes have a transmission range, which is limited by their transmission power, attenuation and interference. Mobile ad hoc networks have a number of disadvantages over wired networks. These include limited bandwidth in the wireless medium, limited power supply and mobility. The traditional routing algorithms such as DBF will not work in such networks due to lack of scalability and ability to cope with highly mobile networks. Recently, a number of routing protocols have been designed to overcome these issues. These protocols can be classified into three different categories: global, on-demand and hybrid routing. In this paper, we provide a performance comparison for on-demand routing protocols, which is based on a number of different parameters. This paper also considers which protocol characteristics will produce better performance levels in these networks, and what improvements can be made to further increase the efficiency of some of these routing protocols.