• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.48-57
• /
• 2008

Wireless sensor networks are composed of a lot of sensor nodes and they are used to monitor environments. Since many studies on wireless sensor networks have considered a stationary sink node, they cannot provide fully ubiquitous applications based on a mobile sink node. In those applications, routing paths for a mobile sink node should be updated while a sink node moves in order to deliver sensor data without data loss. In this paper, we propose a method to continuously update routing paths for a mobile sink node which can be extended on hierarchical multi-hop routing protocols in wireless sensor networks. The efficiency of the proposed scheme has been validated through comparing existing method using a location based routing protocol by extensive computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.285-295
• /
• 2008

Internet routers perform packet forwarding which determines a next hop for each incoming packet using the packet's destination IP address. IP address lookup becomes one of the major challenges because it should be performed in wire-speed for every incoming packet under the circumstance of the advancement in link technologies and the growth of the number of the Internet users. Many binary search algorithms have been proposed for fast IP address lookup. However, tree-based binary search algorithms are usually unbalanced, and they do not provide very good search performance. Even for binary search algorithms providing balanced search, they have drawbacks requiring prefix duplication. In this paper, a new binary search algorithm which provides the balanced binary search and the number of its entries is much less than the number of original prefixes. This is possible because of composing the binary search tree only with disjoint prefixes of the prefix set. Each node has a prefix vector that has the prefix nesting information. The number of memory accesses of the proposed algorithm becomes much less than that of prior binary search algorithms, and hence its performance for IP address lookup is considerably improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1060-1068
• /
• 2016

The range-free localization using connectivity information has problems of mobile tracking. This paper proposes two Bayesian filter-based mobile tracking algorithms considering a propagation scenario. Kalman and Markov Chain Monte Carlo (MCMC) particle filters are applied according to linearity of two measurement models. Measurement models of the Kalman and MCMC particle filter-based algorithms respectively are defined as connectivity between mobiles, information fusion of connectivity information and received signal strength (RSS) from neighbors within one-hop. To perform the accurate simulation, we consider a real indoor map of shopping mall and degree of radio irregularity (DOI) model. According to obstacles between mobiles, we assume two types of DOIs. We show the superiority of the proposed algorithm over existing range-free algorithms through MATLAB simulations.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.333-340
• /
• 2004

In order that routers forward a packet to its destination, they perform IP address lookup which determines the next hop according to the packet's destination address. In designing high speed routers, IP address lookup is an important issue. In order to design high speed routers, this paper proposes a parallel IP lookup scheme which consists of several IP lookup engines without any modification of already fabricated indirect IP lookup chipsets. Also, we propose a simple rule for partitioning IP prefix entries In an overall forwarding table among several IP lookup engines. And we evaluate the performance of the proposed scheme in terms of the memory size required for storing lookup information and the number of memory accesses on constructing the forwarding table. With additional hardware logics, the proposed scheme can reduce about 30% of the required memory size and 80% of the memory access counts.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.919-926
• /
• 2002

In this paper, new multicast scheduling algorithms are proposed for the WDM single-hop broadcast-and-select networks. The existing multicast scheduling algorithms are focused on the partitioning a multicast group into several subgroups to reduce the delay time of each receiver. These partitioning algorithms are grouping method of the receivers already tuned to the transmitter's wavelength. However, these algorithms ignore the state of receivers, which leads to increase the number of subgroups and the delay time. Therefore, 1 propose two new multicast scheduling algorithms called H_EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. The performance of proposed algorithms are evaluated through the computer simulation. They show the better performance comparing with the existing multicast scheduling algorithm.

• Journal of Sensor Science and Technology
• /
• v.20 no.2
• /
• pp.137-144
• /
• 2011

