• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.47-58
• /
• 2006

Due to the movement of nodes, ad-hoc networks suffer from the problems such as the decrease of data delivery ratio, the increase of end-to-end delay, and the increase of routing overhead. The backup routing schemes try to solve these problems by finding the backup routes during the route discovery phase and using them when a route fails. Generally the backup routing schemes outperform the single-path routing schemes in terms of data delivery ratio, end-to-end delay, and routing overhead when the nodes move rapidly. But when the nodes don't move rapidly, the backup routing schemes generate more routing traffics than the single-path routing schemes because they need to exchange packets to find the backup route. In addition, when the backup route fails earlier than the main route, it can not use the backup route because in many backup route algorithms, the backup route is found only at the initial route discovery phase. RBR(Reactive Backup Routing Algorithm) proposed in this paper is an algorithm that provides more stable data delivery than the previous backup routing schemes through the selective maintenance of backup route and the backup route rediscovery. To do that RBR prioritize the backup routes, and maintain and use them selectively Thus it can also decrease the routing overheads. Also, RBR can increase data delivery ratio and decrease delay because it reestablishes the backup route when the network topology changes. For the performance evaluation, OPNET simulator is used to compare RBR with the single-path routing scheme and some of the well known backup routing schemes.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.5
• /
• pp.473-479
• /
• 2004

In this paper, power density in near field is calculated about analytic object which has comparatively large volume in considering used wavelength such as cellular base station antenna. Panel sector antenna which is used widespreadly in domestic cellular wireless communication system is modeled and electromagnetic field distribution in reactive near field region is calculated by FDTD (Finite Difference Time Domain) method. After that, antenna gain in far field region is obtain by near to far transformation. Power spectral density in radiated near field is calculated in applying to gain-based model with antenna gain in far field. Finally, compliance distance is obtained in considering the result from radiated near field calculation and basic restrictions on occupational and general public exposure limits in ICNIRP guideline. In the center of main radiating position, the result from gain-based model is -14.55 ㏈m and the result from surface scanning method is -15.75 ㏈m. When the losses from cables and connectors used in measurement are considered, the results from gain-based model and surface scanning method are nearly coincident.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.1-16
• /
• 2012

In this paper, we propose a cost-effective location and service management scheme in LTE (Long Term Evolution) networks, which a per-user service proxy is created to serve as a gateway between the mobile user and all client-server applications engaged by the mobile user. The service proxy is always co-located with the mobile user's location database such that whenever the MU's location database moves during a location hand-off, a service hand-off also ensues to co-locate the service proxy with the location database. This allows the proxy to know the location of the mobile user all the time to reduce the network communication cost for service delivery. We analyze four integrated location and service management schemes. Our results show that the centralized scheme performs the best when the mobile user's SMR (service to mobility ratio) is low and ${\upsilon}$(session to mobility ratio) is high, while the fully distributed scheme performs the best when both SMR and ${\upsilon}$ are high. In all other conditions, the dynamic anchor scheme is the best except when the service context transfer cost is high under which the static anchor scheme performs the best. Through analytical results, we demonstrate that different users with vastly different mobility and service patterns should adopt different integrated location and service management methods to optimize system performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.5
• /
• pp.137-142
• /
• 2016

A two-step open system(TOS) was proposed to relay between a healing platform and a repository of personal health documents. TOS was designed by taking into consideration the pubsub service based on large scale connections to monitor a provider's access/request process for health documents in real time. TOS, however, uses WebSocket as a communication protocol in case of pubsub. Given the operational environment of low quality wireless networks for mobile devices that are user terminals in a healing platform, there is a need to add a messaging protocol to support QoS as well as a transmission protocol. As a light messaging protocol optimized for mobile devices, MQTT defines reliable messaging QoS to consider a wireless network situation of low speed/low quality. This study designed an MQTT protocol-based message broker to support QoS in case of large scale connections and pubsub by taking into consideration mobile devices that are user terminals in a healing platform. After designing a model between TOS and MQTT message broker, the study implemented a prototype based on the proposed design and compared it with its counterparts from previous studies based on the performance indicators in a load-test with the MQTT client tool.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.3
• /
• pp.52-58
• /
• 2009

If a moving target has a linear characteristics, the Kalman filter can estimate relatively accurate the location of a target, but this performance depends on how the dynamic status characteristics of the target is accurately modeled. In many practical problems of tracking a maneuvering target, a simple kinematic model can fairly accurately describe the target dynamics for a wide class of maneuvers. However, since the target can exhibit a wide range of dynamic characteristics, no fixed SKF(Simple Kalman filter) can be matched to estimate, to the required accuracy, the states of the target for every specific maneuver. In this paper, a new AKF(Active Kalman filter) is proposed to solve this problem The process noise covariance level of the Kalman filter is adjusted at each time step according to the study result which uses the neural network algorithm. It is demonstrated by means of a computer simulation that the tracking capability of the proposed AKF(Active Kalman filter) is better than that of the SKF(Simple Kalman Filter).

• The Journal of Art Theory & Practice
• /
• no.14
• /
• pp.87-124
• /
• 2012

