Packet Scheduling Mechanism Research Articles

An Energy Efficient and Scalable WSN with Enhanced Data Aggregation Accuracy

This paper introduces a method that combines the K-means clustering genetic algorithm (GA) and Lempel-Ziv-Welch (LZW) compression techniques to enhance the efficiency of data aggregation in wireless sensor networks (WSNs). The main goal of this research is to reduce energy consumption, improve network scalability, and enhance data aggregation accuracy. Additionally, the GA technique is employed to optimize the cluster formation process by selecting the cluster heads, while LZW compresses aggregated data to reduce transmission overhead. To further optimize network traffic, scheduling mechanisms are introduced that contribute to packets being transmitted from sensors to cluster heads. The findings of this study will contribute to advancing packet scheduling mechanisms for data aggregation in WSNs in order to reduce the number of packets from sensors to cluster heads. Simulation results confirm the system's effectiveness compared to other compression methods and non-compression scenarios relied upon in LEACH, M-LEACH, multi-hop LEACH, and sLEACH approaches.

Effective scheduling mechanism for a mixture of 5G multimedia use cases

This paper proposes a novel mechanism to address the challenging scheduling problem which is to maximize the ultra-Reliable Low Latency Communication (uRLLC) and enhanced Mobile Broad Band (eMBB) capacity at the desired Quality of Service (QoS) in the downlink Fifth Generation (5G) network. Though some packet scheduling mechanisms that can maximize the network capacity at the desired QoS are available, they were developed for before 5G mobile communication networks. These mechanisms may not perform well in the unique 5G framework that holds distinct characteristics. Conversely, the available 5G packet scheduling mechanisms were mostly developed to maximize capacity when the network contains only one 5G multimedia use case, assumed an ideal simulation environment in the performance evaluation, considered the legacy fixed numerology of 1 ms slot length and make use of mathematical analysis to maximize the desired metrics. Extensive performance evaluations conducted via computer simulations suggest the effectiveness of the proposed mechanism. At the desired uRLLC QoS which is Packet Error Rate (PER) at 10−5 threshold, the proposed mechanism maximizes the network capacity by 52.5% over a benchmark mechanism known as Virtual Token Modified-Largest Weighted Delay First (VTM) when an equal distribution of uRLLC and eMBB users are available.

Enhancing Media Streaming in Wireless Networks using IFW-CFH Algorithm

One of the major concerns for service providers and application developer are Quality of experience (QoE), where high traffic congestion on the Internet leads to the degradation of video quality. However, the effectiveness of video transmission is minimized due to the network based on packet loss, bandwidth, and delay. Because of bandwidth limitations, the videos transmitted are obtained in low quality. Meanwhile, various outcomes such as reduction in throughput, re-buffering, or mosaic are determined in packet loss which validated the video streaming obtained in reliable or unreliable mode. Therefore this paper proposes an Improved Fuzzy Weighted queueing based Crossover Fire Hawk (IFW-CFH) algorithm for effective real-time video transmission. The objective of the IFW-CFH approach is to reduce the delay, packet loss, and bandwidth to enhance the video quality via two key mechanisms namely congestion control mechanism as well as packet scheduling mechanism. During the generation of encoded video frames, the packaged packets to the local buffer are transmitted by the scheduler using our proposed IFW-CFH algorithm. Finally, the experimentation is conducted and the results show that the proposed method minimized transmission delay, packet loss, and bandwidth by 13.8% for effective real-time video transmission compared to the existing methods.

Mining Geological Environment Monitoring and Real-Time Transmission Based on Internet of Things Technology.

A landslide monitoring technology based on BeiDouand, a wireless sensor network, is proposed in order to solve the problem that landslide has brought severe threat to people's life and safety of property. The landslide monitoring system based on the BeiDouand wireless sensor network is analyzed and designed from the point of view of hardware and software. BeiDou message and GPRS double redundancy transmission mode are adopted to improve the reliability of transmission. It also adopts the factor compression method to improve the effectiveness of BeiDoutransmission and adopts queue management and packet scheduling mechanism to improve the real-time and reliability of wireless sensor network transmission. The result is that, as the number of visible satellites increases, the efficiency of the algorithm decreases. However, the overall efficiency of the algorithm has been significantly improved. When there are 28 visible satellites, the number of algorithm times decreases from 20,475 to 1,140, and the efficiency of the algorithm increases by 16.9 times. The GDOP simulated by the fast star selection algorithm proposed in this paper is less than 3.9, reaching an excellent grade.

