• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.6
• /
• pp.1386-1390
• /
• 2011

The IEEE 802.11 MAC uses DCF for media access among the participating network nodes. But DCF alone is neither capable nor suitable for fulfilling the QoS requirements of realtime applications. There are many ways in which QoS is provided by modifying DCF based MAC. This paper proposes (m,k)-collision scheme which is based on IEEE 802.11 and (m,k)-firm scheme tries to improve DCF functionality. The proposed scheme uses different Contention Window according to the number of collision in the node. The simulation result shows that the proposed scheme helps improve the throughput of the DCF.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.768-776
• /
• 2009

This paper analyses the message complexity of TDMA ad hoc MAC protocols. Since the network resource of ad hoc networks is limited due to the multiple interferences and the contention-based wireless channel, the scalability issue is one of the main research topics in developing ad hoc algorithms. Simulation demonstrates that SMACS protocol has the lowest message complexity, whereas TMMAC has the highest. In addition, it is found that since the effect of unicast dominates in the message complexity compared to other factors with an increasing number of nodes, Z-MAC tends to have the property of linearity, whereas BMA and TMMAC show exponential increases in their complexities.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2367-2372
• /
• 2009

Recently, Many studies have been progressing to path-finding adapted dynamic information on the Terminal Based Navigation System(TBNS). The algorithms proposed are based on $A^*$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost. Path-finding with an abstract graph which expresses real road network as a simple graph is proposed for reducing dependency of heuristic and exploring cost. In this paper, two abstract graph that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost and the number of node access but $AG^C$ has worse performance than AGH at exploring cost.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.1
• /
• pp.81-89
• /
• 2012

This study propose the vibration-based damage monitoring scheme for steel girder bolt-connection member by using wireless acceleration sensor node. In order to achieve the objective, the following approaches are implemented. Firstly, wireless acceleration sensor node is described on the design of hardware components and embedded operation software. Secondly, the vibration-based damage monitoring scheme of the steel girder bolt-connection member is described. The damage monitoring scheme performed global damage occurrence alarming and damage localization estimation by the acceleration response feature analysis. The global damage alarming is applied to the correlation coefficient of power spectral density. The damage localization estimation is applied to the frequency-based damage detection technique and the mode-shape-based damage detection technique. Finally, the performance of the vibration-based damage monitoring scheme is evaluated for detecting the bolt-connection member damage on a lab-scale steel girder.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.199-202
• /
• 2009

The optimal path on real road network has been changed by traffic flow of roads frequently. Therefore a path finding system to find the optimal path on real network should consider traffic flow of roads that is changed on real time. The most of existing path finding methods do not consider traffic flow of roads and do not also perform efficiently if they use traffic information. In this paper, we propose an abstraction method of real road network based on the Terminal Based Navigation System (TBNS) with technique such as TPEG. TBNS can be able to provides quality of path better than before as using traffic information that is transferred by TPEG. The proposed method is to abstract real network as simple graph in order to use traffic information. It is composed boundary nodes based on real nodes, all boundary nodes that have the same of connection are merged together. The result of path finding on an abstract graph diminishes the search space.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.12
• /
• pp.1697-1703
• /
• 2020

Sensor nodes that directly collect data from the surrounding environment have many constraints, such as power supply and memory size, thus efficient use of resources is required. In this paper, in a sensor node that receives location data of a vehicle on a lane, the data reception period is changed by the target's speed estimated by the Kalman filter and distance weight. For a slower speed of the vehicle, the longer data reception interval of the sensor node can reduce the processing time performed in the entire sensor network. The proposed method was verified through a traffic simulator implemented as MATLAB, and the results achieved that the processing time was reduced in the entire sensor network using the proposed method compared to the baseline method that receives all data from the vehicle.

• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.167-174
• /
• 2010

