• Title/Summary/Keyword: Defence Node Algorithm

Search Result 4, Processing Time 0.02 seconds

Topology Aggregation for Hierarchical Wireless Tactical Networks

  • Pak, Woo-Guil;Choi, Young-June
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.344-358
    • /
    • 2011
  • Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

Development of 2-Dim Lagrangian Hydrocode and Application to Large Deformation Problems (2차원 Lagrangian Hydrocode 개발 및 대변형 해석)

  • Lee, Min-Hyung;Kim, Sung-Woo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.3
    • /
    • pp.409-415
    • /
    • 2003
  • The purpose of this paper is to develop the 2-Dim Lagrangian Hydrocode for the analysis of large deformations of solids with implementation of the contact algorithm. First, th e governing equations are discretized into a system of algebraic equations. For more accurate and robust contact force computation. the defense node contact algorithm was adopted and implemented. For the verification of the code developed, two cases are carried out; the Taylor-Impact test and two bodies impact. The von -Mises criterion is implemented into the code with the Shock equation of state. The simulation results show a good agreement compared with the published experimental data and results from the commercial code. It is necessary to implement several material models and failure models for applications to different impact and penetration problems.

Effective Route Scheduling for Military Cargo-Plane Operation (군 수송기 운영 효율성 제고를 위한 최적경로 연구)

  • Kim, Seung-Ki;Lee, Moon-Gul;Lee, Hyun-Soo
    • Korean Management Science Review
    • /
    • v.33 no.1
    • /
    • pp.89-99
    • /
    • 2016
  • A scheduled airlift is the most critical part of the air transportation operations in ROK Air Force. The military cargo-plane routing problem is a PDPLS (pickup and delivery problem in which load splits and node revisits are allowed). The cargo which is transported by a military cargo-plane is measured in pallet. The efficiency of pallet needs to be considered with respect to its volume and weight. There are some guidelines about orders of priorities and regulations in the military air transportation. However, there are no methodologies which can raise the efficiency of flight scheduling using Operations Research (OR) theories. This research proposes the effective computing methodology and the related heuristic algorithms that can maximize the effectiveness of the path routing model.

Feature Extraction Algorithm for Underwater Transient Signal Using Cepstral Coefficients Based on Wavelet Packet (웨이브렛 패킷 기반 캡스트럼 계수를 이용한 수중 천이신호 특징 추출 알고리즘)

  • Kim, Juho;Paeng, Dong-Guk;Lee, Chong Hyun;Lee, Seung Woo
    • Journal of Ocean Engineering and Technology
    • /
    • v.28 no.6
    • /
    • pp.552-559
    • /
    • 2014
  • In general, the number of underwater transient signals is very limited for research on automatic recognition. Data-dependent feature extraction is one of the most effective methods in this case. Therefore, we suggest WPCC (Wavelet packet ceptsral coefficient) as a feature extraction method. A wavelet packet best tree for each data set is formed using an entropy-based cost function. Then, every terminal node of the best trees is counted to build a common wavelet best tree. It corresponds to flexible and non-uniform filter bank reflecting characteristics for the data set. A GMM (Gaussian mixture model) is used to classify five classes of underwater transient data sets. The error rate of the WPCC is compared using MFCC (Mel-frequency ceptsral coefficients). The error rates of WPCC-db20, db40, and MFCC are 0.4%, 0%, and 0.4%, respectively, when the training data consist of six out of the nine pieces of data in each class. However, WPCC-db20 and db40 show rates of 2.98% and 1.20%, respectively, while MFCC shows a rate of 7.14% when the training data consists of only three pieces. This shows that WPCC is less sensitive to the number of training data pieces than MFCC. Thus, it could be a more appropriate method for underwater transient recognition. These results may be helpful to develop an automatic recognition system for an underwater transient signal.