• Title/Summary/Keyword: priority mechanism

Search Result 235, Processing Time 0.062 seconds

Wireless LAN with Medical-Grade QoS for E-Healthcare

  • Lee, Hyung-Ho;Park, Kyung-Joon;Ko, Young-Bae;Choi, Chong-Ho
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.149-159
    • /
    • 2011
  • In this paper, we study the problem of how to design a medical-grade wireless local area network (WLAN) for healthcare facilities. First, unlike the IEEE 802.11e MAC, which categorizes traffic primarily by their delay constraints, we prioritize medical applications according to their medical urgency. Second, we propose a mechanism that can guarantee absolute priority to each traffic category, which is critical for medical-grade quality of service (QoS), while the conventional 802.11e MAC only provides relative priority to each traffic category. Based on absolute priority, we focus on the performance of real-time patient monitoring applications, and derive the optimal contention window size that can significantly improve the throughput performance. Finally, for proper performance evaluation from a medical viewpoint, we introduce the weighted diagnostic distortion (WDD) as a medical QoS metric to effectively measure the medical diagnosability by extracting the main diagnostic features of medical signal. Our simulation result shows that the proposed mechanism, together with medical categorization using absolute priority, can significantly improve the medical-grade QoS performance over the conventional IEEE 802.11e MAC.

An Enhanced Transmission Mechanism for Supporting Quality of Service in Wireless Multimedia Sensor Networks

  • Cho, DongOk;Koh, JinGwang;Lee, SungKeun
    • Journal of Internet Computing and Services
    • /
    • v.18 no.6
    • /
    • pp.65-73
    • /
    • 2017
  • Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

Performance Analysis of ATM Switch Using Dynamic Priority Control Mechanisms (동적 우선순위 제어방식을 사용한 ATM 스위치의 성능분석)

  • 박원기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.855-869
    • /
    • 1997
  • In this paper, we proposed two kids of dynamic priority control mechanisms controlling the cell service ratio in order to improve the QOS(Quality of Service). We also analyse theoretically the characteristics of cell loss probability and mean cell delay time by applying the proposed priority control mechanisms to ATM switch with output buffer. The proposed priority control mechanisms have the same principles of storing cells into buffer but the different principles of serving cells from buffer. The one is the control mechanism controlling the cell service ratio according to the relative cell occupancy ratio of buffer, the other is the control mechanism controlling the cell service ratio according to both the relative cell occupancy ratio of buffer and the average arrival rate. The two service classes of our concern are the delay sensitive class and the loss sensitive class. The analytical results show that the proposed control mechanisms are able to improve the QOS, the characteristics of cell loss probability and mean cell delay time, by selecting properly the relative cell occupancy ratio of buffer and the average arrival rate. conventional DLB algorithm does not support synchronous cells, but the proposed algorithm gives higher priority to synchronous cells. To reduce synchronous cell loss rate, the synchronous cell detector is used in the proposed algorithm. Synchronous cell detector detects synchronous cells, and passes them cells to the 2nd Leaky-Bucket. So it is similar to give higher priority to synchronous cells. In this paper, the proposed algorithm used audio/video traffic modeled by On/Off and Two-state MMPP, and simulated by SLAM II package. As simulation results, the proposed algorithm gets lower synchronous cell loss rate than the conventional DLB algorithms. The improved DLB algorithm for multimedia synchronization can be extended to any other cells which require higher priority.

  • PDF

Priority Based Multi-Channel MAC Protocol for Real-Time Monitoring of Weapon Flight Test Using WSNs

  • Min, Joonki;Kim, Joo-Kyoung;Kwon, Youngmi;Lee, Yong-Jae
    • Journal of Sensor Science and Technology
    • /
    • v.22 no.1
    • /
    • pp.18-27
    • /
    • 2013
  • Real-time monitoring is one of the prime necessities in a weapon flight test that is required for the efficient and timely collection of large amounts of high-rate sampled data acquired by an event-trigger. The wireless sensor network is a good candidate to resolve this requirement, especially considering the inhospitable environment of a weapon flight test. In this paper, we propose a priority based multi-channel MAC protocol with CSMA/CA over a single radio for a real-time monitoring of a weapon flight test. Multi-channel transmissions of nodes can improve the network performance in wireless sensor networks. Our proposed MAC protocol has two operation modes: Normal mode and Priority Mode. In the normal mode, the node exploits the normal CSMA/CA mechanism. In the priority mode, the node has one of three grades - Class A, B, and C. The node uses a different CSMA/CA mechanism according to its grade that is determined by a signal level. High grade nodes can exploit more channels and lower backoff exponents than low ones, which allow high grade nodes to obtain more transmission opportunities. In addition, it can guarantee successful transmission of important data generated by high grade nodes. Simulation results show that the proposed MAC exhibits excellent performance in an event-triggered real-time application.

