• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권2호
• /
• pp.445-466
• /
• 2022

As everything linking to the internet, people can subscribe to various services from a service provider to facilitate their lives through the Internet of Things (IoT). An obligatory thing for the service provider is that they should push the service data safely and timely to multiple IoT terminal devices regularly after the IoT devices accomplishing the service subscription. In order to control the service message received by the legal devices as while as keep the confidentiality of the data, the public key encryption algorithm is utilized. While the existing public encryption algorithms for push service are too complicated for IoT devices, and almost of the current subscription schemes based on push mode are relying on centralized organization which may suffer from centralized entity corruption or single point of failure. To address these issues, we design a secure subscription-push service scheme based on blockchain and edge computing in this article, which is decentralized with secure architecture for the subscription and push of service. Furthermore, inspired by broadcast encryption and multicast encryption, a new encryption algorithm is designed to manage the permissions of IoT devices together with smart contract, and to protect the confidentiality of push messages, which is suitable for IoT devices. The edge computing nodes, in the new system architecture, maintain the blockchain to ensure the impartiality and traceability of service subscriptions and push messages, meanwhile undertake some calculations for IoT devices with limited computing power. The legalities of subscription services are guaranteed by verifying subscription tags on the smart contract. Lastly, the analysis indicates that the scheme is reliable, and the proposed encryption algorithm is safe and efficient.

• 한국통신학회논문지
• /
• 제38A권12호
• /
• pp.1125-1134
• /
• 2013

최근 많은 수의 모바일 유저와 과도한 트래픽 증가를 해결하기 위한 솔루션으로 피코 혹은 펨토 셀과 같은 소형 셀을 설치하는 방법이 주목 받고 있다. 그러나 소형 셀에 속한 엣지 유저들은 주변 기지국으로부터 극심한 셀간 간섭을 받기 때문에 낮은 평균 전송률을 얻게 되고, 이를 해결하기 위해서는 셀 간 간섭을 효과적으로 관리하는 방법이 필요하다. 최근의 많은 연구들은 셀 간 간섭 관리를 위해 기지국의 전송 전력을 제어하는 알고리즘을 제시하였지만, 제시된 방법들은 높은 복잡도를 가지고 중앙 기지국의 도움을 필요로 한다는 단점이 있다. 본 연구에서는 기지국간의 경쟁을 기반으로 하여, 낮은 복잡도를 가지는 분산화된 방법의 기지국 전송 전력 on/off 제어 및 유저 스케줄링 알고리즘을 제안한다. 시뮬레이션 결과를 통해, 제안하는 방법이 셀 간 간섭 관리를 하지 않는 방법에 비해 셀 엣지 유저의 경우 170%의 성능 개선을 보이고, 최적의 알고리즘과 비교 했을 때 88-96%에 달하는 geometric average throughput (GAT) 성능 및 매우 근접한 average edge user throughput (AET) 성능을 보임을 검증한다.

• 한국항공우주학회지
• /
• 제44권8호
• /
• pp.657-665
• /
• 2016

발사관제시스템은 발사캠페인 기간 중 지상의 발사 준비 및 발사 운용 임무를 수행한다. 보통 발사 운용의 성공 여부는 발사관제시스템의 하드웨어나 소프트웨어에 의해 크게 영향을 받는다. 특히 제어 알고리즘의 사소한 오류조차 발사 운용에 심각한 문제나 재난을 유발 시킬 수 있다. 따라서 내재된 오류를 사전 검증시험을 통해 찾아내 제거해야 한다. 본 논문은 발사관제시스템 검증에 사용된 하드웨어와 소프트웨어 시뮬레이터의 설계와 구현에 대해 소개한다. 시뮬레이터의 상세한 설계와 플로차트 형식의 구체적인 알고리즘을 기술하여 유사한 시스템의 구현에 적용할 수 있도록 하였다. 특히 별도의 컴퓨터나 PLC를 사용하지 않고 자체 제어기에서 모든 시뮬레이션 알고리즘이 동작하도록 개발한 점을 강조한다.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.26-35
• /
• 2009

