• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.233-246
• /
• 2005

To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.1
• /
• pp.1-9
• /
• 2017

With the Development of Wireless Network Technology and Wireless Link Technology, Wireless Mesh Network (WMN) is Attracting Attention as a Key Technology to Construct the Wireless Transit Network. The WMN has been Studied for a Long Time in Various Fields, however there are still many Problems that have not been solved yet. One of them is the Routing Problem to find an Optimal path in a Multi-hop Network Composed of Wireless Links. In the Hybrid-WMN, which is one of the Three Types of WMN, Optimal Path Selection Requires Research on Path Search Protocols that Effectively use the Infrastructure Mesh as a Transit Network, Together with Research for a Routing Metric with Excellent Performance. Therefore, this Paper Proposes a Dual Mode-AODV(Ad hoc On-demand Distance Vector) for Hybrid-WMN. Simulation result shows that the Path Selection Delay was Reduced by 52% than AODV when the Proposed Dual Mode-AODV was applied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12A
• /
• pp.1238-1245
• /
• 2006

Interest to the RTLS that is one of RFID applications is increasing in recent. The RTLS(Real Time Locating Systems) is one of applications for locating and tracking using RFID tags which are attached to something like container, pallet, or all the things. This paper presents the design and the implementation of an RTLS system using 433MHz active RFID tags and use radio frequency to provide the scalability. Our system we developed using RFID platform takes into account an RTLS standard. Also, in this paper a routing protocol is included to data delivery to server via each reader. In order to perform the evaluation, in addition, some experiments in out door are performed and results such as error metric and distance are also included. Furthermore, simulation for the routing protocol we supposed is also included.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9A
• /
• pp.801-808
• /
• 2011

We propose MBAP(Multi-rate Broadcast Active Probing) technique to get the right measurements for link quality in Wireless Mesh Network (WMN). Most routing protocols for WMN make use of link quality-aware routing metrics, such as ETX(Expected Transmission Count) and ETT(Expected Transmission Time), while the hop count is usually used in MANET (Mobile Ad-hoc NETwork). A broadcast based active proving technique is adopted in the previous studies to get the ETX or ETT of a link. However this technique does not reflect the multi-rate feature of WLAN because it uses a single fixed transmission rate for broadcast which usually differs from the actual rate used in data transmissions. MBAP overcomes this shortage by exploiting various rate broadcast frames for probing. We implement MBAP on linux system by modifying WLAN driver and related kernel sub-systems. Experimental results show that MBAP can capture link quality more accurately than the existing techniques.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.35-42
• /
• 2011

Link quality assessment is a crucial part of sensor network formation to stably operate large-scale wireless sensor networks (WSNs). A stability of path consisting of several nodes strongly depends on all link quality between pair of consecutive nodes. Thus it is very important to assess the link quality on the stage of building a routing path. In this paper, we present a link quality assessment method, Hybrid Link Quality Metric (HQLM), which uses both of LQI and RSSI from RF chip of sensor nodes to minimize set-up time and energy consumption for network formation. The HQLM not only reduces the time and energy consumption, but also provides complementary cooperation of LQI and RSSI. In order to evaluate the validity and efficiency of the proposed method, we measure PDR (Packet Delivery Rate) by exchanging multiple messages and then, compare PDR to the result of HQLM for evaluation. From the research being carried out, we can conclude that the HQLM performs better than either LQI- or RSSI-based metric in terms of recall, precision, and matching on link quality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3496-3514
• /
• 2015

One of the challenging tasks in Mobile Ad hoc Network is to discover precise optimal routing solution due to the infrastructure-less dynamic behavior of wireless mobile nodes. Ant Colony Optimization, a swarm Intelligence technique, inspired by the foraging behaviour of ants in colonies was used in the past research works to compute the optimal path. In this paper, we propose a Recurrent Ant Colony Optimization (RECACO) that executes the actual Ant Colony Optimization iteratively based on recurrent value in order to obtain an optimal path convergence. Each iteration involves three steps: Pheromone tracking, Pheromone renewal and Node selection based on the residual energy in the mobile nodes. The novelty of our approach is the inclusion of new pheromone updating strategy in both online step-by-step pheromone renewal mode and online delayed pheromone renewal mode with the use of newly proposed metric named ELD (Energy Load Delay) based on energy, Load balancing and end-to-end delay metrics to measure the performance. RECACO is implemented using network simulator NS2.34. The implementation results show that the proposed algorithm outperforms the existing algorithms like AODV, ACO, LBE-ARAMA in terms of Energy, Delay, Packet Delivery Ratio and Network life time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5928-5947
• /
• 2019

Multicast Mesh based Mobile Ad-hoc NETworks (MANETs) provide efficient data transmission in energy restraint areas without a fixed infrastructure. In this paper, the authors present an improved version of protocol SLIMMER developed by them earlier, and name it SLIMMER-SN. Most mesh-based protocols suffer from redundancy; however, the proposed protocol controls redundancy through the concept of forwarding nodes. The proposed protocol uses remaining energy of a node to decide its energy efficiency. For measuring stability, a new metric called Stability of Node (SN) has been introduced which depends on transmission range, node density and node velocity. For data transfer, a weighted cost function selects the most energy efficient nodes / most stable nodes or a weighted combination of both. This makes the node selection criteria more dynamic. The protocol works in two steps: (1) calculating SN and (2) using SN value in the weighted cost function for selection of nodes. The study compared the proposed protocol, with other mesh-based protocols PUMA and SLIMMER, based on packet delivery ratio (PDR), throughput, end-to-end delay and average energy consumption under different simulation conditions. Results clearly demonstrate that SLIMMER-SN outperformed both PUMA and SLIMMER.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.4
• /
• pp.87-97
• /
• 2009

Internet network routing system is used to prevent spread and distribution of malicious data traffic. This study is based on analysis of diagnostic weakness structure in the network security domain. We propose an improved integrated multi-level protection domain for in the internal route of groupware. This paper's protection domain is designed to handle the malicious data traffic in the groupware and finally leads to lighten the load of data traffic and improve network security in the groupware. Infrastructure of protection domain is transformed into five-stage blocking domain from two or three-stage blocking. Filtering and protections are executed for the entire server at the gateway level and internet traffic route ensures differentiated protection by dividing into five-stage. Five-stage multi-level network security domain's malicious data traffic protection performance is better than former one. In this paper, we use a trust evaluation metric for measuring the security domain's performance and suggested algorithm.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.371-377
• /
• 2014

Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.

• International Journal of Computer Science & Network Security
• /
• v.24 no.5
• /
• pp.119-128
• /
• 2024

The moveable ad hoc networks are untrustworthy and susceptible to any intrusion because of their wireless interaction approach. Therefore the information from these networks can be stolen very easily just by introducing the attacker nodes in the system. The straight route extent is calculated with the help of hop count metric. For this purpose, routing protocols are planned. From a number of attacks, the wormhole attack is considered to be the hazardous one. This intrusion is commenced with the help of couple attacker nodes. These nodes make a channel by placing some sensor nodes between transmitter and receiver. The accessible system regards the wormhole intrusions in the absence of intermediary sensor nodes amid target. This mechanism is significant for the areas where the route distance amid transmitter and receiver is two hops merely. This mechanism is not suitable for those scenarios where multi hops are presented amid transmitter and receiver. In the projected study, a new technique is implemented for the recognition and separation of attacker sensor nodes from the network. The wormhole intrusions are triggered with the help of these attacker nodes in the network. The projected scheme is utilized in NS2 and it is depicted by the reproduction outcomes that the projected scheme shows better performance in comparison with existing approaches.