2014
DOI: 10.1007/s11276-014-0796-9
|View full text |Cite
|
Sign up to set email alerts
|

Greedy algorithms for actor redeployment in wireless sensor–actor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…Optimization and greedy algorithms are proposed to reposition neighbor actor replacing the failed one in WSAN. 17,18 An algorithm is proposed in Shibo et al 19 maintaining the quality of sensed data with actors. In C 3 R, 20 the overhead is avoided using 1-hop neighbors information to track 2hop neighbor nodes, but these schemes could not identify critical and non-critical nodes.…”
Section: Related Workmentioning
confidence: 99%
“…Optimization and greedy algorithms are proposed to reposition neighbor actor replacing the failed one in WSAN. 17,18 An algorithm is proposed in Shibo et al 19 maintaining the quality of sensed data with actors. In C 3 R, 20 the overhead is avoided using 1-hop neighbors information to track 2hop neighbor nodes, but these schemes could not identify critical and non-critical nodes.…”
Section: Related Workmentioning
confidence: 99%
“…Wireless sensor and actor networks (WSANs) are composed of sensor nodes and actors that are coordinated via wireless communications to perform distributed sensing and acting tasks. In WSANs, sensor nodes collect information about the physical world, while actors use the collected information to take decisions and perform appropriate actions upon the environment [1,2]. The sensor nodes are usually small devices with limited energy resources, computation capabilities and short wireless communication range.…”
Section: Introductionmentioning
confidence: 99%