Compression and Combining Based on Channel Shortening and Rank Reduction Technique for Cooperative Wireless Sensor Networks

Handle URI:
http://hdl.handle.net/10754/307037
Title:
Compression and Combining Based on Channel Shortening and Rank Reduction Technique for Cooperative Wireless Sensor Networks
Authors:
Ahmed, Qasim Zeeshan; Aissa, Sonia; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Park, Kihong ( 0000-0002-6867-4277 )
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 is proposed in this contribution. However, this preprocessing block employs a rank-reduction technique instead of channel-shortening. 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 channel-shortening schemes in terms of computational complexity. In addition, the proposed schemes have a superior BER performance as compared to channel-shortening schemes when sensors employ fixed gain amplification. However, for sensors which employ variable gain amplification, a tradeoff exists in terms of BER performance between the channel-shortening and these schemes. These schemes outperform channel-shortening scheme for lower signal-to-noise ratio.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Communication Theory Lab
Citation:
Ahmed QZ, Park K-H, Alouini M-S, Aissa S (2014) Compression and Combining Based on Channel Shortening and Reduced-Rank Techniques for Cooperative Wireless Sensor Networks. IEEE Trans Veh Technol 63: 72-81. doi:10.1109/TVT.2013.2272061.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Transactions on Vehicular Technology
Issue Date:
18-Dec-2013
DOI:
10.1109/TVT.2013.2272061
ARXIV:
arXiv:1307.0187
Type:
Article
ISSN:
0018-9545; 1939-9359
Additional Links:
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6553287; http://arxiv.org/abs/1307.0187
Appears in Collections:
Articles; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAhmed, Qasim Zeeshanen
dc.contributor.authorAissa, Soniaen
dc.contributor.authorAlouini, Mohamed-Slimen
dc.contributor.authorPark, Kihongen
dc.date.accessioned2013-12-18T12:22:11Z-
dc.date.available2013-12-18T12:22:11Z-
dc.date.issued2013-12-18en
dc.identifier.citationAhmed QZ, Park K-H, Alouini M-S, Aissa S (2014) Compression and Combining Based on Channel Shortening and Reduced-Rank Techniques for Cooperative Wireless Sensor Networks. IEEE Trans Veh Technol 63: 72-81. doi:10.1109/TVT.2013.2272061.en
dc.identifier.issn0018-9545en
dc.identifier.issn1939-9359en
dc.identifier.doi10.1109/TVT.2013.2272061en
dc.identifier.urihttp://hdl.handle.net/10754/307037en
dc.description.abstractThis 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 is proposed in this contribution. However, this preprocessing block employs a rank-reduction technique instead of channel-shortening. 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 channel-shortening schemes in terms of computational complexity. In addition, the proposed schemes have a superior BER performance as compared to channel-shortening schemes when sensors employ fixed gain amplification. However, for sensors which employ variable gain amplification, a tradeoff exists in terms of BER performance between the channel-shortening and these schemes. These schemes outperform channel-shortening scheme for lower signal-to-noise ratio.en
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6553287en
dc.relation.urlhttp://arxiv.org/abs/1307.0187en
dc.rightsArchived with thanks to IEEE Transactions on Vehicular Technologyen
dc.subjectCooperative communicationsen
dc.subjectchannel shorteningen
dc.subjectreduced-rank techniquesen
dc.subjectselection combiningen
dc.titleCompression and Combining Based on Channel Shortening and Rank Reduction Technique for Cooperative Wireless Sensor Networksen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journalIEEE Transactions on Vehicular Technologyen
dc.eprint.versionPost-printen
dc.contributor.institutionNational Institute of Scientific Research, University of Quebec, Montreal, QC H2X 1L7, Canadaen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
dc.identifier.arxividarXiv:1307.0187en
kaust.authorAhmed, Qasim Zeeshanen
kaust.authorPark, Kihongen
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.