Recently the distributed topology control algorithm for constructing the Recrystallization Topology in the unstructured peer-to-peer network was proposed. In this paper, we prove that such a hierarchical topology is a scale-free power-law network. We present a model of a construction process of the distributed protocol, and analyze it based on a mean-field approximation and the continuum theory, so that we show that the constructed Recrystallization Topology is a scale-free network. In the proposed model, all nodes are born with some initial attractiveness and the system incorporates the rewiring of some links at every time step. Some old links are removed with the anti-preferential probability, and some new links are added with preferential probability. In other words, according to the distributed algorithm, each node makes connections to the more-preferential nodes having higher hit-ratio than other nodes, while it disconnects the anti-preferential nodes having lesser hit-ratio. This gives a realistic description of the local processes forming the recrystallization topology in unstructured peer-to-peer network. We calculate analytically the degree distribution. The analytic result indicates that the constructed network is a scale-free network, of which the scaling exponent is 3.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.79-89
• /
• 2006

TCP is the most widely used transport protocol in Internet applications that guarantees a reliable data transfer. But, in the wireless multi-hop networks, TCP performance is degraded because it is designed for wired networks. The main reasons of TCP performance degradation are contention for wireless medium at the MAC layer, hidden terminal problem, exposed terminal problem, packet losses in the link layer, unfairness problem, reordering problem caused by path disconnection, bandwidth waste caused by exponential backoff of retransmission timer due to node's mobility and so on. Specially, in the mobile ad-hoc networks, discrepancy between a station's transmission range and interference range produces hidden terminal problem that decreases TCP performance greatly by limiting simultaneous transmission at a time. In this paper, we propose a new MAC algorithm for mobile ad-hoc networks to solve the problem that a node can not transmit and just increase CW by hidden terminal. In the IEEE 802.11 MAC DCF, a node increases CW exponentially when it fails to transmit, but the proposed algorithm, changes CW adaptively according to the reason of failure so we get a TCP performance enhancement. We show by ns-2 simulation that the proposed algorithm enhances the TCP performance by fairly distributing the transmission opportunity to the failed nodes by hidden terminal problems.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2003.05a
• /
• pp.148-153
• /
• 2003

본 논문에서는 심근허혈 질환을 효율적으로 분류하기 위한 신경망을 설계하였다. European ST-T DB의 심전도로부터 ST 분절의 특징을 추출하여 입력노드를 결정하고 10개의 학습률과 학습 횟수에 따른 신경망의 MES를 계산하였다. 실험 결과 특징 파라미터의 조합을 ST0, ST80, Slope, Area로 하였을 때 MSE를 가장 작았다. 이러한 특징 파라미터를 이용하여 신경망의 입력으로 학습시킨 경우 학습 횟수의 증가에 따라 MSE가 지수합수적으로 감소하였으며 1,000회 이상에서는 둔하게 감소하였다. 또한 학습 횟수가 5,000회, 10,000회, 15,000회 각각의 경우에 대하여 학습률을 0.01부터 0.7까지 증가시키면서 MSE를 계산한 결과 학습 횟수가 증가할수록 MSE를 최소로 하는 최적학습률이 0.1부터 0.04까지 감소하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.181-184
• /
• 2003

가격대 성능 비를 고려할 때 저가격으로 병렬시스템을 제작할 수 있다는 특징으로, 시작된 클러스터시스템이 구성 장비의 특수화 및 전체 시스템의 대규모화로 인하여 더 이상 보조적인 소규모 시스템이 아닌, 슈퍼컴퓨터의 한 종류를 이루는 비중있는 시스템으로 자리매김하고있다. 이처럼 클러스터시스템 개발의 전반적인 방향이 대규모화를 지향하는 점을 고려할 때, 각 구성 요소의 무결성, 즉 안정성 점검은 시스템의 정상적인 운영을 위해서 중요한 부분이다. 본 논문에서는 클러스터시스템을 구성하는 각 계산노드의 메모리의 이상 유무을 관리 서버 측면에서 종합적으로 진단하기 위한 관리 도구의 개발을 다루고 있다.