An optimal scheduling and routing under adaptive spectrum-matching framework for MIMO systems

Sindhwani, Nidhi; Bhamrah, Manjit Singh

doi:10.1080/00207217.2017.1293173

Cited by 18 publications

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Formula (11) represents the constraints of the on-demand scheduling model of routing load. The first constraints represent that after each cluster head completes the network data fusion, because there is only one communication channel between the SINK nodes, the cluster head sends the network data results sequentially to the SINK nodes; the second constraints represent that in the network tasks, the data storage capacity of each cluster head network is limited, so the total data capacity of the cluster head network can not exceed the storage capacity; the third constraint ensures that the total task in the network can be completed by all groups; and the fourth constraint ensures that the network task can be carried out in the whole network (Sindhwani and Bhamrah, 2017).…”

Section: Collecting Network Data Together and Then Reporting The Data...mentioning

confidence: 99%

Research on the on-demand scheduling algorithm of intelligent routing load based on SDN

Huang

et al. 2021

IJIPT

View full text Add to dashboard Cite

Aiming at the traditional on-demand scheduling method of routing load, there are many problems, such as long time to complete the total task and high energy consumption. An on-demand scheduling method of routing load based on multiple SINKs is proposed. The total routing load task is sent from multiple SINK nodes to SDN network. After receiving the sub-tasks sent by SINK, the intra-cluster nodes begin to collect network data together. After the cluster heads fuse the network data transmitted by the nodes, the results are sent to SINK nodes. As a result, the shortest total task completion time is obtained, and the shortest total task completion time is used as the objective function of routing load scheduling on demand. Ant colony algorithm is used to solve the problem and complete the scheduling. Experimental results show that the proposed method has shorter completion time and lower energy consumption of total task.

show abstract

Section: Collecting Network Data Together and Then Reporting The Data...mentioning

confidence: 99%

Research on the on-demand scheduling algorithm of intelligent routing load based on SDN

Huang

et al. 2021

IJIPT

View full text Add to dashboard Cite

show abstract

“…Figure 4 shows the average block error probability of existing [34] and proposed techniques with respect to varying SNR (dB) values. Here, the input modulated symbols are converted into the parallel spatial stream symbols M by the steam parser, then the symbols at the top K endured the Spatial Division Multiplexing (SDM) by the antennas N.…”

Section: Average Block Error Probabilitymentioning

confidence: 99%

A Joint Optimization Based Sub-band Expediency Scheduling Technique for MIMO Communication System

Sindhwani

Singh

2020

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

In the recent days, the multiple input multiple output (MIMO) is considered as the important technology of wireless due to its characteristics. The channel selection and scheduling plays an important roles in MIMO communication systems. For this purpose, various techniques are proposed in the traditional works, but it has some major drawbacks such as increased bit error rate, inefficient channel selection, and reduced spectral efficiency. In order to overcome these issues, this paper aims to develop a new optimization based scheduling technique for a successful MIMO communication. At first, the Rayleigh fading channel is initialized and its parameters are extracted, then the beamforming technique is used to extract the features. After that, the optimal channel is selected from the available number of channels by implementing a joint optimization (JO) technique. Consequently, the power spectral density is estimated before scheduling the channel for communication. Finally, the sub-band expediency based scheduling (SES) technique is implemented for scheduling the channel based on the priority. The novel concept of this paper are, an optimal channel is selected based on the correlation coefficient value, and the priority based channel scheduling is performed for communication. The experimental results evaluate the performance of the proposed JO-SES technique based on the measures of BET, SNR, and average sum rate. Also, some of the existing techniques are considered in this work for proving the betterment of the proposed technique.

show abstract

Enhanced fair earliest due date first scheduling strategy for multimedia applications in LTE downlink framework

Elhadad

El‐Shafai

El‐Rabaie

et al. 2020

Int J Communication

View full text Add to dashboard Cite

Summary Guaranteeing a certain delay threshold for delay‐sensitive applications in long term evolution (LTE) cellular communication system is a very challenging mission. By implementing an optimal scheduling strategy, this mission will be achieved. In this article, a novel scheduler is introduced in order to meet a predefined level of service quality by guaranteeing a specific delay threshold for delay‐sensitive applications in LTE cellular systems. The proposed scheduler assigns the available resource blocks (RBs) to active user equipments (UEs) tacking into consideration several attributes. The expiration date of each packet, the channel quality, the average data rate previously achieved by each UE, and the number of dropped packets for each UE compared with the average number of packets totally dropped are all considered in the proposed scheduler working mechanism. Consequently, the proposed scheduling strategy reduces the number of packets dropped for multimedia applications, and at the same time maximizes the overall throughput of the network. Simulation results are provided to study and evaluate the performance of the proposed scheduling strategy. A comparative study is presented between the proposed strategy and the most recent scheduling techniques. The obtained results prove that the proposed scheduling strategy has considerably acceptable and appreciated results compared with the results of the state‐of‐the‐art scheduling techniques.

show abstract

An optimal scheduling and routing under adaptive spectrum-matching framework for MIMO systems

Cited by 18 publications

References 30 publications

Research on the on-demand scheduling algorithm of intelligent routing load based on SDN

Research on the on-demand scheduling algorithm of intelligent routing load based on SDN

A Joint Optimization Based Sub-band Expediency Scheduling Technique for MIMO Communication System

Enhanced fair earliest due date first scheduling strategy for multimedia applications in LTE downlink framework

Contact Info

Product

Resources

About