Scheduling Algorithm of Wireless Sensor Cluster Head Based on Multi-dimensional QoS
As for the tasks of how wireless sensor network selects cluster head and how cluster head node properly schedule a number of sensor nodes, cluster head scheduling algorithm based on multi-dimensional QoS is presented. Firstly, analytic hierarchy process i
- PDF / 213,305 Bytes
- 8 Pages / 429.725 x 659.895 pts Page_size
- 92 Downloads / 148 Views
School of Computer Science and Engineering, Xi’an Technolical University, 710032, China 2 College of Marine Engineering, Northwestern Polytechnical University, 710072, China [email protected]
Abstract. As for the tasks of how wireless sensor network selects cluster head and how cluster head node properly schedule a number of sensor nodes, cluster head scheduling algorithm based on multi-dimensional QoS is presented. Firstly, analytic hierarchy process in economic field is introduced into the resource scheduling algorithm to compute every dimensional parameters weight, then the tasks is allocated to appropriate cluster head according to customer satisfaction, QoS distance and loading equilibrium, etc. Finally, scheduling algorithm is analyzed by theory example and is simulated with CloudSim tool package. The experiment shows that the scheduling algorithm not only meets customer needs for multi-dimension QoS, but shortens the tasks of sensor nodes finishing time, and greatly improves sensor resource utility rate. Keywords: wireless sensor network, resource scheduling algorithm, QoS. cluster heads, Multi-dimension QoS evaluation.
1
Introduction
In the application field of sensor network, in order to finish the task of monitor and measurement, a large number of low energy consumption sensor nodes, which have many functions such as perception, calculation and communication, are put into environments. These sensor nodes are used to perceive the happenings of events or gather data information like temperature, pressure, moisture, and etc. Then the sensors transfer the collected information to cluster head nodes or receiver nodes, particularly to those cluster head nodes with very limited resources, and try its best to finish the allotted tasks necessarily [1-3]. The traditional resource scheduling algorithms include FCFS (First Come First served) and Round-Robin algorithm. These methods can easily cause problems of task starvation and unbalanced resource, and etc[4]. Enlightening algorithm and QoS Guided Min-Min algorithm bring about problems of resource unused and task pressured crowded, and this two algorithms are not compatible with various QoS limitations. Thus, it is difficult for them to reflect dynamical heterogeneous[5-12]. A typical scheduling algorithm with the multi-dimension QoS guiding is QDDN[13]. *
Micheal Johnson.
H. Tan (Ed.): Knowledge Discovery and Data Mining, AISC 135, pp. 709–716. springerlink.com © Springer-Verlag Berlin Heidelberg 2012
710
W. Gao and F. Kang
Based only on the distance between tasks and resource to allot tasks, this algorithm does not take user’s satisfaction, loading equilibrium, etc into account so as to lead to unsatisfactory scheduling effect. For the above problems to be solved, This paper proposes the cluster head scheduling algorithm based on multi-dimensional QoS SCHSA. This algorithm can greatly reduce delay time of task transfer and prove its efficiency by theoretical example and simulation experiment.
2
QoS Parameter
This paper presents 4 QoS evaluation indexes
Data Loading...