Wireless sensor network(WSN) has the potential to greatly effect many aspects of u-healthcare. By outfitting the potential with WSN, wearable sensor node can collects real-time data on physiological status and transmits through base station to server PC. However, there is a significant gap between WSN and healthcare. WSN has the limited resource about computing capability and data transmission according to bio-sensor sampling rates and channels to apply healthcare system. If a wearable node transmits ECG and accelerometer data of 4 channel sampled at 100 Hz, these data may occur high loss packets for transmitting human activity and ECG to server PC. Therefore current wearable sensor nodes have to solve above mentioned problems to be suited for u-healthcare system. Most WSN based activity and ECG monitoring system have been implemented some algorithms which are applied for signal vector magnitude(SVM) algorithm and ECG noise algorithm in server PC. In this paper, A wearable sensor node using integrated ECG and 3-axial accelerometer based on wireless sensor network is designed and developed. It can form multi-hop network with relay nodes to extend network range in WSN. Our wearable nodes can transmit 1-channel activity data processed activity classification data vector using SVM algorithm to 3-channel accelerometer data. ECG signals are contaminated with high frequency noise such as power line interference and muscle artifact. Our wearable sensor nodes can remove high frequency noise to clear original ECG signal for healthcare monitoring.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.21 no.3
• /
• pp.544-558
• /
• 1997

Black street style has made unique fashion in popular music such as Jazz, Soul, Rhythm Il Blues. Reggae, and Rap, and it is counterculture and subculture against white. Furthermore, the black street style has played a starring role in the development of white culture as well as black culture, which emerged in direct opposition to the dominant cultures practised by a fraction of fellow countrymen within the black diaspora. The objectives of this study are to examine the social chronology of the black street style and the contemporary fashion, and the influences of the black street style on white culture. The seeds of black's style were sown in the late forties, developing throughout the fifties with the arrival of black immigrants from the west Indies and its examples were zooties, hip cats 8l hipsters, modernists. Rude boy & two-tone was anti·fashion style in sixties and then rastafarians continued in seventies costume is used to convey an essential symbolic class and ethnic message. The latest black's street fashion is hip-hop dress, which is pluralistic and electric, and funk is also erratic. During its ten-year reign as an international style, it has undergone numerous shifts because it is decline of racism B-boy & flygirls toraggamuffins & bhangra style to acid Jazz. These have played a crucial part in influencing the gigh fashion and avant-grade fashion designers' work. Today's street fashion has characteristics of postmodern culture without a racism in global village. Moreover, pop music stars take an effect on the street style continuously. With the opening of a new century, the study of the street style will overcast popular fashion and suggest the direction of fashion design.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.556-560
• /
• 2010

In the wireless sensor networks using a multi-hop, quality variation of links occurs irregularly due to the hardware restriction and environmental factor. If an appropriate route, which is affected by the quality variation, is not selected. Traditionally, a beacon is periodically broadcasted and the link quality is estimated. However, the periodically beacon based scheme cannot efficiently estimate the quality of the link changing irregularly. In this paper, a scheme to estimate the link quality adaptively according to network state is proposed. When the link quality changes, the scheme adapts to a change agilely and packet losses are reduced. When there is no change of the link quality, the link quality is estimated in the long period and the energy consumption is reduced. Through performance evaluations, we prove that our adaptive link estimation scheme improves the energy efficiency and packet reception ratio than the periodic estimation scheme.

• Industrial Engineering and Management Systems
• /
• v.4 no.1
• /
• pp.1-22
• /
• 2005

This paper presents new scheduling heuristics, namely Mean Progressive Weighted Tardiness Estimator (MPWT) Heuristic Method and modified priority rules with sequence-dependent setup times consideration. These are designed to solve job shop scheduling problems with new performance measures - progressive weighted tardiness penalties. More realistic constraints, which are inter-machine overlapping sequence-dependent setup times, are considered. In real production environments, inter-machine overlapping sequence-dependent setups are significant. Therefore, modified scheduling generation algorithms of active and nondelay schedules for job shop problems with inter-machine overlapping sequence-dependent setup times are proposed in this paper. In addition, new customer-based measures of performance, which are total earliness and progressive weighted tardiness, and total progressive weighted tardiness, are proposed. The objective of the first experiment is to compare the proposed priority rules with the consideration of sequence-dependent setup times and the standard priority rules without setup times consideration. The results indicate that the proposed priority rules with setup times consideration are superior to the standard priority rules without the consideration of setup times. From the second experiment and the third experiment to compare the proposed MPWT heuristic approach with the efficient priority rules with setup times consideration, the MPWT heuristic method is significantly superior to the Batched Apparent Tardiness Cost with Sequence-dependent Setups (BATCS) rule, and other priority rules based on total earliness and progressive weighted tardiness, and total earliness and tardiness.