Please use this identifier to cite or link to this item:
|標題:||Dual paths node-disjoint routing for data salvation in mobile ad hoc||作者:||Jiang, F.C.
|關鍵字:||Mobile ad-hoc network;Node-disjoint multi-path;Alternative path;Data;salvation;Simulation;networks;protocols;performance||Project:||Journal of Supercomputing||期刊/報告no：:||Journal of Supercomputing, Volume 59, Issue 1, Page(s) 268-296.||摘要:||
The operational patterns of multifarious backup strategies on AODV-based (Ad-hoc On-Demand Vector) routing protocols are elaborated in this article. To have a broader picture on relevant routing protocols together, variants of AODV-based backup routing protocols are formulated by corresponding algorithms, and also each of them are simulated to obtain the necessary performance metrics for comparisons in terms of packet delivery ratio, average latency delay, and the normalized routing load. Then to make the process of data salvation more efficiently in case of link failure, we explore the possibility of combining the AODV backup routing strategy and on-demand node-disjoint multipath routing protocols. This article proposes an improved approach named DPNR (Dual Paths Node-disjoint Routing) for data salvation, a routing protocol that maintains the only two shortest backup paths in the source and destination nodes. The DPNR scheme can alleviate the redundancy-frames overhead during the process of data salvation by the neighboring intermediate nodes. Our simulation results have demonstrated that DPNR scheme delivers good data delivery performance while restricting the impacts of transmission collision and channel contention. The mathematical rationale for our proposed approach is stated as well.
|Appears in Collections:||期刊論文|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.