• Smart Structures and Systems
• /
• v.6 no.5_6
• /
• pp.481-504
• /
• 2010

Wireless smart sensor networks (WSSNs) have been proposed by a number of researchers to evaluate the current condition of civil infrastructure, offering improved understanding of dynamic response through dense instrumentation. As focus moves from laboratory testing to full-scale implementation, the need for multi-hop communication to address issues associated with the large size of civil infrastructure and their limited radio power has become apparent. Multi-hop communication protocols allow sensors to cooperate to reliably deliver data between nodes outside of direct communication range. However, application specific requirements, such as high sampling rates, vast amounts of data to be collected, precise internodal synchronization, and reliable communication, are quite challenging to achieve with generic multi-hop communication protocols. This paper proposes two complementary reliable multi-hop communication solutions for monitoring of civil infrastructure. In the first approach, termed herein General Purpose Multi-hop (GPMH), the wide variety of communication patterns involved in structural health monitoring, particularly in decentralized implementations, are acknowledged to develop a flexible and adaptable any-to-any communication protocol. In the second approach, termed herein Single-Sink Multi-hop (SSMH), an efficient many-to-one protocol utilizing all available RF channels is designed to minimize the time required to collect the large amounts of data generated by dense arrays of sensor nodes. Both protocols adopt the Ad-hoc On-demand Distance Vector (AODV) routing protocol, which provides any-to-any routing and multi-cast capability, and supports a broad range of communication patterns. The proposed implementations refine the routing metric by considering the stability of links, exclude functionality unnecessary in mostly-static WSSNs, and integrate a reliable communication layer with the AODV protocol. These customizations have resulted in robust realizations of multi-hop reliable communication that meet the demands of structural health monitoring.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.923-928
• /
• 2003

This paper proposes a bottleneck link bandwidth measurement algorithm for reducing packet transmission delay within the grid network. There are two methods for measuring bottleneck link bandwidth：Packet Pair algorithm and Paced Probes algorithm. They measure bottleneck link bandwidth using the difference in arrival times of two paced probe packets of the same size traveling from the same source to destination. In addition, they reduce the influences of cross traffic by pacer packet. But there are some problems on these algorithms：it's not possible to know where bottleneck link occurred because they only focus on measuring the smallest link bandwidth along the path without considering bandwidth of every link on the path. So hop-by-hop based bottleneck link bandwidth measurement algorithm can be used for reducing packet transmission delay on grid network. Timestamp option was used on the paced probe packet for the link level measurement of bottleneck bandwidth. And the reducing of packet transmission delay was simulated by the solving a bottleneck link. The algorithm suggested in this paper can contribute to data transmission ensuring FTP and realtime QoS by detecting bandwidth and the location where bottleneck link occurred.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.200-209
• /
• 2017

In this paper, we investigate the tradeoff between security and reliability for a multi-hop protocol in cluster-based underlay cognitive radio networks. In the proposed protocol, a secondary source communicates with a secondary destination via the multi-hop relay method in the presence of a secondary eavesdropper. To enhance system performance under the joint impact of interference constraint required by multiple primary users and hardware impairments, the best relay node is selected at each hop to relay the source data to the destination. Moreover, the destination is equipped with multiple antennas and employs a selection combining (SC) technique to combine the received data. We derive closed-form expressions of the intercept probability (IP) for the eavesdropping links and the outage probability (OP) for the data links over a Rayleigh fading channel. Finally, the correction of our derivations is verified by Monte-Carlo simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1671-1686
• /
• 2022

