• Title/Summary/Keyword: Wireless packet scheduling

Search Result 120, Processing Time 0.026 seconds

A QoS-aware Adaptive Coloring Scheduling Algorithm for Co-located WBANs

  • Wang, Jingxian;Sun, Yongmei;Luo, Shuyun;Ji, Yuefeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5800-5818
    • /
    • 2018
  • Interference may occur when several co-located wireless body area networks (WBANs) share the same channel simultaneously, which is compressed by resource scheduling generally. In this paper, a QoS-aware Adaptive Coloring (QAC) scheduling algorithm is proposed, which contains two components: interference sets determination and time slots assignment. The highlight of QAC is to determine the interference graph based on the relay scheme and adapted to the network QoS by multi-coloring approach. However, the frequent resource assignment brings in extra energy consumption and packet loss. Thus we come up with a launch condition for the QAC scheduling algorithm, that is if the interference duration is longer than a threshold predetermined, time slots rescheduling is activated. Furthermore, based on the relative distance and moving speed between WBANs, a prediction model for interference duration is proposed. The simulation results show that compared with the state-of-the-art approaches, the QAC scheduling algorithm has better performance in terms of network capacity, average delay and resource utility.

Adaptive Delay Threshold-based Priority Queueing Scheme for Packet Scheduling in Mobile Broadband Wireless Access System (광대역 이동 액세스 시스템에서의 실시간 및 비실시간 통합 서비스 지원을 위한 적응적 임계값 기반 패킷 스케줄링 기법)

  • Ku, Jin-Mo;Kim, Sung-Kyung;Kim, Tae-Wan;Kim, Jae-Hoon;Kang, Chung-G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3A
    • /
    • pp.261-270
    • /
    • 2007
  • The Delay Threshold-based Priority Queueing (DTPQ) scheme has been shown useful for scheduling both real-time (RT) and non-real-time (NRT) service traffic in mobile broadband wireless access (MBWA) systems. The overall system capacity can be maximized subject to their QoS requirement by the DTPQ scheme, which takes the urgency of the RT service into account only when their head-of-line (HOL) packet delays exceed a given delay threshold. In practice, the optimum delay threshold must be configured under the varying service scenarios and a corresponding traffic load, e.g., the number of RT and NRTusers in the system. In this paper, we propose an adaptive version of DTPQ scheme, which updates the delay threshold by taking the urgency and channel conditions of RT service users into account. By evaluating the proposed approach in an orthogonal frequency division multiple access/time division duplex (OFDM/TDD)-based broadband mobile access system, it has been found that our adaptive scheme significantly improves the system capacity as compared to the existing DTPQ scheme with a fixed delay threshold.

A Design of DiffServ Supporting Scheduler for uplink traffics in TDD/CDMA Networks (TDD/CDMA망에서의 업링크 트래픽을 위한 DiffServ 지원 스케줄러 설계)

  • Zang, Seog-Ku;Kim, Young-Han
    • The KIPS Transactions:PartC
    • /
    • v.12C no.5 s.101
    • /
    • pp.717-724
    • /
    • 2005
  • In this paper, we Propose an efficient scheduler well suited for the next-generation wireless networks that can support multimedia traffic having various requirements. The scheduler is designed to provide each of multimedia classes with differentiated services. In particular, the scheduler is intended to maximize throughput and minimize packet loss ratio. To apply the scheduler, we suppose that the wireless network is based on TDD/CDMA system The scheduler assigns a packet in a dedicated uplink-slot to the user within a frame to operate scheduling of packets transmitted by the users belonging to the specific class in an efficient manner. Such a manner also enables the scheduler to meet different QoS requirements. The paper also includes performance comparison with other schemes and analysis of the proposed scheduling algorithm by using simulation. We also analyze the proposed scheme by using simulation. The simulation compares the proposed scheduling algerian with previously proposed schemes in terms of the performance.

A Traffic Adaptive MAC Scheduling for Bluetooth with Maximized throughput and Guaranteed fairness

  • Kim Tae suk;Choi Sung-Gi;Kim Sehun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.418-425
    • /
    • 2002
  • Bluetooth is an emerging technology expected to provide users with short range, low cost, pico-cellular wireless connectivity. The access to the medium for Bluetooth is based on a Master driven Time Division Duplexing (TDD) scheme. A slave transmits packets in the reverse slot only after the master polls the slave (or transmits a packet to the slave) in a forward slot. The master transmits packets to a slave in even slots while the slave transmits packets to the master in an odd slot. The way in which the master schedules packets transmission to slaves or polls them determines system performance. In this paper. we propose a traffic adaptive MAC scheduling scheme for Bluetooth. The proposed scheme adopts the ISAR (Intelligent Segmentation and Reassembly) policy, which adjusts the packet size to the traffic patterns, to adapt the polling frequency to the traffic conditions. Also for achieving fairness among master-slave connections our scheme includes a priority policy assinging prioritised service tlimes to each connection. By considering a scenario where a Bluetooth master is used as wireless access point to the Internet, we show that our scheme improve the system throughput and average queue delay with regard to a naive Round Robin (RR) scheme.

  • PDF

