Mao Yingchi

Delay-Aware Associate Tasks Scheduling in the Cloud Computing

Cloud computing can provide the dynamic and elastic virtual resources for the users to execute the large-scale computing tasks. It has become the hot spot in the academic and industry fields. The tasks scheduling plays an important role in the Cloud computing. It should adopt the scheme to dispatch the computing tasks to the appropriate resources considering some QoS constraints, e.g., task execution time, task completion time, resource utilization, and cost. At present, the scheduling schemes should consider the associate tasks scheduling problem with some constraints in the real applications. In this paper, concerning the delay of the associated tasks scheduling in cloud computing, a structured-based hierarchical task models was discussed and the associated task scheduling algorithms based on delay-bound constraint (SAH-DB) was proposed. The scheduling scheme based on the tasks model can improve the task execution concurrency. The tasks in the parallel structure can be grouped into one task set belonging to the same task layer. Through the calculation of the total tasks execution time-bound in each task layer, the associated task was dispatched to the resources with the minimum execution time. Extensive experimental results demonstrated that the proposed SAH-DB algorithms can achieve better performance than CPM and TS-Sim algorithm in the terms of the total execution cost and resource utilization.

A design of a WSN system for pollution monitoring and positioning based on GAF routing algorithms

The background of this paper is about water quality monitoring and pollution source positioning as the main function of telemetry for large-scale drainage basins. The paper introduces wireless sensor network technology, designs and proposes an overall architecture of a hydrologic telemetry and pollution tracking and positioning system based on the public mobile communications network, and chooses network protocols based on the GAF routing algorithm. The paper emphasizes issues when the GAF algorithm is used as routing protocols in practical application of the system such as network lifecycle, pollution source positioning, limited node energy, network quality and etc., and puts forward a preliminary solution.

Notice of Violation of IEEE Publication Principles Latency optimized workload-based Query Routing Tree algorithm in Wireless Sensor Networks

Constructing an effective Query Routing Tree is the premise for continuous queries in a Wireless Sensor Networks (WSN). The query routing tree structures can provide sensors with a path to the querying nodes. At present, the data acquisition systems for WSN construct the routing structures in an ad-hoc manner, therefore, there is no guarantee that a given query workload will be distributed equally among all sensors. That leads to data collisions which represent a major source of energy waste. In addition, if the path of query routing is too long, it seriously suffers from the increased data delivery delay. The high end-to-end delay is not acceptable in the delay-constrained applications. In this paper, we present a data collection timing model for query results acquisition. Based on the timing model, we propose a delay-optimized and workload-based query routing tree construction algorithm, which balances the workload among nodes and optimizes the data delivery delay, thus reducing energy consumption and the data delivery time in the course of data acquisition. The simulation experiments from Intel Research illustrate that the proposed query routing tree algorithm can significantly reduce energy consumption under a variety of conditions and prolong the lifetime of a wireless sensor network.