Effective One-to-One Correspondence Method of O(N Log(N)) Complexity between Distributed Units

Effective One-to-One Correspondence Method of O(N Log(N)) Complexity between Distributed Units

Recently, NCO (Network Centric Operation) has been intensively studied. The new concept provides many benefits by sharing information among distributed militaries linked by network. Based on these, we propose a novel correspondence algorithm of O(N 2 Log(N)) complexity while maintaining comparable B...

Full description

Bibliographic Details
Main Authors: Sanghyuk Park, Jai-Hoon Kim, Chang-Hee Han, Kangseok Kim
Format: Article
Language:English
Published: SAGE Publishing 2012-04-01
Series:International Journal of Advanced Robotic Systems
Online Access:https://doi.org/10.5772/50913
id doaj-375bf8e5f7234d8fb3b8018339ba7fb4
record_format Article
spelling doaj-375bf8e5f7234d8fb3b8018339ba7fb42020-11-25T03:24:08ZengSAGE PublishingInternational Journal of Advanced Robotic Systems1729-88142012-04-01910.5772/5091310.5772_50913Effective One-to-One Correspondence Method of O(N Log(N)) Complexity between Distributed UnitsSanghyuk Park0Jai-Hoon Kim1Chang-Hee Han2Kangseok Kim3 Department of Network Centric Warfare Engineering, Ajou University, Suwon, Korea Graduate School of Information and Communication, Ajou University, Suwon, Korea Department of Computer Science, Korea Military Academy, Seoul, Korea Department of Knowledge Information Security, Graduate School of Ajou University, Suwon, KoreaRecently, NCO (Network Centric Operation) has been intensively studied. The new concept provides many benefits by sharing information among distributed militaries linked by network. Based on these, we propose a novel correspondence algorithm of O(N 2 Log(N)) complexity while maintaining comparable BE (Battle Effects) with the optimal algorithm. We verify the efficiency of our algorithm in terms of complexity and BE by simulation and experiment. The results show that our algorithm improves BE up to 40% comparing to conventional random correspondence methods. Also, our algorithm speeds up by several orders comparing to the optimal algorithm while sacrificing BE only 6%.https://doi.org/10.5772/50913
collection DOAJ
language English
format Article
sources DOAJ
author Sanghyuk Park
Jai-Hoon Kim
Chang-Hee Han
Kangseok Kim
spellingShingle Sanghyuk Park
Jai-Hoon Kim
Chang-Hee Han
Kangseok Kim
Effective One-to-One Correspondence Method of O(N Log(N)) Complexity between Distributed Units
International Journal of Advanced Robotic Systems
author_facet Sanghyuk Park
Jai-Hoon Kim
Chang-Hee Han
Kangseok Kim
author_sort Sanghyuk Park
title Effective One-to-One Correspondence Method of O(N Log(N)) Complexity between Distributed Units
title_short Effective One-to-One Correspondence Method of O(N Log(N)) Complexity between Distributed Units
title_full Effective One-to-One Correspondence Method of O(N Log(N)) Complexity between Distributed Units
title_fullStr Effective One-to-One Correspondence Method of O(N Log(N)) Complexity between Distributed Units
title_full_unstemmed Effective One-to-One Correspondence Method of O(N Log(N)) Complexity between Distributed Units
title_sort effective one-to-one correspondence method of o(n log(n)) complexity between distributed units
publisher SAGE Publishing
series International Journal of Advanced Robotic Systems
issn 1729-8814
publishDate 2012-04-01
description Recently, NCO (Network Centric Operation) has been intensively studied. The new concept provides many benefits by sharing information among distributed militaries linked by network. Based on these, we propose a novel correspondence algorithm of O(N 2 Log(N)) complexity while maintaining comparable BE (Battle Effects) with the optimal algorithm. We verify the efficiency of our algorithm in terms of complexity and BE by simulation and experiment. The results show that our algorithm improves BE up to 40% comparing to conventional random correspondence methods. Also, our algorithm speeds up by several orders comparing to the optimal algorithm while sacrificing BE only 6%.
url https://doi.org/10.5772/50913
work_keys_str_mv AT sanghyukpark effectiveonetoonecorrespondencemethodofonlogncomplexitybetweendistributedunits
AT jaihoonkim effectiveonetoonecorrespondencemethodofonlogncomplexitybetweendistributedunits
AT changheehan effectiveonetoonecorrespondencemethodofonlogncomplexitybetweendistributedunits
AT kangseokkim effectiveonetoonecorrespondencemethodofonlogncomplexitybetweendistributedunits
_version_ 1724603116387565568

Similar Items