Distributed Energy Efficient Data Gathering without Aggregation via Spanning Tree Optimization

A distributed algorithm that solves energy efficient data gathering Weighted Spanning Tree Distributed Optimization (WSTDO) is proposed in this paper. It is based on an optimization performed locally on the data gathering spanning tree. WSTDO algorithm is compared to two centralized spanning tree optimization algorithms MITT and MLTTA. The performance of WSTDO achieves between one half and one third of the MITT performance and proves to be better than MLTTA. The performance depends on the density of the network. It works better for sparse networks. WSTDO has lower overhead than MITT and MLTTA for sparse networks. Though the proposed algorithm has a worse performance than MITT it has other features that over-weights this fact. It is able to perform optimization parallely in disjoint sub-trees and also during data gathering which allows a short data sampling period. It is also prone to link and node failures that can be solved locally.

[1]  Toshiaki Miyazaki,et al.  An Autonomous Multicast-tree Creation Algorithm for Wireless Sensor Networks , 2007, Future Generation Communication and Networking (FGCN 2007).

[2]  Ness B. Shroff,et al.  On optimal energy efficient convergecasting in unreliable sensor networks with applications to target tracking , 2011, MobiHoc '11.

[3]  R. Wattenhofer,et al.  Dozer: Ultra-Low Power Data Gathering in Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[4]  Jiannong Cao,et al.  An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  Hong Chen,et al.  Constructing Maximum-Lifetime Data Gathering Tree without Data Aggregation for Sensor Networks , 2011 .

[6]  François Ingelrest,et al.  Localized broadcast incremental power protocol for wireless ad hoc networks , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[7]  Ernest J. H. Chang,et al.  Echo Algorithms: Depth Parallel Operations on General Graphs , 1982, IEEE Transactions on Software Engineering.

[8]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[9]  Roger Lee.  Computer and Information Science 2011 , 2011 .

[10]  Adam Dunkels,et al.  Cross-Level Sensor Network Simulation with COOJA , 2006, Proceedings. 2006 31st IEEE Conference on Local Computer Networks.

[11]  Guihai Chen,et al.  Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[12]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Ness B. Shroff,et al.  Maximizing Energy Efficiency for Convergecast via Joint Duty Cycle and Route Optimization , 2010, 2010 Proceedings IEEE INFOCOM.

[14]  Hanan Shpungin,et al.  Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks , 2011, FOMC '11.