• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.263-267
• /
• 2015

current mine detector can't division the section if it is conducted and it needs too much labor force and time. in addition to, if the user don't move the head of sensor in regular speed or move it too fast, it is hard to detect a mine exactly. according to this, to improve the problem using one direction ultrasonic wave sensing signal, that is made up of human body antenna part, main micro processor unit part, smart glasses part, body equipped LCD monitor part, wireless data transmit part, belt type power supply part, black box type camera, Security Communication headset. the user can equip this at head, body, arm, waist and leg in removable type. so it is able to detect the powder in a 360-degree on(under) the ground whether it is metal or nonmetal and it can express the 2D or 3D film about distance, form and material of the mine. so the battle combats can avoid the mine and move fast. also, through the portable battery and twin self power supply system of the power supply part, combat troops can fight without extra recharge and we can monitoring the battle situation of distant place at the command center server on real-time. and then, it makes able to sharing the information of battle among battle combats one on one. as a result, the purpose of this study is researching a smart wearable mine detector which can establish a smart battle system as if the commander is in the site of the battle.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.535-544
• /
• 2003

Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.