• Title/Summary/Keyword: Centralized Scheduling

Search Result 48, Processing Time 0.033 seconds

TLSA: A Two Level Scheduling Algorithm for Multiple packets Arrival in TSCH Networks

  • Asuti, Manjunath G.;Basarkod, Prabhugoud I.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.8
    • /
    • pp.3201-3223
    • /
    • 2020
  • Wireless communication has become the promising technology in the recent times because of its applications in Internet of Things( IoT) devices. The IEEE 802.15.4e has become the key technology for IoT devices which utilizes the Time-Slotted Channel Hopping (TSCH) networks for the communication between the devices. In this paper, we develop a Two Level Scheduling Algorithm (TLSA) for scheduling multiple packets with different arrival rate at the source nodes in a TSCH networks based on the link activated by a centralized scheduler. TLSA is developed by considering three types of links in a network such as link i with packets arrival type 1, link j with packets arrival type 2, link k with packets arrival type 3. For the data packets arrival, two stages in a network is considered.At the first stage, the packets are considered to be of higher priority.At the second stage, the packets are considered to be of lower priority.We introduce level 1 schedule for the packets at stage 1 and level 2 schedule for the packets at stage 2 respectively. Finally, the TLSA is validated with the two different energy functions i.e., y = eax - 1 and y = 0.5x2 using MATLAB 2017a software for the computation of average and worst ratios of the two levels.

Development of a process control package using PC (PC를 이용한 자동제어시스템 개발)

  • 구영재;이준서;이인범;장근수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.322-326
    • /
    • 1991
  • A real time process control package was developed in an INTEL 80386 based PC and MS OS/2 environment using MS-C and MS-FORTRAN. RTACS(Real Time Advanced Control System), process control computer software for distributed or centralized architectures, is a package which meets functional requirements specified for typical continuous process applications like chemical processes. The package consists of 5 parts, which are DB(data base), OCF(Operator Console Functions), CL (Control logic Library), MSM(Multitasking and Scheduling, Manager) and UAI(User Applications Interface), based upon a table and function block architecture to improve the system performance.

  • PDF

A Study on QoS Routing Performance Enhancement by using LSQR Scheduling in WiMAX Mesh Networks (와이맥스 메쉬 네트워크에서 LSQR 스케줄링을 이용한 QoS 라우팅 성능 향상에 관한 연구)

  • Tak, Wooyoung;Lee, Gowoon;Joh, Hangki;Ryoo, Intae
    • Journal of Digital Contents Society
    • /
    • v.14 no.4
    • /
    • pp.429-437
    • /
    • 2013
  • Recently, wireless mesh network has been focused as a core technology for resolving the issues of shadow zone and distributed bypass route as it has broad service coverage as well as good scalability features. It, however, provides users with relatively lower QoS than infrastructure-based networks. In order for addressing this QoS issue and also enhancing the routing performance of mobile WiMax mesh network, this paper proposes a load sensing QoS routing (LSQR) scheme. In the proposed LSQR, each node figures out network congestion status and selects a bypass route accordingly. With this scheme, we can expect good load balancing effect by changing the routing paths from centralized links to distributed links under a heavy traffic condition. From the simulation results using NS-2, it has been verified that the LSQR shows lower packet loss rates and data transmission delays than the existing representative routing schemes.

Codebook Design and Centralized Scheduling for Joint Transmission SDMA with Limited Feedback (제한된 피드백을 사용하는 결합 전송 공간 분할 다중 접속 기술을 위한 코드북 설계와 집중 스케줄링)

  • Mun, Cheol
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.10
    • /
    • pp.1180-1187
    • /
    • 2012
  • In this paper, joint transmission space division multiple access(JT-SDMA) scheme is proposed to mitigate inter-cell interference(ICI) in cooperative wireless communications system with limited feedback. We propose a systematic design method for a codebook consisting of a finite number of unitary matrices suitable for network multiple-input multiple-output( MIMO) channel characteristics. A centralized cluster scheduling scheme is proposed to both mitigate ICI and maximizes multiuser diversity gain with limited feedback. It is shown that the proposed JT-SDMA scheme outperforms a existing coordinated SDMA scheme even in wireless network environments where sufficient multiuser diversity order can not be provided through efficient ICI mitigation.

A QoS Based Multiple Access Scheme for the Wireless ATM Services (무선 ATM 서비스를 위한 QoS 기준 다중 접속 방법)

  • Yae, Byung-Ho;Lee, Sung-Chang
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.6
    • /
    • pp.36-45
    • /
    • 1998
  • This paper discusses multiple access control aspects for a wireless extension of high-speed asynchronous transfer mode(ATM) networks. One challenging requirement is that mobile systems convey of diverse types of information including voice, computer data, facsimile, and video data that have different quality of service constraints. Basically, a centralized control scheme for a coordinated multiple access is required in order to efficiently accommodate multimedia traffic on wireless links. The proposed scheme dynamically scheduling the mobile terminal, which has data to transfer according to the service, types at base station. In this scheme, the scheduling algorithm is performed on the basis of traffic descriptors and QoS parameters, which required in the connection set up phase. As a consequence, the transmission scheduling is very flexible and can account for the different traffic rate and delay constraints that emerge from voice and data integration. The simulation result shows that the proposed scheme has better performance over other scheduling algorithms.

  • PDF

Spatial Variability of Soil Moisture and Irrigation Scheduling for Upland Farming (노지 작물의 적정 관개계획을 위한 토양수분의 공간변이성 분석)

  • Choi, Yonghun;Kim, Minyoung;Kim, Youngjin;Jeon, Jonggil;Seo, Myungchul
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.58 no.5
    • /
    • pp.81-90
    • /
    • 2016
  • Due to droughts and water shortages causing severe damage to crops and other vegetations, much attention has been given to efficient irrigation for upland farming. However, little information has been known to measure soil moisture levels in a field scale and apply their spatial variability for proper irrigation scheduling. This study aimed to characterize the spatial variability and temporal stability of soil water contents at depths of 10 cm, 20 cm and 30 cm on flat (loamy soil) and hill-slope fields (silt-loamy soil). Field monitoring of soil moisture contents was used for variogram analysis using GS+ software. Kriging produced from the structural parameters of variogram was applied for the means of spatial prediction. The overall results showed that the surface soil moisture presented a strong spatial dependence at the sampling time and space in the field scale. The coefficient variation (CV) of soil moisture was within 7.0~31.3 % in a flat field and 8.3~39.4 % in a hill-slope field, which was noticeable in the dry season rather than the rainy season. The drought assessment analysis showed that only one day (Dec. 21st) was determined as dry (20.4 % and 24.5 % for flat and hill-slope fields, respectively). In contrary to a hill-slope field where the full irrigation was necessary, the centralized irrigation scheme was appeared to be more effective for a flat field based on the spatial variability of soil moisture contents. The findings of this study clearly showed that the geostatistical analysis of soil moisture contents greatly contributes to proper irrigation scheduling for water-efficient irrigation with maximal crop productivity and environmental benefits.

A centralized approach in mult-channel access scheme for single-hop WDM local area networks (단일흡 파장 분할 다중화 지역망을 위한 집중화된 방식의 다중 접근 방안)

  • 오영열;손장우;조원홍;이재용;이상배
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.4
    • /
    • pp.1035-1044
    • /
    • 1998
  • A new multi-channel access scheme and the associated network architecture for a single-hop WDM local area network is proposed in this paper. The proposed architecture has Central Scheduling Node (CSN) for the transmission coordination among many users, which is one of the key issues in single-hop WDM networks. The data channels, source nodes, and destination nodes are selected at CSN in very simple menner. Our scheme can relive the control processing overhead at all nodes in the network which is caused in existing distributed scheduling algorithms. CSN is simple in the architecture can be implemented easily. in respect to the network performance, the maximum obtainable throughput is up to that of the ideal output queuing because of collision free scheduling. We use the MQMS (multi-queue multi-server) model for performance analaysis.

  • PDF

A Distributed Scheduling Algorithm based on Deep Reinforcement Learning for Device-to-Device communication networks (단말간 직접 통신 네트워크를 위한 심층 강화학습 기반 분산적 스케쥴링 알고리즘)

  • Jeong, Moo-Woong;Kim, Lyun Woo;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1500-1506
    • /
    • 2020
  • In this paper, we study a scheduling problem based on reinforcement learning for overlay device-to-device (D2D) communication networks. Even though various technologies for D2D communication networks using Q-learning, which is one of reinforcement learning models, have been studied, Q-learning causes a tremendous complexity as the number of states and actions increases. In order to solve this problem, D2D communication technologies based on Deep Q Network (DQN) have been studied. In this paper, we thus design a DQN model by considering the characteristics of wireless communication systems, and propose a distributed scheduling scheme based on the DQN model that can reduce feedback and signaling overhead. The proposed model trains all parameters in a centralized manner, and transfers the final trained parameters to all mobiles. All mobiles individually determine their actions by using the transferred parameters. We analyze the performance of the proposed scheme by computer simulation and compare it with optimal scheme, opportunistic selection scheme and full transmission scheme.

Improved MSI Based Scheduling and Admission Control Algorithm for IEEE 802.l1e Wireless LAN (IEEE 802.l1e 무선랜에서 MSI를 이용한 개선된 스케줄링 및 수락제어 알고리즘)

  • Yang, Geun-Hyuk;Ok, Chi-Young;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.99-109
    • /
    • 2007
  • IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

Development of a Real-time Communication Service over Random Medium Access Scheme Networks

  • Choo, Young-Yeol;Kwon, Jang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.350-353
    • /
    • 2004
  • The increasing use of Ethernet-TCP/IP network in industry has led to the growing interest in its reliability in real-time applications such as automated manufacturing systems and process control systems. However, stochastic behavior of its medium access scheme makes it inadequate for time-critical applications. In order to guarantee hard real-time communication service in Ethernet-TCP/IP network, we proposed an algorithm running over TCP/IP protocol stack without modification of protocols. In this paper, we consider communication services guaranteeing deadlines of periodic real-time messages over MAC protocols that have unbounded medium access time. We propose a centralized token scheduling scheme for multiple access networks. The token is used to allow a station to transmit its message during the time amount that is appended to the token. The real-time performance of the proposed algorithm has been described.

  • PDF