Abstract
In this paper, we propose the MISTER (approximate Minimum Steiner TreE based Routing) scheme which can construct the routing paths among sinks in multi-sink wireless sensor networks or cluster heads in clustered wireless sensor networks. By extracting a hierarchically well-separated tree based on the proposed scheme, we can build a bounded approximate minimum Steiner tree among multiple sinks or cluster heads. The experiments show that the MISTER scheme can reduce the average hop counts among multiple sinks or cluster heads. Therefore, we can save the energy of wireless sensor nodes and prolong the lifetime of wireless sensor networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kulkarni, R.V., Forster, A., Venayagamoorthy, G.K.: Computational intelligence in wireless sensor networks: a survey. IEEE Commun. Surv. Tutor. 13(1), 68–96 (2011)
Rashid, B., Rehmani, M.H.: Applications of wireless sensor networks for urban areas: a survey. J. Netw. Comput. Appl. 58, 1–28 (2015)
Huang, F.K., Richards, D.S.: Steiner tree problems. Networks 22(1), 55–89 (1992)
Gao, J., Guibas, L., Milosavljevic, N., Zhou, D.: Distributed resource management and matching in sensor networks. In: 8th ACM/IEEE International Conference on Information Processing in Sensor Networks, pp. 97–108. IEEE Press, New York (2009)
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485–497 (2004)
Zhou, D., Gao, J.: Maintaining approximate minimum steiner tree and k-center for mobile agents in a sensor network. In: 29th IEEE Conference on Computer Communications, pp. 1–5. IEEE Press, New York (2010)
Acknowledgments
The work in this paper has been supported by the National Natural Science Foundation of China (Grant nos. 61402094, 61300195), the Research Fund for the Doctoral Program of Higher Education of China (Grant no. 20120042120009), the Natural Science Foundation of Hebei Province (Grant nos. F2014501078, F2016501076), and the Science and Technology Support Program of Northeastern University at Qinhuangdao (Grant no. XNK201401).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, G., Wang, Y., Wang, C., Luo, B. (2016). MISTER: An Approximate Minimum Steiner Tree Based Routing Scheme in Wireless Sensor Networks. In: Tan, Y., Shi, Y., Li, L. (eds) Advances in Swarm Intelligence. ICSI 2016. Lecture Notes in Computer Science(), vol 9713. Springer, Cham. https://doi.org/10.1007/978-3-319-41009-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-41009-8_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41008-1
Online ISBN: 978-3-319-41009-8
eBook Packages: Computer ScienceComputer Science (R0)