This paper focuses on the social implication of new media art, which has evolved with the advance of technology. To understand the notion of human-computer interactivity in media art, it examines the meaning of "cybernetics" theory invented by Norbert Wiener just after WWII, who provided "control and communication" as central components of his theory of messages. It goes on to investigate the application of cybernetics theory onto art since the 1960s, to which Roy Ascott made a significant contribution by developing telematic art, utilizing the network of telecommunication. This paper underlines the significance of the relationship between human and machine, art and technology in transforming the work of art as a site of communication and experience. The interactivity in new media art transforms the viewer into the user of the work, who is now provided free will to make decisions on his or her action with the work. The artist is no longer a godlike figure who determines the meaning of the work, yet becomes another user of his or her own work, with which to interact. This paper believes that the interaction between man and machine, art and technology can lead to various ways of interaction between humans, thereby restoring a sense of community while liberating humans from conventional limitations on their creativity. This paper considers the development of new media art more than a mere invention of new aesthetic styles employing advanced technology. Rather, new media art provides a critical shift in subverting the modernist autonomy that advocates the medium specificity. New media art envisions a new art, which would embrace impurity into art, allowing the coexistence of autonomy and heteronomy, embracing a technological other, thereby expanding human relations. By enabling the birth of the user in experiencing the work, interactive new media art produces an open arena, in which the user can create the work while communicating with the work and other users. The user now has freedom to visit the work, to take a journey on his or her own, and to make decisions on what to choose and what to do with the work. This paper contends that there is a significant parallel between new media artists' interest in creating new experiences of the art and Jacques Ranci$\grave{e}$re's concept of the aesthetic regime of art. In his argument for eliminating hierarchy in art and for embracing impurity, Ranci$\grave{e}$re provides a vision for art, which is related to life and ultimately reshapes life. Ranci$\grave{e}$re's critique of both formalist modernism and Jean-Francois Lyotard's postmodern view underlines the social implication of new media art practices, which seek to form "the common of a community."

• The Journal of the Korea Contents Association
• /
• v.16 no.4
• /
• pp.204-210
• /
• 2016

The reason to research the musical is it has a lot of useful things for the various studies department not only Korea Musical Theatre own although it has been a successful musical theater on the Off-Broadway by Reboot culture era. Even though does not release on Korea, the popular of the show and powerful results of environments have delivered through the international magazines and Youtube channels to Korea. To study of Musical will be lead us to the world which adopted to the social problems as the youth school violence, family communication hurdle, and religion missing by script not only the musical drama but the interpretation for Teen-agers social problem. There are many kinds of Neo educations are proved by smart learning as STEAM. The students who have been studied with the smartphone, I-pad, personal computer, or laptop as smart tools for class are familliar as feedback processing speedly. It would make them learn the skill for their knowledge of a digital age, but it should not let them how to understand other people's emotion as real although STEAM has emtion part. Besides they have communicated on the social network not the ordinary man but the special ego by themselves, as mention or retweet as like their amusements and make the gossip group. This study would show the perspective for understanding Teen-agers Social Problem and who is the victims today's juvenile problems though the musical based on Jim Taulli's directing.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.7-14
• /
• 2010

In this paper, we introduce a hierarchical internet application traffic classification system based on SVM as an alternative overcoming the uppermost limit of the conventional methodology which is using the port number or payload information. After selecting an optimal attribute subset of the bidirectional traffic flow data collected from the campus, the proposed system classifies the internet application traffic hierarchically. The system is composed of three layers: the first layer quickly determines P2P traffic and non-P2P traffic using a SVM, the second layer classifies P2P traffics into file-sharing, messenger, and TV, based on three SVDDs. The third layer makes specific classification of the entire 16 application traffics. By classifying the internet application traffic finely or coarsely, the proposed system can guarantee an efficient system resource management, a stable network environment, a seamless bandwidth, and an appropriate QoS. Also, even a new application traffic is added, it is possible to have a system incremental updating and scalability by training only a new SVDD without retraining the whole system. We validate the performance of our approach with computer experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.10
• /
• pp.1840-1848
• /
• 2017

Linear wireless sensor networks typically construct a network topology with a high reliability through sequential 1:1 mapping among sensor nodes, so that they are used in various surveillance applications of major national infrastructures. Most existing techniques for identifying sensor nodes in those networks are using GPS, AOA, and RSSI mechanisms. However, GPS or AOA based node identification techniques affect the size or production cost of the nodes so that it is not easy to construct practical sensor networks. RSSI based techniques may have a high deviation regrading location identification according to propagation environments and equipment quality so that complexity of error correction algorithm may increase. We propose a timestamps based sequential localization algorithm that uses transmit and receive timestamps in a message between sensor nodes without using GPS, AOA, and RSSI techniques. The algorithms for distance measurement between each node are expected to measure distance within up to 1 meter in case of an crystal oscillator of 300MHz or more.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.429-439
• /
• 2006

A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to reliability and unpredictability of computing resources, effective scheduling of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from a set of 40 desktop workstations over a period of seven weeks. Then, based on this data, the execution of several representative parallel applications were simulated using trace-driven simulation. The simulation results showed that the proposed method improves the execution time of the target applications significantly when compared to previous desktop grid scheduling methods. In addition, there were fewer instances of application suspension and failure.