Abstract
Recent research shows that significant energy can be saved by using mobile elements (ME)for data gathering in wireless sensor networks. The major drawback of this approach is the low movement speed of MEs which limits them to gather data from all sensor nodes with time constraints. This paper presents a data gathering algorithm called Minimum Mobile Elements Routing with Deadline (M2ERD). The goal of M2ERD is to find a set of minimum cost trajectories whilst satisfying deadline constraint. A genetic algorithm is presented to determine the feasible trajectories. The effectiveness and efficiency of M2ERD are verified through extensive simulations.The presented results show that M2ERD not only can provide substantial energy saving compared with traditional data gathering algorithm, but also can reduce the cost of mobile elements compared with ME-based data gathering algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Mario, D.F., Sajal, K.: Data collection in wireless sensor networks with mobile elements: a survey. ACM Trans. Sens. Netw. 8(1), 1–34 (2011). Article 7
Cai, Z., Chen, Z., Lin, G.: A 3.4713-approximation algorithm for the capacitated multicast tree routing problem. Theor. Comput. Sci. 410(52), 5415–5424 (2009)
Cheng, S., Cai, Z., Li, J.: Curve query processing in wireless sensor networks. IEEE Transactions on Vehicular Technology
Cheng, S., Cai, Z., Li, J., Fang, X.: Drawing dominant dataset from big sensory data in wireless sensor networks. In: The 34rd Annual IEEE International Conference on Computer Communications (INFOCOM) (2015)
He, Z., Cai, Z., Cheng, S., Wang, X.: Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks. Theoretical Computer Science
Christian, P.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31, 1985–2002 (2004)
Yao, X., Huang, H., Tang, J., et al.: Residual energy aware mobile data gathering in wireless sensor networks. Telecomun. Syst. 59(148), 1–11 (2015)
Zhao, M., Yang, Y., Wang, C.: Mobile data gathering with load balanced clustering and dual data uploading in wireless sensor networks. IEEE Trans. Mob. Comput. 14(04), 770–785 (2015)
Somasundara, A., Ramamoorthy, A., Srivastava, M.B.: Mobile element scheduling with dynamic deadlines. IEEE Trans. Mob. Comput. 6(4), 395–410 (2007)
Xing, G., Wang, T., Jia, W., Li, M.: Efficient rendezvous algorithms for mobility-enabled wireless sensor networks. IEEE Trans. Mob. Comput. 11, 47–60 (2012)
Abdullah, A.I., Khaled, K.D., Alasha’ary, H.A., Al-Qadi, Z.A.: Connectivity-based data gathering with path-constrained mobile sink in wireless sensor networks. Wirel. Sens. Netw. 6, 118–128 (2014)
Acknowledgment
This work was supported by the National Science Foundation of China(61100048, 61370222), the Science and technology project of Heilongjiang Provincial Education Department(12531498), and the Heilongjiang province university science and technology innovation team project(2013TD102).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Yin, X., Zhu, J., Li, Y., Wu, Z. (2015). Mobile Data Gathering with Time-Constraints in Wireless Sensor Networks. In: Xu, K., Zhu, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2015. Lecture Notes in Computer Science(), vol 9204. Springer, Cham. https://doi.org/10.1007/978-3-319-21837-3_68
Download citation
DOI: https://doi.org/10.1007/978-3-319-21837-3_68
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21836-6
Online ISBN: 978-3-319-21837-3
eBook Packages: Computer ScienceComputer Science (R0)