• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.4
• /
• pp.378-386
• /
• 2013

In this paper, we propose a multi-way relaying system, in which N communicating nodes interchange their information one another by the help of a multiple-antenna non-regenerative relay station (RS). While the conventional multi-way relaying requires 2N transmission phases to complete the data exchange, the proposed system completes the mission with N phases composed of one multiple access phase and N-1 broadcast phases. For effective broadcast transmission, the proposed system pairs users for signal transmission with a new RS beamforming matrix not to interfere with the nodes of different pairs and a self-interference canceler at each node. The performance evaluation in terms of the average sum rate shows that the proposed system outperforms the conventional one with more significant gain when the number of RS antennas is comparable to the number of communicating nodes. The proposed schemes can be applicable to marine communications where the ships need to share their information with extended coverage.

• The Korean Journal of Applied Statistics
• /
• v.22 no.2
• /
• pp.415-424
• /
• 2009

As one of the unsupervised learning neural network methods, self-organizing maps(SOM) are applied to various fields. It reduces the dimension of multidimensional data by representing observations on the low dimensional manifold. On the other hand, the minimal spanning tree(MST) of a graph that achieves the most economic subset of edges connecting all components by a single open loop. In this study, we apply the MST technique to SOM with subnodes. We propose SOM's with embedded MST and a distance measure for optimum choice of the size and shape of the map. We demonstrate the method with Fisher's Iris data and a real gene expression data. Simulated data sets are also analyzed to check the validity of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1311-1321
• /
• 2010

Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In this paper, we propose SET(SendDoneEventbasedTransmission Technique)which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed. In SET, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission time. Therefore SET could provide high packet transmission rate given large amount of packets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.844-851
• /
• 2010

Recently, AODV routing protocol which one of the table driven method for the purpose data transmission between nodes has been broadly used in mobile wireless sensor networks. An existing AODV has a little overhead of routing packets because of keeping the routing table for activity route and re-routes to recovery the routes in route discontinuation. However that has faults in that excesses useless of the network bandwidth to recovery the route and takes a lone time to recovery the route. This paper proposes an efficient route recovery method for AODV based on wireless sensor networks in connection breaks. The proposed method. The propose method controls the number of RREQ message considering the energy's node and distance between nodes to restrict the flooding range of RREQ message while expanding the range of local repair. In test results, the proposed method are compared to existing method, the number of drops decrease 15.43% and the delay time for re-route decrease 0.20sec.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.01a
• /
• pp.73-74
• /
• 2017

SVM(Support Vector Machine) 알고리즘은 대표적인 기계 학습 분류 알고리즘으로 감정 분석, 제스처 인식 등 다양한 분야의 문제를 해결하기 위해 사용되고 있다. SVM 알고리즘은 분리경계면(Hyper-Plane) 또는 분리경계면 집합 중 지지벡터(Support Vector)라 불리는 특정한 점들로 이루어진 두 그룹 간의 거리 차이(Margin)를 최대로 하는 분리경계면을 이용하여 데이터를 분류하는 알고리즘이다. 높은 정확도를 제공하지만 처리 속도가 느리며 학습을 위해 대량의 데이터 및 메모리가 필요하기 때문에 자원이 제한적인 IoT 환경에서 사용이 어렵다. 본 논문에서는 자원이 제한된 IoT 노드를 기반으로 효율적으로 데이터를 학습하기 위해 K-means 알고리즘을 이용하여 SVM 알고리즘의 저전력화 방안을 연구한다.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.17-23
• /
• 2016

