Adaptive learning routing algorithm of WSNs based autonomous decentralized system approach

Sheng Zhong*, Baihai Zhang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper investigates the routing protocols for randomly distributed wireless sensor networks (WSNs). A learning algorithm is proposed for computing the path on routing, and only few information of adjacent nodes is necessary. By using the depth first search strategy, and remembering the historical experience of path on routing, we can find next node, which illustrates the advantage of combination of autonomous decentralized systems approach and distributed estimation learning algorithm. Simulation example provided to show the usefulness and advantage of the developed results.

Original languageEnglish
Title of host publicationProceedings - 2010 6th International Conference on Natural Computation, ICNC 2010
Pages66-69
Number of pages4
DOIs
Publication statusPublished - 2010
Event2010 6th International Conference on Natural Computation, ICNC'10 - Yantai, Shandong, China
Duration: 10 Aug 201012 Aug 2010

Publication series

NameProceedings - 2010 6th International Conference on Natural Computation, ICNC 2010
Volume1

Conference

Conference2010 6th International Conference on Natural Computation, ICNC'10
Country/TerritoryChina
CityYantai, Shandong
Period10/08/1012/08/10

Keywords

  • Autonomous decentralized systems
  • Leaning algorithms
  • Routing algorithms
  • WSNs

Fingerprint

Dive into the research topics of 'Adaptive learning routing algorithm of WSNs based autonomous decentralized system approach'. Together they form a unique fingerprint.

Cite this