Dynamic Minimal Spanning Tree Routing Protocol for Large Wireless Sensor Networks

2006 ◽  
Author(s):  
Guangyan Huang ◽  
Xiaowei Li ◽  
Jing He
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Spanning Tree ◽  
Wireless Sensor ◽  
Minimal Spanning Tree ◽  
Tree Routing

DATA MINING VIA MINIMAL SPANNING TREE CLUSTERING FOR PROLONGING LIFETIME OF WIRELESS SENSOR NETWORKS

2007 ◽  
Vol 06 (02) ◽  
pp. 235-251 ◽  
Author(s):  
GUANGYAN HUANG ◽  
XIAOWEI LI ◽  
JING HE ◽  
XIN LI
Keyword(s):  
Data Mining ◽  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Spanning Tree ◽  
Base Station ◽  
Wireless Sensor ◽  
Evaluation Metrics ◽  
Minimal Spanning Tree ◽  
Clustering Methods

Clustering is applied in wireless sensor networks for increasing energy efficiency. Clustering methods in wireless sensor networks are different from those in traditional data mining systems. This paper proposes a novel clustering algorithm based on Minimal Spanning Tree (MST) and Maximum Energy resource on sensors named MSTME. Also, specified constrains of clustering in wireless sensor networks and several evaluation metrics are given. MSTME performs better than already known clustering methods of Low Energy Adaptive Clustering Hierarchy (LEACH) and Base Station Controlled Dynamic Clustering Protocol (BCDCP) in wireless sensor networks when they are evaluated by these evaluation metrics. Simulation results show MSTME increases energy efficiency and network lifetime compared with LEACH and BCDCP in two-hop and multi-hop networks, respectively.

Sign in / Sign up

Export Citation Format

Share Document