2017
DOI: 10.1007/s10489-017-1108-8
|View full text |Cite
|
Sign up to set email alerts
|

Energy efficient teaching-learning-based optimization for the discrete routing problem in wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(13 citation statements)
references
References 31 publications
0
13
0
Order By: Relevance
“…According to the convolutional neural network node residual algorithm, the node residual of each neural node in the neural network layer can be obtained [29]. 7For the neural network layer of the second layer, the calculation formula of the node residual of the neural node of the neural network layer is as (8). 8Simply replace the relationship with (9): (9) The above formula represents the weighted sum of unit inputs.…”
Section: Figure 3 Schematic Diagram Of Convolution Operation and Tranmentioning
confidence: 99%
“…According to the convolutional neural network node residual algorithm, the node residual of each neural node in the neural network layer can be obtained [29]. 7For the neural network layer of the second layer, the calculation formula of the node residual of the neural node of the neural network layer is as (8). 8Simply replace the relationship with (9): (9) The above formula represents the weighted sum of unit inputs.…”
Section: Figure 3 Schematic Diagram Of Convolution Operation and Tranmentioning
confidence: 99%
“…In this paper, the route optimization is carried out based on the clustering routing protocol, one of the two major categories of WSN routing protocols [19,20]. The optimization attempts to achieve efficient energy utilization, data fusion, scalability and robustness.…”
Section: Overviewmentioning
confidence: 99%
“…Through this continuous process network derives its own path for data processing. The energy consumption of a node also considered for data processing between two nodes [11,12]. One of the common protocol of this type is Ad-Hoc On Demand Distance Vector (AODV).…”
Section: Fig 1 Basic Building Block Of Wsnmentioning
confidence: 99%
“…In addition, it also provides adding and removing of a node to the network. In AODV, the routing table maintains the routing history between each node and whenever the RREQ (Route REQuest) processed by a source node, the source node checks the routing table for path specification and follows the route [8,11,12]. After certain period, the routing table will change based on the route identification process called Packet REQuest (PREQ).…”
Section: Fig 1 Basic Building Block Of Wsnmentioning
confidence: 99%