Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
ARA - The Ant-Colony Based Routing Algorithm for MANETs
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
MARP: A Multi-Agent Routing Protocol for Mobile Wireless Ad Hoc Networks
Autonomous Agents and Multi-Agent Systems
BeeAdHoc: an energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The polarized gossip protocol for path discovery in MANETs
Ad Hoc Networks
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Mobile Ad Hoc network (MANET) is a very attractive networking technology for providing flexible communication in an anytime and anywhere fashion. However, MANET is infrastructure-less and highly dynamic, so the design of an efficient routing strategy for reliable end-to-end communication in such a network has been a challenging issue. The available routing protocols and their embedded information retrieval methods for MAMETs work well only for networks with certain limited assumptions of number of nodes, density of nodes and mobility. With the continuous expansion of the MANETs in real applications, it is now imperative to develop a new routing protocol for MAMETs that is more scalable and topology independent. In this paper, we introduce such a routing scheme for MANETs, which works well under a wide range of network topologies, nodes-density, coverage area size and nodes-mobility. The proposed scheme is based on a novel enhancement of the hint-based probabilistic protocol. Instead of broadcasting extensive control packets for network topology information retrieval as that of conventional routing schemes, the proposed scheme carefully reuses the feedback information carried in unicast packets for this purpose without introducing any extra overhead. The efficiency of the proposed scheme is demonstrated through both mathematical analysis and an extensive simulations study.