An energy‐efficient priority‐based packet scheduling mechanism for enhancing quality of service in mobile ad hoc network

AbstractIn today's world, a mobile ad hoc network plays a predominant role for numerous applications such as education, entertainment, emergency services, tactical services, and home applications. The performance of IEEE 802.11 based wireless ad hoc networks degrades due to high contention for the shared medium among multiple ad hoc nodes. However, the shared medium can be accessed by multiple nodes, which causes link collisions and packet drop at the link level. These kinds of packet drops have a direct impact on the overall performance of the transmission control protocol (TCP). In this article, a new robust prioritized packet scheduling with adaptive backoff window (PPSAB) mechanism has been proposed to enhance the quality of service of TCP in the wireless scenario. In order to determine the congestion in the network, the proposed PPSAB mechanism anticipates the cross‐layer parameters instead of transport layer parameters. The proposed access scheme assures minimized collisions and energy by setting the node level access to prevailing network parameters. The performance of the proposed PPSAB has been evaluated using an NS‐2 environment and the results manifest that the normalized overhead is reduced by 20% and network throughput is increased by 17% than the existing methods.

Design of a Two-Stage Scheduling Scheme for DVB-S2/S2X Satellite Architecture

One of the main characteristics of the DVB-S2/S2X standard is the capability of using the Adaptive Coding and Modulation (ACM) technique. Differently from Variable Coding and Modulation (VCM), ACM provides a feedback path in the return channel for dynamically varying protection error levels in accordance with different channel conditions. In this article, a double-layer packet scheduling mechanism able to support different QoS levels monitoring the propagation and channel conditions is proposed. It consists of a Two-Stage Scheduler (TSS) approach and proposes two novel schedulers to be used in the first and second stage: an Adaptive Priority-based Scheduling (APS) able to account QoS requirements is proposed for the first stage; an improved version of Proportional Fair queueing (PF) called PF with Padding and Packing (PF-PP), able to select and transmit in the forward link frames in accordance to an appropriate fair policy is designed for the second stage. Performed experiments show an improvement of the overall system performance in terms of packet drop rate, delay jitter, and packets delay.

A Packet Scheduling Method Based on Dynamic Adjustment of Service Priority for Electric Power Wireless Communication Network

With the development of the energy Internet, power communication services are heterogeneous, and different power communication services have different business priorities. The power communication services with different priorities have different requirements for network bandwidth and real-time performance. For traditional unified service, a scheduling method cannot meet these service requirements at the same time, and electric power communication network cannot guarantee the quality of service. Therefore, how to make full use of the time-varying characteristics of communication resources to meet the business needs of different priorities and achieve the goals of high resource utilization and transmission quality has become one of the urgent problems in the power communication network. For this reason, in order to adapt to the real-time congestion of the network, we have designed a packet scheduling method based on the dynamic adjustment of service priority, which dynamically adjusts the priority of the power service on the node; in addition, an evaluation method for the trust value of wireless forwarding nodes is introduced to improve the security of data transmission; and finally, we valuate the channel quality to establish a reasonable and efficient packet scheduling mechanism for services of different priorities. Simulation results show that this method improves the communication performance of high-priority services and improves the spectrum resource utilization of the entire system.

Enhancing the Energy-Efficiency and Timeliness of IoT Communication in WiFi Networks

Increasing the number of Internet of Things (IoT) stations or regular stations escalates downlink channel access contention and queuing delay, which in turn result in higher energy consumption and longer communication delays with IoT stations. To remedy this problem, this paper presents WiFi IoT access point (Wiotap), an enhanced WiFi access point (AP) that implements a downlink packet scheduling mechanism. In addition to assigning higher priority to IoT traffic compared to regular traffic, the scheduling algorithm computes per-packet priorities to arbitrate the contention between the transmission of IoT packets. This algorithm employs a least-laxity first (LLF) scheme that assigns priorities based on the remaining wake-up time of the destination stations. We used simulation to show the scalability of the proposed system. Our results show that Wiotap achieves 37% improvement regarding the duty cycle of IoT stations compared to a regular AP. In addition, we developed a testbed to confirm the implementation correctness and the performance benefits of Wiotap in a network with four IoT stations and regular traffic. For the edge and cloud scenarios, our empirical evaluations show up to 44% and 38% improvement in energy and 52% and 41% improvement in delay, respectively.

Adaptive downlink packet scheduling in LTE networks based on queue monitoring

