Skip to main content
SpringerLink
Log in

MISTER: An Approximate Minimum Steiner Tree Based Routing Scheme in Wireless Sensor Networks

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9713))

Included in the following conference series:

  • 1765 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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)

    Article  Google Scholar 

  2. Rashid, B., Rehmani, M.H.: Applications of wireless sensor networks for urban areas: a survey. J. Netw. Comput. Appl. 58, 1–28 (2015)

    Article  Google Scholar 

  3. Huang, F.K., Richards, D.S.: Steiner tree problems. Networks 22(1), 55–89 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Article  MathSciNet  MATH  Google Scholar 

  6. 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)

    Google Scholar 

Download references

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

  1. School of Computer and Communication Engineering, Northeastern University at Qinhuangdao, Qinhuangdao, 066004, Hebei, China

    Guorui Li, Cong Wang & Biao Luo

  2. Department of Information Engineering, Qinhuangdao Institute of Technology, Qinhuangdao, 066100, Hebei, China

    Ying Wang

Authors
  1. Guorui Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Biao Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guorui Li .

Editor information

Editors and Affiliations

  1. Peking University, Beijing, China

    Ying Tan

  2. Xi'an Jiaotong-Liverpool University, Suzhou, China

    Yuhui Shi

  3. Shenzen University, Shenzhen, China

    Li Li

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation