• Title/Summary/Keyword: Transmission Scheduling

Search Result 357, Processing Time 0.024 seconds

Performance-based Channel Scheduler for AMC/TDM Wireless Network System (AMC/TDM 무선 데이터 통신에서의 성능보장형 채널스케줄러)

  • 이종훈;김동구
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6B
    • /
    • pp.586-592
    • /
    • 2002
  • In this paper, new channel scheduling algorithms which reduce transmission delay caused by wireless network are proposed in AMC/TDM wireless data communication. The concept of the Proposed algorithms is based on the proportional fairness, M-LWDF, and performance-guaranteeing algorithm proposed by Xin Liu. The proposed algorithm can be applied to QoS guaranteeing services as well as best-effort services. Simulation results show that new algorithm reduced transmission delay upto 11.5% in case of proportional fairness algorithm and also decreased transmission delay unto 9% in case of M-LWBF algorithm.

Simple Cell Scheduling Algorithm for Input and Output Buffered ATM Switch (입출력 버퍼형 ATM 스위치의 단순 셀 스케줄링 알고리즘)

  • Han, Man-Soo;Han, In-Tak;Lee, Beom-Cheol
    • Annual Conference of KIPS
    • /
    • 2000.10b
    • /
    • pp.1099-1102
    • /
    • 2000
  • 입출력버퍼형 스위치를 위한 간단한 셀 스케줄링 알고리즘을 제시한다. 스위치는 고속동작 및 성능 향상을 위해 이중 스위칭 플랜을 갖고 있다. 제안한 알고리즘은 각각의 스위칭 플랜에서 독립적으로 수행되며 전송요청 (request), 전송허가(grant). 전송확정 (accept)의 3 단계 동작으로 이루어져 있다. 또한 각 3 단계동작을 한 셀시간에 한 번씩만 수행하여 단위 셀시간이 작은 고속 스위칭에 적합하다. 모의실험 결과 제안한 알고리즘의 성능이 Bernoulli 트래픽 입력에 대해 출력버퍼형 스위치의 성능과 거의 동일하였다.

  • PDF

A Low Complexity Scheduling of Uplink Multiuser MIMO/FDD System (FDD 기반 상향링크 다중사용자 MIMO 시스템 상에서의 낮은 복잡도의 스케줄링 기법)

  • Cho, Sung-Yoon;Kim, Yohan;Kim, Dong-Ku
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.430-436
    • /
    • 2007
  • In this paper, we assume the uplink multiuser MIMO system based on FDD. Considering the implementation of practical system, Antenna selection and Transmit Beamforming scheme are suggested. System model of both two schemes are introduced and the scheduling algorithm which approaches the optimal performance with affordable computational complexity is proposed for each transmission scheme. Simulation results show that the sum-rate of the proposed low complexity scheduler approaches the performance of brute-force scheduler which is believed to be the optimal scheme.

  • PDF

A Scheduling Algorithm of AP for Alleviating Unfairness Property of Upstream-Downstream TCP Flows in Wireless LAN (무선 랜에서의 상.하향 TCP 플로우 공평성 제고를 위한 AP의 스케쥴링 알고리즘 연구)

  • Lim, Do-Hyun;Seok, Seung-Joon
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1521-1529
    • /
    • 2009
  • There is a serious unfairness problem between upstream and downstream flows of AP in IEEE 802.11 Wireless LAN. This problem is because Wireless LAN's DCF MAC protocol provides AP with equal channel access priority to mobile noded. Also, it makes this problem worse that the TCP's Data segment loss is more effective on throughput than the TCP's ACK segment. In this paper, we first make several simulations to analysis the unfairness in the various point of view and to find reasons of the unfairness. Also, this paper presents AP's scheduling scheme to alleviate the unfairness problem and evaluate the scheme through ns2 simulator.

  • PDF

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.

An Efficient Scheduling Algorithm for 3D-Traffic in OFDMA Systems (OFDMA 시스템에서 3D 트래픽의 효율적 전송을 위한 스케줄링 방안)

  • Kwon, Su-Jin;Chung, Young-Uk;Lee, Hyuk-Joon;Choi, Yong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.1104-1110
    • /
    • 2009
  • 3D A/V services are expected to be a representative service of next generation because it can give more realistic feeling by providing dimensions to the 2D images. In terms of transmission part of 3D A/V systems, however, it is difficult to provide these services on real-time in the wireless OFDMA networks because it has to send large amount of traffic. To address this, we proposed a novel scheduling algorithm which separates a 3D traffic into base layer and enhancement layer, and provides different priority to them. From simulation results, we can show that the proposed algorithm can improve QoS.

Playout Scheduling Method Based on Adaptive Jitter Estimation for Enhancing VoIP Speech Quality (VoIP 음질향상을 위한 적응적 지터추정 기반의 플레이아웃 스케줄링 방법)

  • Ryu, Sang-Hyeon;Kim, Hyoung-Gook
    • The Journal of the Acoustical Society of Korea
    • /
    • v.33 no.2
    • /
    • pp.133-138
    • /
    • 2014
  • Packet arrival-delay variation, so-called 'jitter' is one of the main factors that degrade the quality of voice in mobile devices at the Voice over Internet Protocol (VoIP). To resolve this issue, a playout scheduling based on adaptive jitter estimation for enhancing VoIP speech quality is proposed. The proposed algorithm copes with the effect of transmission jitter by expanding or compressing each packet according to the predicted network delay and variations. Additionally, the active network jitter estimation incorporates rapid detection of delay spikes and reacts to changes in network conditions. The experimental results have shown that the proposed algorithm delivers high voice quality in unstable network environment.

Multicast Scheduling Scheme in Dense WLAN Systems (밀집 무선랜 시스템에서의 멀티캐스트 전송 스케줄링 기법)

  • Kim, Namyeong;Kim, Wonjung;Pack, Sangheon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.3
    • /
    • pp.441-450
    • /
    • 2015
  • Nowadays, many WLAN access points (APs) are deployed in hotspot areas such as shopping malls and stations. As the number of WLAN APs deployed increases, how to manage densely deployed APs in an efficient manner becomes one of the most important issues in WLANs. In this environment, uncoordinated multicast services can lead to frequent collisions due to simultaneous transmissions among APs. In this paper, we propose a multicast scheduling algorithm that can exploit simultaneous transmissions in multiple sectors and avoid redundant transmissions in dense networks. Simulation results demonstrate that the proposed scheme can reduce the multicast transmission latency compared to comparison scheduling schemes.

Optimization of Long-term Generator Maintenance Scheduling considering Network Congestion and Equivalent Operating Hours (송전제약과 등가운전시간을 고려한 장기 예방정비계획 최적화에 관한 연구)

  • Shin, Hansol;Kim, Hyoungtae;Lee, Sungwoo;Kim, Wook
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.2
    • /
    • pp.305-314
    • /
    • 2017
  • Most of the existing researches on systemwide optimization of generator maintenance scheduling do not consider the equivalent operating hours(EOHs) mainly due to the difficulties of calculating the EOHs of the CCGTs in the large scale system. In order to estimate the EOHs not only the operating hours but also the number of start-up/shutdown during the planning period should be estimated, which requires the mathematical model to incorporate the economic dispatch model and unit commitment model. The model is inherently modelled as a large scale mixed-integer nonlinear programming problem and the computation time increases exponentially and intractable as the system size grows. To make the problem tractable, this paper proposes an EOH calculation based on demand grouping by K-means clustering algorithm. Network congestion is also considered in order to improve the accuracy of EOH calculation. This proposed method is applied to the actual Korean electricity market and compared to other existing methods.

A Novel Duty Cycle Based Cross Layer Model for Energy Efficient Routing in IWSN Based IoT Application

  • Singh, Ghanshyam;Joshi, Pallavi;Raghuvanshi, Ajay Singh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.6
    • /
    • pp.1849-1876
    • /
    • 2022
  • Wireless Sensor Network (WSN) is considered as an integral part of the Internet of Things (IoT) for collecting real-time data from the site having many applications in industry 4.0 and smart cities. The task of nodes is to sense the environment and send the relevant information over the internet. Though this task seems very straightforward but it is vulnerable to certain issues like energy consumption, delay, throughput, etc. To efficiently address these issues, this work develops a cross-layer model for the optimization between MAC and the Network layer of the OSI model for WSN. A high value of duty cycle for nodes is selected to control the delay and further enhances data transmission reliability. A node measurement prediction system based on the Kalman filter has been introduced, which uses the constraint based on covariance value to decide the scheduling scheme of the nodes. The concept of duty cycle for node scheduling is employed with a greedy data forwarding scheme. The proposed Duty Cycle-based Greedy Routing (DCGR) scheme aims to minimize the hop count, thereby mitigating the energy consumption rate. The proposed algorithm is tested using a real-world wastewater treatment dataset. The proposed method marks an 87.5% increase in the energy efficiency and reduction in the network latency by 61% when validated with other similar pre-existing schemes.