R-SPOFTR: Relieving Single Point of Failure in Tree Routing of Wireless Sensor Networks

• Main Authors: Jun-Jim Wang, 王炯竣
• Other Authors: Wen-Shyang Hwang
• Format: Others
• Language: zh-TW
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/24128427997412419031

碩士 === 國立高雄應用科技大學 === 電機工程系博碩士班 === 102 === Tree routing is the major routing algorithm for static environment surveillance in ZigBee networks because of lacking routing tables and route discovery overhead; in addition, it uses only parent-child link to relay packets to destination. However, the delivery has to detour around the common ancestor of source and destination; it will make more hops and energy when both nodes are close but at different tree branch. Besides, nodes nearby the coordinator always have more chances to relay packet, getting more congestion and more energy consumption. It is called Single Point of Failure (SPOF) problem.In this paper, we propose a Relieving SPOF Tree Routing (R-SPOFTR) algorithm to provide approached optimal routing and avoid congestion. With the algorithm, the source uses neighbor nodes with same tree depth to deliver directly, which avoids disturbing common ancestor and relieving the SPOF problem. The simulation results show the R-SPOFTR algorithm can decrease the average hop count, shorten end-to-end delay, increase throughput, and prolong network lifetime.