• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.830-832
• /
• 2008

변전설비 감시제어시스템은 그 목적상 실시간의 대규모 측정정보 취득을 목적으로 한다. 취득정보는 RTU(Remote Terminal Unit)를 통해서 감시제어시스템에 전달된 후 필요에 따라 해당 정보를 요청하는 애플리케이션들에게 다시 전송된다. 현재 감시제어시스템에 널리 사용되는 DNP(Distribute Network Protocol)는 취득포인트 정보와 취득값만 가지고 있으므로 포인트 리스트에 대한 정보가 없는 경우에는 취득한 데이터를 판독할 수 없다. 따라서 감시제어시스템을 구축하기 위해 우선 RTU에 감시 선로정보를 입력하고, 이 정보를 다시 감시제어시스템의 DB에 포인트 정보와 매핑을 수행해야만 한다. 또한, 새로운 애플리케이션에서 취득값을 얻기 위해서는 이들 포인트 정보와 매핑 정보를 가지고 있는 감시제어시스템의 DB에 직접 연결해야만 한다. 본 논문은 공통정보모델과 이를 기반으로 작성된 메시지 교환 표준 인터페이스를 이용하여 감시제어시스템 취득정보의 효과적인 교환이 가능한 메시지 통합버스에 대하여 기술한다.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.19 no.2
• /
• pp.107-114
• /
• 2024

Mobile ad hoc networks represent self-configuring networks of mobile devices that communicate without relying on a fixed infrastructure. However, traditional routing protocols in such networks encounter challenges in selecting efficient and reliable routes due to dynamic nature of these networks caused by unpredictable mobility of nodes. This often results in a failure to meet the low-delay and low-energy consumption requirements crucial for such networks. In order to overcome such challenges, our paper introduces a novel multi-objective and adaptive routing scheme based on the Q-learning reinforcement learning algorithm. The proposed routing scheme dynamically adjusts itself based on measured network states, such as traffic congestion and mobility. The proposed approach utilizes Q-learning to select routes in a decentralized manner, considering factors like energy consumption, load balancing, and the selection of stable links. We present a formulation of the multi-objective optimization problem and discuss adaptive adjustments of the Q-learning parameters to handle the dynamic nature of the network. To speed up the learning process, our scheme incorporates informative shaped rewards, providing additional guidance to the learning agents for better solutions. Implemented on the widely-used AODV routing protocol, our proposed approaches demonstrate better performance in terms of energy efficiency and improved message delivery delay, even in highly dynamic network environments, when compared to the traditional AODV. These findings show the potential of leveraging reinforcement learning for efficient routing in ad hoc networks, making the way for future advancements in the field of mobile ad hoc networking.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.329-342
• /
• 2003

Most of the existing multicast routing protocols for ad-hoc networks do not take into account the efficiency of the protocol for the cases when there are large number of sources in the multicast group, resulting in either large overhead or poor data delivery ratio when the number of sources is large. In this paper, we propose a multicast routing protocol for ad-hoc networks, which particularly considers the scalability of the protocol in terms of the number of sources in the multicast groups. The proposed protocol designates a set of sources as the core sources. Each core source is a root of each tree that reaches all the destinations of the multicast group. The union of these trees constitutes the data delivery mesh, and each of the non-core sources finds the nearest core source in order to delegate its data delivery. For the efficient operation of the proposed protocol, it is important to have an appropriate number of core sources. Having too many of the core sources incurs excessive control and data packet overhead, whereas having too little of them results in a vulnerable and overloaded data delivery mesh. The data delivery mesh is optimally reconfigured through the periodic control message flooding from the core sources, whereas the connectivity of the mesh is maintained by a persistent local mesh recovery mechanism. The simulation results show that the proposed protocol achieves an efficient multicast communication with high data delivery ratio and low communication overhead compared with the other existing multicast routing protocols when there are multiple sources in the multicast group.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.437-452
• /
• 2008

IEEE 802.16j MR networks introduce RSs (Relay Stations) within the IEEE 802.16 system in order to enhance the data throughput and extend the coverage. However, the current standardization defines that the BS (Base Station) controls MS's (Mobile Station's) handover, not only it induces the large signaling overhead but also handover latency could increase. In this paper, we propose a handover protocol in the MR networks where the high capability RSs that can process the MS's control functions are deployed. First, we classify the handover scenarios for the MR networks with the high capability RSs. Then, we define the MAC handover procedure, corresponding MAC management messages and the transmission routes for the proposed messages so that an 802.16e MS can perform seamless handover without noticing it is attached to an MR network. The simulation results show that the proposed handover protocol not only reduces the MAC management message overhead transferred through the wireless links compared to IEEE 802.16j/D1, which is the current standard for MR networks, but also performs the rapider and more secure MS handover than IEEE 802.16e and IEEE 802.16j/D1.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.730-742
• /
• 2014

