• Journal of the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.57-66
• /
• 2010

In this paper, we propose the reliability constrained resource allocation scheduling algorithm in cellular network for uplink transmission, where uplink transmission is supported via packet switching schemes without the dedicated uplink circuit links. We evaluate the performance of the proposed algorithm, and compared with the conventional works to identify the pros and cons. The proposed uplink scheduling algorithm is to satisfy the constraints requirements of the MTC services which is considered as the core technology for future mobile wireless networks. It is different to conventional works which target to maximize the link capacity. The proposed algorithm provides reliable uplink transmission independent to the location and the quality of the wireless link of the mobile terminal. Based on the performance evaluation results, we conclude that the proposed method provides enhanced reliability performance than conventional works.

• Korean Journal of Construction Engineering and Management
• /
• v.10 no.6
• /
• pp.127-134
• /
• 2009

This study aims to provide an optimal model for the layout of multiple tower cranes and material stockyards which have multiple candidate positions. In a high-rise building construction, the positional allocation of tower cranes and material stockyard has an effect on the travel time of material hauling. In addition, in case of using multiple tower cranes, specific location of a tower crane allocated to each material determines the efficiency of the works. Current optimal model limited to the optimization of position of single tower crane and material stockyards. This study suggests optimal model both for the positions of multiple tower cranes and material stockyards. Layout of multiple tower cranes requires additional allocation of each crane to each material hauling and control on the minimum distance between tower cranes. This optimization model utilizes genetic algorithm to deal with complex interaction on the candidate positions of multiple tower cranes, material stockyards, and types of materials. In order to identify its utility, case study was performed.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.689-697
• /
• 2004

Rapid advances in mobile computing and the availability of wireless communications will soon provide mobile users with the ability to access data regardless of the location of the user or of the data. SRA(Static Replica Allocation) that is traditional scheme has been used for the replication method on the server. This replicates the data on the replica server after a moving host has been transferred to the cell. This strategy is simple and can easily relocate data. However, if a mobile user does not exist in the cell, the replicated data can be deleted in order to maintain data consistency. In addition to, if the mobile host leaves from replicated cell, it is difficult to access data in terms of replication route. Therefore, this paper proposes a new method of relocation based on data consistency strategy called USRAC(User Selection Replica Allocation based on Consistency) and also analyzes access cost according to the moving rate of mobile users, according to the access rate of mobile hosts, and according to the number of cells of mobile users and mobile hosts.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.67-75
• /
• 2020

This paper proposes a methodology for gantry route optimization in order to maximize the productivity of a odd-type surface mount device (SMD). A odd-type SMD is a machine that uses a gantry to mount electronic components on the placement point of a printed circuit board (PCB). The gantry needs a nozzle to move its electronic components. There is a suitability between the nozzle and the electronic component, and the mounting speed varies depending on the suitability. When it is difficult for the nozzle to adsorb electronic components, nozzle exchange is performed, and nozzle exchange takes a certain amount of time. The gantry route optimization problem is divided into the mounting order on PCB and the allocation of nozzles and electronic components to the gantry. Nozzle and electronic component allocation minimized the time incurred by nozzle exchange and nozzle-to-electronic component compatibility by using an mixed integer programming method. Sequence of mounting points on PCB minimizes travel time by using the branch-and-price method. Experimental data was made by randomly picking the location of the mounting point on a PCB of 800mm in width and 800mm in length. The number of mounting points is divided into 25, 50, 75, and 100, and experiments are conducted according to the number of types of electronic components, number of nozzle types, and suitability between nozzles and electronic components, respectively. Because the experimental data are random, the calculation time is not constant, but it is confirmed that the gantry route is found within a reasonable time.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.737-746
• /
• 2009

Given the increased interest in ubiquitous computing, wireless sensor network has been researched widely. The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose APL(Adaptive Power Control based Resource Allocation Technique for Efficient Localization Technique), the localization technique for multiple mobile nodes based on adaptive power control in mobile wireless sensor networks. In APL, collision of localization between sensor nodes is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we use RTS(Ready To Send) packet type for localization initiation by mobile node and CTS(Clear To Send) packet type for localization grant by anchor node. NTS(Not To Send) packet type is used to reject localization by anchor node for interference avoidance and STS(Start To Send) for synchronization between 모anchor nodes. At last, the power level of sensor node is controled adaptively to minimize the affected area. The experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and APL provides efficient localization.

• Journal of the Economic Geographical Society of Korea
• /
• v.14 no.2
• /
• pp.116-128
• /
• 2011

Some subway passengers may want to have their fresh vegetables purchased through internet at a service facility within the subway station of the Metropolitan Seoul subway system on the way to home, which raises further questions about which stations are chosen to locate service facilities and how many passengers can use the facilities. This problem is well known as the pickup problem, and it can be solved on a traffic network with traffic flows which should be identified from origin stations to destination stations. Since flows of the subway passengers can be found from the smart card transaction database of the Metropolitan Seoul smart card system, the pickup problem in the Metropolitan Seoul subway system is to select subway stations for the service facilities such that captured passenger flows are maximized. In this paper, we have formulated a model of the pickup problem on the Metropolitan Seoul subway system with subway passenger flows, and have proposed a fast heuristic algorithm to select pickup stations which can capture the most passenger flows in each step from an origin-destination matrix which represents the passenger flows. We have applied the heuristic algorithm to select the pickup stations from a large volume of traffic network, the Metropolitan Seoul subway system, with about 400 subway stations and five millions passenger transactions daily. We have obtained not only the experimental results in fast response time, but also displayed the top 10 pickup stations in a subway guide map. In addition, we have shown that the resulting solution is nearly optimal by a few more supplementary experiments.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.18 no.4
• /
• pp.45-71
• /
• 1991

