2019
DOI: 10.1109/access.2019.2929756
|View full text |Cite
|
Sign up to set email alerts
|

Location Updating Scheme of Sink Node Based on Topology Balance and Reinforcement Learning in WSN

Abstract: This paper proposes a scheme for updating the location of the sink node to balance the network topology when a wireless sensor network (WSN) is scaled up. We divide the proposed location update scheme into two steps, namely, searching the optimal location and designing the pathfinding algorithm. For the former, to find the optimal location of the sink node simply and efficiently, we only consider the information of the expanded longer paths and some key nodes instead of the global information of the entire net… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 43 publications
0
3
0
Order By: Relevance
“…The reinforcement learning (RL) algorithm calculates a potential and effective path to the base station and then integrates the node to achieve the optimal path 9 . Multiuser multiarmed bandit (UM‐MAB) concept collects data based on the virtual head (VH) energy efficiency.…”
Section: Literature Surveymentioning
confidence: 99%
“…The reinforcement learning (RL) algorithm calculates a potential and effective path to the base station and then integrates the node to achieve the optimal path 9 . Multiuser multiarmed bandit (UM‐MAB) concept collects data based on the virtual head (VH) energy efficiency.…”
Section: Literature Surveymentioning
confidence: 99%
“…In terms of the time complexity of the proposed RL solutions, [70] proposes a constant time approach since the size of the set of tasks and the number of the neighbor nodes are fixed at initialization. But most of the other proposed algorithms, such as [54,72,79,95,101], require a quadratic time complexity with an execution time that increases exponentially as the size of the state and/or the action space increases. The authors in [76] try to decrease the Computational complexity by combining the hidden layer nodes which have similar functions.…”
Section: Cachingmentioning
confidence: 99%
“…Wang et al [95] have addressed the problem caused by 817 scaling-up in WSNs and propose a location update scheme of 818 the mobile sink node to achieve more efficient network topology. First, the sink node updates its location by collecting information from certain key nodes and searches for the best performing location to define it as the final location.…”
mentioning
confidence: 99%