Abstract
This paper proposes a mathematical optimization model to maximize the lifetime of wireless sensor networks through determining the optimal trajectory (OT) of mobile sink (MS). We address deadline and event based applications where by capturing an event, a sensor node has to send its data to MS in a restricted time slot defined as a deadline. We demonstrate that the addressed problem is in NP-hard form and then by dividing the problem into two phases, we propose a heuristic approach based on mathematical optimization. In the first phase, the trajectory of MS is determined through proposing a convex mathematical optimization model; in this step, we specify an optimal line as OT with respect to the current location and constant velocity of MS; moreover, the volume of captured data by sensor nodes, deadline and geographical locations of sensor nodes are taken into account. We extend our work in the second phase by proposing a mixed integer linear programming (MILP) model to relax the constant velocity assumption of MS. To obtain an optimal solution of MILP, subsequently a tabu-based algorithm is proposed. The effectiveness of our approach is validated via the extensive number of simulation runs and comparison with other proposed algorithms.
Similar content being viewed by others
Notes
This assumption will be relaxed in Sect. 4.
References
Luo, J., & Hubaux, J.-P. (2010). Joint sink mobility and routing to increase the lifetime of wireless sensor networks: The case of constrained mobility. IEEE/ACM Transactions on Networking, 18(5), 1387–1400.
Gandham, S. R, Dawande, M., et al. (2003). Energy efficient schemes for wireless sensor networks with multiple mobile base stations. In Proceeding of the Globecom’03 (pp. 377–381).
Jain, S., Shah, R. C., Brunette, W., Borriello, G., & Roy, S. (2006). Exploiting mobility for energy efficient data collection in sensor networks. Mobile Networks and Applications, 11(3), 327–339.
Chakrabarti, A., Sabharwal, A., & Aazhang, B. (2006). Communication power optimization in a sensor network with a path-constrained mobile observer. ACM Transactions on Sensor Networks, 2(3), 297–324.
Song, L., & Hatzinakos, D. (2007). Architecture of wireless sensor networks with mobile sinks: Sparsely deployed sensors. IEEE Transactions on Vehicular Technology, 56(4), 1826–1836.
Jea, D., Somasundara, A., & Srivastava, M. (2005). Multiple controlled mobile elements (data mules) for data collection in sensor networks. Distributed computing in sensor systems (pp. 244–257). Berlin: Springer.
Li, Z., Li, M., Wang, J., & Cao, Z. (2011). Ubiquitous data collection for mobile users in wireless sensor networks. In Proc. of IEEEINFOCOM’11. Shanghai.
Shah, R. C., et al. (2003). Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 1(2), 215–233.
Tong, L., Zhao, Q., & Adireddy, S. (Oct 2003). Sensor networks with mobile agents. In Proc., IEEE MILCOM 2003, vol. 22 (pp. 688–693). Boston, MA.
Shi, Y., & Hou, Y. T. (2009). Optimal base station placement in wireless sensor networks. ACM Transactions on Sensor Networks, 5(4), 32.
Yun, Y., & Xia, Y. (2010). Maximizing the lifetime of wireless sensor networks with mobile sink in delay-tolerant applications. IEEE Transaction on Mobile, Computing, 9(9), 1308–1318.
Xing, G., Li, M., Wang, T., Jia, W., & Huang, J. (2012). Efficient rendezvous algorithms for mobility-enabled wireless sensor networks. IEEE Transactions on Mobile Computing, 11(1), 47–60.
Wang, Y.-C., Peng, W.-C., & Tseng, Y.-C. (2010). Energy-balanced dispatch of mobile sensors in a hybrid wireless sensor network. IEEE Transactions on Parallel and Distributed Systems, 12, 1836–1850.
Gu, Y., et al. (2013). ESWC: Efficient scheduling for the mobile sink in wireless sensor networks with delay constraint. IEEE Transactions on Parallel and Distributed Systems, 24(7), 1310–1320.
Zhao, M., Ma, M., & Yang, Y. (2010). Efficient data gathering with mobile collectors and space-division multiple access technique in wireless sensor networks. IEEE Transactions on Computers, 60(3), 400–417.
Basagni, S., et al. (2008). Controlled sink mobility for prolonging wireless sensor networks lifetime. Wireless Networks, 14(6), 831–858.
Shi, Y., & Hou, Y. T. (2008). Theoretical results on base station movement problem for sensor network. In The 27th conference on computer communications. IEEE INFOCOM.
Xing, G., Wang, T., Xie, Z., & Jia, W. (2008). Rendezvous planning in wireless sensor networks with mobile elements. IEEE Transactions on Mobile Computing, 7(11), 1–14.
Tashtarian, F., Yaghmaee Moghaddam, M. H., Sohraby, K., & Effati, S. (2014). On maximizing the lifetime of wireless sensor networks in event-driven applications with mobile sinks. IEEE Transactions on Vehicular Technology, 64(7), 3177–3189.
Konstantopoulos, C., Pantziou, G., Gavalas, D., Mpitziopoulos, A., & Mamalis, B. (2012). A rendezvous-based approach enabling energy-efficient sensory data collection with mobile sinks. IEEE Transaction Parallel Distributed System, 23, 809–817.
Liang, W., Luo, J., & Xu, X. (2010). Prolonging network lifetime via a controlled mobile sink in wireless sensor networks. In Proc. of Globecom’10, IEEE.
Pan, J., Cai, L., Hou, Y. T., Shi, Y., & Shen, S. X. (2005). Optimal base-station locations in two-tiered wireless sensor networks. IEEE Transaction on Mobile Computing, 4(5), 458–473.
MathWorks—MATLAB and simulink for technical computing. http://www.mathworks.com.
Gao, S., et al. (2011). Efficient data collection in wireless sensor networks with path-constrained mobile sinks. IEEE Transaction on Mobile Computing, 10(5), 1–9.
Tashtarian, F., Yaghmaee Moghaddam, M. H., Sohraby, K., & Effati, S. (2015). ODT: Optimal deadline-based trajectory for mobile sinks in WSN: A decision tree and dynamic programming approach. Computer Networks, 77, 128–143.
Ye, F., Luo, H., Cheng, J., Lu, S., & Zhang, L. (Sep 2002). A two-tier data dissemination model for large-scale wireless sensor networks. In Proceedings of ACM the 8th annual international conference on mobile computing and networking, ser. MobiCom’02 (pp. 148–159). Atlanta, Georgia.
Liu, X., Member, S., & Zhao, H. (2013). SinkTrail: A proactive data reporting protocol for wireless sensor networks. IEEE Transactions on Computers, 62(1), 151–162.
Heinzelman, W. B., et al. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications, 1(4), 660–670.
Vavasis, S. A. (1991). Nonlinear optimization: Complexity issues. Oxford: Oxford University Press.
Boyd, S. P., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press.
Manyem, P., & Ugon, J. (2012). Computational complexity, NP completeness and optimization duality: A survey. Electronic Colloquium on Computational Complexity (ECCC), 19, 9.
Vapnik, V. N. (1995). The nature of statistical learning theory. NewYork: Springer.
Glover, F. (1989). Tabu search, part I. ORSA Journal on Computing, 1, 190–206.
Glover, F. (1990). Tabu search, part II. ORSA Journal on Computing, 2, 4–32.
Rhazi, A. E., & Pierre, S. (2009). A Tabu search algorithm for cluster building in wireless sensor networks. IEEE Transactions on Mobile Computing, 8(4), 433–444.
TOMLAB/CPLEX. http://tomopt.com/.
Acknowledgments
This work was partially supported by “Mashhad Branch, Islamic Azad University, Mashhad, Iran”. Any opinion, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect those of the host institution or funders.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tashtarian, F., Majma, M.R., Pedram, H. et al. Controlling Mobile Sink Trajectory for Data Harvesting in Wireless Sensor Networks. Wireless Pers Commun 90, 1149–1178 (2016). https://doi.org/10.1007/s11277-016-3383-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-016-3383-9