• Title/Summary/Keyword: (m,k)-firm Algorithm

Search Result 8, Processing Time 0.027 seconds

A Guaranteed Real-time Scheduling Algorithm for (m,k)-firm Deadlines Constrained Tasks on Multiprocessors (멀티프로세서에서 (m, k)-firm Deadline 을 가지는 태스크를 위한 실시간 스케줄링 알고리즘)

  • Kong, Yeonhwa;Cho, Hyeonjoong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1529-1532
    • /
    • 2010
  • 본 논문은 동종의 멀티코어에서 (m,k)-firm Deadline 을 가지는 태스크를 위한 실시간 시스템의 스케줄링 기법을 제안한다. 본 논문에서 제안된 알고리즘의 목적은 (m, k)-firm Deadline 을 만족시키는 확률을 증가시켜 최대의 Quality of Service 를 제공하는 것이다. 본 논문에서는 제안된 알고리즘이 QoS 를 보장함을 분석적으로 보이고 실험을 통해 알고리즘의 효율성을 검증한다.

Backoff Algorithm to improve DCF functionality in IEEE 802.11 (IEEE 802.11에서 DCF 성능 향상을 위한 백오프 알고리즘)

  • Nam, Jae-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.6
    • /
    • pp.1386-1390
    • /
    • 2011
  • The IEEE 802.11 MAC uses DCF for media access among the participating network nodes. But DCF alone is neither capable nor suitable for fulfilling the QoS requirements of realtime applications. There are many ways in which QoS is provided by modifying DCF based MAC. This paper proposes (m,k)-collision scheme which is based on IEEE 802.11 and (m,k)-firm scheme tries to improve DCF functionality. The proposed scheme uses different Contention Window according to the number of collision in the node. The simulation result shows that the proposed scheme helps improve the throughput of the DCF.

Hierarchical Real-Time MAC Protocol for (m,k)-firm Stream in Wireless Sensor Networks

  • Teng, Zhang;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.2
    • /
    • pp.212-218
    • /
    • 2010
  • In wireless sensor networks (WSNs), both efficient energy management and Quality of Service (QoS) are important issues for some applications. For creating robust networks, real-time services are usually employed to satisfy the QoS requirements. In this paper, we proposed a hierarchical real-time MAC (medium access control) protocol for (m,k)-firm constraint in wireless sensor networks shortly called HRTS-MAC. The proposed HRTS-MAC protocol is based on a dynamic priority assignment by (m,k)-firm constraint. In a tree structure topology, the scheduling algorithm assigns uniform transmitting opportunities to each node. The paper also provides experimental results and comparison of the proposed protocol with E_DBP scheduling algorithm.

Extension of ReInForM Protocol for (m,k)-firm Real-time Streams in Wireless Sensor Networks

  • Li, Bijun;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.3
    • /
    • pp.231-236
    • /
    • 2012
  • For real-time wireless sensor network applications, it is essential to provide different levels of quality of service (QoS) such as reliability, low latency, and fault-tolerant traffic control. To meet these requirements, an (m,k)-firm based real-time routing protocol has been proposed in our prior work, including a novel local transmission status indicator called local DBP (L_DBP). In this paper, a fault recovery scheme for (m,k)-firm real-time streams is proposed to improve the performance of our prior work, by contributing a delay-aware forwarding candidates selection algorithm for providing restricted redundancy of packets on multipath with bounded delay in case of transmission failure. Each node can utilize the evaluated stream DBP (G_DBP) and L_DBP values as well as the deadline information of packets to dynamically define the forwarding candidate set. Simulation results show that for real-time service, it is possible to achieve both reliability and timeliness in the fault recovery process, which consequently avoids dynamic failure and guarantees meeting the end-to-end QoS requirement.

Backoff Algorithm to improve DCF functionality in IEEE 802.11 (IEEE 802.11에서 DCF 성능 향상을 위한 백오프 알고리즘)

  • Nam, Jae-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.796-798
    • /
    • 2011
  • The IEEE 802.11 MAC uses DCF for media access among the participating network nodes. But DCF alone is neither capable nor suitable for fulfilling the QoS requirements of realtime applications. There are many ways in which QoS is provided by modifying DCF based MAC. This paper proposes (m,k)-collision scheme which is based on IEEE 802.11 and (m,k)-firm scheme tries to improve DCF functionality. The proposed scheme uses different Contention Window according to the number of collision in the node. The simulation result shows that the proposed scheme helps improve the throughput of the DCF.

  • PDF

A Scheduling Algorithm for Servicing (m,k)-firm-based Request Data from RSU Using in VANETs (VANET내 RSU에서 (m,k)-firm 기반 요청 데이터 처리를 위한 스케쥴링 알고리즘)

  • Nam, Jae-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.11
    • /
    • pp.2665-2670
    • /
    • 2015
  • VANET is ad-hoc network in which vehicles are treated as node and these nodes are communicating with each other as well as RSUs on the road. In VANET, scheduling is a very important issue as the request data are to be delivered to the recipient vehicle properly and accurately. It is also critical that any request data which is sent to the vehicle is received by it in the time period for which the vehicle will be in range of RSU. RSU picks the one with the highest priority to serve based on the scheduling scheme. In this paper, we propose a scheduling algorithm to select the one with the highest priority in RSU, in which an RSU can transfer the overload requests to other RSUs. We use the modified DBP scheme to calculate the priority of request data. Simulation results show that our scheme outperforms other scheduling schemes under various conditions.

A Real-Time MAC Protocol with Extended Backoff Scheme for Wireless Sensor Networks

  • Teng, Zhang;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.3
    • /
    • pp.341-346
    • /
    • 2011
  • Wireless sensor networks (WSNs) are formed by a great quantity of sensor nodes, which are consisted of battery-powered and some tiny devices. In WSN, both efficient energy management and Quality of Service (QoS) are important issues for some applications. Real-time services are usually employed to satisfy QoS requirements in critical environment. This paper proposes a real-time MAC (Medium Access Control) protocol with extended backoff scheme for wireless sensor networks. The basic idea of the proposed protocol employs (m,k)-firm constraint scheduling which is to adjust the contention window (CW) around the optimal value for decreasing the dynamic failure and reducing collisions DBP (Distant Based Priority). In the proposed protocol, the scheduling algorithm dynamically assigns uniform transmitting opportunities to each node. Numerical results reveal the effect of the proposed backoff mechanism.

Development of a Optimal Design Program for the Helical Gear on Vehicle Transmission (자동차 트랜스미션용 헬리컬 기어의 최적 설계 프로그램 개발)

  • Shim, Jae-Yong;Kwak, Jae-Seob;Song, Ji-Bok
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.11
    • /
    • pp.88-93
    • /
    • 2000
  • Recently the gear design focuses on the optimal design to extract the design factors from the vehicle transmission that is required to equip the powerful, speedy and silent characteristics. In this study, we had determined modules($m_n$) and face widths (b) to sustain strengths of contact and bending. The pressure angle ($\alpha$) and the helix angle ($\beta$) also had been obtained from the constraint of a contact ratio ($\varepsilon) on helical gears. Through the optimal design algorithm suggested in this study, the design factors were calculated on vehicle transmission gears and those determined factors were able to firm a suitability of the design.

  • PDF