2013
DOI: 10.1016/j.suscom.2013.01.003
|View full text |Cite
|
Sign up to set email alerts
|

A lightweight dynamic optimization methodology and application metrics estimation model for wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…The results of the proposed technique is compared with three other techniques of optimization. Firstly, Online Greedy Algorithm (OGA) technique which does searching of parameter space in defined order to optimize function [46]. Other two techniques use only one parameters, transmission power or data rate, for 1-Dimension probing keeping other parameter constant along with payload length.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The results of the proposed technique is compared with three other techniques of optimization. Firstly, Online Greedy Algorithm (OGA) technique which does searching of parameter space in defined order to optimize function [46]. Other two techniques use only one parameters, transmission power or data rate, for 1-Dimension probing keeping other parameter constant along with payload length.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Munir et al [21] proposed another alternative to overcome the overhead of exhaustive search in their work on dynamic optimization of wireless sensor networks. Their approach was divided into two phases.…”
Section: Related Workmentioning
confidence: 99%
“…In this paper, we improve on the work carried out by Munir et al [21]. We leverage a similar approach to design space exploration but add two new phases: a set-partitioning phase and an exhaustive search phase.…”
Section: Related Workmentioning
confidence: 99%
“…In this paper, we improve on the work carried out by Munir et al [10]. We use a similar approach to design space exploration but with an addition of two new phases -a set partition phase and an exhaustive search phase.…”
Section: Related Workmentioning
confidence: 99%
“…Munir et al [10] used a greedy algorithm to overcome the overhead of exhaustive search, in their paper on dynamic optimization of wireless sensor networks. Their algorithm was separated in two phases.…”
Section: Related Workmentioning
confidence: 99%