The dynamic packet scheduling is a key component of LTE network to enhance the system throughput, as well as to satisfy the end users with the quality of service. However, the burst in user data traffic leads to user queue overflow at eNodeB due to resource starvation. Therefore, in this paper, queue monitoring and resource scheduling algorithms are proposed for LTE downlink transmission to reduce overflow of the user queue at eNodeB, and also to reduce the transmission time of the packet. On the other hand, this also enhances the system throughput and maintains fairness among the users. The dynamic packet scheduling mechanism first checks the queue level of user at eNodeB, channel condition of the user, resource allocation history and QoS of the packets, and then computes the priority metric of user by using these parameters. Then, using three proposed resources allocation mechanisms, the resource blocks are allocated to the users based on priority metric of user as well as queue status of user at eNodeB. The experimental results illustrate that the proposed algorithms enhance the system throughput compared to other existing schedulers. Further, it also improves packet delivery fraction and reduces the transmission time of the packets.

PSPAT: Software packet scheduling at hardware speed

Tenants in a cloud environment run services, such as Virtual Network Function instantiations, that may legitimately generate millions of packets per second. The hosting platform, hence, needs robust packet scheduling mechanisms that support these rates and, at the same time, provide isolation and dependable service guarantees under all load conditions.Current hardware or software packet scheduling solutions fail to meet all these requirements, most commonly lacking on either performance or guarantees.In this paper we propose an architecture, called PSPAT to build efficient and robust software packet schedulers suitable to high speed, highly concurrent environments. PSPAT decouples clients, scheduler and device driver through lock-free mailboxes, thus removing lock contention, providing opportunities to parallelize operation, and achieving high and dependable performance even under overload.We describe the operation of our system, discuss implementation and system issues, provide analytical bounds on the service guarantees of PSPAT, and validate the behavior of its Linux implementation even at high link utilization, comparing it with current hardware and software solutions. Our prototype can make over 28 million scheduling decisions per second, and keep latency low, even with tens of concurrent clients running on a multi-core, multi-socket system.

Cross-Layer Performance of Downlink Dynamic Cell Selection With Random Packet Scheduling and Partial CQI Feedback in Wireless Networks With Cell Sleeping

In this paper, we consider a coordinated multipoint dynamic cell selection (DCS) transmission scheme for serving sleeping cell user equipments (UEs). According to this DCS scheme, packets of UEs in a sleeping cell are randomly forwarded to the potential active base stations (BSs) by the packet serving gateway and UEs in the sleeping cell dynamically select their serving BS from these active BSs. We model the system as a fork/join (F/J) queuing system and develop a cross-layer analytical model that considers the time varying nature of the channels, channel scheduling mechanism, partial channel quality information feedback, cell selection mechanism, bursty packet arrivals, and packet scheduling mechanism. The developed analytical model can be used to measure various packet-level performance parameters, such as packet loss probability (PLP) and queuing delay while accounting for out-of-sequence packet delivery. We validate the accuracy of the developed analytical model via simulations, and we compare the performance of the DCS scheme under consideration with the conventional fixed cell selection scheme and with the state-of-the-art DCS scheme. Presented numerical results show that the DCS scheme under consideration significantly improves the PLP performance. Queuing delay performance, on the other hand, depends on the system and operating parameters.

A new concept of fairness in flow‐aware networking

SummaryWe demonstrate a new approach to assuring fairness in flow‐aware networking. Standard routine in flow‐aware networking guarantees that each flow receives the same amount of resources. This property can be exploited by dividing a single transmission into a number of flows. We propose and evaluate the per‐user fair packet scheduling mechanism, which ensures fairness among users (not flows). We also compare the new mechanism with the one already known from the literature, which is based on altering the admission control routine. Evaluation shows that the new concept of fairness provides better performance and fair resource distribution regardless of the behavior of users.

On the packet allocation of multi-band aggregation wireless networks

