• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.673-684
• /
• 2004

As the wireless mobile communication is being widespread, mobile technologies will have important roles in the communication with the explosive growth of demanding for wireless portable devices. Among the mobile technologies, a great deal of interest has been taken in mobile ad hoc network (MANET), which is a collection of wireless mobile nodes forming a temporary network without the aid of stationary infrastructure in recent. Furthermore, considering characteristic of ad hoc networks, the design of efficient routing protocols is an important issue. In recent years, on-demand protocols among routing protocols have noticed because of the low routing overhead. However, on-demand protocols suffer from production of the enormous query Packets by broadcasting in order to setup routes, that is, a flooding scheme. The flooding scheme is very costly and results in serious problem, which we refer as the broadcast storm problem. In this paper, we propose a Dynamic Adaptation Query flooding Using Neighbor Topology (NT-DAQ) scheme, in order to resolve the broadcast storm Problem. When a route discovery is in progress, each mobile node decides on the basis of neighbor topology information whether discovery process participates or not. Therefore, our proposed scheme enables to improve network performance in which minimize the number of query rackets. We evaluate the efficiency of our proposed scheme through simulation.

• Animal Bioscience
• /
• v.36 no.1
• /
• pp.10-18
• /
• 2023

Objective: In this study, we aimed to position the Hungarian Merino among other Merinoderived sheep breeds, explore the characteristics of our sampled animals' genetic similarity network within the breed, and highlight single nucleotide polymorphisms (SNPs) associated with daily weight-gain. Methods: Hungarian Merino (n = 138) was genotyped on Ovine SNP50 Bead Chip (Illumina, San Diego, CA, USA) and positioned among 30 Merino and Merino-derived breeds (n = 555). Population characteristics were obtained via PLINK, SVS, Admixture, and Treemix software, within-breed network was analysed with python networkx 2.3 library. Daily weight gain of Hungarian Merino was standardised to 60 days and was collected from the database of the Association of Hungarian Sheep and Goat Breeders. For the identification of loci associated with daily weight gain, a multi-locus mixed-model was used. Results: Supporting the breed's written history, the closest breeds to Hungarian Merino were Estremadura and Rambouillet (pairwise F_ST values are 0.035 and 0.036, respectively). Among Hungarian Merino, a highly centralised connectedness has been revealed by network analysis of pairwise values of identity-by-state, where the animal in the central node had a betweenness centrality value equal to 0.936. Probing of daily weight gain against the SNP data of Hungarian Merinos revealed five associated loci. Two of them, OAR8_17854216.1 and s42441.1 on chromosome 8 and 9 (-log₁₀P>22, false discovery rate<5.5e-20) and one locus on chromosome 20, s28948.1 (-log₁₀P = 13.46, false discovery rate = 4.1e-11), were close to the markers reported in other breeds concerning daily weight gain, six-month weight, and post-weaning gain. Conclusion: The position of Hungarian Merino among other Merino breeds has been determined. We have described the similarity network of the individuals to be applied in breeding practices and highlighted several markers useful for elevating the daily weight gain of Hungarian Merino.

• 지역과문화
• /
• v.6 no.4
• /
• pp.23-45
• /
• 2019

The main research is on how to find source stories and develop and utilize content that will properly show the value of Panmunjom and the surrounding DMZ on the Korean Peninsula, which are receiving worldwide attention. Three methods were used as research for the high-end branding of Panmunjom and the surrounding DMZ. The first is the interest of prospective visitors through the travel cycle, using Joseph Campbell's "The Hero's Journey." The second was to incorporate Roland Bart's "third meaning" into the subjective travel and emotional stimulation, which is the trend of modern travel. The third introduced Kevin Lynch's theory and tried to place five elements of the path, edge, district, node and landmark in the core location of Panmunjom. Through the study, the excavation of contents in Panmunjom and the surrounding DMZ needs to be collected to a third meaning using a direct interview method that listens to the stories of related figures as well as organizing historical events. The priority should be given to those over the age of 80 and interviews should be conducted at least three times and over three generations. The process of building it into an archive, selecting a story, and then going through a culture collage and networking and branding takes place in five stages. This can create a virtuous circle of content processing, content utilization, job creation in the region and revitalizing the local economy through discovery of source stories and storytelling. Content development should be able to touch sensibility while saving time, history, place, originality and sincerity. Taking the center between tourism and travel, development and damage concerns, a careful but long-term plan and large-scale discovery of source stories should be made, and a consensus should be formed on the need for proper storytelling.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.730-742
• /
• 2014

