• Land and Housing Review
• /
• v.2 no.4
• /
• pp.559-568
• /
• 2011

This study aims at listing up those manufacturing activities sensitive to regional characteristics by analyzing locational hierarchy designed on the urban rank-size rule. This locational hierarchy by manufacturing activities is expected to provide a ground for the proper supply of an industrial complex. The analysis of the locational hierarchy by manufacturing activities can work as a method of observing the characteristics of the distribution of location for each economic activity by analyzing the trend in the change of manufacturing location. Consequently, it can be used to determine the appropriate manufacturing activities for the industrial complex of a particular region. Here, the locational hierarchy is analyzed depending on the base of the basic local government such as Gun(district level) and Si(city level), and manufacturing activities are categorized by Korea Standard Industry Code. Those activities demonstrating growth pattern are Manufacture of Electronic Equipment(KSIC 26), Manufacture of Medical Precision Optical Instruments Watch(KSIC 27), Manufacture of Motor Vehicles (KSIC 30, 31), etc. With proper infrastructures, these activities can be located everywhere. Those sectors on the decline pattern in the locational hierarchy can be summarized as Manufacture of Tobacco Products(KSIC 12), Manufacture of wearing apparel Fur Articles(KSIC 14), etc. Those sectors scattered widely in the locational hierarchy are Manufacture of Food Products(KSIC 10), Manufacture of Coke Petroleum Products(KSIC 19), Manufacture of Chemical Products(KSIC 20), Manufacture of Electronic Equipment(KSIC 26). These particular manufacturing activities can be operated in those regions in a sufficient supply of unskilled workers regardless of proper infrastructures. Those activities that have a tendency to reconcentrate on larger cities are Manufacture of Textiles(KSIC 13), Manufacture of Wearing Apparel Clothing Fur Articles(KSIC 14), Manufacture of Other Transport Equiptmen(KSIC 31). In most cases, these sectors tend to favor their existing agglomerated areas and concentrate around large cities. Therefore, it is inefficient to promote these sectors in small or medium-sized cities or underdeveloped regions. The establishment of developmental strategies of an industrial complex can gain greater competitiveness by observing such characteristics of the locational hierarchy.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.