Face manipulation tools represented by Deepfake have threatened the security of people's biological identity information. Particularly, manipulation tools with deep learning technology have brought great challenges to Deepfake detection. There are many solutions for Deepfake detection based on traditional machine learning and advanced deep learning. However, those solutions of detectors almost have problems of poor performance when evaluated on different quality datasets. In this paper, for the sake of making high-quality Deepfake datasets, we provide a preprocessing method based on the image pixel matrix feature to eliminate similar images and the residual channel attention network (RCAN) to resize the scale of images. Significantly, we also describe a Deepfake detector named Cascaded-Hop which is based on the PixelHop++ system and the successive subspace learning (SSL) model. By feeding the preprocessed datasets, Cascaded-Hop achieves a good classification result on different manipulation types and multiple quality datasets. According to the experiment on FaceForensics++ and Celeb-DF, the AUC (area under curve) results of our proposed methods are comparable to the state-of-the-art models.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.34-39
• /
• 2005

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical Wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop count. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose the Just Enough Time(JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.

• Journal of the Korean Society of Costume
• /
• v.66 no.4
• /
• pp.94-110
• /
• 2016

The purpose of this study is to delve into the identity of the swag style which has diversified into various forms by exploring the phenomenon, formative characteristics and the internal values of the swag style in modern fashioin. This study discusses the concept and the socio-cultural meanings of swag from the perspective of Jean Baudrillard's hyper-reality, and a form of existence. The classifies the swag fashion styles into parody, hip hop and collage-type mix-and-match. Expressive characteristics of the swag look in modern fashion are as follows. First, the swag look utilizes the parody technique. In the mid-2000s, the look parodied brand logos as a form of self-mocking and active self-derision toward cheap imitations. Second, the swag look borrows from the expressive factors of the hip-hop style. Born as a sub-culture based on music, hip-hop has become a way of life, as its nature became multi-cultural and trans-cultural while its fashion style gained popularity globally after the 1980s. Third, the swag look barrows from the pop-type collage form as it mixes-and-matches costume items based on the expressive characteristics of hip hop, and this can be seen through items being used in new, non-formative and free styles. Comic aesthetics is revealed in parodied expression, hip-hop factors and collage-style mix-and-match. Swag as a hyper-reality manifests itself in various natures: humorous nature, negative nature and deconstructive nature through reflection and re-enactment of reality, transmutation and distortion of reality, and absence of reality respectively. However, it does not have a binding nature, which is the norm for subcultures. This characteristic, in combination with it having internal lightness, strong meaning of communication, and a sharing of self-contentment, distinguishes itself from the general meanings of existing parody fashion, hip-hop fashion and collage fashion.

• Fashion & Textile Research Journal
• /
• v.24 no.5
• /
• pp.493-504
• /
• 2022

This study aims to gain a deeper understanding of the fashion styles of underground rappers in China and South Korea. Due to rappers' fashion influence on modern fashion trends, research on rapper fashion has been conducted steadily in the field of apparel. Qualitative research methodologies including literature research and in-depth interviews were the primary techniques used to solve the research questions. In-depth interviews were conducted with 10 Chinese underground rappers and 10 Korean underground rappers to reveal and explore their fashion style and view of fashion. As a result, the participants' fashion styles were categorized into four styles: authentic hip-hop fashion style, popularized hip-hop fashion style, easy sports casual style, and trendy street style. Rappers from both countries consider that their identity as rappers can be demonstrated through their hip-hop fashion style. The influence of hip-hop culture and the popularity of rap music differs between China and Korea. It affects not only the rapper's musical characteristics, but also their fashion style. While Korean underground rappers' fashions style is trendier, Chinese underground rappers' fashions style displays stronger characteristics of hip-hop fashion. Due to the public's negative view of rappers, some Korean underground rappers intentionally try to hide their identity by wearing a fashion style that differs from the authentic rapper image. Understanding the fashion styles of underground rappers in Korea and China is expected to assist in predicting future hip-hop culture and rapper fashion trends.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1559-1571
• /
• 2011

In wireless ad hoc networks, nodes communicate with each other using multihop routed transmission in which hop-by-hop cooperative diversity can be effectively employed. This paper proposes (i) two cooperation models for per-link cooperation (PLC) and per-node cooperation (PNC) for exploiting cooperative diversity in wireless ad hoc networks and (ii) a cooperative routing algorithm for the above models in which best relays are selected for cooperative transmission. First, two cooperation models for PLC and PNC are introduced and represented as an edge-weighted graph with effective link quality. Then, the proposed models are transformed into a simplified graph and a cooperative routing algorithm with O(n2) time is developed, where n is the number of nodes in the network. The effectiveness of the algorithm is confirmed for the two cooperation models using simulation.

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

An energy-efficient multi-hop scheme based on cooperative MIMO (multiple-input multiple-output) technique is proposed for wireless sensor networks, taking into consideration the modulation constellation size, transmission distance, and extra training overhead requirement. The scheme saves energy by selecting the hop length. In order to evaluate the performance of the proposed scheme, a detailed analysis of the energy and delay efficiencies in the proposed scheme compared with the equidistance scheme is presented. Results from numerical experiments indicate that by use of the proposed scheme significant savings in terms of total energy cousumption can be achieved.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.