• Convergence Security Journal
• /
• v.22 no.5
• /
• pp.95-105
• /
• 2022

The Army, Navy, and Air Force are making various efforts to develop a weapon system that incorporates the 4th industrial revolution technology so that it can be used in multi-domain operations. In order to effectively demonstrate the integrated combat power through the weapon system to which the new technology is applied, it is necessary to establish a network environment in which each weapon system can transmit and receive information smoothly. For this, it is essential to analyze the Information Exchange Requirement(IER) of each weapon system, but many IER analysis studies did not sufficiently reflect the various considerations of the actual tactical network. Therefore, this study closely analyzes the research methods and results of the existing information exchange requirements analysis studies. In IER analysis, the size of the message itself, the size of the network protocol header, the transmission/reception structure of the tactical network, the information distribution process, and the message occurrence frequency. In order to be able to use it for future IER prediction, we present a technique for calculating the information exchange requirement as a probability distribution using the Poisson distribution and the probability generating function. In order to prove the validity of this technique, the results of the probability distribution calculation using the message list and network topology samples are compared with the simulation results using Network Simulator 2.

• Korean journal of applied entomology
• /
• v.53 no.4
• /
• pp.375-380
• /
• 2014

The sweetpotato whitefly (SPW), Bemisia tabaci Gennadius, is a major pest in tomato greenhouses on Jeju Island because they transmit viral diseases. To develop practical sampling methods for adult SPWs, yellow-color sticky traps were used in commercial tomato greenhouses throughout the western part of Jeju Island in 2011 and 2012. On the basis of the size and growing conditions in the tomato greenhouses, 20 to 30 traps were installed in each greenhouse for developing a sampling plan. Adult SPWs were more attracted to horizontal traps placed 60 cm above the ground than to vertical trap placed 10 cm above the plant canopy. The spatial patterns of the adult SPWs were evaluated using Taylor's power law (TPL) and Iwao's patchiness regression (IPR). The results showed that adult SPWs were aggregated in each surveyed greenhouse. In this study, TPL showed better performance because of the coefficient of determination ($r^2$). On the basis of the fixed-precision level sampling plan using TPL parameters, more traps were required for higher precision in lower SPW densities per trap. A sequential sampling stop line was constructed using TPL parameters. If the treatment threshold was greater than 10 maximum adult SPWs on a trap, the required traps numbered 15 at a fixed-precision level of 0.25. In estimating the mean density per trap, the proportion of traps with two or more adult SPWs was more efficient than whole counting: ${\ln}(m)=1.19+0.90{\ln}(-{\ln}(1-p_T))$. The results of this study could be used to prevent the dissemination of SPW as a viral disease vector by using accurate control decision in SPW management programs.

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