In the field of structural health monitoring based on wireless sensor networks, usually using clustering routing algorithm, the structural damage identification is achieved by two structural features, natural frequencies and mode shapes. This kind of routing algorithm in specific applications needs to meet certain constraints, such as the single-hop-communication between cluster head node and each node in cluster, the overlap between different clusters and so on. To meet with the special constraints for clustering routing algorithm in structural health monitoring, this paper proposed a new method based on minimal connected cover set, which is called Enhanced Greedy Algorithm based D(v) (DEGA) routing algorithm. The DEGA method can achieve the minimum connected cover by node's own degree D(v), and can meet the structural health monitoring routing constraints. The simulation experiments on NS2 show that, DEGA algorithm to get minimum cover set performance is superior to the traditional greedy algorithm. Compared with the classic HEED clustering routing algorithm, DEGA algorithm has better energy resistance, and can be maintain a longer network lifetime.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com