• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.396-399
• /
• 2013

TDMA(Time-Division Multiple Access)는 한정된 채널을 시간상에서 여러 개의 구간으로 분할하고, 자신에게 할당된 시간 구간에서 정보를 전송하는 기법이다. 본 논문은 TDMA 알고리즘의 한 종류인 DESYNC 알고리즘을 소규모 네트워크에 적용하여 별도의 동기화 작업 없이 간단한 규칙으로 동기화를 유지하는 기법을 소개 한다. 기존의 DESYNC 알고리즘은 모든 노드들이 전송 영역 안에 있어야 하고, 전부 연결되어있어야 한다는 단점이 있다. 이 문제점을 해결하고자 중앙제어장치인 CU(Central Unit)을 네트워크에 배치하여 2-홉 형태의 중앙 집중방식 네트워크가 운영되도록 하였다. 제시하는 알고리즘은 기존의 DESYNC 알고리즘과 마찬가지로 복잡한 동기화 과정 없이 단순한 방식으로 TDMA가 동작할 수 있도록 하면서, 전송 범위는 기존의 DESYNC 알고리즘의 성능에 비해 우수하다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.3
• /
• pp.31-42
• /
• 2005

We consider a network storage model whose administrator can not be fully trusted. In this model, we assume that all data stored are encrypted for data confidentiality and one owner distributes the decryption key for each time period to users. In this paper, we propose three privilege management schemes. In the first scheme, called Temporal Privilege Management (TPM), we use a symmetric encryption based on one-way function chains for key encapsulation. In the second scheme, called Asymmetric Temporal Privilege Management (ATPM), anyone can encrypt the data using the public key of owner, but only privileged users can decrypt the encrypted data. Finally, we present a scheme to restrict writers' privilege using ID-based signatures in ATPM. In our schemes, the privilege managements are based on the time and the addition of users is efficient. Specially, applying TPM and ATPM, we can solve the back-issue problem.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.11
• /
• pp.20-26
• /
• 1994

In this paper, we propose an algorithm on partitioning a network into several subsets where the cost of a net which connects nodes in k subsets is given as k(k-1)/2 indicating the typical pattern of complete graphs. This problem is one of generalizations for multiple-way partitioning proposed by Sanchis. $^{[5]}$ Its solution can be applied to resource allocation problem in distributed systems. The proposed algorithm expanded the algorithm of Fiduccia and Mattheyses$^{[3]}$ to handle the multiple-way partitioning simultaneously. It has time and space complexity linear to the size of the network. To evaluate the performance of the proposed algorithm, we implemented also a traditional cluster growth method which groups connected nodes for nets, and compared experimental results with those of the proposed algorithm. The proposed algorithm shows some enhancement made.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.4
• /
• pp.127-134
• /
• 2012

This study analyzed the present status of services by fire-suppression mobilization time of fire station where is located in Jinju city, by using network analysis of GIS targeting fire station(five 119 safety centers, one 119 division) in Jinju city area. As a result, it was indicated to be 15.9% in the ratio with less than 5 minutes of mobilization time, 34.7% in the ratio with less than 8 minutes, 94% in the ratio with less than 20 minutes out of the whole fire service area in Jinju city. Even districts with more than 20 minutes were analyzed to reach 6%. Especially, to solve vulnerability to approach the fire service in uptown districts(Jinseong, Jisu, Sabong, Ilbanseong, the whole area of Ibanseong), the 119 division is installed more to be operated. However, accessibility is still remaining in low level. Also, in case of 119 safety center of Cheonjeon, the national industrial complex and the general industrial complex are being formed on a large scale. However, analyzing the fire service level in the corresponding area, the districts with more than 8 minutes and less than 20 minutes were existing broadly. In consequence of analyzing the fire service area in Jinju city with the fire-suppression mobilization time as the above, the fire service level is failing to escape largely from the status prior to the urban-rural consolidation compared to what the jurisdictional area was largely expanded by which the administrative districts were integrated by the urban-rural consolidation in locally small-and medium-sized city. Thus, there is a need of a measure for improving this.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.232-234
• /
• 2006

본 논문에서는 마르코프 결정 문제 (Markov decision problem)의 풀이 효율을 잴 수 있는 척도를 알아보기 위해 복잡계 네트워크 (complex network) 의 관점에서 MDP를 하나의 그래프로 나타내고, 그 그래프의 위상학적 성질들을 여러 네트워크 척도 (network measurements)들을 이용하여 측정하고 그 MDP의 풀이 효율과의 관계를 분석하였다. 실세계의 여러 문제들이 MDP로 표현될 수 있고, 모델이 알려진 경우에는 평가치 반복(value iteration)이나 모델이 알려지지 않은 경우에도 강화 학습(reinforcement learning) 알고리즘등을 사용하여 풀 수 있으나, 이들 알고리즘들은 시간 복잡도가 높아 크기가 큰 실세계 문제에 적용하기 쉽지 않다. 이 문제를 해결하기 위해 제안된 것이 MDP를 계층적으로 분할하거나, 여러 단계를 묶어서 수행하는 등의 시간적 추상화(temporal abstraction) 방법들이다. 시간적 추상화를 도입할 경우 MDP가 보다 효율적으로 풀리는 꼴로 바뀐다는 사실에 착안하여, MDP의 풀이 효율을 네트워크 척도를 이용하여 측정할 수 있는 여러 위상학적 성질들을 기반으로 분석하였다. 다양한 구조와 파라미터를 가진 MDP들을 사용해 네트워크 척도들과 MDP의 풀이 효율간의 관계를 분석해 본 결과, 네트워크 척도들 중 평균 측지 거리 (mean geodesic distance) 가 그 MDP의 풀이 효율을 결정하는 가장 중요한 기준이라는 사실을 알 수 있었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.194-198
• /
• 2021

