Autor: |
Xiao-jian ZHU, Jun SHEN |
Jazyk: |
čínština |
Rok vydání: |
2013 |
Předmět: |
|
Zdroj: |
Tongxin xuebao, Vol 34, Pp 16-28 (2013) |
Druh dokumentu: |
article |
ISSN: |
1000-436X |
DOI: |
10.3969/j.issn.1000-436X.2013.06.003 |
Popis: |
For the minimum power broadcast scheduling problem where network uses sleep scheduling and each node's transmission power is continuously adjustable,a recursive approach to compute the optimal transmission scheduling of a node was firstly presented,and then a discrete particle swarm optimization algorithm to construct the minimum power broadcast scheduling was proposed.This algorithm searches for the optimal broadcast arborescence,and utilizes the greedy algorithm based on the minimization of the broadcast's power increment and the local optimization algorithm based on the heuristic adjustment of the broadcast arborescence to improve the convergence speed and the result quality.The simulation results show that the proposed algorithm is able to effectively reduce the broadcast power. |
Databáze: |
Directory of Open Access Journals |
Externí odkaz: |
|