2007
DOI: 10.1007/s11235-007-9061-1
|View full text |Cite
|
Sign up to set email alerts
|

A new QoS routing algorithm based on self-organizing maps for wireless sensor networks

Abstract: For the past ten years, many authors have focused their investigations in wireless sensor networks. Different researching issues have been extensively developed: power consumption, MAC protocols, self-organizing network algorithms, data-aggregation schemes, routing protocols, QoS management, etc. Due to the constraints on data processing and power consumption, the use of artificial intelligence has been historically discarded. However, in some special scenarios the features of neural networks are appropriate t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(21 citation statements)
references
References 24 publications
0
21
0
Order By: Relevance
“…An unsupervised learning based routing referred to as Sensor Intelligence Routing (SIR) is proposed in [225]. They modify the Dijkstra's algorithm utilizing SOM.…”
Section: Mac Protocol ML Algorithm Objectivementioning
confidence: 99%
See 1 more Smart Citation
“…An unsupervised learning based routing referred to as Sensor Intelligence Routing (SIR) is proposed in [225]. They modify the Dijkstra's algorithm utilizing SOM.…”
Section: Mac Protocol ML Algorithm Objectivementioning
confidence: 99%
“…Proposed to improve reliability by predicting disconnection probabilities Barbancho et al [225] SOM Modified version of Dijkstra's Algorithm Dong et al [228] RL Energy efficient geographical routing Hu and Fei [229] RL Liftime-aware routing for UAN that aims to distribute traffic load among nodes Forster and Murphy [230] RF Near-Optimal routing for multiple source to multiple sinks others) that must be considered during decision making. This challenge is further exacerbated when a distributed operation is required to reduce the overhead and ensure scalability.…”
Section: Cmacmentioning
confidence: 99%
“…The composition of a routing issue in wireless sensor networks customarily is conducted as a graphing issue G = (V, E), where V shows the pair of all nodes and E represents the pair of bidirectional communication channels linking the nodes [20,21]. Using this graph modeling strategy, the routing issue can be called the process of getting the minimal cost way from the source vertex to all destination vertices, by utilizing the available graph edges.…”
Section: Issues For Routing In Wsnmentioning
confidence: 99%
“…SIR [104] adopts neural networks in every sensor node to discover paths. Each node obtains mean values of latency, error rate, duty cycle and throughput by testing every neighbor link quality with the transmissions of a specific packet named ping.…”
Section: Artificial Neural Network Algorithmmentioning
confidence: 99%