File(s) under permanent embargo
Dynamic minimal spanning tree routing protocol for large wireless sensor networks
conference contribution
posted on 2006-01-01, 00:00 authored by Guangyan HuangGuangyan Huang, X Li, J HeHundreds or thousands of wireless sensor nodes with limited energy resource are randomly scattered in the observation fields to extract the data messages for users. Because their energy resource cannot be recharged, energy efficiency becomes one of the most important problems. LEACH is an energy efficient protocol by grouping nodes into clusters and using cluster heads (CH) to fuse data before transmitting to the base station (BS). BCDCP improves LEACH by introducing a minimal spanning tree (MST) to connect CHs and adopting iterative cluster splitting algorithm to choose CHs or form clusters. This paper proposes another innovative cluster-based routing protocol named dynamic minimal spanning tree routing protocol (DMSTRP), which improves BCDCP by introducing MSTs instead of clubs to connect nodes in clusters. Simulation results show that DMSTRP excels LEACH and BCDCP in terms of both network lifetime and delay when the network size becomes large.
History
Event
IEEE Conference on Industrial Electronics and Applications (1st : 2006 : Singapore)Volume
1Pagination
1669 - 1673Publisher
IEEELocation
SingaporePlace of publication
Piscataway, N.J.Publisher DOI
Start date
2006-05-24End date
2006-05-26ISBN-10
078039514XLanguage
engPublication classification
E Conference publication; E1.1 Full written paper - refereedCopyright notice
2006, IEEETitle of proceedings
ICIEA 2006: Proceedings of the 1st IEEE Conference on Industrial Electronics and ApplicationsUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC