On Maximizing the Lifetime of Wireless Sensor Networks in Event-Driven Applications With Mobile Sinks

Recent studies have shown that utilizing a mobile sink (MS) to harvest and carry data from a wireless sensor network (WSN) can enhance network operations and increase the network lifetime. Since a significant portion of sensor nodes' energy is consumed for data transmission to an MS, the specific trajectory has a profound influence on the lifetime of a WSN. In this paper, we study the problem of controlling sink mobility in event-driven applications to achieve maximum network lifetime. In these applications, an MS with limited velocity has to harvest the captured data of events from a group of sensor nodes in a specific time as a reporting time slot. We show that this problem is NP-hard, and then, we propose a convex optimization model inspired by the support vector regression technique to determine an optimal trajectory of an MS without considering predefined structures such as a virtual grid or rendezvous points. The effectiveness of our approach is validated via the extensive number of simulation runs and comparison with other algorithms.

[1]  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.

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

[3]  Lang Tong,et al.  Sensor networks with mobile agents , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[4]  Norman C. Beaulieu,et al.  A Mobile-Sink-Based Packet Transmission Scheduling Algorithm for Dense Wireless Sensor Networks , 2009, IEEE Transactions on Vehicular Technology.

[5]  Mo Li,et al.  Ubiquitous data collection for mobile users in wireless sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[6]  L. Tong,et al.  Energy Efficient Data Collection in Sensor Networks , 2022 .

[7]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[8]  Ashutosh Sabharwal,et al.  Communication power optimization in a sensor network with a path-constrained mobile observer , 2006, TOSN.

[9]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[10]  Catherine Rosenberg,et al.  Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control, and Rate Adaptation , 2010, IEEE/ACM Transactions on Networking.

[11]  Mani B. Srivastava,et al.  Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks , 2005, DCOSS.

[12]  K. Sohraby,et al.  A Generalized Random Mobility Model for Wireless Ad Hoc Networks and Its Analysis: One-Dimensional Case , 2007, IEEE/ACM Transactions on Networking.

[13]  Dimitrios Hatzinakos,et al.  Architecture of Wireless Sensor Networks With Mobile Sinks: Sparsely Deployed Sensors , 2007, IEEE Transactions on Vehicular Technology.

[14]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[15]  Julien Ugon,et al.  Computational Complexity, NP Completeness and Optimization Duality: A Survey , 2012, Electron. Colloquium Comput. Complex..

[16]  Zhisheng Niu,et al.  Motion-Indicated Interest Dissemination With Directional Antennas for Wireless Sensor Networks With Mobile Sinks , 2006, IEEE Transactions on Vehicular Technology.

[17]  Samuel Pierre,et al.  A Tabu Search Algorithm for Cluster Building in Wireless Sensor Networks , 2009, IEEE Transactions on Mobile Computing.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[20]  S Sujatha,et al.  Efficient Data Gathering With Mobile Collectors and Space-Division Multiple Access Technique in Wireless Sensor Networks , 2014 .

[21]  Jonathan Cole Smith,et al.  Distributed algorithm for lifetime maximization in delay-tolerant wireless sensor network with mobile sink , 2010, 49th IEEE Conference on Decision and Control (CDC).

[22]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

[24]  Yu-Chee Tseng,et al.  Energy-Balanced Dispatch of Mobile Sensors in a Hybrid Wireless Sensor Network , 2010, IEEE Transactions on Parallel and Distributed Systems.

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

[26]  Sven Leyffer,et al.  Mixed Integer Nonlinear Programming , 2011 .

[27]  Yu Gu,et al.  ESWC: Efficient Scheduling for the Mobile Sink in Wireless Sensor Networks with Delay Constraint , 2013, IEEE Transactions on Parallel and Distributed Systems.

[28]  Yiwei Thomas Hou,et al.  Theoretical Results on Base Station Movement Problem for Sensor Network , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[29]  S. Vavasis.  Nonlinear optimization: complexity issues , 1991 .

[30]  Jianping Pan,et al.  Optimal base-station locations in two-tiered wireless sensor networks , 2005, IEEE Transactions on Mobile Computing.

[31]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[32]  Gaetano Borriello,et al.  Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks , 2006, Mob. Networks Appl..

[33]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[34]  K. Sohraby,et al.  Two-Dimensional Modeling and Analysis of Generalized Random Mobility Models for Wireless Ad Hoc Networks , 2007, IEEE/ACM Transactions on Networking.

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

[36]  Yiwei Thomas Hou,et al.  Optimal base station placement in wireless sensor networks , 2009, TOSN.

[37]  Ye Xia,et al.  Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications , 2010, IEEE Transactions on Mobile Computing.

[38]  Jun Zheng,et al.  Double-Blind Data Discovery Using Double Cross for Large-Scale Wireless Sensor Networks With Mobile Sinks , 2012, IEEE Transactions on Vehicular Technology.

[39]  Weifa Liang,et al.  Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[40]  Guoliang Xing,et al.  Efficient Rendezvous Algorithms for Mobility-Enabled Wireless Sensor Networks , 2012, IEEE Transactions on Mobile Computing.

[41]  Guoliang Xing,et al.  Performance Analysis of Wireless Sensor Networks With Mobile Sinks , 2012, IEEE Transactions on Vehicular Technology.

[42]  Abbas Jamalipour,et al.  A Novel Information Acquisition Technique for Mobile-Assisted Wireless Sensor Networks , 2012, IEEE Transactions on Vehicular Technology.

[43]  Ling Liu,et al.  Protecting Location Privacy with Personalized k-Anonymity: Architecture and Algorithms , 2008, IEEE Transactions on Mobile Computing.

[44]  Jun Luo,et al.  Joint Sink Mobility and Routing to Maximize the Lifetime of Wireless Sensor Networks: The Case of Constrained Mobility , 2010, IEEE/ACM Transactions on Networking.

[45]  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).