In the future network such as Internet of Things (IoT), the number of computing devices are expected to grow exponentially, and each of the things communicates with the others and acquires information by itself. Due to the growing interest in IoT applications, the broadcasting in Opportunistic ad-hoc networks such as Machine-to-Machine (M2M) is very important transmission strategy which allows fast data dissemination. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose a fuzzy logic based probabilistic multi-hop broadcast (FPMCAST) algorithm which statistically disseminates data accordingly to the remaining energy rate, the replication density rate of sending node, and the distance rate between sending and receiving nodes. In proposed FPMCAST, the inference engine is based the fuzzy rule base which is consists of 27 if-then rules. It maps input and output parameters to membership functions of input and output. The output of fuzzy system defines the fuzzy sets for rebroadcasting probability, and defuzzification is used to extract a numeric result from the fuzzy set. Here Center of Gravity (COG) method is used to defuzzify the fuzzy set. Then, the performance of FPMCAST is evaluated through a simulation study. From the simulation, we demonstrate that the proposed FPMCAST algorithm significantly outperforms flooding and gossiping algorithms. Specially, the FPMCAST algorithm has longer network lifetime because the residual energy of each node consumes evenly.

• Annual Conference of KIPS
• /
• 2024.05a
• /
• pp.37-40
• /
• 2024

본 연구에서는 웨어러블 디바이스로부터 수집된 다변량 반려동물 행동 데이터를 처리하기 위해, GCN(Graph Convolutional Network)과 GRU(Gated Recurrent Unit)를 결합한 모델을 제안한다. 제안된 모델은 시계열 내부 구조를 활용하여 그래프 구조로 변환하고, DTW(Dynamic Time Warping) 유사도 분석을 통해 노드 간의 시간적 유사도를 기반으로 엣지를 생성한다. 실험결과로 DTW 기반 엣지 생성 방식이 유클리드 거리 및 선형 방식에 비해 더 높은 성능을 나타냈다. 본 연구는 반려동물의 행동을 정확히 분류하기 위한 효과적인 방법론을 제공한다.

• Journal of Cadastre & Land InformatiX
• /
• v.50 no.2
• /
• pp.203-219
• /
• 2020

The primary purpose of this study is to identify spatial distribution patterns of co-authoring activities in Korean cadastral science. The analysis showed that a small number of researchers played an essential role in the Korean cadastral co-authorship network. In particular, some authors not only had a significant influence on other nodes in the network but also served as intermediaries between researchers. Moreover, the distance between researchers influenced co-authorship decisions to a limited extent. This study differs considerably from previous studies in that it used spatial analysis techniques to identify spatial distribution patterns of co-authoring activities. However, this research is limited in that it applied only 2019 data to determine the spatial distribution pattern of co-authoring activities. We can overcome this limitation if we analyze the spatial distribution patterns of co-authoring activities using multi-year data in future studies.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.29-45
• /
• 2017

Ad hoc sensor network is characterized by decentralized structure and ad hoc deployment. Sensor networks have all basic features of ad hoc network except different degrees such as lower mobility and more stringent energy requirements. Existing protocols provide different tradeoffs among some desirable characteristics such as fault tolerance, distributed computation, robustness, scalability and reliability. wireless protocols suggested so far are very limited, generally focusing on communication to a single base station or on aggregating sensor data. The main reason having such restrictions is due to maximum lifetime to maintain network activities. The network lifetime is an important design metric in ad hoc networks. Since every node does a router role, it is not possible for other nodes to communicate with each other if some nodes do not work due to energy lack. In this paper, we suggest an experimental ad-hoc on-demand distance vector routing protocol to optimize the communication of energy of the network nodes.The load distribution avoids the choice of exhausted nodes at the route selection phase, thus balances the use of energy among nodes and maximizing the network lifetime. In transmission control phase, there is a balance between the choice of a high transmission power that lead to increase in the range of signal transmission thus reducing the number of hops and lower power levels that reduces the interference on the expense of network connectivity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.874-881
• /
• 2010

Acoustic signal, which is a main carrier of underwater communication, attenuates along the traveled path heavily depending on the frequency as well as inter-node distance. In addition, since it has a long propagation delay, the conventional medium access control (MAC) schemes requiring complex signaling procedures and accordingly heavy overhead messages would not be appropriate in underwater communications. In this paper, we propose a code division multiple access (CDMA) scheme as a solution for MAC of underwater communication and evaluate the performance. A hierarchical data-gathering tree topology is considered and a staggered wake-up pattern is employed for the purpose of energy saving. As a performance measure, the data rate at each level of hierarchical topology is derived.