Open Access Open Access  Restricted Access Subscription Access

An Efficient and Robust Spanning Tree Topology to Minimize Power Consumption and Data Loss in Wireless Sensor Networks


Affiliations
1 Department of Computer Science, Sri Venkateswara University College of Engineering, Tirupati, India
 

Efficiency and Robustness to minimize power consumption and data loss in the presence of adverse conditions are desirable for the distributed applications like Wireless sensor networks (WSN). This notion is important for today’s large complex high performance systems like wireless sensor networks because they are subject to frequent disruptions due to resource contention, such disruptions are inherently unpredictable. In this paper, a methodology for constructing a spanning tree overlay network that is capable to minimize both power consumption and data loss. In this work the construction technique employ Bellman-Ford algorithm to a weighted formula for hop count and path weight that changes the relative importance as the distance from the ischolar_main node changes. This results in trees that perform for a wide variety of metrics to the problem of power consumption and data loss.

Keywords

Wireless Sensor Networks, Distributed Computing, Power Consumption, Data Loss, Efficiency, Robustness.
User
Notifications
Font Size

Abstract Views: 170

PDF Views: 0




  • An Efficient and Robust Spanning Tree Topology to Minimize Power Consumption and Data Loss in Wireless Sensor Networks

Abstract Views: 170  |  PDF Views: 0

Authors

P. Venkata Subba Reddy
Department of Computer Science, Sri Venkateswara University College of Engineering, Tirupati, India
G. Mahendra Raju
Department of Computer Science, Sri Venkateswara University College of Engineering, Tirupati, India

Abstract


Efficiency and Robustness to minimize power consumption and data loss in the presence of adverse conditions are desirable for the distributed applications like Wireless sensor networks (WSN). This notion is important for today’s large complex high performance systems like wireless sensor networks because they are subject to frequent disruptions due to resource contention, such disruptions are inherently unpredictable. In this paper, a methodology for constructing a spanning tree overlay network that is capable to minimize both power consumption and data loss. In this work the construction technique employ Bellman-Ford algorithm to a weighted formula for hop count and path weight that changes the relative importance as the distance from the ischolar_main node changes. This results in trees that perform for a wide variety of metrics to the problem of power consumption and data loss.

Keywords


Wireless Sensor Networks, Distributed Computing, Power Consumption, Data Loss, Efficiency, Robustness.