• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1369-1376
• /
• 2015

A wireless bridge is essential to transmit control and managing information to sensors or instruments from a central integrated ship area network station. In this paper, a WiMedia Distributed-MAC(D-MAC) protocol is adopted for development of a seamless N-Screen wireless service in Indoor and Ship Area Networks. Furthermore, to provide the OSMU(One Source Multi Use) N-screen service through P2P streaming in the seamless D-MAC protocol, a Dynamic Threshold-based Multicast(DTM) technology is proposed and analyzed. For this technology, a new Hard/Soft Vertical Region(HVR-SVR) based time slot allocation and a multicast resource reservation scheme are combined. From simulation results, proposed DTM scheme expands the number of time slots available for unicast and multicast realtime N-Screen reservations with various service time interval requests. Furthermore, it enhances performances in vewpoints of realtime N-Screen data reservation conflict and throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2539-2548
• /
• 2015

Overcoming inter-cell interference and spectrum scarcity are major issues in heterogeneous cellular networks. Static Frequency reuse schemes have been proposed as an effective way to manage the spectrum and reduce ICI(Inter cell Interference) in cellular networks. In a kind of static frequency reuse scheme, the allocations of transmission power and subcarriers in each cell are fixed prior to system deployment. This limits the potential performance of the static frequency reuse scheme. Also, most of dynamic frequency reuse schemes did not consider small cell and the network environment when the traffic load of each cell is heavy and non-uniform. In this paper, we propose an inter-cell resource allocation algorithm that dynamically optimizes subcarrier allocations for the multi-cell heterogeneous networks. The proposed dynamic frequency reuse scheme first finds the subcarrier usage in each cell-edge by using the exhaustive search and allocates subcarrier for all the cells except small cells. After that it allocates subcarrier for the small cell and then iteratively repeats the process. Proposed dynamic frequency reuse scheme performs better than previous frequency reuse schemes in terms of the throughput by improving the spectral efficiency due to it is able to adapt the network environment immediately when the traffic load of each cell is heavy and non-uniform.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.1
• /
• pp.37-48
• /
• 2011

Sensor networks monitor the environment, collect sensed data, and relay the data back to a collection point. Although sensor nodes have very limited hardware resources, they require an operating system that can provide efficient resource management and various application environments. In addition, the wireless sensor networks require the code update previously deployed to patch bugs in program and to improve performance of kernel service routines and application programs. This paper presents EPRCU (Easy to Perform Remote Code Update), a new operating system for wireless sensor nodes, which has enhanced functionalities to perform remote code update. To achieve an efficient code update, the EPRCU provides dynamic memory allocation and program memory management. It supports the event-driven kernel, which uses priority-based scheduling with the application of aging techniques. Therefore, the proposed operating system is not only easy to perform wireless communication with the remote code update but also suitable for various sensor network applications.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.20 no.2
• /
• pp.27-42
• /
• 1992

IN urban areas, public outdoor recreation opportunities are limited, traditional funding sources are being eraded, and crowding as well as ecological damage appear inevitable, these developments may require new analysis on the prospective policy of park, with the evaluation of the trend of amenity resources and recreation values, 16 parks were taken as informants in Deagu city area, the data for this research were collected 2,942 samples by the on-site-interview. The abstracted results of amenity elements were revealed as institutions and resource types, the attraction of resources was about twice as much as that of institutions. The resources is to be classified into two items ; national resources and human resources. The former is about five times as mcuh atractive as the latter. The attraction of natural resources consists in the atmospheric factors(35%), the biological factors(28%), the topographical factors(19%), and the scenery factors(18%). While, the attraction of human resources consists in the cultural factors(54%), the social factors(46%). The attraction of the base institutions is very low. The attraction of the static institution is three times as much as that of that of the dynamic institution. The above tendency is a general trend in Daegu city. But when we are taking into consideration in datail, we find that there is great difference among the green tract of land of the park. When the amenity resources of one's destination was used for the value of recreation, the pattern of attraction variables as a physical characteristics could explain 58%. Based on those result, this study is a small but important guidence for decision makings concerning to the allocation of scarce amenity resources.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.115-122
• /
• 2011

