The Experts below are selected from a list of 9174 Experts worldwide ranked by ideXlab platform

Tie Qiu - One of the best experts on this subject based on the ideXlab platform.

  • a data emergency aware scheduling scheme for internet of things in smart cities
    IEEE Transactions on Industrial Informatics, 2018
    Co-Authors: Tie Qiu, Kaiyu Zheng, Min Han, C Philip L Chen
    Abstract:

    With the applications of Internet of Things (IoT) for smart cities, the real-time performance for a large number of network Packets is facing serious challenge. Thus, how to improve the emergency response has become a critical issue. However, traditional Packet scheduling algorithms cannot meet the requirements of the large-scale IoT system for smart cities. To address this shortcoming, this paper proposes EARS, an efficient data-emergency-aware Packet scheduling scheme for smart cities. EARS describes the Packet emergency information with the Packet Priority and deadline. Each source node informs the destination node of the Packet emergency information before sending the Packets. The destination node determines the Packet scheduling sequence and processing sequence according to emergency information. Moreover, this paper compares EARS with a first-come, first-served, multilevel queue algorithm and a dynamic multilevel Priority Packet scheduling algorithm. Simulation results show that EARS outperforms these previous scheduling algorithms in terms of Packet loss rate, average Packet waiting time, and average Packet end-to-end delay.

  • a local optimization emergency scheduling scheme with self recovery for a smart grid
    IEEE Transactions on Industrial Informatics, 2017
    Co-Authors: Tie Qiu, Kaiyu Zheng, Houbing Song, Min Han, Burak Kantarci
    Abstract:

    With the widespread applications of Internet of Things (IoT), the emergency response performance for large-scale network Packets is facing serious challenge, especially for renewable distributed energy resources monitoring in a smart grid. Therefore, how to improve the real-time performance of the emergency data Packets has been a critical issue. Traditional Packet scheduling schemes and topology optimization strategies are not suitable for a large-scale IoT-based smart grid. To address this problem, this paper proposes a new Packet scheduling scheme named LOES, which first combines the Priority-based Packet scheduling scheme with local optimization. We exchange local geographic information to reduce the hop counts and distance between distributed source nodes and sink nodes. Each destination node determines the Packet scheduling sequence according to the received emergency information. Finally, we compare LOES with first come first serve, multilevel scheme, and dynamic multilevel Priority Packet scheduling scheme using Packet loss rate, Packet waiting time, and average Packet end-to-end delay as metrics. The simulation results show that LOES outperforms these previous scheduling schemes.

Burak Kantarci - One of the best experts on this subject based on the ideXlab platform.

  • a local optimization emergency scheduling scheme with self recovery for a smart grid
    IEEE Transactions on Industrial Informatics, 2017
    Co-Authors: Tie Qiu, Kaiyu Zheng, Houbing Song, Min Han, Burak Kantarci
    Abstract:

    With the widespread applications of Internet of Things (IoT), the emergency response performance for large-scale network Packets is facing serious challenge, especially for renewable distributed energy resources monitoring in a smart grid. Therefore, how to improve the real-time performance of the emergency data Packets has been a critical issue. Traditional Packet scheduling schemes and topology optimization strategies are not suitable for a large-scale IoT-based smart grid. To address this problem, this paper proposes a new Packet scheduling scheme named LOES, which first combines the Priority-based Packet scheduling scheme with local optimization. We exchange local geographic information to reduce the hop counts and distance between distributed source nodes and sink nodes. Each destination node determines the Packet scheduling sequence according to the received emergency information. Finally, we compare LOES with first come first serve, multilevel scheme, and dynamic multilevel Priority Packet scheduling scheme using Packet loss rate, Packet waiting time, and average Packet end-to-end delay as metrics. The simulation results show that LOES outperforms these previous scheduling schemes.

