• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.51-63
• /
• 2013

Recently with base apply MANET with the application for the service discovery and delivery which are various techniques are being proposed the result of such MANET base research techniques from actual inside. This dissertation proposes T-Chord(Trustworthy-based Chord) Ring system for MANET to guarantees from such requirements. T-Chord Ring system in order to manage Efficiently the services which the mobile nodes provide is the service discovery system which uses P2P overlay network Technique in mobile environment. The system which is proposed MANET communications in order to accomplish a service discovery operation with physical network class and logical network class will be able to minimize problems from about MANET service discoveries, and uses the dispersive hash table technique for a service discovery and effectiveness of service discovery improves and will be able to guarantee the expandability of network size. The mobile nodes(mobile device) have a mobility from MANET and operate with service request node, service provide node and service transmit node. The mobile nodes will be able to elect cluster header using Trustworthy that was evaluated service request, provision and delivery in each other. The system which is proposed a service discovery and a delivery efficiently will compose the cluster head which will grow of P2P overlay networks and will be able to accomplish. The system which proposes from dissertation is composed of Trustworthy evaluations of MANET mobile nodes, service information collection which is dispersed and P2P overlay networks that composed of Chord algorithm modules which provide O(Log N) efficiencies. The system comparison evaluation analyzes an efficiency from the expandability side of effectiveness and the network of service discovery technique and the service discovery message over head, service discovery and delivery of former times and service discovery and delivery is excellent gives proof from MANET.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1258-1268
• /
• 2005

While the concept of Home Network is laying by and its interests are increasing by means of digitalizing of the information communication infrastructure, many efforts are in progress toward convenient lives. Moreover, as information household appliances which have a junction of connecting to the network are appearing over the past a few years, the demands against intellectual Home Services are increasing. In this paper, by being based upon Multimedia which is an essential factor for developing of various application services on ubiquitous computing environments, we suggest a simplified application model that could apply the information to the automated processing system after studying user's behavior patterns using authentication and access control for identity certification of users. In addition, we compared captured video images in the fixed range by pixel unit through some time and checked disorder of them. And that made safe of user certification as adopting self-developed certification method which was used 'Hash' algorism through salt function of 12 byte. In order to show the usefulness of this proposed model, we did some testing by emulator for control of information after construction for Intellectual Multimedia Server, which ubiquitous network is available on as a scheme so as to check out developed applications. According to experimental results, it is very reasonable to believe that we could extend various multimedia applications in our daily lives.

• Journal of Digital Convergence
• /
• v.18 no.3
• /
• pp.163-169
• /
• 2020

A smart key has been used in a variety of embedded environments and there also have been attacks from a remote place by amplifying signals at a location of a user. Existing studies on defence techniques suggest multiple sensors and hash functions to improve authentication speed; these, however, increase the electricity usage and the probability of type 1 error. For these reasons, I suggest an embedded security controller based on client authentication and user movement information improving the authentication method between a controller and a host device. I applied encryption algorithm to the suggested model for communication using an Arduino board, GPS, and Bluetooth and performed authentication through path analysis utilizing user movement information for the authentication. I found that the change in usability was nonsignificant when performing actions using the suggested model by evaluating the time to encode and decode. The embedded security controller in the model can be applied to the system of a remote controller for a two-wheeled vehicle or a mobile and stationary host device; in the process of studying, I found that encryption and decryption could take less then 100ms. The later study may deal with protocols to speed up the data communication including encryption and decryption and the path data management.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.11
• /
• pp.113-123
• /
• 2023

This paper introduces the Cherry system, a user-independent blockchain donation system. This is a procedure that is delivered to the beneficiary's bank account through a virtual account when a donor makes a donation, so there is no difference from the existing donation delivery method from the user's point of view However, within the blockchain, Cherry Points, a virtual currency based on the user ID, are issued and delivered to the beneficiary, while all transactions and the beneficiary's usage history are managed on the blockchain. By adopting this method, there was an improvement in blockchain performance, with transaction processing exceeding 1,000 TPS in typical transaction condition and service completion within 21.3 seconds. By applying the automatic influence control algorithm to this system, the influence according to stake, which is an individual donation, is greatly reduced to 0.3 after 2 months, thereby concentrating influence could be controlled automatically. In addition, it was designed to enable micro tracking by adding a tracking function by timestamp to the donation ledger for each individual ID, which greatly improved the transparency in the use of donations. From a service perspective, existing blockchain donation systems were handled as limited donation delivery methods. Since it is a direct service in a user-independent method, convenience has been greatly improved by delivering donations in various forms.