Position-Based k-Disjoint Path Routing for Reliable Data Gathering in Wireless Sensor Networks
Summary :
This paper proposes a novel routing algorithm that constructs position-based k-disjoint paths to realize greater resiliency to patterned failure. The proposed algorithm constructs k-disjoint paths that are spatially distributed by using the hop-count based positioning system. Simulation results reveal that the proposed algorithm is more resilient to patterned failure than other routing algorithms, while it has low power consumption and small delay.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E95-B No.8 pp.2658-2660
- Publication Date
- 2012/08/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E95.B.2658
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Jang Woon BAEK, Young Jin NAM, Dae-Wha SEO, "Position-Based k-Disjoint Path Routing for Reliable Data Gathering in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 8, pp. 2658-2660, August 2012, doi: 10.1587/transcom.E95.B.2658.
Abstract: This paper proposes a novel routing algorithm that constructs position-based k-disjoint paths to realize greater resiliency to patterned failure. The proposed algorithm constructs k-disjoint paths that are spatially distributed by using the hop-count based positioning system. Simulation results reveal that the proposed algorithm is more resilient to patterned failure than other routing algorithms, while it has low power consumption and small delay.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.2658/_p
Copy
@ARTICLE{e95-b_8_2658,
author={Jang Woon BAEK, Young Jin NAM, Dae-Wha SEO, },
journal={IEICE TRANSACTIONS on Communications},
title={Position-Based k-Disjoint Path Routing for Reliable Data Gathering in Wireless Sensor Networks},
year={2012},
volume={E95-B},
number={8},
pages={2658-2660},
abstract={This paper proposes a novel routing algorithm that constructs position-based k-disjoint paths to realize greater resiliency to patterned failure. The proposed algorithm constructs k-disjoint paths that are spatially distributed by using the hop-count based positioning system. Simulation results reveal that the proposed algorithm is more resilient to patterned failure than other routing algorithms, while it has low power consumption and small delay.},
keywords={},
doi={10.1587/transcom.E95.B.2658},
ISSN={1745-1345},
month={August},}
Copy
TY - JOUR
TI - Position-Based k-Disjoint Path Routing for Reliable Data Gathering in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2658
EP - 2660
AU - Jang Woon BAEK
AU - Young Jin NAM
AU - Dae-Wha SEO
PY - 2012
DO - 10.1587/transcom.E95.B.2658
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2012
AB - This paper proposes a novel routing algorithm that constructs position-based k-disjoint paths to realize greater resiliency to patterned failure. The proposed algorithm constructs k-disjoint paths that are spatially distributed by using the hop-count based positioning system. Simulation results reveal that the proposed algorithm is more resilient to patterned failure than other routing algorithms, while it has low power consumption and small delay.
ER -
English
