An image processing inspired mobile sink solution for energy efficient data gathering in wireless sensor networks

This paper presents a gradient-based multi-hop clustering protocol combined with a mobile sink (MS) solution for efficient data gathering in wireless sensor networks. The main insight for the clustering algorithm is drawn from image processing field and namely from the watershed transform, widely used for image segmentation. The proposed algorithm creates multi-hop clusters whose cluster heads (CHs) as well as cluster members near the CHs have high energy reserves. Specifically, the energy of the sensors in a cluster increases progressively as getting closer to the CH. As the nodes closer to the CH are most burdened with relaying of data from other cluster members, the higher levels of available energy at these nodes prolong the network lifetime eventually. After cluster formation, a MS periodically visits each CH and collects the data from cluster members already gathered at the CH. Simulation results show the higher performance of the proposed scheme in comparison to other competent approaches in the literature.

[1]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[2]  Emanuel Melachrinoudis,et al.  Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[3]  Yuanyuan Yang,et al.  SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[4]  Marc Renaudin,et al.  Parallel Asynchronous Watershed Algorithm-Architecture , 2007, IEEE Transactions on Parallel and Distributed Systems.

[5]  Fernand Meyer,et al.  Topographic distance and watershed lines , 1994, Signal Process..

[6]  Hongke Zhang,et al.  Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks , 2011, IEEE Trans. Mob. Comput..

[7]  Weifa Liang,et al.  Online Data Gathering for Maximizing Network Lifetime in Sensor Networks , 2007, IEEE Transactions on Mobile Computing.

[8]  Milind Dawande,et al.  Energy efficient schemes for wireless sensor networks with multiple mobile base stations , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[9]  Charalampos Konstantopoulos,et al.  Clustering in Wireless Sensor Networks , 2009 .

[10]  Michael W. Marcellin,et al.  A Theory for Maximizing the Lifetime of Sensor Networks , 2007, IEEE Transactions on Communications.

[11]  Saurabh Bagchi,et al.  Efficient collection of sensor data in remote fields using mobile collectors , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[12]  L. Friedmann,et al.  Efficient Multi-sink Relocation in Wireless Sensor Network , 2007, International Conference on Networking and Services (ICNS '07).

[13]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[14]  Murat Demirbas,et al.  Data Salmon: A Greedy Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks , 2007, DCOSS.

[15]  Jun Luo,et al.  Joint mobility and routing for lifetime elongation in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Subir K. Biswas,et al.  Network-assisted sink navigation for distributed data gathering: Stability and delay-energy trade-offs , 2010, Comput. Commun..

[17]  Charalampos Konstantopoulos,et al.  Watershed-Based Clustering for Energy Efficient Data Gathering in Wireless Sensor Networks with Mobile Collector , 2012, Euro-Par.

[18]  Rajesh K. Gupta,et al.  Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[19]  Shi Zhang,et al.  An energy balanced multihop adaptive clustering protocol for wireless sensor networks , 2010, 2010 2nd International Conference on Signal Processing Systems.

[20]  Charalampos Konstantopoulos,et al.  A Rendezvous-Based Approach Enabling Energy-Efficient Sensory Data Collection with Mobile Sinks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[21]  Sungyoung Lee,et al.  A coordination-based data dissemination protocol for wireless sensor networks , 2004, Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, 2004..

[22]  Ioannis Chatzigiannakis,et al.  Efficient data propagation strategies in wireless sensor networks using a single mobile sink , 2008, Comput. Commun..

[23]  Liusheng Huang,et al.  On the Throughput Capacity of Wireless Sensor Networks With Mobile Relays , 2012, IEEE Transactions on Vehicular Technology.

[24]  Tsutomu Maruyama,et al.  Real-time image segmentation based on a parallel and pipelined watershed algorithm , 2007, Journal of Real-Time Image Processing.

[25]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[26]  Deborah Estrin,et al.  Controllably mobile infrastructure for low energy embedded networks , 2006, IEEE Transactions on Mobile Computing.

[27]  Guoliang Xing,et al.  Rendezvous Planning in Wireless Sensor Networks with Mobile Elements , 2008, IEEE Transactions on Mobile Computing.

[28]  Hyung Seok Kim,et al.  Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks , 2003, SenSys '03.

[29]  Emanuel Melachrinoudis,et al.  Controlled sink mobility for prolonging wireless sensor networks lifetime , 2008, Wirel. Networks.

[30]  Ivan Stojmenovic,et al.  Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[31]  Guoliang Xing,et al.  Rendezvous design algorithms for wireless sensor networks with a mobile base station , 2008, MobiHoc '08.

[32]  Sajal K. Das,et al.  Promoting Heterogeneity, Mobility, and Energy-Aware Voronoi Diagram in Wireless Sensor Networks , 2008, IEEE Transactions on Parallel and Distributed Systems.

[33]  José D. P. Rolim,et al.  Optimal data gathering paths and energy-balance mechanisms in wireless networks , 2010, Ad Hoc Networks.

[34]  Krishna M. Sivalingam,et al.  Energy-efficient mobile data collection in Wireless Sensor Networks with delay reduction using wireless communication , 2010, 2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010).

[35]  Rolland Vida,et al.  Adaptive Sink Mobility in Event-Driven Densely Deployed Wireless Sensor Networks , 2007, Ad Hoc Sens. Wirel. Networks.

[36]  Ivan Stojmenovic,et al.  Sink Mobility in Wireless Sensor Networks , 2010 .

[37]  Moncef Gabbouj,et al.  Parallel watershed transformation algorithms for image segmentation , 1998, Parallel Comput..

[38]  Rajesh K. Gupta,et al.  Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility , 2008, DCOSS.

[39]  Kien A. Hua,et al.  Mobile Data Collection Networks for Wireless Sensors , 2012, MCSS.

[40]  Sajal K. Das,et al.  Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey , 2011, TOSN.

[41]  Cynthia A. Phillips,et al.  Coordinated and controlled mobility of multiple sinks for maximizing the lifetime of wireless sensor networks , 2011, Wirel. Networks.

[42]  Ioannis Papadimitriou,et al.  Maximum Lifetime Routing to Mobile Sink in Wireless Sensor Networks , 2005 .

[43]  José D. P. Rolim,et al.  Fast and energy efficient sensor data collection by multiple mobile sinks , 2007, MobiWac '07.

[44]  Pierre Soille,et al.  Morphological Image Analysis: Principles and Applications , 2003 .

[45]  Elyes Ben Hamida,et al.  Strategies for data dissemination to mobile sinks in wireless sensor networks , 2008, IEEE Wireless Communications.

[46]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.