Channel selection algorithms in virtual MIMO sensor networks

  • Authors:
  • Jing Liang;Qilian Liang

  • Affiliations:
  • University of Texas at Arlington, Arlington, TX, USA;University of Texas at Arlington, Arlington, TX, USA

  • Venue:
  • Proceedings of the 1st ACM international workshop on Heterogeneous sensor and actor networks
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present two practical algorithms to select a subset of channels in virtual MIMO wireless sensor networks (WSN). One is the Singular-Value Decomposition-QR with Threshold (SVD-QR-T) approach that selects the best subset of transmitters while keeping all receivers active. The threshold is adaptive by means of Fuzzy C-Mean (FCM). The other is the Maximum Spanning Tree Searching (MASTS) algorithm on a basis of graph theory in respect of cross-layer design, which potentially provides a path connecting all sensors that benefits routing and QoS of networks. The MASTS algorithm keeps all sensors active but selects Mt + Mr -1 subchannels, where Mt and Mr are the number of transmitters and receivers, respectively. These two approaches are compared against the case without channel selection in terms of capacity, bit error rate (BER), and multiplexing gain in the presence of water-filling as well as the circumstance of without water-filling under the same total transmission power constraint. Despite less multiplexing gain, when water-filling is applied, MASTS achieves higher capacity and lower BER than that of virtual MIMO without channel selection at moderate to high SNR while SVD-QR-T FCM provides the lowest BER at high SNR; in case of no water-filling and equal transmission power allocation, MASTS still offers the highest capacity at moderate to high SNR but SVD-QR-T FCM achieves the lowest BER. Both algorithms provide satisfying performances with reduced cost and resources compared to the case without channel selection.