An optimal antenna assignment strategy for information raining

Dayu Huang, Pingyi Fan, Khaled Letaief

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This paper addresses the antenna assignment problem for distributed multiple-antenna architecture that enables wireless communication between onboard and ground in subway and railway. We propose a class of algorithms that match the assignment pattern to the large scale fading. Such algorithms are not constrained by short coherence time inherited in subway and railway. We will then derive an optimal antenna assignment strategy employing maximum ratio combining. Simulation results will be provided to demonstrate the advantages of the proposed strategy, which can also be applied to the recently proposed information raining system.

Original languageEnglish
Article number4489735
Pages (from-to)1134-1139
Number of pages6
JournalIEEE Transactions on Wireless Communications
Volume7
Issue number4
DOIs
Publication statusPublished - Apr 2008
Externally publishedYes

Fingerprint

Railway
Antenna
Subways
Assignment
Antennas
Multiple Antennas
Assignment Problem
Fading
Wireless Communication
Information Systems
Information systems
Demonstrate
Simulation
Communication
Strategy
Class
Architecture

Keywords

  • Antenna assignment
  • Mobile communication system
  • Mobile hotspots
  • Wireless communication

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

An optimal antenna assignment strategy for information raining. / Huang, Dayu; Fan, Pingyi; Letaief, Khaled.

In: IEEE Transactions on Wireless Communications, Vol. 7, No. 4, 4489735, 04.2008, p. 1134-1139.

Research output: Contribution to journalArticle

@article{1c4c9b0f46cb4b758ba088722eea3b95,
title = "An optimal antenna assignment strategy for information raining",
abstract = "This paper addresses the antenna assignment problem for distributed multiple-antenna architecture that enables wireless communication between onboard and ground in subway and railway. We propose a class of algorithms that match the assignment pattern to the large scale fading. Such algorithms are not constrained by short coherence time inherited in subway and railway. We will then derive an optimal antenna assignment strategy employing maximum ratio combining. Simulation results will be provided to demonstrate the advantages of the proposed strategy, which can also be applied to the recently proposed information raining system.",
keywords = "Antenna assignment, Mobile communication system, Mobile hotspots, Wireless communication",
author = "Dayu Huang and Pingyi Fan and Khaled Letaief",
year = "2008",
month = "4",
doi = "10.1109/TWC.2008.060838",
language = "English",
volume = "7",
pages = "1134--1139",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - An optimal antenna assignment strategy for information raining

AU - Huang, Dayu

AU - Fan, Pingyi

AU - Letaief, Khaled

PY - 2008/4

Y1 - 2008/4

N2 - This paper addresses the antenna assignment problem for distributed multiple-antenna architecture that enables wireless communication between onboard and ground in subway and railway. We propose a class of algorithms that match the assignment pattern to the large scale fading. Such algorithms are not constrained by short coherence time inherited in subway and railway. We will then derive an optimal antenna assignment strategy employing maximum ratio combining. Simulation results will be provided to demonstrate the advantages of the proposed strategy, which can also be applied to the recently proposed information raining system.

AB - This paper addresses the antenna assignment problem for distributed multiple-antenna architecture that enables wireless communication between onboard and ground in subway and railway. We propose a class of algorithms that match the assignment pattern to the large scale fading. Such algorithms are not constrained by short coherence time inherited in subway and railway. We will then derive an optimal antenna assignment strategy employing maximum ratio combining. Simulation results will be provided to demonstrate the advantages of the proposed strategy, which can also be applied to the recently proposed information raining system.

KW - Antenna assignment

KW - Mobile communication system

KW - Mobile hotspots

KW - Wireless communication

UR - http://www.scopus.com/inward/record.url?scp=58149119349&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58149119349&partnerID=8YFLogxK

U2 - 10.1109/TWC.2008.060838

DO - 10.1109/TWC.2008.060838

M3 - Article

VL - 7

SP - 1134

EP - 1139

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 4

M1 - 4489735

ER -