Códigos Reed-Solomon Aplicados a Sistemas de Marca D’Água Digital no Domínio da Frequência

Abstract

This paper analizes the complexity-performance tradeoff of relay selection (RS) methods for cooperative networks (CoopNet), specially applied to wireless sensor networks (WSNs). The performance-complexity of the classical RS methods such as opportunistic (O-RS), random (R-RS), maximum harmonic mean (MHM-RS), best-worse (BW-RS), max-generalized-mean (MGM-RS) and maximum signal-noise ratio (Max-SNR) have been analysed by simulation considering one and two hops with increasing number of available relays and set of selected relays as well. The complexity in terms of number of operations and computational time is analysed in order to confirm the feasibility of the RS methods under the perspective of digital signal processing architecture.