• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

• 지역과문화
• /
• 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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.63-74
• /
• 2009

In 2005, Wang et al. discovered devastating collision attacks on the main hash functions from the MD4 family. After the discovery of Wang, many analysis results on the security of existing hash-based cryptographic schemes are presented. At CRYPTO'07, Fouque, Leurent and Nguyen presented full key-recovery attacks on HMAC/NMAC-MD4 and NMAC-MD5[4]. Such attacks are based on collision attacks on the underlying hash function, and the most expensive stage is the recovery of the outer key. At EUROCRYPT'08, Wang, Ohta and Kunihiro presented improved outer key recovery attack on HMAC/NMAC-MD4, by using a new near collision path with a high probability[2]. This improves the complexity of the full key-recovery attack on HMAC/NMAC-MD4 which proposed by Fouque, Leurent and Nguyen at CRYPTO'07: The MAC queries decreases from $2^{88}$ to $2^{72}$, and the number of MD4 computations decreases from $2^{95}$ to $2^{77}$. In this paper, we propose improved outer key-recovery attack on HMAC/NMAC-MD4 with $2^{77.1246}$ MAC queries and $2^{37}$ MD4 computations, by using divide and conquer paradigm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1146-1165
• /
• 2013

Collaborative awareness between persons with various smart multimedia devices is a new trend in the Internet of Things (IoT). Because of the mobility, randomness, and complexity of persons, it is difficult to achieve complete data awareness and data transmission in IoT. Therefore, research must be conducted on mobile-aware service models. In this work, we first discuss and quantify the social relationships of mobile nodes from multiple perspectives based on a summary of social characteristics. We then define various decision factors (DFs). Next, we construct a directed and weighted community by analyzing the activity patterns of mobile nodes. Finally, a mobile-aware service routing algorithm (MSRA) is proposed to determine appropriate service nodes through a trusted chain and optimal path tree. The simulation results indicate that the model has superior dynamic adaptability and service discovery efficiency compared to the existing models. The mobile-aware service model could be used to improve date acquisition techniques and the quality of mobile-aware service in the IoT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.700-713
• /
• 2015

It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

• Journal of Periodontal and Implant Science
• /
• v.50 no.5
• /
• pp.281-290
• /
• 2020

Purpose: The aim of this study was to compare microRNA (miRNA) gene expression in saliva using miRNA polymerase chain reaction (PCR) arrays in healthy and aggressive periodontitis (AP) patients. Methods: PCR arrays of 84 miRNAs related to the human inflammatory response and autoimmunity from the saliva samples of 4 patients with AP and 4 healthy controls were performed. The functions and diseases related to the miRNAs were obtained using TAM 2.0. Experimentally validated targets of differentially expressed miRNAs were obtained from mirTarBase. Gene ontology terms and pathways were analyzed using ConsensusPathDB. Results: Four downregulated miRNAs (hsa-let-7a-5p, hsa-let-7f-5p, hsa-miR-181b-5p, and hsa-miR-23b-3p) were identified in patients with AP. These miRNAs are associated with cell death and innate immunity, and they target genes associated with osteoclast development and function. Conclusions: This study is the first analysis of miRNAs in the saliva of patients with AP. Identifying discriminatory human salivary miRNA biomarkers reflective of periodontal disease in a non-invasive screening assay is crucial for the development of salivary diagnostics. These data provide a first step towards the discovery of key salivary miRNA biomarkers for AP.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.6
• /
• pp.71-84
• /
• 2017

Over the past decade, we have witnessed Serious Debates in MISQ and Other Journals Between Two Camps that have Differing Views on the use of Causal Indicators to Measure Constructs. There is the Camp that advocates Causal Indicators (ADVOCATE) and the Camp that opposes Their Usage (OPPONENT). The Debates have been primarily centered on the OPPONENT's Argument that the Meaning of a Latent Variable is determined by its Outcome Variables. However, Little Effort has been made to Validate the ADVOCATE's Dispute (Against the OPPONENT's Arguments) that the Meaning of a Latent Variable is decided by its Causal Indicators if there is no Misspecification. Our Study precisely examines the Integrity of the Argument. For this, we empirically examine how the two Primary Psychometric Properties-Comprehensiveness and Interrelationship-of Causal Indicators Influence Theory Testing between Latent Variables through Three Different Tests (i.e., Comprehensive Test, Interrelationship Test, and Mixed Test). Conducted on Two Different Datasets, Our Analysis Consistently Reveals that Structural Path Coefficients are Hardly Sensitive to the Changes (i.e., Misspecification) in the Properties of Causal Indicators. The Discovery offers Important Evidence that the Sound Theoretical Logic of a Causal Model is not in Sync with the Empirical Mechanism of Parameter Estimation. This Underscores that a Latent Variable Formed by Causal Indicators is empirically an elusive notion that is Difficult to Operationalize. As Our Results have Significant Implications on the Integrity of Numerous IS studies which have conducted Theory or Hypothesis Testing Using Causal Indicators, we strongly advocate Open Discussions among Methodologists regarding Our Findings and Their Implications for Both Published IS Research and Future Practices.

• Convergence Security Journal
• /
• v.20 no.5
• /
• pp.33-39
• /
• 2020

In MANET consisting of only mobile nodes, all nodes serve as routes. However, the dynamic topology due to frequent movement of nodes degrades routing performance and is also cause of many security vulnerabilities. Therefore, security must be applied to routing techniques that can influence the performance of MANET. In this paper, we propose a technique for efficiently responding to various routing attacks and safe data transmission through application of zone-key based security routing techniques. A zone-based network structure was used, and a management node that manages member nodes in each zone was used in the proposed technique. In addition, the damage from the attacking node was minimized by issuing a key to each node and applying this to a routing technique. The zone management node issues a key for encryption routing information and manages the issuance information. A member node that wants to transmit data encrypts routing in formation using a key issued from the zone management node, and then performs path discovery using this. The improved performance of the proposed technique was confirmed through a comparative experiment with the CBSR and ARNA technique, excellent performance was confirmed through experiments.