Abstract
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multiple sinks. We design an approximation algorithm to minimize the latency of data collection schedule and show that it gives a constant-factor performance guarantee. We also present a heuristic algorithm based on breadth first search for this problem. Using simulation, we evaluate the performance of these two algorithms, and show that the approximation algorithm outperforms the heuristic up to 60%.
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
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Sciences 43(2), 290–298 (1991)
Balakrishnan, H., Barrett, C., Anil Kumar, V.S., Marathe, M., Thite, S.: The distance 2-matching problem and its relationship to the mac layer capacity of adhoc wireless networks. IEEE J. Selected Areas in Connunications 22(6) (August 2004)
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45(1), 104–126 (1992)
Cheng, W.C., Chou, C.-F., Golubchik, L., Khuller, S., (Justin) Wan, Y.-C.: Large-scale data collection: a coordinated approach. In: IEEE Infocom (2003)
Florens, C., McEliece, R.: Packets distribution algorithms for sensor networks. In: IEEE Infocom (2003)
Ford, L.R., Fulkerson, D.R.: Flows in networks. Princeton University Press, New Jersey (1962)
Gandhi, R., Parthasarathy, S., Mishra, A.: Minimizing broadcast latency and redundancy in ad hoc networks. In: ACM MobiHoc 2003, pp. 222–232 (2003)
Gandhi, R., Kim, Y.-A., Lee, S., Ryu, J., Wan, P.-J.: Approximation algorithm for data broadcast and collection in wireless networks. In: IEEE Infocom (Mini conference) (2009)
Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)
Hopper, B., Tardors, E.: Polynomial time algorithms for some evacuation problems. In: SODA: ACM-SIAM Symposium on Discrete Algorithms, pp. 512–521 (1994)
Huang, Q., Zhang, Y.: Radial coordination for convergecast in wireless sensor networks. In: LCN 2004: Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks, Washington, DC, USA, 2004, pp. 542–549. IEEE Computer Society Press, Los Alamitos (2004)
Huang, S.C.-H., Wan, P.-J., Deng, J., Han, Y.S.: Broadcast scheduling in interference environment. IEEE Trans. on Mobile Computing 7(11), 1338–1348 (2008)
Huang, S.C.-H., Wan, P.-J., Jia, X., Du, H., Shang, W.: Minimum-latency broadcast scheduling in wireless ad hoc networks. In: Proceedings of 26th IEEE Infocom, pp. 733–739 (2007)
Huang, S.C.-H., Wan, P.-J., Vu, C.T., Li, Y., Yao, F.: Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: Proceedings of 26th IEEE Infocom, pp. 366–372 (2007)
Kesselman, A., Kowalski, D.R.: Fast distributed algorithm for convergecast in ad hoc geometric radio networks. J. Parallel Distrib. Comput. 66(4), 578–585 (2006)
Anil Kumar, V.S., Marathe, M., Parthasarathy, S., Srinivasan, A.: End-to-end packet scheduling in ad hoc networks. In: ACM-SIAM symposium on Discrete Algorithms, SODA, pp. 1014–1023 (2004)
Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Algorithmic aspects of capacity in wireless networks. In: SIGMETRICS, Banff, Alberta, Canada (June 2005)
Upadhyayula, S., Annamalai, V., Gupta, S.K.S.: A low-latency and energy-efficient algorithm for convergecast in wireless sensor networks. In: IEEE Global Telecommunications Conference, pp. 3525–3530 (2003)
Yi, S., Pei, Y., Kalyanaraman, S.: On the capacity improvement of ad hoc wireless networks using deirectional antennas. In: Proceedings of 4th ACM international symposium on Mobile ad hoc networking and computing, pp. 108–116 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, S., Coolbeth, M., Dinh, H., Kim, YA., Wang, B. (2009). Data Collection with Multiple Sinks in Wireless Sensor Networks. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)