DocumentCode
3160512
Title
Performance Improvement of Wireless Sensor Networks Using Layered Space Time Codes
Author
Bhagyaveni, M.A. ; Rajeswari, K.
Author_Institution
Dept. of ECE, Anna Univ., Chennai, India
fYear
2009
fDate
27-29 Dec. 2009
Firstpage
129
Lastpage
134
Abstract
Multiple-input and multiple-output (MIMO) is one of the key component in wireless standards. Wireless standards exploit MIMO to enhance user experience by improving the data rate and reliability of the link. Multiple-input and multiple-output (MIMO) systems formed by multiple transmit and receive antennas can improve performance and increase capacity of wireless sensor networks. In this Paper, the performance of different detection algorithms for V-BLAST, the zero forcing algorithm (ZF), minimum mean square error (MMSE) algorithm and the Maximum a-Posteriori (MAP) algorithm have been simulated and their performances have been compared. under the assumption that the receiver has perfect knowledge about the channel state information (CSI). Convolutional code can be combined with the V-BLAST algorithm to improve its performance.
Keywords
MIMO communication; mean square error methods; receiving antennas; space-time codes; transmitting antennas; wireless channels; wireless sensor networks; V-BLAST algorithm; channel state information; layered space time codes; maximum a-posteriori algorithm; minimum mean square error algorithm; multiple input and multiple output systems; multiple receive antennas; multiple transmit antennas; performance improvement; wireless sensor networks; zero forcing algorithm; Channel state information; Detection algorithms; MIMO; Maximum a posteriori estimation; Mean square error methods; Receiving antennas; Space time codes; Transmitters; Transmitting antennas; Wireless sensor networks; MIMO; signal to noise ratio; symbol error rate; wireless sensor network;
fLanguage
English
Publisher
ieee
Conference_Titel
Networks and Communications, 2009. NETCOM '09. First International Conference on
Conference_Location
Chennai
Print_ISBN
978-1-4244-5364-1
Electronic_ISBN
978-0-7695-3924-9
Type
conf
DOI
10.1109/NetCoM.2009.27
Filename
5384023
Link To Document