Relay augmentation for lifetime extension of wireless sensor networks

The authors propose a novel relay augmentation strategy for extending the lifetime of a certain class of wireless sensor networks. In this class sensors are located at fixed and pre-determined positions and all communication takes place through multi-hop paths in a fixed routing tree rooted at the base station. It is assumed that no accumulation of data takes place along the communication paths and that there is no restriction on where additional relays may be located. Under these assumptions the optimal extension of network lifetime is modelled as the Euclidean k -bottleneck Steiner tree problem. Only two approximation algorithms for this NP-hard problem exist in the literature: a minimum spanning tree heuristic (MSTH) with performance ratio 2, and a probabilistic 3-regular hypergraph heuristic (3RHH) with performance ratio √(3) + e. The authors present a new iterative heuristic that incorporates MSTH and show through simulation that their algorithm performs better than MSTH in extending lifetime, and outperforms 3RHH in terms of efficiency.

[1]  Hossam S. Hassanein,et al.  Relay Node Deployment Strategies in Heterogeneous Wireless Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[2]  Sang Won Bae,et al.  On exact solutions to the Euclidean bottleneck Steiner tree problem , 2010, Inf. Process. Lett..

[3]  K. Chao,et al.  Steiner Minimal Trees , 2005 .

[4]  Konstantinos Kalpakis,et al.  A combinatorial algorithm for the maximum lifetime data gathering with aggregation problem in sensor networks , 2009, Comput. Commun..

[5]  Raouf Boutaba,et al.  On Balancing Energy Consumption in Wireless Sensor Networks , 2009, IEEE Transactions on Vehicular Technology.

[6]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[7]  Xue Liu,et al.  Density-Varying High-End Sensor Placement in Heterogeneous Wireless Sensor Networks , 2009, 2009 IEEE International Conference on Communications.

[8]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[9]  G. O. Wesolowsky,et al.  A multi-facility minimax location method for Euclidean distances , 1973 .

[10]  Jon Lee,et al.  A First Course in Combinatorial Optimization: Frontmatter , 2004 .

[11]  Sang Won Bae,et al.  Exact Algorithms for the Bottleneck Steiner Tree Problem , 2011, Algorithmica.

[12]  Errol L. Lloyd,et al.  Relay Node Placement in Wireless Sensor Networks , 2011, IEEE Transactions on Computers.

[13]  Haibo Zhang,et al.  Balancing Energy Consumption to Maximize Network Lifetime in Data-Gathering Sensor Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[14]  Vangelis Th. Paschos,et al.  Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics , 2006, Eur. J. Oper. Res..

[15]  Lusheng Wang,et al.  The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points , 2001, COCOON.

[16]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[17]  Chak-Kuen Wong,et al.  Bottleneck Steiner Trees in the Plane , 1992, IEEE Trans. Computers.

[18]  Lusheng Wang,et al.  Approximations for a Bottleneck Steiner Tree Problem , 2001, Algorithmica.

[19]  Marcus Brazil,et al.  The bottleneck 2-connected k-Steiner network problem for k≤2 , 2011, Discret. Appl. Math..

[20]  S. Manesis,et al.  A Survey of Applications of Wireless Sensors and Wireless Sensor Networks , 2005, Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation Intelligent Control, 2005..

[21]  E. Demaine,et al.  Deploying Sensor Nets with Guaranteed Capacity and Fault Tolerance , 2022 .

[22]  Saurabh Ganeriwal,et al.  Aggregation in sensor networks: an energy-accuracy trade-off , 2003, Ad Hoc Networks.

[23]  Mark A. Shayman,et al.  Relay Deployment and Power Control for Lifetime Elongation in Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[24]  J.-S. Li,et al.  Voronoi-based relay placement scheme for wireless sensor networks , 2009, IET Commun..

[25]  G. O. Wesolowsky,et al.  A New Method for the Multifacility Minimax Location Problem , 1978, The Journal of the Operational Research Society.

[26]  Marcus Brazil,et al.  Approximating minimum Steiner point trees in Minkowski planes , 2010, Networks.

[27]  Feng Wang,et al.  Traffic-Aware Relay Node Deployment for Data Collection in Wireless Sensor Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[28]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[29]  Konrad J. Swanepoel,et al.  Generalised k-Steiner Tree Problems in Normed Planes , 2013, Algorithmica.

[30]  Tingting Zhang,et al.  Bottleneck zone analysis in energy-constrained wireless sensor networks , 2009, IEEE Communications Letters.

[31]  Hans Jürgen Prömel,et al.  A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 , 2000, J. Algorithms.