• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.451-454
• /
• 2000

Invasive methode and Non-invasive methode are used in blood pressure measurement. The Invasive methode can Set the correct measured blood pressure but, it has patient feels uncomfortable. So most of cases use Non-invasive methode. The Oscillometric method is commonly apply to modem electric sphygmomanometer and using various algorithm. In this paper describe about a algorithm it control and to determinate the cuff pressure, and filtering that data for measure the blood pressure. The communicating with personal computer can pressure deflation is by Solenoid valve and it uses RS-232 system in packet communication. The main using algorithm for blood pressure measurements are maximum amplitude algorithm and oscillometric algorithm. MAA(maximum amplitude algorithm) has various measured oscillation it depend on patient's age, height, weight and arm circumference size. In this paper, 1 studied the various measured oscillation apply to characteristic ratio and can get the result of systolic blood pressure, diastolic blood pressure, mean blood pressure. It was not used same ratio to measuring oscillation. In the MAA(maximum amplitude algorithm), we hope for reduce the difference with the real blood pressure and the measured blood pressure, when it applied with various specific ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.42-48
• /
• 2002

In broadband wireless networks, the effective meeting of the QoS guarantees may strongly depend on the Contention Resolution Algorithm used in the uplink contention period. The time it takes a station to transmit a successful request to the base station, or request delay, must be kept low even during periods of high contention. If a request suffers many collisions, it cannot rely on the preemptive scheduler to receive low access delays. However, the conventional collision resolution algorithm has a problem that all collided stations are treated equally regardless of their delay from previous contention periods. Some requests may have very long request delay caused by continuous collisions. In this paper, we propose an adaptive collision resolution algorithm for fast random access in broadband wireless networks. The design goal is to provide quick access to the request with a high number of collisions. To do this, the proposed algorithm separates the whole contention region into multiple sub regions and permits access through each sub region only to the requests with equal number of collisions. The sub region is adaptively created according to the feedback information of previous random access. By simulation, the proposed algorithm can improve the performance in terms of throughput, random delay and complementary distribution of random delay by its ability to isolate higher priorities from lower ones. We can notice the algorithm provides efficiency and random access delay in random access environment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.1
• /
• pp.1-12
• /
• 2004

In this paper, we take advantage of the characteristics of optical burst switching (OBS) to support service-differentiation in optical networks. With the offset time between control packet and burst data, the proposed scheme uses different offset time of each service class. As contrasted with the Previous method, in which the high Priority service use only long offset time, it derives the burst loss rate as a QoS parameter in consideration of conservation law and given service-differential ratios and decides a reasonable offset time for this QoS finally Firstly proposed method classifies services into one of high or low class and is an algorithm deciding the offset time for supporting the required QoS of high class. In order to consider the multi-classes environment, we expand the analysis method of first algorithm and propose the second algorithm. It divides services into one of high or low group according to their burst loss rate and decides the offset time for high group, and lastly cumulates the offset time of each class. The proposed algorithms are evaluated through simulation. The result of simulation is compared with that of analysis to verify the proposed scheme.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.2 no.2 s.3
• /
• pp.43-54
• /
• 2003

As the demand for ubiquitous mobile wireless Internet grows, vehicles are receiving a lot of attention as new networking platforms. The demand for 4G all-IP networks encourages vehicle networks to be connected using IPv6. By means of network mobility (NEMO) support, we can connect sensors, controllers, local ,servers as well as passengers' devices of a vehicle to the Internet through a mobile router. The mobile router provides the connectivity to the Internet and mobility transparency for the rest of the mobile nodes of an in-vehicle nv6 network. So, it is .important for the mobile router to assure reliable connection and a sufficient data rate for the group of nodes behind it. To provide reliability, this paper proposes an adaptive multihoming architecture of multiple mobile routers. Proposed architecture makes use of different mobility characteristics of different vehicles. Simulation results with different configurations show that the proposed architecture increases session preservation thus increases reliability and reduces packet loss. We also show that the proposed architecture is adaptive to heterogeneous access environment which provide different access coverage areas and data rates. The result shows that our architecture achieves sufficient data rates as well as session preservation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.1
• /
• pp.24-37
• /
• 2001

This paper deals with our experience for the design and implementation of Transport and Session managers in the Integrated Streaming Service Architecture (IS SA) that was developed by the authors. The ISSA is a streaming framework that allows to develop integrated multimedia streaming applications such as VOD system in unicast/multicast and real-time broadcastOive-cast). It also facilities standard real-time transport protocols such as RTp(Real-Time Transport Protocol)/RTCP(Real-time Control Protocol) and RTSP(Real-Time Streaming ProtocoD that allows to user openness. The ISSA supports diverse media fonnats and is independent from underlying networks and operating systems, and compatible with the global real-time multimedia database system (BeeHive) so that streaming media are efficiently retrieved, stored, and serviced. The role of the Transport Manager is to do packetization and depacketization for the different types of multimedia data and delivers the packetized media data in real-time. The Transport Manager uses RTP protocol. The role of the Session Manager is to establish and control the media channel by using RTSP protocol and to deliver the database transactions for the multimedia database by using RTTP(Real-Time Transaction Protocol) protocol. Both the Transport and Session Manager are doing their functions through the network interface in the ISSA that allows developers to various network programming interfaces and provides flexibility to the system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.555-564
• /
• 2016

This paper proposes a time slot allocation scheme for military patrol environments. This proposal comes from analysis of traffic properties in a military patrol environment. In the near future, robots are expected to explore enemy grounds and measure threat, taking the place of human patrol. In order to control such robots, control messages must be extremely accurate. One mistake from the control center could cause a tragedy. Thus, high reliability must be guaranteed. Another goal is to maintain a continual flow of multimedia data sent from patrol robots. That is, QoS (Quality of Service) must be guaranteed. In order to transmit data while fulfilling both attributes, the per-path based centralized TDMA slot allocation scheme is recommended. The control center allocates slots to robots allowing synchronization among robots. Slot allocation collisions can also be avoided. The proposed scheme was verified through the ns-3 simulator. The scheme showed a higher packet delivery ratio than the algorithm in comparison. It also performed with shorter delay time in the downlink traffic transmission scenario than the algorithm in comparison.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.35 no.2
• /
• pp.129-135
• /
• 1999

The telemetry system for the current speed and direction, the underwater ambient noise and the distribution ecology of fishes was constructed by the author and his collaborator in order to product and manage effectively in shallow sea culture and setnets fisheries, and then the experiments for the telemetry system carried out at set net fishing ground located Nungpobay in Kojedo from October 1996 to June 1997. As this results, the techniques suggested in the telemetry system gave full display its function even though far away 1.5 km from transmitting part, but with the suggested telemetry system could not be ascertained relationship between physical environment and distribution ecology of fishes.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.41-47
• /
• 2009

Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.

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

Currently a number of managers exist to manage heterogeneous networks, in this situation, the NETCONF protocol for efficient network management has been proposed as a new protocol. However, the standard NETCONF protocol stack continuous improvement since the establishment but in four layers still have some problems. Especially in situations where there are multiple administrators, problems are more highlighted in operation layer. In this paper, we focus on these issues and the Operation layer has improved the efficiency and flexibility of operations among NETCONF four layers. Additionally, for the inefficiency of updates improved the device settings based on improved operation techniques. In addition, standard protocol NETCONF did not proposed content layer data structure and we propose standard technique of content layer that can generate configuration structure of devices. Improved the three techniques are applied appropriately to the NETCONF, the proposed method and the existing NETCONF was performed experiment to compare with experimental four factors. Compare key factor are four kind as maintaining the probability of network function, the reaction performance about command, the number of control packets, performance of data creation in content layer. Such factors after performing the experiment, the proposed method in this paper is superior to the existing NETCONF and there was confirmed by analysis Experimental results.