A Fault-recovery Routing Approach for Loop-based Clustering WSN

DSpace/Manakin Repository

Search OPUS

Advanced Search


My Account

Show simple item record

dc.contributor.author Xu, Ming en_AU
dc.contributor.author Zhang, Shengdong en_AU
dc.contributor.author Cao, Jiannong en_AU
dc.contributor.author Guo, Xiaoxing en_AU
dc.date.accessioned 2007-03-12T22:05:40Z
dc.date.accessioned 2012-12-15T02:29:27Z
dc.date.available 2007-03-12T22:05:40Z
dc.date.available 2012-12-15T02:29:27Z
dc.date.issued 2007-03-12T22:05:40Z
dc.identifier.uri http://hdl.handle.net/2100/117
dc.identifier.uri http://hdl.handle.net/10453/19560
dc.description.abstract Clustering has been used as an effective approach to saving energy and providing better scalability for Wireless Sensor Networks (WSN). Most of the existing methods for clustering use a star-based topology while the newly proposed loop-based topology brings some unusual advantages. In this paper, we present a loopbased clustering method for WSN with an improved mechanism. Based on the data flow characteristics of WSN, we design an algorithm to release the hop information from the sink node to all nodes in a fully distributed way, and design the routing protocol based on the information. Considering failure recovery, the paper proposes a recovery algorithm to overcome node failure and communication failure. The simulation results showthat both algorithms have low communication and storage overhead and meet constraints on low energy consumption and low bandwidth of WSN while improving the fault-tolerance capability. en_AU
dc.format.extent 206192 bytes
dc.format.mimetype application/pdf
dc.language.iso en_AU
dc.title A Fault-recovery Routing Approach for Loop-based Clustering WSN en_AU
utslib.copyright.status Open Access

Files in this item

This item appears in the following Collection(s)

Show simple item record