Min-variance routing over a MIMO ad-hoc tactical environments

Taewan Kim, Sanghoon Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In an ad-hoc tactical environment, it is important to determine an optimal routing path forguaranteeing Quality of Service (QoS).In this paper,we explore the two routing algorithms, named min-variance and max-cost for two different cases(i.e.,urgent and ordinary) for transmitting multimedia data in MIMO ad-hoc network such as tactical circumstance. For theordinary case, each source node finds the effective routing path based on the max-cost routing algorithm.However,for the emergencycase, the node with a high priority utilizes the min- variance routing algorithm.The simulation results show that the max-costand min-variance routing algorithms are effective for the ordinary and emergency cases respectively.

Original languageEnglish
Title of host publication2010 International Conference on Information and Communication Technology Convergence, ICTC 2010
Pages378-379
Number of pages2
DOIs
Publication statusPublished - 2010 Dec 1
Event2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 - Jeju, Korea, Republic of
Duration: 2010 Nov 172010 Nov 19

Publication series

Name2010 International Conference on Information and Communication Technology Convergence, ICTC 2010

Other

Other2010 International Conference on Information and Communication Technology Convergence, ICTC 2010
CountryKorea, Republic of
CityJeju
Period10/11/1710/11/19

Fingerprint

Routing algorithms
MIMO systems
Ad hoc networks
Costs
Quality of service

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

Cite this

Kim, T., & Lee, S. (2010). Min-variance routing over a MIMO ad-hoc tactical environments. In 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 (pp. 378-379). [5674823] (2010 International Conference on Information and Communication Technology Convergence, ICTC 2010). https://doi.org/10.1109/ICTC.2010.5674823
Kim, Taewan ; Lee, Sanghoon. / Min-variance routing over a MIMO ad-hoc tactical environments. 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010. 2010. pp. 378-379 (2010 International Conference on Information and Communication Technology Convergence, ICTC 2010).
@inproceedings{116bb660f78e440d958965be2f6f3215,
title = "Min-variance routing over a MIMO ad-hoc tactical environments",
abstract = "In an ad-hoc tactical environment, it is important to determine an optimal routing path forguaranteeing Quality of Service (QoS).In this paper,we explore the two routing algorithms, named min-variance and max-cost for two different cases(i.e.,urgent and ordinary) for transmitting multimedia data in MIMO ad-hoc network such as tactical circumstance. For theordinary case, each source node finds the effective routing path based on the max-cost routing algorithm.However,for the emergencycase, the node with a high priority utilizes the min- variance routing algorithm.The simulation results show that the max-costand min-variance routing algorithms are effective for the ordinary and emergency cases respectively.",
author = "Taewan Kim and Sanghoon Lee",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/ICTC.2010.5674823",
language = "English",
isbn = "9781424498062",
series = "2010 International Conference on Information and Communication Technology Convergence, ICTC 2010",
pages = "378--379",
booktitle = "2010 International Conference on Information and Communication Technology Convergence, ICTC 2010",

}

Kim, T & Lee, S 2010, Min-variance routing over a MIMO ad-hoc tactical environments. in 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010., 5674823, 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010, pp. 378-379, 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010, Jeju, Korea, Republic of, 10/11/17. https://doi.org/10.1109/ICTC.2010.5674823

Min-variance routing over a MIMO ad-hoc tactical environments. / Kim, Taewan; Lee, Sanghoon.

2010 International Conference on Information and Communication Technology Convergence, ICTC 2010. 2010. p. 378-379 5674823 (2010 International Conference on Information and Communication Technology Convergence, ICTC 2010).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Min-variance routing over a MIMO ad-hoc tactical environments

AU - Kim, Taewan

AU - Lee, Sanghoon

PY - 2010/12/1

Y1 - 2010/12/1

N2 - In an ad-hoc tactical environment, it is important to determine an optimal routing path forguaranteeing Quality of Service (QoS).In this paper,we explore the two routing algorithms, named min-variance and max-cost for two different cases(i.e.,urgent and ordinary) for transmitting multimedia data in MIMO ad-hoc network such as tactical circumstance. For theordinary case, each source node finds the effective routing path based on the max-cost routing algorithm.However,for the emergencycase, the node with a high priority utilizes the min- variance routing algorithm.The simulation results show that the max-costand min-variance routing algorithms are effective for the ordinary and emergency cases respectively.

AB - In an ad-hoc tactical environment, it is important to determine an optimal routing path forguaranteeing Quality of Service (QoS).In this paper,we explore the two routing algorithms, named min-variance and max-cost for two different cases(i.e.,urgent and ordinary) for transmitting multimedia data in MIMO ad-hoc network such as tactical circumstance. For theordinary case, each source node finds the effective routing path based on the max-cost routing algorithm.However,for the emergencycase, the node with a high priority utilizes the min- variance routing algorithm.The simulation results show that the max-costand min-variance routing algorithms are effective for the ordinary and emergency cases respectively.

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

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

U2 - 10.1109/ICTC.2010.5674823

DO - 10.1109/ICTC.2010.5674823

M3 - Conference contribution

AN - SCOPUS:78751540580

SN - 9781424498062

T3 - 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010

SP - 378

EP - 379

BT - 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010

ER -

Kim T, Lee S. Min-variance routing over a MIMO ad-hoc tactical environments. In 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010. 2010. p. 378-379. 5674823. (2010 International Conference on Information and Communication Technology Convergence, ICTC 2010). https://doi.org/10.1109/ICTC.2010.5674823