In this paper, we investigate how to do resource allocation to guarantee a minimum user data rate at low signaling overhead in multi-cell orthogonal frequency division multiple access (OFDMA) wireless systems. We devise dynamic resource allocation (DRA) algorithms that can minimize the QoS violation ratio (i.e., the ratio of the number of users who fail to get the requested data rate to the total number of users in the overall network). We assume an OFDMA system that allows dynamic control of frequency reuse factor (FRF) of each sub-carrier. The proposed DRA algorithms determine the FRFs of the sub-carriers and allocate them to the users adaptively based on inter-cell interference and load distribution. In order to reduce the signaling overhead, we adopt a hierarchical resource allocation architecture which divides the resource allocation decision into the inter-cell coordinator (ICC) and the base station (BS) levels. We limit the information available at the ICC only to the load of each cell, that is, the total number of sub-carriers required for supporting the data rate requirement of all the users. We then present the DRA with limited coordination (DRA-LC) algorithm where the ICC performs load-adaptive inter-cell resource allocation with the limited information while the BS performs intra-cell resource allocation with full information about its own cell. For performance comparison, we design a centralized algorithm called DRA with full coordination (DRA-FC). Simulation results reveal that the DRA-LC algorithm can perform close to the DRA-FC algorithm at very low signaling overhead. In addition, it turns out to improve the QoS performance of the cell-boundary users, and achieve a better fairness among neighboring cells under non-uniform load distribution.

• 한국통신학회논문지
• /
• 제37A권10호
• /
• pp.865-875
• /
• 2012

본 논문은 포트 당 일정 파워 제약을 전제한 상황에서, 다중 안테나를 장착한 분산 안테나 (distributed antenna: DA) 포트를 갖는 분산 안테나 시스템 (distributed antenna system: DAS)의 안테나 위치 설계 방법을 분석한다. 안테나 위치의 설계를 위해 복잡하게 셀 당 평균 ergodic sum rate를 최대화하는 대신, 본 논문에서는 단일 셀 상황에서는 signal-to-noise ratio (SNR) 기댓값의 lower bound에, 그리고 이중 셀 상황에서는 signal-to-leakage ratio (SLR) 기댓값의 lower bound에 각각 초점을 맞춘다. 단일 셀 상황의 경우, 기존의 반복적 알고리즘에 비해 SNR criterion의 최적화 문제는 닫힌 형태 (closed-form)의 솔루션을 제공한다. 또한, 이중 셀 상황에선 gradient ascent 방법을 이용한 알고리즘을 제안하여 SLR criterion의 최적화 솔루션을 도출한다.

• 융합보안논문지
• /
• 제20권1호
• /
• pp.3-8
• /
• 2020

블록체인은 중앙 집중 시스템 형태에서 벗어난 탈중앙화 형태의 데이터 관리를 통하여 데이터 투명성과 보안성을 높일 수 있다. 블록체인 플랫폼 중 허가형 블록체인은 신뢰기반의 허가된 노드만이 분산 네트워크에 참여할 수 있다. 허가형 블록체인의 특징을 고려하였을 때 합의 알고리즘 선정을 위한 조건으로 네트워크 통신 속도 및 거래내역의 최종성 합의, 안정성 등의 고려가 필요하다. 허가형 블록체인 환경의 합의 알고리즘은 PoA, PBFT, Raft 등 다양하지만 합의 알고리즘 선정을 위한 다양한 평가요소가 존재하지 않는다. 본 논문에서는 허가형 블록체인의 각 합의 알고리즘의 특징을 분석하고 네트워크를 구성하는 사용자 환경의 특징을 고려한 효율적 합의 알고리즘 선정을 위하여 다양한 성능평가항목을 제안하였다. 제안한 성능평가항목은 신뢰를 전제로 한 노드 간 네트워크 속도, 안정성, 최종성 합의의 적합성 등을 고려할 수 있으며 이를 통하여 보다 효율적인 블록체인 네트워크 환경을 구성할 수 있다.

• 국제학술발표논문집
• /
• The 9th International Conference on Construction Engineering and Project Management
• /
• pp.1243-1244
• /
• 2022

