• Journal of Industrial Convergence
• /
• v.20 no.10
• /
• pp.17-24
• /
• 2022

Lora, a non-band network technology of the long-distance wireless standard LPWAN standard, uses ABP and OTTA methods and AES-128-based encryption algorithm (shared key) for internal terminal authentication and integrity verification. Lora's recent firmware tampering vulnerability and shared-key encryption algorithm structure make it difficult to defend against MITM attacks. In this study, the consensus algorithm(PBFT) is applied to the Lora network to enhance safety. It performs authentication and PBFT block chain creation by searching for node groups using the GPS module. As a result of the performance analysis, we established a new Lora trust network and proved that the latency of the consensus algorithm was improved. This study is a 4th industry convergence study and is intended to help improve the security technology of Lora devices in the future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2188-2208
• /
• 2023

Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.

• Journal of Intelligence and Information Systems
• /
• v.19 no.1
• /
• pp.111-123
• /
• 2013

Semantic similarity/relatedness measure between two concepts plays an important role in research on system integration and database integration. Moreover, current research on keyword recommendation or tag clustering strongly depends on this kind of semantic measure. For this reason, many researchers in various fields including computer science and computational linguistics have tried to improve methods to calculating semantic similarity/relatedness measure. This study of similarity between concepts is meant to discover how a computational process can model the action of a human to determine the relationship between two concepts. Most research on calculating semantic similarity usually uses ready-made reference knowledge such as semantic network and dictionary to measure concept similarity. The topological method is used to calculated relatedness or similarity between concepts based on various forms of a semantic network including a hierarchical taxonomy. This approach assumes that the semantic network reflects the human knowledge well. The nodes in a network represent concepts, and way to measure the conceptual similarity between two nodes are also regarded as ways to determine the conceptual similarity of two words(i.e,. two nodes in a network). Topological method can be categorized as node-based or edge-based, which are also called the information content approach and the conceptual distance approach, respectively. The node-based approach is used to calculate similarity between concepts based on how much information the two concepts share in terms of a semantic network or taxonomy while edge-based approach estimates the distance between the nodes that correspond to the concepts being compared. Both of two approaches have assumed that the semantic network is static. That means topological approach has not considered the change of semantic relation between concepts in semantic network. However, as information communication technologies make advantage in sharing knowledge among people, semantic relation between concepts in semantic network may change. To explain the change in semantic relation, we adopt the cognitive semantics. The basic assumption of cognitive semantics is that humans judge the semantic relation based on their cognition and understanding of concepts. This cognition and understanding is called 'World Knowledge.' World knowledge can be categorized as personal knowledge and cultural knowledge. Personal knowledge means the knowledge from personal experience. Everyone can have different Personal Knowledge of same concept. Cultural Knowledge is the knowledge shared by people who are living in the same culture or using the same language. People in the same culture have common understanding of specific concepts. Cultural knowledge can be the starting point of discussion about the change of semantic relation. If the culture shared by people changes for some reasons, the human's cultural knowledge may also change. Today's society and culture are changing at a past face, and the change of cultural knowledge is not negligible issues in the research on semantic relationship between concepts. In this paper, we propose the future directions of research on semantic similarity. In other words, we discuss that how the research on semantic similarity can reflect the change of semantic relation caused by the change of cultural knowledge. We suggest three direction of future research on semantic similarity. First, the research should include the versioning and update methodology for semantic network. Second, semantic network which is dynamically generated can be used for the calculation of semantic similarity between concepts. If the researcher can develop the methodology to extract the semantic network from given knowledge base in real time, this approach can solve many problems related to the change of semantic relation. Third, the statistical approach based on corpus analysis can be an alternative for the method using semantic network. We believe that these proposed research direction can be the milestone of the research on semantic relation.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.4
• /
• pp.1-7
• /
• 2000

Traditionally, three dimension model s have been used for building virtual worlds, and a data structure called the "scene graph" is often employed to organize these 3D objects in the virtual space. On the other hand, image-based rendering has recently been suggested as a probable alternative VR platform for its photo-realism, however, due to limited interactivity. it has only been used for simple navigation systems. To combine the merits of these two approaches to object/scene representations, this paper proposes for a scene graph structure in which both 3D models and various image-based scenes/objects can be defined. traversed, and rendered together. In fact, as suggested by Shade et al. [1]. these different representations can be used as different LOD's for a given object. For in stance, an object might be rendered using a 3D model at close range, a billboard at an intermediate range. and as part of an environment map at far range. The ultimate objective of this mixed platform is to breath more interactivity into the image based rendered VE's by employing 3D models as well. There are several technical challenges in devising such a platform : designing scene graph nodes for various types of image based techniques, establishing criteria for LOD/representation selection. handling their transition s. implementing appropriate interaction schemes. and correctly rendering the overall scene. Currently, we have extended the scene graph structure of the Sense8's WorldToolKit. to accommodate new node types for environment maps. billboards, moving textures and sprites, "Tour-into-the-Picture" structure, and view interpolated objects. As for choosing the right LOD level, the usual viewing distance and image space criteria are used, however, the switching between the image and 3D model occurs at a distance from the user where the user starts to perceive the object's internal depth. Also. during interaction, regardless of the viewing distance. a 3D representation would be used, if it exists. Finally. we carried out experiments to verify the theoretical derivation of the switching rule and obtained positive results.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1000-1015
• /
• 2010

