Title :
A graph theoretical algorithm for virtual MIMO channel selection in wireless sensor networks
Author :
Liang, Jing ; Liang, Qilian
Author_Institution :
Dept. of Electr. Eng., Univ. of Texas at Arlington, Arlington, TX
Abstract :
In this paper we investigate a methodology named channel selection with the aim of balancing the multiple input multiple output (MIMO) advantage and the complexity of node cooperations for wireless sensor networks (WSN). In respect of cross-layer design, we propose the Maximum Spanning Tree Searching (MASTS) algorithm to select a set of subchannels that always provide a path connecting all sensors. The performances are analyzed through Monte Carlo simulation in terms of capacity, diversity gain, bit error rate (BER) and multiplexing gain. It is shown that MASTS channel selection can achieve satisfying performances compared to those of full virtual MIMO with reduced resource consumption.
Keywords :
MIMO communication; Monte Carlo methods; graph theory; tree searching; wireless sensor networks; MASTS channel selection; Maximum Spanning Tree Searching algorithm; Monte Carlo simulation; bit error rate; channel selection; cross-layer design; graph theoretical algorithm; multiple input multiple output; multiplexing gain; node cooperations; virtual MIMO channel selection; wireless sensor networks; Bit error rate; Cross layer design; Electronic mail; Energy consumption; Energy efficiency; MIMO; Sensor systems; Spread spectrum communication; USA Councils; Wireless sensor networks;
Conference_Titel :
Military Communications Conference, 2008. MILCOM 2008. IEEE
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-2676-8
Electronic_ISBN :
978-1-4244-2677-5
DOI :
10.1109/MILCOM.2008.4753524
