• Title/Summary/Keyword: transmission priority

Search Result 311, Processing Time 0.03 seconds

A Fairness and QoS Supporting MAC(FQSM) Protocol for Wireless Sensor Networks (무선 센서 네트워크에서 공평성과 QoS를 지원하는 MAC 프로토콜)

  • Kim, Seong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.1
    • /
    • pp.191-197
    • /
    • 2012
  • In this paper we propose the FQSM(Fairness and QoS Supporting MAC) protocol that supports fairness and Quality of Service(QoS). The received or measured data traffics will be assigned a priority level according to its transmission urgency in the FQSM. And the load prediction algorithm is used to support the fairness between different priority traffics. For this, the buffer length values of the nodes are continuously monitored for a some period. Based on the buffer length variations for this period, the order of transmission is determined. FQSM also adapts cross-layer concept to rearrange the data transmission order in each sensor node's buffer, saves energy consumption by allowing few nodes in data transmission, and prolongs the network lifetime.

3D Markov chain based multi-priority path selection in the heterogeneous Internet of Things

  • Wu, Huan;Wen, Xiangming;Lu, Zhaoming;Nie, Yao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5276-5298
    • /
    • 2019
  • Internet of Things (IoT) based sensor networks have gained unprecedented popularity in recent years. With the exponential explosion of the objects (sensors and mobiles), the bandwidth and the speed of data transmission are dwarfed by the anticipated emergence of IoT. In this paper, we propose a novel heterogeneous IoT model integrated the power line communication (PLC) and WiFi network to increase the network capacity and cope with the rapid growth of the objects. We firstly propose the mean transmission delay calculation algorithm based the 3D Markov chain according to the multi-priority of the objects. Then, the attractor selection algorithm, which is based on the adaptive behavior of the biological system, is exploited. The combined the 3D Markov chain and the attractor selection model, named MASM, can select the optimal path adaptively in the heterogeneous IoT according to the environment. Furthermore, we verify that the MASM improves the transmission efficiency and reduce the transmission delay effectively. The simulation results show that the MASM is stable to changes in the environment and more applicable for the heterogeneous IoT, compared with the other algorithms.

Study on Wireless Body Area Network System Design Based on Transmission Rate (전송률을 고려한 WBAN 시스템 설계에 관한 연구)

  • Park, Joo-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.12
    • /
    • pp.121-129
    • /
    • 2012
  • In this paper, we proposed WBAN system model to management an application that requires low rate data transfer in IEEE 802.15.4. We have to use different wireless sensor network technology to transfer different date rate and emergency message in medical application service. A suitable system model for WBAN and a WBAN MAC protocol in order to solve these existing system problems are proposed. Firstly, the priority queuing was applied to contention access period, and the system model which could guarantee transmission of a MAC command frame was proposed. Secondly, the MAC frame was newly defined to use the system model which was proposed above. Thirdly, WBAN CSMA/CA back-off algorithm based on data transmission rate was proposed to enhance data throughput and transmission probability of the data frame which does not have priority in the proposed WBAN system. The proposed algorithm is designed to be variable CSMA/CA algorithm parameter, depending on data rate. For the evaluation of WBAN CSMA/CA algorithm, we used Castalia. As a result of the simulation, it is found that the proposed system model can not only relieve loads of data processing, but also probability of collision was decreased.

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.

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

Synch. RA-based Uplink Packet Transmission in OFDMA Systems (OFDMA 시스템에서 동기 RA 방식 기반의 상향링크 패킷 전송)

  • Oh, Sang-Kyu;Moon, Jin-Soo;Shin, Seok-Joo
    • Journal of Internet Computing and Services
    • /
    • v.9 no.2
    • /
    • pp.25-33
    • /
    • 2008
  • In this paper we propose uplink packet transmission scheme based on Synchronized RA. The scheme can afford to support diverse QoS required from diverse multimeda traffics. In order to minimze the collision probability occurred in contention based channel access, we assign a reservation access channel additionally to the traffic channels. Access probability function for controlling collisions occurred in the reservation access channel is applied. Through assigning different access probability to each traffic user with respect to priority issued by his required QoS, the proposed scheme guarantees minimum throughput required by higher priority users in the whole range of system load.

  • PDF

The study for improvement performance to be alteration packet type on multi-buffer scheme in wireless lan Here (초고속무선통신 기반의 멀티버퍼 패킷구조 변경에 따른 성능 향상에 관한 연구)

  • Park, Chi-Ho;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.95-102
    • /
    • 2005
  • This paper is purpose for improvement performance wireless lan of IEEE802.11a/b/g. Access point utilized a single server, multi-queuing system, FIFS system model to adapted priority multi-bufferto be alteration packet type. The main purpose of the paper improve the transmission rate and the performance of access point to settle transmission delay for load in MAC, has priority multi-buffer. We use experimentation to obtain our model of the access point and buffer-related parameters. Using our test design, we are able to extract the parameters of an analytic equation giving the average service time of a packet as a function of packer IP payload.

Efficient subcarrier allocation for OFDM transmission in multi-services application (다중 서비스 환경을 위한 효율적인 OFDM 부채널 배정 방법)

  • Lee, Jong-Hun;Song, Sang-Seop
    • Journal of Satellite, Information and Communications
    • /
    • v.1 no.1
    • /
    • pp.40-47
    • /
    • 2006
  • The next-generation mobile communication system are required to provide high-data-rate and high quality transmission over hostile radio channels. Orthogonal Frequency Division Multiplexing(OFDM) technique regarded as a most promising solution in mobile environment. This paper considers the issue of efficient subcarrier allocation for OFDM system in multi-service application. Proposed algorithm can consider channel gain of each service and divide subchannel. Proposed method considers priority of service and divide more subchannels in high priority service. When proposed algorithm compares with existent algorithm, the convergence rate improves and the calculation amount is decreased.

  • PDF

Buffer Management Algorithm for Performance Improvement in WBAN (WBAN 환경에서 성능향상을 위한 버퍼 관리 알고리즘)

  • Kim, JiWon;Kim, Kanghee;Lee, ChangHo;Choi, SangBang
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.5
    • /
    • pp.106-114
    • /
    • 2015
  • Wireless Body Area Network(WBAN) is a network standard around a human body which connects various medical sensor and devices It has to satisfy various demands such as data transmission rate, priority, and delay time. In this paper, considering a data priority and transmission delay time, is proposed to improve efficiency of WBAN service depending on congestion status of network. The proposed algorithm operates with adapted data removal probability according to data priority when the hub buffer is congested than before. And in the case of lower congestion within the hub buffer data is served considering data delay time. Through the comparison with other existing scheduling algorithms, it is confirmed that quality of WBAN service is improved due to lower data loss rate of medical data and less delay time in the proposed algorithm.