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

Haseeb Zafar*, David Harle, Ivan Andonovic, Mahmood Ashraf

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications
Pages97-100
Number of pages4
DOIs
Publication statusPublished - 22 Dec 2008
Externally publishedYes
Event2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007 - Dubai, United Arab Emirates
Duration: 14 Nov 200727 Nov 2007

Conference

Conference2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007
Country/TerritoryUnited Arab Emirates
CityDubai
Period14/11/0727/11/07

Keywords

  • Ad-hoc networks
  • Multipath routing
  • Partial-disjoint
  • Shortest multipath source routing

Cite this