An Exposed-Terminal-Eliminated Dual-Channel MAC Protocol for Exploiting Concurrent Transmissions in Multihop Wireless Networks

  • Liu, Kai;Zhang, Yupeng;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.778-798
    • /
    • 2014
  • This paper proposes a novel exposed-terminal-eliminated medium access control (ETE-MAC) protocol by combining channel reservation, collision avoidance and concurrent transmissions to improve multi-access performance of the multihop wireless networks. Based on the proposed slot scheduling scheme, each node senses the control channel (CCH) or the data channel (DCH) to accurately determine whether it can send or receive the corresponding packets without collisions. Slot reservation on the CCH can be simultaneously executed with data packet transmissions on the DCH. Therefore, it resolves the hidden-terminal type and the exposed-terminal type problems efficiently, and obtains more spatial reuse of channel resources. Concurrent packet transmissions without extra network overheads are maximized. An analytical model combining Markov model and M/G/1 queuing theory is proposed to analyze its performance. The performance comparison between analysis and simulation shows that the analytical model is highly accurate. Finally, simulation results show that, the proposed protocol obviously outperforms the link-directionality-based dual-channel MAC protocol (DCP) and WiFlex in terms of the network throughput and the average packet delay.

Effective Packet Transmission Scheme in Multirate WLAN (다중 전송률 지원 무선랜에서 효율적인 패킷 전송 기법)

  • Kim, Nam-Gi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2A
    • /
    • pp.168-175
    • /
    • 2006
  • To cope with channel variation, wireless networks such as IEEE 802.11 WLAN provide multiple transmission rates by employing different channel modulation and coding schemes. However, the coexistence of different transmission rates degrades the total system performance of the network. In order to eliminate this performance abnormality and improve protocol capacity, we propose a new Packet transmission algorithm, the RAT(Rate-Adapted Transmission) scheme. The RAT scheme distributes the wireless channel fairly based on the channel occupancy time. Moreover, it efficiently transmits packets even in a single station using rate-based queue management. Therefore, the RAT scheme obtains not only the inter-rate contention gain among stations but also the intra-rate contention gain among connections in a single station.

A study on a packet scheduler for wireless access networks (무선 가입자 액세스 망에서 QoS 패킷 스케줄러에 관한 연구)

  • Jang Jae Shin;Choi Jin Seek;Kwak Dong Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1380-1386
    • /
    • 2004
  • Future communication networks would consist of wired and wireless access networks where there would be various types of traffic services. To meet the QoS requirements of those various traffic services simultaneously, new QoS control schemes are required. Since they are simple to deploy, cheep to manage, and easy to support subscriber mobility, wireless access networks are considered here. In this paper, a wireless joint buffer management and scheduling (W-JoBS) scheme, which is a modified version of the original JoBS algorithm at error-prone wireless access networks, is proposed. W-JoBS scheme is for providing service fairness among traffic classes with service compensation and channel-state dependent packet scheduling schemes. With computer simulation, this proposed W-JoBS scheme is evaluated and the performance of W-JoBS is compared with that of the original JoBS.

A Wireless Sink Congestion Control by Tournament Scheduling (토너먼트 스케줄링을 이용한 무선싱크 혼잡제어)

  • Lee, Chong-Deuk
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.4
    • /
    • pp.641-648
    • /
    • 2012
  • The up-streams of the continuous streaming of data packets with lower importance level in the wireless sink node can cause congestion and delay, they affect on energy efficiency, memory size, buffer size, and throughput. This paper proposes a new wireless sink congestion control mechanism based on tournament scheduling. The proposed method consists of two module parts: stream decision module part and service differentiation module part. The final winner in the tournament controls congestion effectively, minimizes packet loss due to congestion, decreases energy consumption, and improves QoS. The simulation result shows that the proposed method is more effective and has better performance compared with those of congestion descriptor-based control method, reliability-based control method, and best-effort transmission control method.