To overcome this problem, we proposed an improved dynamic priority scheduling algorithm based on heap sorting. The task deadline, task value, energy consumption, and other parameters were introduced.