It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.325-338
• /
• 2004

As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.

• Journal of Digital Contents Society
• /
• v.13 no.3
• /
• pp.385-392
• /
• 2012

The definition of the product market in a supplier's point of view can cause various problems in the market activities of companies because specific situations are excluded and the consideration for discontinuity is lacking by identifying segmented markets with processes, raw materials, the similarity of product functions and so forth. Furthermore, as this definition is static and general, it is difficult to express and predict the dynamic market changes. Meanwhile, customer-oriented market segment can be obtained by grouping substitutable products and related customers in the situation pursuing specific benefits. This definition of the product market enables us to find threats and opportunities emerging in markets and promotes effective performance assessments and resource allocation. The purpose of this paper is suggesting a framework to select data mining techniques proper for the customer data characteristics to identify customer oriented product market.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.10-23
• /
• 2001

It is difficult to satisfy the QoS(Quality of Service) guarantee which is required by real-time application services only with the Best-Effort(BE) service adopted in the current Internet. Therefore, worldwide research is being made on the method of QoS provisioning. Among them, the QoS guarantee mechanism using the Diffserv(Differentiated Service) was discussed in this paper. First we analyzed how the DiffServ performance was affected by traffic models. For this, we performed the research for the random, bursts, and self-similar traffic modeling method. We then designed and implemented an OPNET simulator, and performed the simulation 7d performance evaluation for diverse input parameters. Based on the results of performance evaluation, it was confirmed that QoS guarantee is possible for the EF(Expedited Forwarding) class with the DiffServ function under every environments considered and the service separation between EF and BE(Best Effort) classes is also possible. We also analyzed the performance variation and dynamic behavior of DiffServ mechanism based on the resource allocation between E? and BE classes in WFQ(Weighted Fair Queueing).

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.591-601
• /
• 2011

Today's Internet which provides communication channels with best-effort end-to-end performance is rapidly evolving into an autonomic global computing platform. Achieving autonomicity in the Future Internet will require a performance architecture that (a) allows users to request and own 'slices' of geographically-distributed host and network resources, (b) measures and monitors end-to-end host and network status, (c) enables analysis of the measurements within expert systems, and (d) provides performance intelligence in a timely manner for application adaptations to improve performance and scalability. We describe the requirements and design of one such "Future Internet performance architecture" (FIPA), and present our reference implementation of FIPA called 'OnTimeMeasure.' OnTimeMeasure comprises of several measurement-related services that can interact with each other and with existing measurement frameworks to enable performance intelligence. We also explain our OnTimeMeasure deployment in the global environment for network innovations (GENI) infrastructure collaborative research initiative to build a sliceable Future Internet. Further, we present an applicationad-aptation case study in GENI that uses OnTimeMeasure-enabled performance intelligence in the context of dynamic resource allocation within thin-client based virtual desktop clouds. We show how a virtual desktop cloud provider in the Future Internet can use the performance intelligence to increase cloud scalability, while simultaneously delivering satisfactory user quality-of-experience.

• Journal of Digital Contents Society
• /
• v.18 no.2
• /
• pp.411-422
• /
• 2017

Current policies for sharing bandwidth increase average throughput and improve utilization of the bandwidth in the local network. However, with these policies, a central administer, which is responsible for allocating bandwidth to each network flow, cannot allocate resources based on user characteristics. Thus, it leads to unfair bandwidth allocation because it does not guarantee services based on user characteristics. Therefore, we propose a novel negotiation method to share the bandwidth in a limited bandwidth network, in which, a user negotiates with other users to gain more resource. Ideally, we use a fuzzy system to infer and determine whether a device will request bandwidth or not based on the current usage of the given device. We conduct two experiments consisting of a video streaming simulation in OPNET and a real-time video streaming in WebRTC. The results of the experiment indicate that the proposed method can flexibly share the bandwidth utilization based on user's requirement in the network.