Zhen Chen - One of the best experts on this subject based on the ideXlab platform.

  • optimal Priority Packetization with multi layer uep for video streaming over wireless network
    Advances in Multimedia, 2006
    Co-Authors: Zhen Chen
    Abstract:

    Most of current Packetization schemes consider only bit error or Packet erasure, both of which are common in wireless networks. This paper addresses these two problems together, and proposes an optimal Packetization scheme for video streaming over wireless network, which is independent of video coding method. To combat the Packet erasure, Priority Packetization combined with multi-layer unequal error protection (UEP) is applied on video frames. Multi-layer UEP contains low-complexity duplication of high-Priority Packet in application layer and different retransmission limit in media access control layer. Content-aware rate-distortion optimization is also introduced in order to countermine the distortion caused by bit errors. Simulations show that our scheme gains 2.17 dB or more compared with the conventional scheme.

  • optimal Priority Packetization with multi layer uep for video streaming over wireless network
    Advances in Multimedia, 2006
    Co-Authors: Zhen Chen
    Abstract:

    Most of current Packetization schemes consider only bit error or Packet erasure, both of which are common in wireless networks. This paper addresses these two problems together, and proposes an optimal Packetization scheme for video streaming over wireless network, which is independent of video coding method. To combat the Packet erasure, Priority Packetization combined with multi-layer unequal error protection (UEP) is applied on video frames. Multi-layer UEP contains low-complexity duplication of high-Priority Packet in application layer and different retransmission limit in media access control layer. Content-aware rate-distortion optimization is also introduced in order to countermine the distortion caused by bit errors. Simulations show that our scheme gains 2.17 dB or more compared with the conventional scheme.

Tarik Taleb - One of the best experts on this subject based on the ideXlab platform.

  • dynamic multilevel Priority Packet scheduling scheme for wireless sensor network
    IEEE Transactions on Wireless Communications, 2013
    Co-Authors: Nidal Nasser, Lutful Karim, Tarik Taleb
    Abstract:

    Scheduling different types of Packets, such as real-time 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 non-preemptive 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.

Min Han - One of the best experts on this subject based on the ideXlab platform.

  • a data emergency aware scheduling scheme for internet of things in smart cities
    IEEE Transactions on Industrial Informatics, 2018
    Co-Authors: Tie Qiu, Kaiyu Zheng, Min Han, C Philip L Chen
    Abstract:

    With the applications of Internet of Things (IoT) for smart cities, the real-time performance for a large number of network Packets is facing serious challenge. Thus, how to improve the emergency response has become a critical issue. However, traditional Packet scheduling algorithms cannot meet the requirements of the large-scale IoT system for smart cities. To address this shortcoming, this paper proposes EARS, an efficient data-emergency-aware Packet scheduling scheme for smart cities. EARS describes the Packet emergency information with the Packet Priority and deadline. Each source node informs the destination node of the Packet emergency information before sending the Packets. The destination node determines the Packet scheduling sequence and processing sequence according to emergency information. Moreover, this paper compares EARS with a first-come, first-served, multilevel queue algorithm and a dynamic multilevel Priority Packet scheduling algorithm. Simulation results show that EARS outperforms these previous scheduling algorithms in terms of Packet loss rate, average Packet waiting time, and average Packet end-to-end delay.

  • a local optimization emergency scheduling scheme with self recovery for a smart grid
    IEEE Transactions on Industrial Informatics, 2017
    Co-Authors: Tie Qiu, Kaiyu Zheng, Houbing Song, Min Han, Burak Kantarci
    Abstract:

    With the widespread applications of Internet of Things (IoT), the emergency response performance for large-scale network Packets is facing serious challenge, especially for renewable distributed energy resources monitoring in a smart grid. Therefore, how to improve the real-time performance of the emergency data Packets has been a critical issue. Traditional Packet scheduling schemes and topology optimization strategies are not suitable for a large-scale IoT-based smart grid. To address this problem, this paper proposes a new Packet scheduling scheme named LOES, which first combines the Priority-based Packet scheduling scheme with local optimization. We exchange local geographic information to reduce the hop counts and distance between distributed source nodes and sink nodes. Each destination node determines the Packet scheduling sequence according to the received emergency information. Finally, we compare LOES with first come first serve, multilevel scheme, and dynamic multilevel Priority Packet scheduling scheme using Packet loss rate, Packet waiting time, and average Packet end-to-end delay as metrics. The simulation results show that LOES outperforms these previous scheduling schemes.