Abstract
Mobile Data Collectors (MDCs) can be employed to provide intermittent connectivity in partitioned Wireless Sensor Networks (WSNs). Typically, an MDC serves multiple partitions to collect their sensed data and relay it to the sink node if the sink is in one of the served partitions. If not, then the data needs to be passed to another MDC serving the sink partition at a certain rendezvous location. This causes an extra waiting time for the MDCs that reach the meeting points before others. In this paper, we propose a scheduling algorithm to reduce the rendezvous waiting delay based on the tour lengths. To completely eliminate this waiting delay, we also present a solution with multiple sinks. In this approach, the partitions of the WSN are clustered using \(p\)-center optimization and Voronoi cells. An MDC is then assigned for touring each cluster’s partitions. In this way, the dependency of MDCs to relay their data to other MDCs is eliminated and the tour lengths of MDCs are balanced which minimizes the end-to-end delay significantly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Lloyd, E.L., Xue, G.: Relay node placement in wireless sensor networks. IEEE Trans. Comput. 56(1), 134–138 (2007)
Younis, M., Akkaya, K.: Strategies and techniques for node placement in wireless sensor networks: a survey. Elsevier Ad-Hoc Netw. J 6(4), 621–655 (2008)
Wang, W., Srinivasan, V., Chu, K.C.: Using mobile relays to prolong the lifetime of wireless sensor networks. In: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking (Mobicom05), Cologne, Germany, August 2005
Ma, M., Yang, Y.: Data gathering in wireless sensor networks with mobile collectors. In: IEEE International Symposium on Parallel and Distributed Processing, 2008, IPDPS 2008, pp. 1–9 (2008)
Abbas, A., Younis, M.: Interconnecting disjoint network segments using a mix of stationary and mobile nodes. In: IEEE Conference on Local Computer Networks (LCN 2012), Clearwater, FL (to appear)
Senel, F., Younis, M.: Optimized interconnection of disjoint wireless sensor network segments using k mobile data collectors. In: IEEE International Conference on Communications (ICC’12), Ottawa, Canada, June 2012
Senturk, I., Akkaya, K., Senel, F., Younis, M.: Connectivity restoration in disjoint wireless sensor networks using limited number of mobile relays. In: 2013 IEEE International Conference on Communications (ICC) (to appear)
Mladenović, N., Labbé, M., Hansen, P.: Solving the p-center problem with tabu search and variable neighborhood search. Networks 42(1), 48–64 (2003)
Cheng, X., Du, D.-Z., Wang, L., Xu, B.: Relay sensor placement in wireless sensor networks. Wirel. Netw. 14(3), 347–355 (2008)
Zhang, W., Xue, G., Misra, S.: Fault-tolerant relay node placement in wireless sensor networks: problems and algorithms. In: INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp. 1649–1657. IEEE, May 2007
Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. In: Proceedings of the 17th Annual Symposium on Foundations of Computer Science, pp. 216–227. IEEE Computer Society, Washington (1976)
Bhadauria, D., Isler, V.: Data gathering tours for mobile robots. In: Proceedings of the 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, ser. IROS’09, pp. 3868–3873. IEEE Press, Piscataway (2009)
Almasaeid, H., Kamal, A.E.: Data delivery in fragmented wireless sensor networks using mobile agents. In: 10th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), Chania, Greece, October 2007
Xing, G., Wang, T., Jia, W., Li, M.: Rendezvous design algorithms for wireless sensor networks with a mobile base station. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 231–240. ACM (2008)
Xing, G., Wang, T., Xie, Z., Jia, W.: Rendezvous planning in wireless sensor networks with mobile elements. IEEE Trans. Mob. Comput. 7(12), 1430–1443 (2008)
Somasundara, A.A., Ramamoorthy, A., Srivastava, M.B.: Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines. In: Proceedings of the 25th IEEE International Real-Time Systems Symposium, ser. RTSS ’04, pp. 296–305. IEEE Computer Society, Washington (2004). http://dx.doi.org/10.1109/REAL.2004.31 [Online]
Gu, Y., Bozdag, D., Ekici, E., Ozguner, F., Lee, C.G.: Partitioning based mobile element scheduling in wireless sensor networks. In: IEEE SECON, pp. 386–395. Citeseer (2005)
Senel, F. Younis, M.: Optimized connectivity restoration in a partitioned wireless sensor network. In: 2011 IEEE Global Telecommunications Conference (GLOBECOM 2011), pp. 1–5, December 2011
Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton (2007)
Bash, B.A., Desnoyers, P.: Exact distributed voronoi cell computation in sensor networks. In: Abdelzaher, T.F., Guibas, L.J., Welsh, M. (eds.) Proceedings of the 6th International Conference on Information Processing in Sensor Networks, IPSN 2007, Cambridge, Massachusetts, USA, 25–27 April 2007, pp. 236–243. ACM (2007)
Acknowledgment
This work is supported by US National Science Foundation under the grant number CNS 1018404. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Senturk, I.F., Akkaya, K. (2014). Mobile Data Collector Assignment and Scheduling for Minimizing Data Delay in Partitioned Wireless Sensor Networks. In: Sherif, M., Mellouk, A., Li, J., Bellavista, P. (eds) Ad Hoc Networks. ADHOCNETS 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 129. Springer, Cham. https://doi.org/10.1007/978-3-319-04105-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-04105-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04104-9
Online ISBN: 978-3-319-04105-6
eBook Packages: Computer ScienceComputer Science (R0)