Compression and Combining Based on Channel Shortening and Reduced-Rank Techniques for Cooperative Wireless Sensor Networks

Qasim Ahmed, Kihong Park, Mohamed-Slim Alouini, Sonia Aissa

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

This paper investigates and compares the performance of wireless sensor networks where sensors operate on the principles of cooperative communications. We consider a scenario where the source transmits signals to the destination with the help of L sensors. As the destination has the capacity of processing only U out of these L signals, the strongest U signals are selected, while the remaining (L–U) signals are suppressed. A preprocessing block similar to channel shortening (CS) is proposed in this paper. However, this preprocessing block employs a rank-reduction technique instead of CS. By employing this preprocessing, we are able to decrease the computational complexity of the system without affecting the bit-error-rate (BER) performance. From our simulations, it can be shown that these schemes outperform the CS schemes in terms of computational complexity. In addition, the proposed schemes have a superior BER performance as compared with CS schemes when sensors employ fixed-gain amplification. However, for sensors that employ variable-gain amplification, a tradeoff exists in terms of BER performance between the CS scheme and these schemes. These schemes outperform the CS
scheme for a lower signal-to-noise ratio.
LanguageEnglish
Pages72-81
Number of pages10
JournalIEEE Transactions on Vehicular Technology
Volume63
Issue number1
Early online date8 Jul 2013
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes

Fingerprint

Reduced Rank
Wireless Sensor Networks
Wireless sensor networks
Compression
Bit error rate
Sensors
Amplification
Computational complexity
Preprocessing
Error Rate
Sensor
Cooperative communication
Computational Complexity
Rank Reduction
Signal to noise ratio
Cooperative Communication
Processing
Trade-offs
Decrease
Scenarios

Cite this

@article{68ca22f361d24ea38e62150426da8d37,
title = "Compression and Combining Based on Channel Shortening and Reduced-Rank Techniques for Cooperative Wireless Sensor Networks",
abstract = "This paper investigates and compares the performance of wireless sensor networks where sensors operate on the principles of cooperative communications. We consider a scenario where the source transmits signals to the destination with the help of L sensors. As the destination has the capacity of processing only U out of these L signals, the strongest U signals are selected, while the remaining (L–U) signals are suppressed. A preprocessing block similar to channel shortening (CS) is proposed in this paper. However, this preprocessing block employs a rank-reduction technique instead of CS. By employing this preprocessing, we are able to decrease the computational complexity of the system without affecting the bit-error-rate (BER) performance. From our simulations, it can be shown that these schemes outperform the CS schemes in terms of computational complexity. In addition, the proposed schemes have a superior BER performance as compared with CS schemes when sensors employ fixed-gain amplification. However, for sensors that employ variable-gain amplification, a tradeoff exists in terms of BER performance between the CS scheme and these schemes. These schemes outperform the CSscheme for a lower signal-to-noise ratio.",
keywords = "channel shortening (CS), cooperative communications, reduced-rank techniques, selection combining",
author = "Qasim Ahmed and Kihong Park and Mohamed-Slim Alouini and Sonia Aissa",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/TVT.2013.2272061",
language = "English",
volume = "63",
pages = "72--81",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

Compression and Combining Based on Channel Shortening and Reduced-Rank Techniques for Cooperative Wireless Sensor Networks. / Ahmed, Qasim; Park, Kihong ; Alouini, Mohamed-Slim; Aissa, Sonia.

In: IEEE Transactions on Vehicular Technology, Vol. 63, No. 1, 01.01.2014, p. 72-81.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Compression and Combining Based on Channel Shortening and Reduced-Rank Techniques for Cooperative Wireless Sensor Networks

AU - Ahmed, Qasim

AU - Park, Kihong

AU - Alouini, Mohamed-Slim

AU - Aissa, Sonia

PY - 2014/1/1

Y1 - 2014/1/1

N2 - This paper investigates and compares the performance of wireless sensor networks where sensors operate on the principles of cooperative communications. We consider a scenario where the source transmits signals to the destination with the help of L sensors. As the destination has the capacity of processing only U out of these L signals, the strongest U signals are selected, while the remaining (L–U) signals are suppressed. A preprocessing block similar to channel shortening (CS) is proposed in this paper. However, this preprocessing block employs a rank-reduction technique instead of CS. By employing this preprocessing, we are able to decrease the computational complexity of the system without affecting the bit-error-rate (BER) performance. From our simulations, it can be shown that these schemes outperform the CS schemes in terms of computational complexity. In addition, the proposed schemes have a superior BER performance as compared with CS schemes when sensors employ fixed-gain amplification. However, for sensors that employ variable-gain amplification, a tradeoff exists in terms of BER performance between the CS scheme and these schemes. These schemes outperform the CSscheme for a lower signal-to-noise ratio.

AB - This paper investigates and compares the performance of wireless sensor networks where sensors operate on the principles of cooperative communications. We consider a scenario where the source transmits signals to the destination with the help of L sensors. As the destination has the capacity of processing only U out of these L signals, the strongest U signals are selected, while the remaining (L–U) signals are suppressed. A preprocessing block similar to channel shortening (CS) is proposed in this paper. However, this preprocessing block employs a rank-reduction technique instead of CS. By employing this preprocessing, we are able to decrease the computational complexity of the system without affecting the bit-error-rate (BER) performance. From our simulations, it can be shown that these schemes outperform the CS schemes in terms of computational complexity. In addition, the proposed schemes have a superior BER performance as compared with CS schemes when sensors employ fixed-gain amplification. However, for sensors that employ variable-gain amplification, a tradeoff exists in terms of BER performance between the CS scheme and these schemes. These schemes outperform the CSscheme for a lower signal-to-noise ratio.

KW - channel shortening (CS)

KW - cooperative communications

KW - reduced-rank techniques

KW - selection combining

U2 - 10.1109/TVT.2013.2272061

DO - 10.1109/TVT.2013.2272061

M3 - Article

VL - 63

SP - 72

EP - 81

JO - IEEE Transactions on Vehicular Technology

T2 - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 1

ER -