The use of heterogeneous networks with multiple radio access technologies (RATs) is a system concept that both academia and industry are studying. In such system, integrated use of available multiple RATs is essential to achieve beyond additive throughput and connectivity gains using multi-dimensional diversity. This paper considers an aggregation module called opportunistic multi-MAC aggregation (OMMA). It resides between the IP layer and the air interface protocol stacks, common to all RATs in the device. We present a theoretical framework for such system while considering a special case of multi-RAT systems, i.e., a multi-band wireless LAN (WLAN) system. An optimal packet distribution approach is derived which minimizes the average packet latency (the sum of queueing delay and serving delay) over multiple bands. It supports multiple user terminals with different QoS classes simultaneously. We further propose a packet scheduling algorithm, OMMA Leaky Bucket, which minimizes the packet end-to-end delay, i.e., the sum of average packet latency and average packet reordering delay. We also describe the system architecture of the proposed OMMA system, which is applicable for the general case of the multi-RAT devices. It includes functional description, discovery and association processes, and dynamic RAT update management. We finally present simulation results for a multi-band WLAN system. It shows the performance gains of the proposed OMMA Leaky Bucket scheme in comparison to other existing packet scheduling mechanisms.

A Survey of Packets Scheduling Congestion Control Algorithms in Internet Protocol Storage Area Networks

Several approaches have been proposed to empower communication systems with quality of service (QoS) capabilities. In general, their main goal is to coherently support the end-to-end performance needs of applications, based on the establishment of, and agreement on, a set of concepts, policies and mechanisms. The fiber channel is the standard technology used in storage are network communications but it does not have mechanisms for providing QOS guarantees. However the increasing use of transmission control/internet protocol based network storage has introduced the possibility of using already existing techniques and tools to achieve to achieve QOS guarantees in Internet protocol Storage Area Networks. Due to the existence of other competing traffic in internet protocol networks it is necessary to provide storage input/output traffic with guaranteed network bandwidth. This paper discusses the available packet scheduling mechanisms pin pointing their advantages and disadvantages. The main goal is to combine two packets scheduling mechanisms and come up with a hybrid that assure a given storage QOS requirement between a storage client and internet protocol storage.

A new TDD scheme and interference-aware precoding for device-to-device underlay massive MIMO

Cognitive radio sensor network is applied to facilitate network monitoring and management, and achieves high spectrum efficiencies in smart grid. However, the conventional traffic scheduling mechanisms are hard to provide guaranteed quality of service for the secondary users. It is because that they ignore the influence of diverse transition requirements in heterogeneous traffic. Therefore, a novel QoS-aware packet scheduling mechanism is proposed to improve transmission quality for secondary users. In this mechanism, a QoS-based prioritization model is established to address data classification firstly. And then, channel quality and the effect of channel switch are integrated into priority-based packet scheduling mechanism. At last, the simulation is implemented with MATLAB and OPNET. The results show that the proposed scheduling mechanism improves the transmission quality of high-priority secondary users and increase the whole system utilization by 10%.

Joint Congestion Control and Packet Scheduling in Wireless Sensor Network

Background: Congestion is the most important starting place for packet drop, escalating queuing delay, small throughput, retransmission of packets, and hence utilization of extra energy, also running down of communication resources. With the aim of surpassing this complication, Joint Congestion Control and Packet Scheduling (JCCPS) mechanism with the help of Space-Time Division Multiple Access (STDMA) is proposed in this research work. Methods: Here, an extended version which makes use of both cluster and tree based strategy is formulated. This builds a node-centric approach that makes a load balanced tree in WSNs of asymmetric structural design. Results: The proposed approach results in less congestion in the complete network, boosts the throughput and at the same time increases the packet delivery ratio (pdr) and also diminishes delay. Moreover, it also boosts network efficiency by the way of increased delivery of packets. Load balancing, network lifetime, and scalability are essential constraints for numerous data collecting sensor network applications. Furthermore, the proposed STDMA packet scheduling approach has enhanced working than the existing schedulers in accordance with the average task waiting time and end-to-end delay. Conclusion: The proposed JCCPS protocol is very effective to determine the constraints which influence the network.Keywords: Congestion Control, Clustering, Cluster Tree Topology, Load Balancing, Packet Scheduling and Congestion Control Protocol, Space-Time Division Multiple Access

Priority Scheduling for Multipath Video Transmission in WMSNS

In video data transmission over Wireless Multimedia Sensor Networks (WMSNs), in which network congestion and link failures are main characteristics, providing Quality-of-Service (QoS) is challenging. In such situation, using multipath routing protocols along with efficient packet scheduling can improve the performance of video delivery over sensor networks. In this paper we propose a new packet scheduling mechanism for multipath video transmission over WMSN. Since, different video frame types in a compressed video stream have different impact on the perceived video at the receiver; our proposed scheme for video packet scheduling is content aware that schedules transmission of different video packets over different paths. For this purpose, condition of each routing path is periodically evaluated and the high priority video packets are transmitted through high quality paths. Simulation results show that our proposed scheduling improves the quality of the perceived video at the receiver, considerably.