In recent years, the growing interest in off-site construction has led to factories scaling up their manufacturing and production processes in the construction sector. Consequently, continuous large-scale site monitoring in low-variability environments, such as prefabricated components production plants (precast concrete production), has gained increasing importance. Although many studies on computer vision-based site monitoring have been conducted, challenges for deploying this technology for large-scale field applications still remain. One of the issues is collecting and transmitting vast amounts of video data. Continuous site monitoring systems are based on real-time video data collection and analysis, which requires excessive computational resources and network traffic. In addition, it is difficult to integrate various object information with different sizes and scales into a single scene. Various sizes and types of objects (e.g., workers, heavy equipment, and materials) exist in a plant production environment, and these objects should be detected simultaneously for effective site monitoring. However, with the existing object detection algorithms, it is difficult to simultaneously detect objects with significant differences in size because collecting and training massive amounts of object image data with various scales is necessary. This study thus developed a large-scale site monitoring system using edge computing and a small-object detection system to solve these problems. Edge computing is a distributed information technology architecture wherein the image or video data is processed near the originating source, not on a centralized server or cloud. By inferring information from the AI computing module equipped with CCTVs and communicating only the processed information with the server, it is possible to reduce excessive network traffic. Small-object detection is an innovative method to detect different-sized objects by cropping the raw image and setting the appropriate number of rows and columns for image splitting based on the target object size. This enables the detection of small objects from cropped and magnified images. The detected small objects can then be expressed in the original image. In the inference process, this study used the YOLO-v5 algorithm, known for its fast processing speed and widely used for real-time object detection. This method could effectively detect large and even small objects that were difficult to detect with the existing object detection algorithms. When the large-scale site monitoring system was tested, it performed well in detecting small objects, such as workers in a large-scale view of construction sites, which were inaccurately detected by the existing algorithms. Our next goal is to incorporate various safety monitoring and risk analysis algorithms into this system, such as collision risk estimation, based on the time-to-collision concept, enabling the optimization of safety routes by accumulating workers' paths and inferring the risky areas based on workers' trajectory patterns. Through such developments, this continuous large-scale site monitoring system can guide a construction plant's safety management system more effectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권2호
• /
• pp.577-594
• /
• 2020

Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.

• KIEAE Journal
• /
• 제15권1호
• /
• pp.89-95
• /
• 2015

The centralized power supply system and rainwater treatment system, which are major infrastructure in modern cities, are showing their limitations in accommodating environment load due to climate changes that has aggravated recently. As a result, complex issues such as shortage of reserve power and urban flooding have emerged. As a single solution, decentralized systems such as a model integrating photovoltaic system and rooftop greening system are suggested. When these two systems are integrated and applied together, the synergy effect is expected as the rooftop greening has an effect of preventing urban flooding by controlling peak outflow and also reduces ambient temperature and thus the surface temperature of solar cells is lowered and power generation efficiency is improved. This study aims to compare and analyze the monitoring results of four algorithms that define correlations between micro-climate variables around rooftop greening and the surface temperature of solar cells and generate their significance. By doing so, this study seeks to present an effective algorithm that can estimate the surface temperature of solar cell that has direct impact on the efficiency of photovoltaic power generation by observing climate variables.

• 정보처리학회논문지B
• /
• 제17B권2호
• /
• pp.157-162
• /
• 2010

본 논문에서는 분산된 거대한 네트워크상의 데이터에서 유용한 정보를 추출하는 새로운 마이그레이션 조절방법을 이용한 유전 알고리즘을 제안한다. 제안된 알고리즘의 주된 아이디어는 부분 개체군 사이에서 개체들의 이동에 필요한 파라미터들을 적응적으로 결정하는 것이다. 또 이동된 개체들이 새로운 부분 개체군에서 도태되지 않고 적응 할 수 있기 위한 방법을 제시한다. UCI 기계학습 관련 데이터 셋에서 중앙 집중적 단일 유전 알고리즘과 제안된 알고리즘을 비교하기 위해 여섯 개의 데이터를 사용했다. 결론적으로 분산 유전 알고리즘을 적용한 특징 부분 집합이 단일 유전 알고리즘을 적용한 것 보다 좋은 성능을 보였다.