• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.123-129
• /
• 2016

Recently indoor positioning technologies have been studied using the acoustic signal from a smart phone. Also multi-hop indoor positioning system in which the equipments measure their relative position successively has been proposed. As the total positioning error is prone to increase due to the successively accumulated positioning error for the multi-hop system, the error analysis is required for the system design. In this paper, the absolute positioning error for the multi-hop indoor positioning equipments successively installed is analyzed, and it is verified by computer simulation. According to the results, the accumulated positioning error is linearly increased as the number of the multi-hop increases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.731-763
• /
• 2017

In Underwater Linear Sensor Networks (UW-LSN) routing process, nodes without proper address make it difficult to determine relative sensor details specially the position of the node. In addition, it effects to determine the exact leakage position with minimized delay for long range underwater pipeline monitoring. Several studies have been made to overcome the mentioned issues. However, little attention has been given to minimize communication delay using dynamic addressing schemes. This paper presents the novel solution called Hop-by-Hop Dynamic Addressing based Routing Protocol for Pipeline Monitoring (H2-DARP-PM) to deal with nodes addressing and communication delay. H2-DARP-PM assigns a dynamic hop address to every participating node in an efficient manner. Dynamic addressing mechanism employed by H2-DARP-PM differentiates the heterogeneous types of sensor nodes thereby helping to control the traffic flows between the nodes. The proposed dynamic addressing mechanism provides support in the selection of an appropriate next hop neighbour. Simulation results and analytical model illustrate that H2-DARP-PM addressing support distribution of topology into different ranges of heterogeneous sensors and sinks to mitigate the higher delay issue. One of the distinguishing characteristics of H2-DARP-PM has the capability to operate with a fewer number of sensor nodes deployed for long-range underwater pipeline monitoring.

• 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.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.443-461
• /
• 2014

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.2035-2046
• /
• 2015

Recently, researches on resource allocation algorithms operating in a distributed way are widely conducted because of the increasing number of network nodes and the rapidly changing the network environment. In this paper, we propose Multi-Hop DESYNC(MH DESYNC), that is bio-inspired TDMA-based resource allocation scheme operating in a distributed manner in multi-hop networks. In this paper, we define a frame structure for the proposed MH DESYNC algorithm and firing message structure which is a reference for resource allocation and propose the related operating procedures. We show that MH DSYNC can resolve the hidden-node problem effectively and verify that each node shares resources fairly among its neighboring nodes. Through simulation evaluations, it is shown that MH DESYNC algorithm works well in a multi-hop networks. Furthermore, results show that MH DESYNC algorithm achieves better performance than CSMA/CA algorithm in terms of throughput.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.364-374
• /
• 2016

With vast amounts of spectrum available in the millimeter wave (mmWave) band, small cells at mmWave frequencies densely deployed underlying the conventional homogeneous macrocell network have gained considerable interest from academia, industry, and standards bodies. Due to high propagation loss at higher frequencies, mmWave communications are inherently directional, and concurrent transmissions (spatial reuse) under low inter-link interference can be enabled to significantly improve network capacity. On the other hand, mmWave links are easily blocked by obstacles such as human body and furniture. In this paper, we develop a multi-hop relaying transmission (MHRT) scheme to steer blocked flows around obstacles by establishing multi-hop relay paths. In MHRT, a relay path selection algorithm is proposed to establish relay paths for blocked flows for better use of concurrent transmissions. After relay path selection, we use a multi-hop transmission scheduling algorithm to compute near-optimal schedules by fully exploiting the spatial reuse. Through extensive simulations under various traffic patterns and channel conditions, we demonstrate MHRT achieves superior performance in terms of network throughput and connection robustness compared with other existing protocols, especially under serious blockage conditions. The performance ofMHRT with different hop limitations is also simulated and analyzed for a better choice of the maximum hop number in practice.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.127-136
• /
• 2007

It is easy to install and maintain a mobile multi-hop wireless network due to its self-organizing characteristics. However it has security weakness of the authentication of mobile multi-hop relay stations. Specially, the mobile multi-hop relay network in the IEEE 802.16j has the additional security weakness caused by the requirement of backward compatibility for mobile stations of the conventional IEEE 802.16 system. In this paper, we propose a novel mutual authentication scheme applicable to IEEE 802.16j-based mobile multi-hop relay network architecture. The scheme is able to resolve the initial trust gain problem of a multi-hop node at its entry to the network, the problem of rogue mobile multi-hop node and the problem of hop-by-hop authentication between multi-hop nodes. Effectively, the scheme is a hybrid scheme of the distributed authentication method and the centralized authentication method which have been considered to be deployed in the wireless ad-hoc network and the wireless network connected to wired authentication servers, respectively. Also, we analyze the effectiveness of the proposed hybrid authentication method.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.67-74
• /
• 2014

In multi-hop communication systems, two-way relaying is one of the solutions to mitigate the spectral efficiency loss caused by a half-duplex transmission. In this paper, a simple two-way relaying scheme is proposed for two-hop two-user multiple input multiple output (MIMO) systems. In the proposed system, a base station and a relay station (RS), both equipped with two antennas, form a point-to-point MIMO channel, while the RS and two single-antenna mobile users form a point-to-multipoint multiuser (MU)-MIMO channel. Numerical examples show that the proposed system achieves a significant sum rate gain as compared to a one-way relaying system as the distance between a relay and the two users decreases. We also show that although we can expand the proposed scheme to more than two users, its performance gain as compared to that of one-way relaying decreases with an increase in the number of users.