An Enhanced Message Priority Mechanism in IEEE 802.11p Based Vehicular Networks

  • Liu, Chang;Chung, Sang-Hwa;Jeong, Han-You;Jung, Ik-Joo
    • Journal of Information Processing Systems
    • /
    • v.11 no.3
    • /
    • pp.465-482
    • /
    • 2015
  • IEEE 802.11p is a standard MAC protocol for wireless access in vehicular environments (WAVEs). If a packet collision happens when a safety message is sent out, IEEE 802.11p chooses a random back-off counter value in a fixed-size contention window. However, depending on the random choice of back-off counter value, it is still possible that less important messages are sent out first while more important messages are delayed longer until sent out. In this paper, we present a new scheme for safety message scheduling, called the enhanced message priority mechanism (EMPM). It consists of the following two components: the benefit-value algorithm, which calculates the priority of the messages depending on the speed, deceleration, and message lifetime; and the back-off counter selection algorithm, which chooses the non-uniform back-off counter value in order to reduce the collision probability and to enhance the throughput of the highly beneficial messages. Numerical results show that the EMPM can significantly improve the throughput and delay of messages with high benefits when compared with existing MAC protocols. Consequently, the EMPM can provide better QoS support for the more important and urgent messages.

Enhancements of the Modified PCF in IEEE 802.11 WLANs

  • Kanjanavapastit Apichan;Landfeldt Bjorn
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.313-324
    • /
    • 2005
  • The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.

Hybrid Priority Medium Access Control Scheme for Wireless Body Area Networks (무선 인체통신 네트워크를 위한 복합 우선순위 MAC 기법)

  • Lee, In-Hwan;Lee, Gun-Woo;Cho, Sung-Ho;Choo, Sung-Rae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1305-1313
    • /
    • 2010
  • Last few years, wireless personal area network (WPAN) has been widely researched for various healthcare applications. Due to restriction of device hardware (e.g., energy and memory), we need to design a highly-versatile MAC layer protocol for WBAN (Wireless Body Area Network). In addition, when an emergency occurs to a patient, a priority mechanism is necessitated for a urgent message to get through to the final destination. This paper presents a priority mechanism referred to as hybrid priority MAC for WBAN. Through extensive simulation, we show the proposed MAC protocol can minimize the average packet latency for urgent data. Thus, when patients have an emergency situation, our MAC allows adequate assistance time and medical treatment for patients. The simulation based on NS-2 shows that our Hybrid Priority MAC has the good performance and usability.

-An Application of Simulated Annealing for an FMS Disatching Priority Problem (유연생산시스템의 투입우선순서결정을 위한 Simulated Anneaing의 적용)

  • 이근형;황승국;이강우
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.54
    • /
    • pp.77-85
    • /
    • 2000
  • One form of job shop scheduling problem in contemporary automated manufacturing such as flexible manufacturing systems (FMS's) is presented which we call the FMS dispatching priority problem. The FMS dispatching priority problem seeks the best dispatching priority of parts and operations, and is essentially a combinatorial optimization problem. Because of the complicated mechanism of the system, the performance of a given dispatching priority must be evaluated via simulation. Simulated annealing have been applied to the problem, and it is found that appropriate parameter setting will be desirable to get good, if not the optimal, solutions within a limited amount of time under the presence of heavy computational burden due to simulation. More specifically, experiments reveal that initial temperature is the single most important factor among other parameters and factors, and that the appropriate initial temperature depends on the allowable computer time in such a way that the less time one can afford to spend, the lower the appropriate initial temperature should be.

  • PDF

A Distributed Precedence Queue Mechanism to Assign Efficient Bandwidth in CAN Networks (CAN 네트워크상의 효율적인 대역 할당을 위한 분산 선행대기 열 기법)

  • 최호식;이장명
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.11
    • /
    • pp.1058-1064
    • /
    • 2004
  • This paper presents a distributed precedence queue mechanism to resolve unexpected transmission delay of a lower priority transaction in a CAN based system, which keeps a fixed priority in data transaction. The mechanism is implemented in the upper sub-layer of the data link layer(DLL), which is fully compatible with the original medium access control layer protocol of CAN. Thus the mechanism can be implemented dynamically while the data transactions are going on without any hardware modification. The CAN protocol was originally developed to be used in the automotive industry, and it was recently applied for a broader class of automated factories. Even though CAN is able to satisfy most of real-time requirements found in automated environments, it is not to enforce either a fair subdivision of the network bandwidth among the stations or a satisfactory distribution of the access delays in message transmission. The proposed solution provides a superset of the CAN logical link layer control, which can coexist with the older CAN applications. Through the real experiments, effectiveness of the proposed mechanism is verified.

A Dynamic Precedence Queue Mechanism to Improve Transmission Efficiency in CAN Networks

  • Yun, Jae-Mu;Choi, Ho-Seek;Lee, Jang-Myung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.761-766
    • /
    • 2005
  • This paper presents a dynamic precedence queue mechanism to resolve unexpected transmission delay of a lower priority transaction in a CAN based system which keeps a fixed priority in data transactions. The mechanism is implemented in the upper sub-layer of the data link layer (DLL), which is fully compatible with the original medium access control layer protocol of CAN. Thus the mechanism can be implemented dynamically while the data transactions are going on without any hardware modification. The CAN protocol was originally developed to be used in the automotive industry and it was recently applied for a broader class of automated factories. Even though CAN is able to satisfy most of real-time requirements found in automated environments, it is not to enforce either a fair subdivision of the network bandwidth among the stations or a satisfactory distribution of the access delays in message transmissions. The proposed solution provides a superset of the CAN logical link layer control, which can coexist with the older CAN applications. Through the real experiments, effectiveness of the proposed mechanism is verified.

  • PDF