Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
On the impact of alternate path routing for load balancing in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Performance Study of a Multipath Routing Method for Wireless Mobile Ad Hoc Networks
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Electric-field-based routing: a reliable framework for routing in MANETs
ACM SIGMOBILE Mobile Computing and Communications Review
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Ad hoc on-demand multipath distance vector routing: Research Articles
Wireless Communications & Mobile Computing - Wireless Ad Hoc Networks: Technologies and Challenges
Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Maximally radio-disjoint multipath routing for wireless multimedia sensor networks
Proceedings of the 4th ACM workshop on Wireless multimedia networking and performance modeling
EAOMDV-MIMC: A Multipath Routing Protocol for Multi-Interface Multi-Channel Mobile Ad-Hoc Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
We develop an on-demand multipath routing protocol for multi-hop wireless networks (MWNs), capable of finding spatially disjoint paths (paths physically distant from each other) 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 and distance of the paths. Most of the proposed multipath protocols for MWNs focus on reliability and do not find spatially separate 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. A new distance metric is presented to measure path separation, which proves to be congruent with Euclidean distance across nodes in the paths. We develop a heuristic algorithm which, given a topology graph and utilizing the proposed distance metric, can discover spatially disjoint paths between any two nodes in the graph. To evaluate the protocol, we have studied the overhead both analytically in comparison with OLSR, and by simulation. The simulations also demonstrate the effectiveness of the protocol in finding spatially separate routes.