In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1313-1329
• /
• 2015

In MANET, frequent route breaks lead to repeated route discovery process and this increases control packet overhead and packet drop. AODV-I improves performance of AODV by using the event driven approach which removes periodic Hello message. Unlike the Hello message, Interrupt message which is sent for each event can detect and predict the link failure because it allows node to know the status of the neighbor node. From this characteristics of Interrupt message, performance of AODV-I can be further improved by adding a processing procedures for each type of Interrupt message and it is also possible to improve AODV-I by adding the Backup path scheme because it originally has problems due to a single path of AODV. In this paper, we propose AODV-IB that combines improved Backup path scheme and Interrupt message approach of AODV-I in order to reduce transmission delay and the number of route discoveries. AODV-IB improves AODV-I by adding proper processing procedures for the link failure prediction and detection for each Interrupt message. We also implement improved Backup path strategy in AODV-IB by minimizing delay without additional Control packet. Simulation results, using the simulator QualNet 5.0, indicate that proposed AODV-IB performs better than AODV-I.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.325-336
• /
• 2005

Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.567-574
• /
• 2013

Recently, many researches on P2P overlay network-based multimedia streaming services have been actively performed because of their high scalability and cost-efficiency advantages. However, P2P overlay networks also have the shortcoming of generating higher traffic owing to their unicast-based one-to-many multimedia deliveries. In order to reduce the traffic generated by the P2P streaming overlay network, we propose an ISP and locality-based parent node discovery method and check its feasibility through an implementation of a prototype streaming system. The measurement of RTTs and hop counts for random nodes having different ISPs and localities shows the proposed method to be able to shorten about 32% RTTs and about 17% Hop counts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.273-281
• /
• 2002

Recently, demand for real-time data and multimedia data is rapidly increasing, and it is impossible for mobile Ad Hoc networks with only best effort service to efficiently transfer such data. So, we absolutely need the QoS service which reserves the communication resources in advance. The existing routing protocols, which assume that the links between nodes are bidirectional, provide the convenience for the route discovery and maintenance, but can not support the routing function for the unidirectional links due to the wireless link property easily changing with time under the real wireless environment. In order to solve such problems, in this dissertation we suggested a unidirectional QoS routing a waste of communication resources. The waste of protocol that supports unidirectional links and reduces communication resources is reduced by establishing the shortest route suitable to QoS support, considering in advance the usable communication resources at each node.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.3
• /
• pp.397-404
• /
• 2011

In this research, wish to suggest method to embody system that can accommodate defect of PLC and find actual propriety. Defect permission control system minimizes production damage because enables repair and checking without discontinuance and improve believability about whole system. Propose duplexing of system to embody this fault tolerant system. Therefore, composed control system that can permit defect or breakdown duplexings of various module proposing this system, and confirms to simulation and actuality kiln of defect permission control system through an application experiment, and compares for mean time between defect by estimate and defect special quality and system configuration of failure(failure) to improve believability of PLC control system together. In proposed system expression method and system mode and relation with operation mode, error discovery mode and switching tube of duplexing mode, and PLC's central processing unit of node study algorithm about master-standby conversion driving and continuous operation of 2 channels method that have 2 that is not one and deduced continuous operation method and result about defect permission in this algorithm and applies this result to actuality kiln control system and confirms continuous operation about PLC defect permission.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.150-167
• /
• 2009

XML has become the new standard for storing, exchanging, and publishing of data over both the internet and the ubiquitous data stream environment. As demand for efficiency in handling XML document grows, labeling scheme has become an important topic in data storage. Recently proposed labeling schemes reflect the dynamic XML environment, which itself provides motivation for the discovery of an efficient labeling scheme. However, previous proposed labeling schemes have several problems: 1) An insertion of a new node into the XML document triggers re-labeling of pre-existing nodes. 2) They need larger memory space to store total label. etc. In this paper, we introduce a new labeling scheme called a Circle Labeling Scheme. In CLS, XML documents are represented in a circular form, and efficient storage of labels is supported by the use of concepts Rotation Number and Parent Circle/Child Circle. The concept of Radius is applied to support inclusion of new nodes at arbitrary positions in the tree. This eliminates the need for re-labeling existing nodes and the need to increase label length, and mitigates conflict with existing labels. A detailed experimental study demonstrates efficiency of CLS.