Position-Based k-Disjoint Path Routing for Reliable Data Gathering in Wireless Sensor Networks

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• The Institute of Electronics, Information and Communication Engineersの論文
• 2012-08-01

著者

• SEO Dae-Wha

  the School of Electrical Eng. & Computer Science, Kyungpook National University

• BAEK Jang

  the Automobile SW Platform Technology Team, Daegu-Gyeongbuk Research Center, ETRI

• NAM Young

  the School of Computer & Information Technology, Daegu University

関連論文

• Position-Based k-Disjoint Path Routing for Reliable Data Gathering in Wireless Sensor Networks
• Forest Fire Monitoring with an Adaptive In-Network Aggregation Scheduling in Wireless Sensor Networks

スポンサーリンク