• Journal of the Korea institute for structural maintenance and inspection
• /
• v.25 no.1
• /
• pp.93-102
• /
• 2021

This paper describes the process of developing a concrete median barrier of SB4 grade with anti-glare function. The development section has a height and width of 1,270mm and 560mm, respectively. A wire mesh is placed in the center of the cross section to improve the protection performance. Collision analysis predicted that this section satisfies the strength and occupant protection performance, and that no damage to the barrier occurs. In the actual collision test, it was confirmed that this section satisfies the strength and occupant protection performance. However, damage was observed on two concrete barrier when the truck crashed. In order to improve the accuracy of the collision analysis of the concrete barrier in the future, it is considered that a study on the model development and continuous collision analysis method for domestic commercial vehicles should be carried out.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.625-630
• /
• 2006

Zigbee 센서 네트워크에서는 multihop 전송을 위하여 tree topology와 beacon-enabled 네트워크 구성을 갖는다. 이러한 multihop beaconing 네트워크의 목적은 routing 노드들에게 Sleep할 기회를 주어 파워의 소모를 줄이고자 하는 데 있다. 파워의 소모를 줄이고 beacon 전송시의 충돌을 방지하기 위하여 beacon 전송 스케줄링이 필요한데 본 논문은 multihop을 지원하고 에너지 효율에 효과적인 beacon 전송 스케줄링 알고리즘과 이를 바탕으로 에너지 효율적인 라우팅 기법을 제안한다. 본 제안은 Zigbee coordinator의 beacon interval(BI)이 결정되면 네트워크 내의 beacon을 전송하는 모든 노드들은 Zigbee coordinator의 BI를 알고 모든 노드의 superframe duration(SD)은 동일하다고 가정한다. 이러한 가정하에서 beacon을 전송하는 노드들이 Zigbee coordinator의 BI 구간 중 항상 정해진 시간에 자신의 beacon을 전송한다면 beacon의 충돌을 막을 수 있음을 보여 준다. 또한 노드들이 서로의 beacon 전송 시간을 알 수 있기 때문에 목적지 노드의 beacon을 tracking하지 않고도 목적지 노드가 active 되는 시점에 패킷을 전송하면 에너지 측면에서 좀 더 효율적인 라우팅 기반을 제공한다는 것을 보여 준다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.977-985
• /
• 2012

Recently, many countries have been developing new protocols to improve the performance of tactical ad hoc networks for implementing NCW (Network Centric Warfare). Combat net radio (CNR) networks are the most important communication infra for the ground forces such as infantry of Army. U.S. Army had developed MIL-STD-188-220D that is the Interoperability Standard for DMTDs (Digital Messages Transfer Device Subsystems) for voice and data communication in CNR. MIL-STD-188-220D is a candidate for MAC protocol of TMMR which is next radio and has a few constraints to used in TMMR. NAD (Network Access Delay) defined in MIL-STD-188-220D needs time synchronization to avoid collision. However, it is difficult for time synchronization to fit in multi-hop environment. We suggest the enhanced DAP (Deterministic Adaptable Priority)-NAD to prevent conflicts and decrease delays in multi-hop CNR. Simulation results show that the proposed scheme improves the performance in multi-hop CNR networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.723-725
• /
• 2016

In Gen-2 Q-algorithm, if the number of tags is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. Also, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to select the weight based on the slot-count size of current query round through the tag number estimation and.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.160-163
• /
• 2021

최근 국내 전동킥보드 공유서비스의 증가 추세에 따라 전동킥보드와 보행자 혹은 차량과의 충돌사고가 증가하고 있다. 이러한 충돌사고로 인한 사고를 예방하기 위해 본 논문에서는 영상처리 기술에 기반한 후방위험요소 감지 시스템을 제안한다. 제안 시스템은 전동킥보드 사용자의 안전 헬멧에 라즈베리파이와 파이캠을 장착하여 가까이 오는 보행자나 차량을 영상처리 기법을 활용하여 인식하도록 하여 이들과의 충돌을 사전에 방지하도록 해준다. 제안 시스템의 정확도를 파악하기 위해 입력영상의 해상도별 처리속도와 정확도를 비교한다. 아울러, 제안 시스템을 안전 헬멧에 장착하여 테스트필드 실험을 통해 실제 환경에서 사용가능 여부를 검증한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.76-79
• /
• 2016

