In recent years, wireless networks have been widely adopted in industrial applications such as monitoring and control because of their flexibility and low cost. However, wireless networks use shared medium which requi...
详细信息
In recent years, wireless networks have been widely adopted in industrial applications such as monitoring and control because of their flexibility and low cost. However, wireless networks use shared medium which require appropriate Media Access Control (MAC) protocols to manage the shared medium. Time Division Multiple Access (TDMA)-based MAC protocols, which are collision free are predominantly used in industrial networks. To achieve the stringent requirements of reliability and timeliness in industrial applications, proper scheduling of the nodes accessing the shared channel is essential. A number of TDMA scheduling algorithms have been proposed in the literature but there is no study that have analyzed and compared the algorithms to help designers of new algorithms with basic information of the existing algorithms. The objective of this study is to provide basic findings that should be used by researchers looking for TDMA scheduling algorithms for industrial applications. To achieve the objectives of this article various categories of the TDMA scheduling algorithms that have been implemented in various industrial networks mostly Industrial Wireless Sensor Network (IWSN) which is widely deployed have been presented. Comparison of the various categories of the scheduling algorithms using reliability and delay as performance metrics which are crucial in industrial applications have been done. It was noted that hybrid TDMA scheduling algorithms have improved performance compared to distributed and centralized algorithms in random networks. Designing and testing of hybrid TDMA scheduling algorithms in the emerging industrial wireless networks such as LoRaWAN are recommended future work.
Cloud computing restructured the entire world of IT by providing shared scalable resources to the organization. Cloud establishes a huge path to find the solution for many major problems found in the industry. Cloud o...
详细信息
ISBN:
(纸本)9781665487351
Cloud computing restructured the entire world of IT by providing shared scalable resources to the organization. Cloud establishes a huge path to find the solution for many major problems found in the industry. Cloud offers virtualized resources such as applications, software, networks, servers, and storage services. Cloud enables all the virtualized resources to clients on a pay-per-use basis. Because of handling the vast request sent by multiple clients and providing more versatile services to the organization, the cloud faces many critical problems such as security issues, dissatisfied Quality-Of-Services, and sometimes an unbalanced load arises. Among those, the most serious problem is balancing the load across the network. Load balancing issues can be handled by scheduling the work eventually to all nodes without overloading any single node. This paper gives an overview idea of different load balancing algorithms and provides comparative results on its quality metrics.
This paper presents an empirical performance analysis of three project scheduling algorithms dealing with maximizing projects' net present value with unrestricted resources. The selected algorithms, being the most...
详细信息
Task and resource scheduling in cloud computing remains an important topic that requires enhancement. In this paper, a hybrid task scheduling consisting of three algorithms Min-Min scheduling, Max-Min scheduling, and ...
详细信息
ISBN:
(数字)9781665472159
ISBN:
(纸本)9781665472166
Task and resource scheduling in cloud computing remains an important topic that requires enhancement. In this paper, a hybrid task scheduling consisting of three algorithms Min-Min scheduling, Max-Min scheduling, and genetic algorithm is proposed to reduce Makespan and optimize the load balances between resources. In this work genetics algorithm play a vital role by determining which tasks should schedule using the Max-Min algorithm and which ones should be scheduled using the Min-Min algorithm. The Makespan and resources utilization are two measures used to test the efficiency of the proposed work. The results obtained from the proposed work are compared with Min-Min and Max-Min scheduling algorithms, the experimental results show the best outcomes in reducing the Makespan and utilization of all available resources effectively compared with the other two algorithms.
This survey paper provides a detailed explanation of Long Term Evolution (LTE) cellular network's packet scheduling algorithms in both downlink and uplink directions. It starts by explaining the difference between...
详细信息
In typical e-commerce warehouse operations, upon receiving the orders from customers, the purchased items need to be retrieved from shelves and then packaged accordingly for delivery. To automate and speed up the item...
详细信息
In typical e-commerce warehouse operations, upon receiving the orders from customers, the purchased items need to be retrieved from shelves and then packaged accordingly for delivery. To automate and speed up the item retrieval process, a Smart Warehouse usually employs a management system, called the Automated Retrieval System (ARS), to control and schedule the retrieval jobs. The working principle of ARS is crucial to the Smart Warehouse because it will have a great impact on the subsequent downstream processes. In short, all the items in a particular order should be considered as an integral part;if one of these items encounters a much larger retrieval delay than others do, then the entire order may experience an unnecessary latency. In the past, the integrality of order has not received much attention for the parallel retrieval process of multiple stackers. To take this into account, this paper proposes using an Order Tag to label all the items that belong to the same order for retrieval job scheduling. The way of calculating the Order Tags will then determine the scheduling discipline of the ARS. With the objectives of minimizing the average delay and ensuring the fairness, two algorithms are proposed. They are named as Dynamic Order-Based (DOB) and Dynamic Order-Based with Threshold (DOBT) scheduling algorithms, respectively. Compared with the First-Come-First-Serve and other approaches, the simulation results show that DOB and DOBT are able to reduce the average order retrieval delay by at least 30%, and generate less backlog pressure to the downstream operations.
Background. Wireless links are fast becoming the key communication mode. However, as compared to the wired link, their characteristics make the traffic prone to time-and location-dependent signal attenuation, noise, f...
详细信息
Background. Wireless links are fast becoming the key communication mode. However, as compared to the wired link, their characteristics make the traffic prone to time-and location-dependent signal attenuation, noise, fading, and interference that result in time varying channel capacities and link error rate. scheduling algorithms play an important role in wireless links to guarantee quality of service (QoS) parameters such as throughput, delay, jitter, fairness and packet loss rate. The scheduler has vital importance in current as well as future cellular communications since it assigns resource block (RB) to different users for transmission. scheduling algorithm makes a decision based on the information of link state, number of sessions, reserved rates and status of the session queues. The information required by a scheduler implemented in the base station can easily be collected from the downlink transmission. Methods. This paper reflects on the importance of schedulers for future wireless communications taking LTE-A networks as a case study. It compares the performance of four well-known scheduling algorithms including round robin (RR), best channel quality indicator (BCQI), proportional fair (PF), and fractional frequency reuse (FFR). The performance of these four algorithms is evaluated in terms of throughput, fairness index, spectral efficiency and overall effectiveness. System level simulations have been performed using a MATLAB based LTE-A Vienna downlink simulator. Results. The results show that the FFR scheduler is the best performer among the four tested algorithms. It also exhibits flexibility and adaptability for radio resource assignment.
This work provides some criteria that allow network administrators to measure the impact of different network configurations have on voice, data, and video applications quality of service offered to the different user...
详细信息
ISBN:
(纸本)9781728173498
This work provides some criteria that allow network administrators to measure the impact of different network configurations have on voice, data, and video applications quality of service offered to the different users. For that, this project implemented tests to measure parameters such as packet loss, delay and jitter using static routing, different packet scheduling algorithms (Custom Queuing, Priority Queuing, and Weighted First Queuing), different services (voice, data, and video), and connection speeds using Cisco 2800 Routers and D-ITG traffic generator in conjunction with the Network Time Protocol synchronizer. A comparative analysis of sensitive parameters for Quality of Service was conducted to describe network behavior for each service. The implemented services presented performances according to quality requirements, reported in the literature. Specifically, the data service presented delay and jitter within the levels considered acceptable for this application and zero packet loss. For its part, the video service presented levels of delay and jitter according to the quality requirements for streaming. Finally, the voice service presented the best configuration performance with the Priority Queuing algorithm, for all measured service quality parameters.
The literature already shows diverse gains in the adoption of virtual reality environments, such as the possibility of safely repeating experiments without increasing the costs. However, it is unclear the advantages o...
详细信息
ISBN:
(纸本)9783030588205;9783030588199
The literature already shows diverse gains in the adoption of virtual reality environments, such as the possibility of safely repeating experiments without increasing the costs. However, it is unclear the advantages of the adoption of two-dimensional (2D) simulators in comparison to three-dimensional (3D) simulators based on virtual reality. We present a motivational analysis of a virtual reality simulator for teaching disk-scheduling algorithms for solid-state drives (SSDs). For this, we developed a fully immersive and interactive simulator. A case study was carried out with 38 students in which it compared the simulator being executed in a 2D environment (desktop) with a 3D environment (Google Cardboard). The results indicate a motivational increase in the 3D environment in some aspects.
This is the age of information. Now-a-days everyone communicates with each other by means of digital systems. Humans are always communicating with each other on the go. On-demand broadcasting is an efficient way to br...
详细信息
This is the age of information. Now-a-days everyone communicates with each other by means of digital systems. Humans are always communicating with each other on the go. On-demand broadcasting is an efficient way to broadcast information according to user requests. In an on-demand broadcasting network, anyone can satisfy multiple clients in one broadcast which helps to fulfill the enormous demand of information by clients. The optimized flow of digital data in a network through the transmission of digital evidence about messages is called network coding. The "digital evidence" is composed of two or more messages. Network coding incorporated with data scheduling algorithms can further improve the performance of on-demand broadcasting networks. Using network coding, anyone can broadcast multiple data items using single broadcast strategy which can satisfy the needs of more clients. In this work, it is described that network coding cannot always maintain its superiority over non-network coding when the system handles different sized data items. However, the causes of performance reduction on network coding have been analyzed and THETA based dynamic threshold value integration strategy has been proposed through which the network coding can overcome its limitation for handling heterogeneous data items. In the proposed strategy, THETA based dynamic threshold will control which data item will be selected from the Client Relationship graph (CR-graph) so that large sized data items cannot be encoded with small sized data items. Simulation result shows some interesting performance comparison.
暂无评论