A packet scheduling scheme for 4G wireless access systems aiming to maximize revenue for the telecom carriers

Efficient utilization of network resources is a key goal for emerging BWAS. This is a complex goal to achieve due to the heterogeneous service nature and diverse QoS requirements of various applications that BWAS support. Packet scheduling is an important activity that affects BWAS QoS outcomes. This paper proposes a new packet scheduling mechanism that improves QoS in mobile wireless networks which exploit IP as a transport technology for data transfer between BWAS base stations and mobile users at the radio transmission layer. In order to improve BWAS QoS the new packet algorithm makes changes at both the IP and the radio layers. The new algorithm exploits handoff priority scheduling principles and takes into account buffer occupancy and channel conditions. The packet scheduling mechanism also incorporates the concept of fairness. The algorithm offers an opportunity to maximize the carriers' revenue at various traffic situations. Simulation results were compared to well-known algorithms which demonstrated the new packet scheduling algorithm is able to provide a low handoff packet drop rate, low packet forwarding rate, low packet delay, ensure fairness amongst the users of different services and generates higher revenue. Furthermore this research proposes a new and novel measure named "Satisfaction Factor" to measure the efficacy of various scheduling schemes and finally proposes four performance metrics for NodeB's of in Next Generation Wireless Networks.

Dynamic Multilevel Priority Packet Scheduling Scheme for Wireless Sensor Network

Scheduling different types of packets, such as realtime and non-real-time data packets, at sensor nodes with resource constraints in Wireless Sensor Networks (WSN) is of vital importance to reduce sensors' energy consumptions and end-to-end data transmission delays. Most of the existing packet-scheduling mechanisms of WSN use First Come First Served (FCFS), non-preemptive priority and preemptive priority scheduling algorithms. These algorithms incur a high processing overhead and long end-to-end data transmission delay due to the FCFS concept, starvation of high priority real-time data packets due to the transmission of a large data packet in nonpreemptive priority scheduling, starvation of non-real-time data packets due to the probable continuous arrival of real-time data in preemptive priority scheduling, and improper allocation of data packets to queues in multilevel queue scheduling algorithms. Moreover, these algorithms are not dynamic to the changing requirements of WSN applications since their scheduling policies are predetermined. In this paper, we propose a Dynamic Multilevel Priority (DMP) packet scheduling scheme. In the proposed scheme, each node, except those at the last level of the virtual hierarchy in the zone-based topology of WSN, has three levels of priority queues. Real-time packets are placed into the highest-priority queue and can preempt data packets in other queues. Non-real-time packets are placed into two other queues based on a certain threshold of their estimated processing time. Leaf nodes have two queues for real-time and non-real-time data packets since they do not receive data from other nodes and thus, reduce end-to-end delay. We evaluate the performance of the proposed DMP packet scheduling scheme through simulations for real-time and non-real-time data. Simulation results illustrate that the DMP packet scheduling scheme outperforms conventional schemes in terms of average data waiting time and end-to-end delay.

Downlink Packet Scheduling in LTE Cellular Networks: Key Design Issues and a Survey

Future generation cellular networks are expected to provide ubiquitous broadband access to a continuously growing number of mobile users. In this context, LTE systems represent an important milestone towards the so called 4G cellular networks. A key feature of LTE is the adoption of advanced Radio Resource Management procedures in order to increase the system performance up to the Shannon limit. Packet scheduling mechanisms, in particular, play a fundamental role, because they are responsible for choosing, with fine time and frequency resolutions, how to distribute radio resources among different stations, taking into account channel condition and QoS requirements. This goal should be accomplished by providing, at the same time, an optimal trade-off between spectral efficiency and fairness. In this context, this paper provides an overview on the key issues that arise in the design of a resource allocation algorithm for LTE networks. It is intended for a wide range of readers as it covers the topic from basics to advanced aspects. The downlink channel under frequency division duplex configuration is considered as object of our study, but most of the considerations are valid for other configurations as well. Moreover, a survey on the most recent techniques is reported, including a classification of the different approaches presented in literature. Performance comparisons of the most well-known schemes, with particular focus on QoS provisioning capabilities, are also provided for complementing the described concepts. Thus, this survey would be useful for readers interested in learning the basic concepts before going into the details of a particular scheduling strategy, as well as for researchers aiming at deepening more specific aspects.