In this paper, we propose a novel algorithm for hand gesture recognition. The hand detection method is based on human skin color, and we use the boundary energy information to locate the hand region accurately, then the moment method will be employed to locate the hand palm center. Hand gesture recognition can be separated into 2 step: firstly, the hand posture recognition: we employ the parallel NNs to deal with problem of hand posture recognition, pattern of a hand posture can be extracted by utilize the fitting ellipses method, which separates the detected hand region by 12 ellipses and calculates the white pixels rate in ellipse line. the pattern will be input to the NNs with 12 input nodes, the NNs contains 4 output nodes, each output node out a value within 0~1, the posture is then represented by composed of the 4 output codes. Secondly, the hand gesture tracking and recognition: we employed the Kalman filter to predict the position information of gesture to create the position sequence, distance relationship between positions will be used to confirm the gesture. The simulation have been performed on Windows XP to evaluate the efficiency of the algorithm, for recognizing the hand posture, we used 300 training images to train the recognizing machine and used 200 images to test the machine, the correct number is up to 194. And for testing the hand tracking recognition part, we make 1200 times gesture (each gesture 400 times), the total correct number is 1002 times. These results shows that the proposed gesture recognition algorithm can achieve an endurable job for detecting the hand and its' gesture.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.56-63
• /
• 2009

The IEEE 802.11 standard has been used for wireless data networks such as wireless LAN, ad-hoc network, and vehicular ad-hoc network. Thus, the performance analysis of the IEEE 802.11 specification has been one of the hottest issues for network optimization and resource management. Most of the analysis studies were performed in a data plane of the IEEE 802.11 unicast. However, IEEE 802.11 broadcast is widely used for topology management, path management, and data dissemination. Thus, it is important to understand the performance of the broadcast scheme for the design of efficient wireless data network. In this contort, we analyze the IEEE 802.11 broadcast scheme in terms of the broadcast frame reception probability according to the distance from a sending node. Unlike the other works, our analysis framework includes not only the system parameters of the IEEE 802.11 specification such as transmission range, data rate, minimum contention window but also the networking environments such as the number of nodes, network load, and the radio propagation environments. Therefore, our analysis framework is expected to be used for the development of protocols and algorithms in a dynamic wireless data network.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.109-117
• /
• 2014

In navigation route planning systems using A* algorithms, the cardinality of an Open list, which is a list of candidate nodes through which a terminal node can be accessed, increases as the path length increases. In this paper, a method of alternately utilizing the Dijkstra's algorithm and the A* algorithm to reduce the cardinality of the Open list is investigated. In particular, by employing a depth parameter, named Level, the two algorithms are alternately performed depending on the Level's value. Using the hybrid searching approach, the Open list constructed in the Dijkstra's algorithm is transferred into the Open list of the A* algorithm, and consequently, the unconstricted increase of the cardinality of the Open list of the former algorithm can be avoided and controlled appropriately. In addition, an optimal or nearly optimal path similar to the Dijkstra's route, but not available in the A* algorithm, can be found. The experimental results, obtained with synthetic and real-life benchmark data, demonstrate that the computational cost, measured with the number of nodes to be compared, was remarkably reduced compared to the traditional searching algorithms, while maintaining the similar distance to those of the latter algorithms. Here, the values of Level were empirically selected. Thus, a study on finding the optimal Level values, while taking into consideration the actual road conditions remains open.

• Journal of Advanced Marine Engineering and Technology
• /
• v.39 no.7
• /
• pp.760-764
• /
• 2015

Wireless sensors, installed on machinery, and Time Division Multiple Access (TDMA) transmission make an ideal system for monitoring machine conditions in industrial plants because there is no need for electronic wiring. However, there has not yet been a successful field application of such a system, capable of continuously transmitting data at sample rates greater than 100 Hz. In this research, a TDMA network protocol capable of acquiring data from multiple sensors at sample rates greater than 100 Hz was developed for field application. The protocol was implemented in a single cluster-star topology network, and the system was evaluated based on the node number and transmission distance. Network simulator 2 (ns-2) was used for a real field simulation. Non-TDMA and TDMA protocol cases were compared using four sensor nodes. In the cases of 20-s and 40-s transmission times, there was little difference between the reception rates of the non-TDMA and TDMA systems. However, the difference was much greater when using a 60-s transmission time.

• Restorative Dentistry and Endodontics
• /
• v.18 no.2
• /
• pp.395-411
• /
• 1993

The purpose of this study was to examine the clear concept of the designs for cavity preparations. Among the several parameters in cavity designs, profound understanding of isthmus width factor would facilitate selection of the appropriate cavity preparation for a specific clinical situation. In this study, the cavities were prepared on maxillary first premolar and filled with gold inaly. A two - dimensional model was composed of 1037 - node triangle elements. In this model, isthmus was varied in width at 1/4, 1/3 and 1/2 of intercuspal width and material properties were given for four element groups, i.e., enamel, dentin, pulp and gold. The 500N occlusal load varied in direction and it was examined using three types of load : concentrated load, divided load and distributed load. The models were also examined with empty cavities using the devided load and distributed load. These models were analyzed the displacement and strees distribution by the two - dimensional Finite Element Method. The results were as follows : 1. All experimental models which filled with gold inlay after cavity preparation were similar direction of displacement with control model under same load type. But in the models with empty cavities, as isthmus width was wider, the degree of displacement was increased at same load type. 2. Among the experimental models which were filled with gold inaly after cavity preparation, the model II showed the least stress concentration under concentrated load and divided load. But in the models with empty cavities, the model III showed the largest stress concentration and tooth fracture is expected regardless isthmus width. 3. All experimental models showed similar displacement pattern beneath restorative material under a concentrated load. In the models with empty cavities, a divided load resulted in a lingual displacement of the lingual cusp, but a distributed load resulted in a buccal displacement of the lingual cusp. In regard to the above results, the restored models were stronger than empty models in respect to the bending moment and tensile stress. The empty models are expected to fracture regardless isthmus width. The safest isthmus width was 1/3 of intercuspal distance, which showed the least stress concentration in respect to the effect of stress distribution.