The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The paper studies a practical problem of resource assignment and optimal human resource allocation scheduling with the objective of minimizing employees' useless working time and retire some workers. We analyze simultaneous employment staff with different competencies (skills) that needed to complete jobs. Each job and worker have a set of individual parameters. The mathematical model of assignment...
In Wireless Sensors Network (WSN) the energy parameter is important. The traffic management needs a clever scheduling algorithm that can balance the energy consumption and the time slots also can be divided according to the traffic pattern. Every sensor node collects the environmental data and sends it to the coordinator. Using scheduling algorithm allows the communication process to be done in a...
This paper proposes a dynamic slot scheduling for tasks having different time constraints executed over wireless sensor networks (WSN). These tasks may have different priorities. They are usually repeated periodically. We present an algorithm which is able to provide a dynamic scheduling procedure for all tasks. In the actual version, the scheduling algorithm is executed on the network coordinator...
In this study, we propose a clustering technique based on FP-tree algorithm to group students based on the intended courses they will register for a given next semester. The goal of this clustering is to solve the problem of course's time scheduling that we encountered in previous semesters which prevented students from enrolling in some of these courses as they are being scheduled at the same time...
In this paper we explore a fundamental joint routing and scheduling problem in wireless mesh networks (WMNs) that employ time division multiple access (TDMA). The problem, referred to as the minimum cost single flow routing and scheduling (MC-SFRS) problem, deals with incremental update of transmission schedules necessitated by dynamic arrival of new flows and termination of existing flows during...
In OFDMA systems, reducing the inter-cell interference among adjacent cells is a very important issue especially for the cell-edge users. In this paper, we propose a distributed algorithm that maximizing the system total throughput considering proportional fairness. In our proposed algorithm, the frequency resources in each cell is divided into high and low power regions. The bandwidth allocations...
Self-optimization of the network, for the purposes of improving overall capacity and/or cell edge data rates, is an important objective for next generation cellular systems. We propose algorithms that automatically create efficient, soft fractional frequency reuse (FFR) patterns for enhancing performance of orthogonal frequency division multiple access (OFDMA) based cellular systems for forward link...
In this paper we study the performance of the heuristic localized gradient algorithm (HLGA) that was designed for uplink scheduling in 3G long term evolution (LTE) systems. The performance of the algorithm is examined when dynamic traffic models are assumed. With dynamic traffic, users will have different buffer occupancies. The amount of resources granted to a user need to be mapped to the size of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.