SMS: shortest multipath source routing for mobile ad-hoc networks

Zafar, M.H. and Harle, D.A. and Andonovic, I. and Ashraf, M. (2007) SMS: shortest multipath source routing for mobile ad-hoc networks. In: UNSPECIFIED. (https://doi.org/10.1109/ICSPC.2007.4728264)

Full text not available in this repository.Request a copy

Abstract

In recent years, on-demand multipath routing protocols have been a key research area in mobile ad-hoc networks. Such protocols are crucial in providing resilience to route failures and to successful load balancing. Previous work shows that on-demand multipath routing protocols achieve lower end-to-end delay, routing overheads and higher goodput under certain scenarios when compared to traditional single-path routing protocols. In this paper, the shortest multipath source (SMS) routing protocol is proposed. The proposed protocol builds multiple partial-disjoint paths that are shorter when compared to multiple link-disjoint or node-disjoint paths and, in so doing, reduce end-to-end delay and routing overheads incurred when recovering from route breaks. Simulation results show that SMS outperforms the competing protocols with respect to a number of key performance metrics.

ORCID iDs

Zafar, M.H., Harle, D.A. ORCID logoORCID: https://orcid.org/0000-0002-0534-1096, Andonovic, I. ORCID logoORCID: https://orcid.org/0000-0001-9093-5245 and Ashraf, M.;
CORE (COnnecting REpositories)