Skip to main content

WSN Multi-hop Routing Algorithm Based on Path Quality Comparison in New Energy Consumption Distance Node Relation Model

  • Conference paper
  • First Online:
Artificial Intelligence and Security (ICAIS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 11634))

Included in the following conference series:

  • 1314 Accesses

Abstract

The wireless sensor network is an important technology of the Internet of things. In the sensor network, the limited energy and uneven distribution of nodes lead to unbalanced load of nodes, and reduce the quality of network and the survival time. In order to eliminate the lack of space distance relationships between two nodes, this paper makes an improvement to the node relation model and proposes the concept of Energy Consumption Distance (ECD). According to the relation model, a multi-hop routing algorithm based on path goodness degree (MRPGD) is proposed. The core idea of the algorithm is that the path lifetime combines with the data redundancy to form the link quality index after the path failure, and the link quality index is the path goodness degree (PGD). The source node uses the higher PGD path to return data, and accurately calculates the transmission paths of all nodes in the network, which can completely draw the network topology. This method can effectively suppress the hot spots in the network and effectively prolong the lifetime. The results show that the proposed algorithm has a 36% increase in the network lifetime compared with the related algorithms.

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

Access this chapter

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. Mohanty, P., Kabat, M.R.: Energy efficient structure-free data aggregation and delivery in WSN. Egypt. Inform. J. 17(3), 273–284 (2016)

    Article  Google Scholar 

  2. Mostafaei, H., Montieri, A., Persico, V.: A sleep scheduling approach based on learning automata for WSN partialcoverage. J. Netw. Comput. Appl. 80(C), 67–78 (2017)

    Article  Google Scholar 

  3. Bakr, B.A., Lilien, L.T.: Extending lifetime of wireless sensor networks by management of spare nodes. Proc. Comput. Sci. 34, 493–498 (2014)

    Article  Google Scholar 

  4. Shi, X.-B., Zhang, Y., Zhao, B.: Discrete multi-objective optimization of particle swarm optimizer algorithm for multi-agents collaborative planning. J. Commun. 37(6), 29–37 (2016)

    Google Scholar 

  5. Zhang, X.-W., Shen, L., Jiang, Y.-F.: Optimizing path selection of mobile Sink nodes in mobility-assistant WSN. J. Commun. 34(2), 85–93 (2013)

    Google Scholar 

  6. Heinzelman, W.R., Chandrakasan, A.: Energy-efficient communication protocol for wireless microsensor networks. Adhoc Sens. Wirel. Netw. 2(10), 10–18 (2000)

    Google Scholar 

  7. Manjeshwar, A., Agrawal, D.P.: TEEN: a routing protocol for enhanced efficiency in wireless sensor networks. In: International Parallel & Distributed Processing Symposium, pp. 189–194. IEEE Computer Society (2001)

    Google Scholar 

  8. Wang, J., Ju, C., Gao, Y., Sangaiah, A.K., Kim, G.J.: A PSO based energy efficient coverage control algorithm for wireless sensor networks. CMC Comput. Mater. Continua 56(3), 433–446 (2018)

    Google Scholar 

  9. Jaideep, K., Kamaljit, K.: A fuzzy approach for an IoT-based automated employee performance appraisal. CMC: Comput. Mater. Continua 53(1), 23–36 (2017)

    Google Scholar 

  10. Zhang, D., Zhao, C., Li, G.: A kind of routing protocol based on forward-aware factor for energy balance. Acta Electronica Sinica 42(1), 113–118 (2014)

    Google Scholar 

  11. Weng, C.E., Lai, T.W.: An energy-efficient routing algorithm based on relative identification and direction for wireless sensor networks. Wireless Pers. Commun. 69(1), 253–268 (2013)

    Article  Google Scholar 

  12. Du, H., Li, Q., Ding, G.: The research of AODV routing protocol based on link quality and node energy in WSN. Chin. J. Sens. Actuators 29(7), 1042–1048 (2016)

    Google Scholar 

  13. Sun, Y., Peng, J., Liu, T.: Uneven clustering routing protocol based on dynamic partition for wireless sensor network. J. Commun. 1, 198–206 (2014)

    Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China (No. 51474007, 51874003, 61703005), the MOE Humanities and Social Science Research on Youth Foundation of China (No. 13YJCZH077), and the Natural Science Foundation of Anhui Province of China (NO. 1808085MG221). The authors are grateful to the anonymous referee for a careful checking of the details and for helpful comments that improved this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiagnqian Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, H. et al. (2019). WSN Multi-hop Routing Algorithm Based on Path Quality Comparison in New Energy Consumption Distance Node Relation Model. In: Sun, X., Pan, Z., Bertino, E. (eds) Artificial Intelligence and Security. ICAIS 2019. Lecture Notes in Computer Science(), vol 11634. Springer, Cham. https://doi.org/10.1007/978-3-030-24271-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24271-8_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24270-1

  • Online ISBN: 978-3-030-24271-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics