• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.285-298
• /
• 2009

According to the development of ubiquitous technologies, sensor networks is used in various area. In particular, medical field is one of the significant application areas using sensor networks, and recently it has come to be more important according to standardization of the body sensor networks technology. There are special characteristics of their own for medical sensor networks, which are different from the one of sensor networks for general application or environment. In this paper, we propose a hierarchical medical sensor networks structure considering own properties of medical applications, and also introduce transmission mechanism based on hierarchical structure. Our mechanism uses the priority and threshold value for medical sensor nodes considering patient's needs and health condition. Through this way Cluster head can transmit emergency data to the Base station rapidly. We also present the new key establishment mechanism based on key management mechanism which is proposed by L. Eschenauer and V. Gligor for our proposed structure and transmission mechanism. We use key provisioning for emergency nodes that have high priority based on patients' health condition. This mechanism guarantees the emergency nodes to establish the key and transmit the urgent message to the new cluster head more rapidly through preparing key establishment with key provisioning. We analyze the efficiency of our mechanism through comparing the amount of traffic and energy consumption with analysis and simulation with QualNet simulator. We also implemented our key management mechanism on TmoteSKY sensor board using TinyOS 2.0 and through this experiments we proved that the new mechanism could be actually utilized in network design.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.80-89
• /
• 2005

In IEEE 802.11 and 802.11e for ad hoc networks, DCF and EDCA use a contention-based protocol called CSMA/CA, which is simple to implement efficient when the system is light loaded. But the performance of CSMA/CA decreases dramatically when the system load is heavy because of increasing collisions. In PCF and HCF modes, stations are controlled by a base station by polling, no collision ever occurs. However, when the system load is light, the performance is poor because few stations have data to transfer. More important, PCF and HCF can not be used in the ad hoc networks. In this paper, we address a priority-based distributed polling mechanism (PDPM) that implements polling scheme into DCF or EDCA modes for ad hoc networks by adding a polling approach before every contention-based procedure. PDPM takes the advantages of polling mechanism that avoids most of collisions in a high load condition. At the same time, it also keeps the contention-based mechanism for a light loaded condition. PDPM provides quality of service (QoS) with fewer collisions and higher throughput compared with IEEE 802.11e.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.6
• /
• pp.676-688
• /
• 2014

The IEEE 802.11e EDCA (Enhanced Distributed Channel Access) mechanism has been proposed to improve the QoS (Quality of Service) of various services in WLANs (Wireless Local Area Networks). By differentiating the channel access delay depending on ACs (Access Categories), this mechanism can provide the relative service differentiation among ACs. In this paper, we consider that WLAN is deployed in medical environments to transfer medical traffic and we reveal that the quality of the medical traffic (in particular, ECG signals) is significantly deteriorated even with the service differentiation by IEEE 802.11e EDCA. Also, we analyze the reason for performance degradation and show that IEEE 802.11e EDCA has difficulty in protecting the transmission opportunity of high-priority traffic against low-priority traffic. In order to assure medical-grade QoS, we firstly define the service priority of medical traffic based on their characteristics and requirements, and then we propose the enhanced channel access scheme, referred to as DIFF-CW. The proposed scheme differentiates CW (Contention Window) depending on the service priority and modifies the channel access procedure for low-priority traffic. The simulation results confirm that the DIFF-CW scheme not only assures the QoS of medical traffic but also improves the overall channel utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.492-504
• /
• 1994

In ATM network was two QOS bearer services for flexible bandwidth assignment, various priority assignment buffer access mechanisms have been sugested. In this paper, a performance model with 3 state discrete time Markov proess in explicit priority assignment is suggested and cell loss probability is analytically derived. Also flexible space priority control mechanism with partial buffer sharing is studied and verified by simulation with OPNET.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.10
• /
• pp.1923-1928
• /
• 2010

The IEC 61850 protocol proposed for the interoperability between IEDs(intelligent electronic devices) adopts the prioritized switched ethernet as its communication channel because substation bus is utilized to exchange both real-time and non real-time messages. The prioritized switched ethernet uses IEEE 802.1Q/p QoS(Quality of Service) in addition to IEEE 802.3 ethernet to enhance the real-time characteristics. However, IEEE 802.1Q/p QoS has priority-blocking problem that occurs when higher-priority frame transmission request during lower-priority frame transmission. To resolve this problem, this paper proposes P(Preemptive)-Ethernet. P-Ethernet uses the modified IEEE 802.1Q/p frame format and new priority preemption mechanism. This paper also implements P-Ethernet controller using FPGA (Virtex-4) and MicroBlaze processor. From the implementation results, P-Ethernet controller shows a improved latency and jitter of transmission period compare to the normal ethernet controller.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.2
• /
• pp.57-71
• /
• 2023

In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2636-2656
• /
• 2013

To improve the cooperative efficiency of node cooperation and multiple access performance for multihop wireless networks, a priority-differentiated cooperative medium access control protocol with contention resolution (CRP-CMAC) is proposed. In the protocol, the helper selection process is divided into the priority differentiation phase and the contention resolution phase for the helpers with the same priority. A higher priority helper can choose an earlier minislot in the priority differentiation phase to send a busy tone. As a result, the protocol promptly selects all the highest priority helpers. The contention resolution phase of the same priority helpers consists of k round contention resolution procedures. The helpers that had sent the first busy tone and are now sending the longest busy tone can continue to the next round, and then the other helpers that sense the busy tone withdraw from the contention. Therefore, it can select the unique best helper from the highest priority helpers with high probability. A packet piggyback mechanism is also adopted to make the high data rate helper with packet to send transmit its data packets to its recipient without reservation. It can significantly decrease the reservation overhead and effectively improve the cooperation efficiency and channel utilization. Simulation results show that the maximum throughput of CRP-CMAC is 74%, 36.1% and 15% higher than those of the 802.11 DCF, CoopMACA and 2rcMAC protocols in a wireless local area network (WLAN) environment, and 82.6%, 37.6% and 46.3% higher in an ad hoc network environment, respectively.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.8
• /
• pp.2436-2448
• /
• 1996

This paper presents the development of three types of network performance manager for IEEE 802.4 token bus networks that are a part of Manufacturing Automation Protocol(MAP). The performance managers attempt to keep the average data latency below a certain level specified for each priority class. All of the three performance managers are based on a set of fuzzy rules incorporating the knowledge on the relationship between data latency and parameters of the priority mechanism. These Fuzzy Network Performance Managers(FNPMs) have been evaluated via discrete event simulation to demonstrate their efficacy.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.149-152
• /
• 2000

In the Internet, multimedia data transfer is hard to guarantee the characteristics of the Real-Time because of the Best-Effort of the nature of IP, then additional mechanism is applied to multimedia application for real-time data. In this paper, we introduce the nature of multimedia and the necessary facility for real-time protocol. We propose protocol layer, which has necessary function above mentioned and offer the end-to-end transfer far real-time data. Also, the proposed protocol perform a next low operation: 1) a required information for QoS control by using Feedback mechanism is obtained from sender, 2) divided a transferred packet by delay and loss priority. 3) recognized the low service models, and 4) decided a bandwidth and QoS according to a network state

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.55-60
• /
• 1992

The IEEE 802.4 priority mechanism can be used to handle multiple data access classes of traffic. Several timers are used to realize the priority mechanism. The performance and stability of a token bus network depend on the assignment of such timers. In this peper, we present a dynamic timer assignment algorithm for the token passing bus network. The presented algorithm has simple structure for real-time applications and adaptively controls the set of initial timer values according to the offered traffic load. The assignment of the set of timers becomes easy due to the presented algorithm. Based on the iterative algorithm, some solutions such as mean waiting time are derived.