Achieving spatial disjointness in multipath routing without location information

  • Authors:
  • Juan J. Gálvez;Pedro M. Ruiz;Antonio F. G. Skarmeta

  • Affiliations:
  • DIIC, Computer Science Faculty, University of Murcia, Spain;DIIC, Computer Science Faculty, University of Murcia, Spain;DIIC, Computer Science Faculty, University of Murcia, Spain

  • Venue:
  • WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We develop an on-demand multipath routing protocol for multi-hop wireless networks (MWNs), capable of finding spatially disjoint paths without the need of location information. Multipath routing can enable various applications and enhancements in MWNs, such as load balancing, bandwidth aggregation, reliability and secure communications. The use of spatially disjoint routes is important to effectively achieve these gains, due to the non-interfering nature of the paths. Most of the proposed multipath protocols for MWNs focus on reliability and do not find spatially disjoint paths. We propose a new on-demand protocol called Spatially Disjoint Multipath Routing (SDMR), capable of finding multiple paths in one route discovery, measuring the distance between them and choosing paths with most separation. Simulations demonstrate the effectiveness of the protocol in finding spatially separate routes.