자동차 산업의 발달과 전세계적으로 차량의 증가로 인해 보행자의 사고 발생율이 증가하고 있고 보행자의 안전에 대해 연구와 안전장비들이 계속적으로 개발되고 있다. 보행자와 차량의 충돌시 보행자의 상해를 감소시키는 시스템 중 화약식 액티브 후드 시스템(active hood system, AHS)은 부하가 화약성분이므로 부하의 성분을 검출하는데 한계가 있고, 위험성이 높으므로 정밀한 고장진단이 필요하다. 이러한 문제점을 해결하기 위해 화약의 부하저항을 측정하는 방법과 저항성 누설전류를 측정하는 방법을 제시하고, 이 방법을 점화회로의 이상 유무를 확인하는 고장진단 기법으로 제안한다. 그리고 고장진단시 squib가 점화되는 오동작을 방지하고저 고장진단 모드와 점화모드를 구별하여 진단전류와 점화전류를 구분하는 기법을 제안한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.615-617
• /
• 2014

The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. This algorithm uses the fixed frame size at every scan. Therefore, it has problems that the performance of PS algorithm can be variously shown according to the number of tags, frame size, and power level increase. In this paper, we propose an EPS algorithm that allocates the optimal frame size by estimating the number of tags at each scan.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1395-1409
• /
• 2006

A spatial data warehouse has spatial data cube composed of multi-dimensional data for efficient OLAP(On-Line Analytical Processing) operations. A spatial data cube supporting concept hierarchies holds huge amount of data so that many researches have studied a incremental update method for minimum modification of a spatial data cube. The Cube, however, compressed by eliminating prefix and suffix redundancy has coalescing paths that cause update inconsistencies for some updates can affect the aggregate value of coalesced cell that has no relationship with the update. In this paper, we propose incremental batch update method of a spatial data cube. The proposed method uses duplicated nodes and extended node structure to avoid update inconsistencies. If any collision is detected during update procedure, the shared node is duplicated and the duplicate is updated. As a result, compressed spatial data cube that includes concept hierarchies can be updated incrementally with no inconsistency. In performance evaluation, we show the proposed method is more efficient than other naive update methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.846-850
• /
• 2009

Recently, wireless sensor networks have found their way into a wide variety of applications and systems with vastly varying requirements and characteristics such as environmental monitoring, smart spaces, medical applications, and precision agriculture. The sensor nodes are battery powered. Therefore, the energy is the most precious resource of a wireless sensor network since periodically replacing the battery of the nodes in large scale deployments is infeasible. Energy efficient mechanisms for gathering sensor readings are indispensable to prolong the lifetime of a sensor network as long as possible. There are two energy-efficient approaches to prolong the network lifetime in sensor networks. One is the compression scheme to reduce the size of sensor readings. When the communication conflict is occurred between two sensor nodes, the sender must try to retransmit its reading. The other is the MAC protocol to prevent the communication conflict. In this paper, we propose a novel approaches to reduce the size of the sensor readings in the MAC layer. The proposed scheme compresses sensor readings by allocating the time slots of the TDMA schedule to them dynamically. We also present a mathematical model to predict latency from collecting the sensor readings as the compression ratio is changed. In the simulation result, our proposed scheme reduces the communication cost by about 52% over the existing scheme.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.53-63
• /
• 2008

Reader collision may occur when neighboring RFID readers use the same channel at the same time. Especially when the readers are operated in dense mode, even though many channels are available, because of frequent reader collisions we can not guarantee the performance of RFID readers. Conventional solutions such as FH(Frequency Hopping) or LBT(Listen Before Talk) are not effective in this situation because they can not schedule RFID readers effectively when RFID readers are operated in multi-channel, dense reader mode, In this paper, we propose a new RFID reader anti-collision algorithm which employs LBT, random backoff before channel access, and probabilistic channel hopping at the same time. While LBT and Random backoff before channel access reduces collisions between competing readers, probabilistic channel hopping increases channel utilization by adaptively changing the hopping probability by reflecting the reader density and utilization. Simulation results shows that our algorithm outperforms conventional methods.