2014 IEEE Conference on Wireless Sensors (ICWiSE) 2014
DOI: 10.1109/icwise.2014.7042667
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of block interleaving techniques for robust image communication in wireless camera sensor networks

Abstract: We study block interleaving techniques for enhancing robustness against packet loss on wireless vision sensor networks. We evaluate three techniques: DSJ-AL interleaving, Turner and Peterson (TP) technique, and Torus Automorphisms (TA). Results in terms of image quality, obtained trough extensive simulations over monochromatic images, show the improvements provided by interleaving techniques in comparison with a sequential communication, with a slight favor to TA.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(10 citation statements)
references
References 14 publications
(18 reference statements)
0
10
0
Order By: Relevance
“…For evaluation purposes, the following parameters were selected for each considered method:For the proposed Genetic Algorithm (GA):Number of executions (number of times the algorithm was executed with the same parameters, but different random seeds): 20NG=500Tp=150Pc=0.8Pm=0.03PS=0.2For Rombaut Simulated Annealing (RA):Number of executions: 20Equilibrium criteria for SA: 500 iterationsEquilibrium criteria for the Metropolis algorithm: 150 iterationsT0=1,500,000SA acceptance probability α=0.9 (according to [35,36])For Torus Automorphisms (TA):Best parameters k and n (Equation (1)) obtained by exhaustive search for each different scenario (according with methodology in [11]). Identified parameters are presented in Table 2.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…For evaluation purposes, the following parameters were selected for each considered method:For the proposed Genetic Algorithm (GA):Number of executions (number of times the algorithm was executed with the same parameters, but different random seeds): 20NG=500Tp=150Pc=0.8Pm=0.03PS=0.2For Rombaut Simulated Annealing (RA):Number of executions: 20Equilibrium criteria for SA: 500 iterationsEquilibrium criteria for the Metropolis algorithm: 150 iterationsT0=1,500,000SA acceptance probability α=0.9 (according to [35,36])For Torus Automorphisms (TA):Best parameters k and n (Equation (1)) obtained by exhaustive search for each different scenario (according with methodology in [11]). Identified parameters are presented in Table 2.…”
Section: Resultsmentioning
confidence: 99%
“…Indeed, the calculation of TA (and other deterministic methods) is performed in a few milliseconds [11]. Actually, TA complexity is low enough to be implemented in very resource-constrained hardware [8].…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Additionally, in order to support the reconstruction process, robust codes at the sender side may be included. That is the case of the interleaving techniques studied in [ 33 ]. ARQ-based full-reliable protocols.…”
Section: General Backgroundmentioning
confidence: 99%