• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.15 no.1
• /
• pp.41-50
• /
• 2010

We have developed an in-situ benthic chamber (BelcI) for use in coastal studies that can be deployed from a small boat. It is expected that BelcI will be useful in studying the benthic boundary layer because of its flexibility. BelcI is divided into three main areas: 1) frame and body chamber, 2) water sampler, and 3) stirring devices, electric controller, and data acquisition technology. To maximize in-situ use, the frame is constructed from two layers that consist of square cells. All electronic parts (motor controller, pA meter, data acquisition, etc.) are low-power consumers so that the external power supply can be safely removed from the system. The hydrodynamics of BelcI, measured by PIV (particle image velocimetry), show a typical "radial-flow impeller" pattern. Mixing time of water in the chamber is about 30 s, and shear velocity ($u^*$) near the bottom layer was calculated at $0.32\;cm\;s^{-1}$. Measurements of diffusivity boundary layer thickness showed a range of $180-230\;{\mu}m$. Sediment oxygen consumption rate, measured in-situ，was $84\;mmol\;O_2\;m^{-2}\;d_{-1}$, more than two times higher than on-board incubation results. Benthic fluxes assessed from in-situ incubation were estimated as follows: nitrate + nitrite = $0.18\;{\pm}\;0.07\;mmol\;m^{-2}\;d^{-1}$ ammonium $23\;{\pm}\;1\;mmol\;m^{-2}\;d^{-1}$ phosphate = $0.09\;{\pm}\;0.02\;mmol\;m^{-2}\;d^{-1}$ and silicate = $23\;{\pm}\;1\;mmol\;m^{-2}\;d^{-1}$.

• 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.