Location of Repository

An Enhanced Spanning Tree Topology for Wireless Sensor Networks

By Smita A. Attarde, Lata L. Ragha and Shital K. Dhamal

Abstract

Most of the parallel and distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environment. An approach to robustness is considered for applications that operate on a spanning tree overlay network. For such applications, a robust spanning tree is designed by considering a weighted combination of hop count and path weight. The robust spanning tree topology shows good performance when applied to wireless sensor network. For wireless sensor networks, the expected data loss and power consumption metrics are very important. When both of these metrics are considered, the proposed robust tree shows average results as compared with the existing spanning tree topologies. When a node fails, the expected data loss is also average when compared with the existing trees like Dijkstra’s, fewest hop and Prim’s minimum spanning tree topologies

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.184.5087
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ijcaonline.org/allp... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.