With quick topology changes due to mobile node movement or signal fading in MANET environments, conventional routing restoration processes are costly to implement and may incur high flooding of network traffic overhead and long routing path latency. Adopting the traditional shortest path tree (SPT) recomputation and restoration schemes used in Internet routing protocols will not work effectively for MANET. An object of the next generation SPT restoration system is to provide a cost-effective solution using an adaptive learning control system, wherein the SPT restoration engine is able to skip over the heavy SPT computation. We proposed a novel SPT restoration scheme, called Cognitive Shortest Path Tree Restoration (CSPTR). CSPTR is designed based on the Network Simplex Method (NSM) and Sensitivity Analysis (SA) techniques to provide a comprehensive and low-cost link failure healing process. NSM is used to derive the shortest paths for each node, while the use of SA can greatly reduce the effort of unnecessary recomputation of the SPT when network topology changes. In practice, a SA range table is used to enable the learning capability of CSPTR. The performance of computing and communication overheads are compared with other two well-known schemes, such as Dijstra's algorithm and incremental OSPF. Results show that CSPTR can greatly eliminate unnecessary SPT recomputation and reduce large amounts of the flooding overheads.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Huan CHEN, Bo-Chao CHENG, Po-Kai TSENG, "Cognitive Shortest Path Tree Restoration (CSPTR) for MANET Using Cost-Sensitivity Analysis" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 3, pp. 717-727, March 2009, doi: 10.1587/transcom.E92.B.717.
Abstract: With quick topology changes due to mobile node movement or signal fading in MANET environments, conventional routing restoration processes are costly to implement and may incur high flooding of network traffic overhead and long routing path latency. Adopting the traditional shortest path tree (SPT) recomputation and restoration schemes used in Internet routing protocols will not work effectively for MANET. An object of the next generation SPT restoration system is to provide a cost-effective solution using an adaptive learning control system, wherein the SPT restoration engine is able to skip over the heavy SPT computation. We proposed a novel SPT restoration scheme, called Cognitive Shortest Path Tree Restoration (CSPTR). CSPTR is designed based on the Network Simplex Method (NSM) and Sensitivity Analysis (SA) techniques to provide a comprehensive and low-cost link failure healing process. NSM is used to derive the shortest paths for each node, while the use of SA can greatly reduce the effort of unnecessary recomputation of the SPT when network topology changes. In practice, a SA range table is used to enable the learning capability of CSPTR. The performance of computing and communication overheads are compared with other two well-known schemes, such as Dijstra's algorithm and incremental OSPF. Results show that CSPTR can greatly eliminate unnecessary SPT recomputation and reduce large amounts of the flooding overheads.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.717/_p
Copy
@ARTICLE{e92-b_3_717,
author={Huan CHEN, Bo-Chao CHENG, Po-Kai TSENG, },
journal={IEICE TRANSACTIONS on Communications},
title={Cognitive Shortest Path Tree Restoration (CSPTR) for MANET Using Cost-Sensitivity Analysis},
year={2009},
volume={E92-B},
number={3},
pages={717-727},
abstract={With quick topology changes due to mobile node movement or signal fading in MANET environments, conventional routing restoration processes are costly to implement and may incur high flooding of network traffic overhead and long routing path latency. Adopting the traditional shortest path tree (SPT) recomputation and restoration schemes used in Internet routing protocols will not work effectively for MANET. An object of the next generation SPT restoration system is to provide a cost-effective solution using an adaptive learning control system, wherein the SPT restoration engine is able to skip over the heavy SPT computation. We proposed a novel SPT restoration scheme, called Cognitive Shortest Path Tree Restoration (CSPTR). CSPTR is designed based on the Network Simplex Method (NSM) and Sensitivity Analysis (SA) techniques to provide a comprehensive and low-cost link failure healing process. NSM is used to derive the shortest paths for each node, while the use of SA can greatly reduce the effort of unnecessary recomputation of the SPT when network topology changes. In practice, a SA range table is used to enable the learning capability of CSPTR. The performance of computing and communication overheads are compared with other two well-known schemes, such as Dijstra's algorithm and incremental OSPF. Results show that CSPTR can greatly eliminate unnecessary SPT recomputation and reduce large amounts of the flooding overheads.},
keywords={},
doi={10.1587/transcom.E92.B.717},
ISSN={1745-1345},
month={March},}
Copy
TY - JOUR
TI - Cognitive Shortest Path Tree Restoration (CSPTR) for MANET Using Cost-Sensitivity Analysis
T2 - IEICE TRANSACTIONS on Communications
SP - 717
EP - 727
AU - Huan CHEN
AU - Bo-Chao CHENG
AU - Po-Kai TSENG
PY - 2009
DO - 10.1587/transcom.E92.B.717
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2009
AB - With quick topology changes due to mobile node movement or signal fading in MANET environments, conventional routing restoration processes are costly to implement and may incur high flooding of network traffic overhead and long routing path latency. Adopting the traditional shortest path tree (SPT) recomputation and restoration schemes used in Internet routing protocols will not work effectively for MANET. An object of the next generation SPT restoration system is to provide a cost-effective solution using an adaptive learning control system, wherein the SPT restoration engine is able to skip over the heavy SPT computation. We proposed a novel SPT restoration scheme, called Cognitive Shortest Path Tree Restoration (CSPTR). CSPTR is designed based on the Network Simplex Method (NSM) and Sensitivity Analysis (SA) techniques to provide a comprehensive and low-cost link failure healing process. NSM is used to derive the shortest paths for each node, while the use of SA can greatly reduce the effort of unnecessary recomputation of the SPT when network topology changes. In practice, a SA range table is used to enable the learning capability of CSPTR. The performance of computing and communication overheads are compared with other two well-known schemes, such as Dijstra's algorithm and incremental OSPF. Results show that CSPTR can greatly eliminate unnecessary SPT recomputation and reduce large amounts of the flooding overheads.
ER -