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
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
Country/TerritoryKorea, Republic of
CityJeju
Period10/11/1710/11/19

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Fingerprint

Dive into the research topics of 'Min-variance routing over a MIMO ad-hoc tactical environments'. Together they form a unique fingerprint.

Cite this