LoRa is a physical layer technology that is designed to provide a reliable long-range communication with introducing CSS and with introducing a loco parentis tree network. Since a leaf can utilize multiple parents at the same time with a single transmission, PDR increases logarithmically as the number of gateways increases. Because of the ALOHA-like MAC of LoRa, however, the PDR degrades even under the loco parentis tree topology similarly to the single-gateway environment. Our proposed method is aimed to achieve SDMA approach to reuse the same frequency in different areas. For that purpose, it elaborately controls each TxPower of the senders for each message in concurrent transmission to survive the collision at each different gateway. The gain from this so-called capture effect increases the capacity of resource-hungry LPWAN. Compared to a typical collision-free controlled-access scheme, our method outperforms by 10-35% from the perspective of the total count of the consumed time slots. Also, due to the power control mechanism in our method, the energy consumption reduced by 20-40%.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.11a
• /
• pp.78-79
• /
• 2022

육상제어센터의 원격제어시스템은 원격모니터링시스템, 원격제어시스템, 메시지 교환장치 및 선박모사장치로 구성되었다. 본 연구에서는 육상제어센터의 원격제어시스템 실험을 위해 실습선 한나라호와 육상제어센터 간 통신망(VSAT, LTE)를 활용하여 1) 장비테스트, 2) 시나리오 기반 테스트를 실시하였다. 먼저, 장비테스트는 정박 및 항해중 필수장비(Rudder, Engine, Thruster)에 대해 이루어졌으며, 시나리오 기반 테스트는 항해중 안전수역내에서 제어실험이 이루어졌다. 장비테스트 결과는 선박-육상 간 지연시간은 0.1초이내이며, 시나리오 기반 테스트 결과는 선박에서 육상제어센터까지 평균지연시간은 0.87초이며 최대 9.88분, 육상제어센터에서 선박까지 평균지연시간은 1.14초이며, 최대 8.9분이다. 이와 같이, 선박과 육상간 송수신된 데이터 분석을 통해 선박과 육상 간의 원격제어 및 통신네트워크의 문제점 식별하고, 이에 대한 대안방안 등을 제시하고자 한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2017.05a
• /
• pp.17-18
• /
• 2017

손쉽게 현 위치 정보를 공유하고 사용자 간 커뮤니케이션이 가능한 위치 기반 소셜 네트워크가 대중화되면서 장소 추천에 대한 연구가 활발히 진행되어 있다. 본 논문은 시간대별 사용자 선호도와 주요 활동 영역을 고려한 POI 추천 기법을 제안한다. 장소 카테고리별 사용자의 체크인(che-ck-in)정보를 시간대로 분할하여 시간에 따른 장소의 선호도를 판별하고 사용자의 과거 이력을 이용하여 사용자별 활동 영역을 선별한다. 장소의 선호도와 선별된 활동 영역에 기반하여 협업 필터링을 수행하여 POI를 추천한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.618-624
• /
• 2009

In the evolution from wireless sensor networks(WSNs) to ubiquitous sensor networks(USNs), technologies that can support intensive data-traffic loads, large number of users, improved interoperability, and extreme longevity are required. Therefore, efficient communication time coordination control and low power consumption becomes one of the most important design goals for USN MAC protocols. So far several time division multiplexed (TDM) MAC protocols have been proposed. However, since the pros and cons of existing protocols are not easy to analyze, it becomes a challenging task to design improved TOM MAC protocols. Based on this objective, this paper provides a novel protocol analysis along with a message complexity derivation and comparison of the existing TDM MAC protocols.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.37-46
• /
• 2011

Time synchronization plays an important role in mobile communication systems, particularly, when an accurate time-division mechanism among the communication entities is required. We present a new time synchronization algorithm for a wireless mobile ad-hoc network assuming that communication link is managed by a time-slot reservation-based medium access control protocol. The central idea is to reduce time synchronization packet collisions by exploiting the advantages found in reference broadcasting. In addition, we adopt a sophisticated clock updating scheme to ensure the time synchronization convergence. To verify the performance of our algorithm, a set of network simulations has been performed under various mobile ad-hoc network scenarios using the OPNET. The results obtained from the simulations show that the proposed method outperforms the conventional TSF method in terms of synchronization accuracy and convergence time.