The landscape systems in Korean island settlements can be recognized as results of ingabitants' ecological adptation to the isolated environment with the limited natural resources. Both the fishery dominant industry in island society and ecological nature of its environments seem to have influenced on inhabitants' environmental cognition as well as the physical landscape of island villages such as its location, spatial pattern in each village, housing form and so on. This study was done mainly by both refering to the related documents and direct observations in case study areas, and results of the study can be summarized as follows. 1. In general, the landscape of an individual island seems to take more innate characteristics of island's own, corresponding to the degree of isolation from mainland. That is, while the landscape of island in neighboring waters takes both inland-like and island-innate landscape character at the same time, the one in the open sea far from land takes more innate landscape character of all island's own in the aspects of village location, land use and housing density etc. 2. The convex landform of most islands brings about more centrifugal village allocation than centripetal allocation in most inland villages. And thus most villages in each island face extremely diverse directions different from the south facing preference in most inland rural villages. 3. Most island villages tend to be located along the ecologically transitional strip between land and sea, so called 'line of life', rather than between hilly slope and flat land as being in most inland village locations. So they are located with marine ecology bounded fishing ground ahead and land ecology bounded agricultural site at the back of them. 4. The settlement pattern of the island fishing villages shows more compact spatial structure than that of inland agricultural villages, due to the absolute limits of usable land resources and the adaptation to the marine environment with severe sea winds and waves or for the easy accessability to the fishing grounds. And also the managerial patterns of public owned sea weed catching ground, which take each family as the unit of usership rather than an individual, seem to make the villagescape more compact and the size of Individual residence smaller than that of inland agricultural village. 5. The folk shrine('Dand') systems, in persrective of villagescape, represent innate environmental cognition of island inhabitants above all other cultural landscape elements in the island. Usually the kinds and the meanings of island's communal shrine and its allocative patternsin island villagescape are composed of set with binary opposition, for example 'Upper shrine(representing 'earth', 'mountain' or 'fire')' and 'Lower Shrine(representing 'sea', 'dragon' or 'water') are those. They are usually located at contrary positions in villagescape each other. That is, they are located at 'the virtical center or visual terminus(Upper shrine at hillside behind the village)' and 'the border or entrance(Lower Shrine at seashore in front of the village)'. Each of these shirines' divinity coincides with each subsystem of island's natural eco-system(earth sphere vs marine sphere) and they also contribute to ecological conservation, bonded with the 'Sacred Forest(usually with another function of windbreak)' or 'Sacred Natural Fountain' nearby them, which are representatives of island's natural resources.

• Journal of Korean Society of Disaster and Security
• /
• v.17 no.1
• /
• pp.9-16
• /
• 2024

In Korea, as disasters become larger and more complex, there is a trend of shifting from a focus on response and recovery to a focus on prevention and preparedness. In order to prevent and prepare for disasters, each local government manages disaster management resources by stockpiling them. However, although disaster management resources are stored in individual warehouses, they are managed by department rather than by warehouse, resulting in insufficient management of disaster management resources due to the heavy workload of those in charge. In order to intensively manage these disaster management resources, an integrated disaster management resource management center is established and managed at the metropolitan/provincial level. In the case of Gangwon-do, the subject of this study, a warehouse is rented and operated as an integrated disaster management resource management center. When leasing an integrated management center, there is the inconvenience of having to move the location every 1 to 2 years, so it is deemed necessary to build a dedicated facility in an available site. To select a location candidate, network analysis was used to measure access to and use of facilities along interconnected routes of networks such as roads and railways. During network analysis, the Location-Allocation method, which was widely used in the past to determine the location of multiple facilities, was applied. As a result, Hoengseong-gun in Gangwon-do was identified as a suitable candidate site. In addition, if the integrated management center uses our country's logistics system to stockpile disaster management resources, local governments can mobilize disaster management resources in 3 days, and it is said that it takes 3 days to return to normal life after a disaster occurs. Each city's disaster management resource stockpile is 3 days' worth per week, and the integrated management center stores 3 times the maximum of the city's 4-day stockpile.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.11
• /
• pp.256-264
• /
• 2020

Industrial Wireless Sensor Networks (IWSNs) is exploited to achieve various objectives such as improving productivity and reducing cost in the diversity of industrial application, and it has requirements such as low-delay and high reliability packet transmission. To accomplish the requirement, the network manager performs graph construction and resource allocation about network topology, and determines the transmission cycle and path of each node in advance. However, this network management scheme cannot treat mobile devices that cause continuous topology changes because graph reconstruction and resource reallocation should be performed as network topology changes. That is, despite the growing need of mobile devices in many industries, existing scheme cannot adequately respond to path failure caused by movement of mobile device and packet loss in the process of path recovery. To solve this problem, a network management scheme is required to prevent packet loss caused by mobile devices. Thus, we analyse the location and movement cycle of mobile devices over time using machine learning for predicting the mobility pattern. In the proposed scheme, the network manager could prevent the problems caused by mobile devices through performing graph construction and resource allocation for the predicted network topology based on the movement pattern. Performance evaluation results show a prediction rate of about 86% compared with actual movement pattern, and a higher packet delivery ratio and a lower resource share compared to existing scheme.

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1404-1415
• /
• 2022

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.