In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2450-2460
• /
• 2015

Recently, as interest in IoT (Internet of Things) increase, research and standardization of a new protocol which reflects the characteristics of IoT has progressed. Among them, RPL(IPv6 for Low-Power Lossy Network) is a standardized routing protocol for IoT. RPL utilizes DIO (DODAG Information Object) messages which is flooded from the sink node to the whole network for path establish and maintenance. However, in large scale networks, not only a long time is required to propagate the DIO message to the whole networks but also a bottleneck effect around the sink node is occurred. Multi-sink based approaches which take advantage of reducing routing overhead and bottleneck effect are widely used to solve these problems. In this paper, we define 'unnecessary path update problems' that may arise when applying the RPL protocol to the multi sink based IoT networks and propose two methods namely Routing Metric based Path Update Decision method and Immediate Successor based Path Update Decision method for selective routing update.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.48-58
• /
• 2009

Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.

• Safety and Health at Work
• /
• v.10 no.4
• /
• pp.452-460
• /
• 2019

Background: Monitoring and control of PM_2.5 are being recognized as key to address health issues attributed to PM_2.5. Availability of low-cost PM_2.5 sensors made it possible to introduce a number of portable PM_2.5 monitors based on light scattering to the consumer market at an affordable price. Accuracy of light scatteringe-based PM_2.5 monitors significantly depends on the method of calibration. Static calibration curve is used as the most popular calibration method for low-cost PM_2.5 sensors particularly because of ease of application. Drawback in this approach is, however, the lack of accuracy. Methods: This study discussed the calibration of a low-cost PM_2.5-monitoring device (PMD) to improve the accuracy and reliability for practical use. The proposed method is based on construction of the PM_2.5 sensor network using Message Queuing Telemetry Transport (MQTT) protocol and web query of reference measurement data available at government-authorized PM monitoring station (GAMS) in the republic of Korea. Four machine learning (ML) algorithms such as support vector machine, k-nearest neighbors, random forest, and extreme gradient boosting were used as regression models to calibrate the PMD measurements of PM_2.5. Performance of each ML algorithm was evaluated using stratified K-fold cross-validation, and a linear regression model was used as a reference. Results: Based on the performance of ML algorithms used, regression of the output of the PMD to PM_2.5 concentrations data available from the GAMS through web query was effective. The extreme gradient boosting algorithm showed the best performance with a mean coefficient of determination (R²) of 0.78 and standard error of 5.0 ㎍/㎥, corresponding to 8% increase in R² and 12% decrease in root mean square error in comparison with the linear regression model. Minimum 100 hours of calibration period was found required to calibrate the PMD to its full capacity. Calibration method proposed poses a limitation on the location of the PMD being in the vicinity of the GAMS. As the number of the PMD participating in the sensor network increases, however, calibrated PMDs can be used as reference devices to nearby PMDs that require calibration, forming a calibration chain through MQTT protocol. Conclusions: Calibration of a low-cost PMD, which is based on construction of PM_2.5 sensor network using MQTT protocol and web query of reference measurement data available at a GAMS, significantly improves the accuracy and reliability of a PMD, thereby making practical use of the low-cost PMD possible.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.27-30
• /
• 2012

In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases of header re-elected problem, decreases of header re-elected problem and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header because the remaining energy level goes low, it sends a beacon message to neighbor member nodes and the second header will serve as the cluster header.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.699-711
• /
• 2003

Home networking and Internet control technologies must satisfy three requirements with a view to being applied to home for raising the qualify of human life. Firstly, the cost of adding home networking ability to the traditional appliance must be minimized. Secondly, the mutual accessibility between home network and Internet must be guaranteed in the various Internet service environment of home. Finally, communication must be possible between the home network and the Internet that use different communications protocols. This paper proposes the ARCS (Appliance Remote Control System) that controls appliances based on LnCP (Living network Control Protocol) via the Internet. LnCP is the most cost-effective network and control protocol for home network. ARCS guarantees the accessibility from the Internet to home network and provides users with the virtual interface designed for controlling appliances using the Internet application program. In addition, this paper proposes AICS (Appliance Internet Control Specification). AICS, is based on LnCP, defines the message structure and control commands for the Internet control communication. ARCS and home gateway are developed to meet AICS.