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.
In this paper, a new Discrete Particle Swarm Optimization (DPSO) algorithms is introduced for bi-objective no-wait flow scheduling problem, to minimize total flow time (TFT) and maximum completion time (makespan). which makes the problem into single objective by sum of weighted and discrete for no-wait flow scheduling problem. In order to improve the optimization of PSO and increase the algorithm's...
Scheduling is a fundamental component in resource (bandwidth and power) management in NG wireless networks and plays the main role in providing QoS requirements such as delay, throughput and packet loss for different classes of service in 802.16d networks. In this paper we propose a novel scheduling algorithm Strict Priority Based Adaptive modulation and Coding (SP_AMC_Based) that can grantee QoS...
Cellular base stations typically orthogonalize downlink transmissions, although this approach is not always throughput-optimal. Indeed, it can be shown that removing the orthogonality constraint (as in Superposition Coding) can provide significant benefits in some scenarios. Based on this principle, we propose a scheduling algorithm for a two-user downlink that leverages the disparity in their respective...
We consider the Downlink (DL) of a cellular relay system where in each sector, multiple users are served by one Base Station (BS) and one Relay Station (RS). We first design a scheme based on Superposition Coding (SC) that serves two users simultaneously over the same spectral resource. By superposing the messages to the two users into three layers, this scheme allows both users to benefit from the...
We investigate a relay-aided multi-cell broadcasting system using random network codes, where the focus is on devising efficient scheduling algorithms between relay and base stations. Two scheduling algorithms are proposed based on different feedback strategies; namely, a one-step scheduling algorithm with instantaneous feedback for each redundancy packet; and a multi-step scheduling algorithm with...
In this paper, we consider a scenario that data broadcasting with network coding in on-demand broadcast environment. We analyze the coding problem in on-demand broadcast and transform it into the problem of finding the maximum clique in graph theory. A novel coding strategy called AC is proposed. The performance results of our simulation show that our coding strategy is efficient at minimizing the...
The efficient scheduling of streaming data delivery in a peer-to-peer (P2P) network is a hard problem due to the Internet's lack of support for resource allocation and performance guarantees. In particular, the bandwidth resources available to a peer is constantly in flux and the future bandwidth availability is very difficult, if not impossible, to predict accurately. This work proposes to tackle...
The video applications become popular with the development of the network. Because of the complexity of the network and real-time stream video on demand, the scheduling algorithm has great influence on the QoS. In this paper, a stream video scheduling algorithm based on QoS is proposed, associated the FEC and Kalman Filter theories. According to the status of the receiver, the sending rate is adapted...
The Medium-Granular scalable (MGS) technologies in H.264/AVC-based scalable video coding (SVC) provide a flexible foundation to accommodate different network capacities. In order to make use of MGS in multiple environments conveniently, we need to obtain the Rate Distortion (R-D) function of SVC and design efficient bitstream extractions. In this paper, we proposed a simple and effective distortion...
Quality of service (QoS) differentiation is one of the keys to success for WiMAX (Worldwide Interoperability for Microwave Access) networks. Although the IEEE 802.16 standard issued some guidelines to design a QoS architecture, for the most part implementation details are left to manufacturers. Focus in this paper is on channel-aware scheduling policies to be implemented in the WiMAX Base Station...
This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET that consists of ns multicast sessions. Each multicast session has one source and p destinations. Each source sends identical information to the p destinations in its multicast session, and the information is required to be delivered to all the p destinations within D time-slots...
In our previous works, we have proposed a new approach based on genetic algorithms and the learning by injection of sequences for solving the Flexible Job-shop Scheduling Problem (FJSP). This approach was based on a joint resolution of the inherent assignment subproblem and the sequencing subproblem with total flexibility. In this paper, we develop a new strategy of learning (partial injection of...
In this paper, we propose a frame-level heuristic scheduling parallel emerging Multi-view Video Coding (MVC) using Directed Acyclic Graph (DAG) on Intel multi-core processor. We illustrate the reason to choose heuristic scheduling and formulate the problem. Through defining dependent degree and concurrent degree, we demonstrate why to choose frame as parallel granularity. Experimental results demonstrate...
Dirty paper coding scheme (DPC) is known to be a capacity achieving transmission technique in downlink multiuser MIMO channels. As a suboptimal solution to DPC, a precoding technique called successive zero-forcing dirty paper coding (SZF-DPC) has been proposed recently. The condition for the existence of the precoding matrices in SZF-DPC restricts the capability of supporting multiple users simultaneously...
Relay stations (RSs) are usually used to enhance the signal strength of the mobile stations (MSs) close to the cell boundary. However, the introduction of RSs to the cellular networks increases the interference to the MS served by the base station (BS) under spatial multiplexing mode. In this paper, we propose a method which can cancel the interference through a novel use of dirty paper coding (DPC)...
Because of the best-effort network, the QoS of video transmission can't be gotten well guarantee. With the development of network, the video applications based on Internet are growing rapidly. The real-time video applications become popular. Because of the complexity of the network and real-time stream video on demand, the scheduling algorithm has great influence on the QoS. In this paper, a scheduling...
In large storage systems, it is crucial to protect data from loss due to failures. Erasure codes lay the foundation of this protection, enabling systems to reconstruct lost data when components fail. Erasure codes can however impose significant performance overhead in two core operations: encoding, where coding information is calculated from newly written data, and decoding, where data is reconstructed...
In this paper a new permutation zone which combines adjacent and distributed subcarrier permutation is proposed for Orthogonal Frequency Division Multiple Access (OFDMA) systems. For such purpose two types of burst are defined: localized and distributed. A new resource allocation and scheduling algorithm that exploits such structure is then proposed. Furthermore, the effects of limited feedback are...
This paper presents a system level design flow which enables rapid design space exploration and a verification tool to assist a designer to identify an FPGA-based MPSoC for stream-oriented application. The case study, JPEG encoding, illustrates how the tool exploits the task-level parallelism and produces a suitable architectural design, binding and scheduling algorithm while satisfying physical constraints.
We propose two efficient scheduling algorithms for OFDMA networks based on graph theory. The algorithms overcome many drawbacks of previously proposed algorithms such as assuming a single service scenario, limiting the QoS parameters to instantaneous data rate and considering a single OFDM symbol in each scheduling decision. Also, our algorithms enable the system designer to control the tradeoff between...
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.