• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.112-114
• /
• 2011

On multimedia databases, in order to realize the fast access method, indexing methods for the multidimension data space are used. However, since it is a premise to use the Euclid distance as the distance measure, this method lacks in flexibility. On the other hand, there are metric indexing methods which require only to satisfy distance axiom. Since metric indexing methods can also apply for distance measures other than the Euclid distance, these methods have high flexibility. This paper proposes an improved method of VP-tree which is one of the metric indexing methods. VP-tree follows the node which suits the search range from a route node at searching. And distances between a query and all objects linked from the leaf node which finally arrived are computed, and it investigates whether each object is contained in the search range. However, search speed will become slow if the number of distance calculations in a leaf node increases. Therefore, we paid attention to the candidates selection method using the triangular inequality in a leaf node. As the improved methods, we propose a method to use the nearest neighbor object point for the query as the datum point of the triangular inequality. It becomes possible to make the search range smaller and to cut down the number of times of distance calculation by these improved methods. From evaluation experiments using 10,000 image data, it was found that our proposed method could cut 5%~12% of search time of the traditional method.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.3
• /
• pp.35-45
• /
• 2013

MANET has a weak point because it allows access from not only legal nodes but also illegal nodes. Most of the MANET researches had been focused on attack on routing path or packet forwarding. Nevertheless, there are insuffcient studies on a comprehensive approach to detect various attacks on malicious nodes at packet forwarding processes. In this paper, we propose a technique, named DTecBC (detection technique of malicious node behaviors based on collaboration), which can handle more effciently various types of malicious node attacks on MANET environment. The DTecBC is designed to detect malicious nodes by communication between neighboring nodes, and manage malicious nodes using a maintain table. OPNET tool was used to compare with Watchdog, CONFIDANT, SRRPPnT for verifying effectiveness of our approach. As a result, DTecBC detects various behaviors of malicious nodes more effectively than other techniques.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.19-30
• /
• 2008

Sensor nodes are used as a storage space in the data centric storage method for sensor networks. Sensor nodes save the data to the node which is computed by hash table and users also access to the node to get the data by using hash table. One of the problems which the data centric storage method has is that queries from many users who are interested in the popular data could be concentrated to one node. In this case, responses for queries could be delayed and the energy of heavy loaded node could be dissipated fast. This would lead to reduction of network life time. In this paper, ALT, Data Centric Storage based on Adaptive Local Trajectory, is proposed as scalable data centric storage method for sensor network. ALT constructs trajectory around the storage node. The scope of trajectory is increased or decreased based on the query frequency. ALT distributes the query processing loads to several nodes so that delay of response is reduced and energy dissipation is also distributed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.5
• /
• pp.581-588
• /
• 2019

In this paper, I propose an modified back-off algorithm to improve the fairness for slotted ALOHA sensor networks. In hierarchical networks, the performance degradation of a specific node can cause degradation of the overall network performance in case the data transmitted by lower nodes is needed to be synthesized and processed by an upper node. Therefore it is important to ensure the fairness of transmission performance to all nodes. The proposed scheme choose a back-off time of a node considering the previous transmission results as well as the current transmission result. Moreover a node that failed to transmit consecutively is given gradually shorter back-off time but a node that is success to transmit consecutively is given gradually longer back-off time. Through simulations, I compare and analyze the performance of the proposed scheme with the binary exponential back-off algorithm(BEB). The results show that the proposed scheme reduces the throughput slightly compared to BEB but improves the fairness significantly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.618-636
• /
• 1997

DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.212-218
• /
• 2010

In wireless sensor networks (WSNs), both efficient energy management and Quality of Service (QoS) are important issues for some applications. For creating robust networks, real-time services are usually employed to satisfy the QoS requirements. In this paper, we proposed a hierarchical real-time MAC (medium access control) protocol for (m,k)-firm constraint in wireless sensor networks shortly called HRTS-MAC. The proposed HRTS-MAC protocol is based on a dynamic priority assignment by (m,k)-firm constraint. In a tree structure topology, the scheduling algorithm assigns uniform transmitting opportunities to each node. The paper also provides experimental results and comparison of the proposed protocol with E_DBP scheduling algorithm.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.2787-2794
• /
• 2011

A mesh node, a component of a mesh network, is connected with the network by dynamic routing using routing protocol and collects the information of adjacent or connected mesh nodes for its self-management and settings. Also, it relays packets between the mesh nodes and provides AP(Access Point) with its corresponding functions based on IEEE 802.11 a/b/g for clients' access to the network. In this paper, the study focused on the design and performance tests of Wireless Mesh Network(WMN) which is applied to the wireless communication network for the CBTC(Communications Based Train Control) system. The WMN was established on a K-AGT test-line (Kyeongsan city, Gyeongsangbuk-do), and to verify the applicability, its operation and performances are checked by measuring the data throughput, delay latency, quality measurements such as transmission loss, radio interference and path recovery and setup between the on-board and wayside.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.216-226
• /
• 2000

This paper suggests a new access path, hashed B-tree which is an efficient access method for integrity checking. Hashed B-tree is based on the observation that most query patterns in enforcing integrity constraints are point queries. Hashed B-tree compresses the key by hashing procedure, which reduces the height of tree and results in fast node search. This method has the advantages such as it can be implemented easily and use the B-tree concurrency control and recovery algorithm with minor modifications.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.311-321
• /
• 2014

This paper focuses on contention-based medium access control (MAC) protocols used in wireless local area networks. We propose a novel MAC protocol called adaptive backoff tuning MAC (ABTMAC) based on IEEE 802.11 distributed coordination function (DCF). In our proposed MAC protocol, we utilize a fixed transmission attempt rate and each node dynamically adjusts its backoff window size considering the current network status. We determined the appropriate transmission attempt rate for both cases where the request-to-send/clear-to-send mechanism was and was not employed. Robustness against performance degradation caused by the difference between desired and actual values of the attempt rate parameter is considered when setting it. The performance of the protocol is evaluated analytically and through simulations. These results indicate that a wireless network utilizing ABTMAC performs better than one using IEEE 802.11 DCF.

• Information and Communications Magazine
• /
• v.26 no.5
• /
• pp.30-35
• /
• 2009

본고에서는 무선 가시광 통신을 위한 Medium Access Control (MAC) 프로토콜의 설계에 관해 기술한다. 조명등을 이용한 가시광 무선랜 네트워크는 고정된 상태의 Access Point (AP)에 의한 인프라를 Mobile Node (MN)를 상대로 구성하고 인터넷과 같은 기존의 인프라와 연결되는 구조적 특징을 가진다. 이러한 네트워크에 사용되는 무선 가시광 통신 채널의 특성을 이해하고 MAC프로토콜의 기능에 대한 요구조건을 도출하였다. 주어진 가시광 통신 채널을 효율적으로 사용할 수 있도록 시 분할다중 접속 방식과Full duplex를 도입하는 Frame 구조를 구성하였고 가시성을 이용한 접속 절차를 제안하였다.