Tree-clustered data gathering protocol (TCDGP) for wireless sensor networks

Wireless Sensor Networks (WSNs) consist of numerous low cost, low power, low volume, and short-distance transmitting nodes. As sensor nodes are deployed in a sensing field they can help people to monitor and aggregate data. Researchers also try to find more efficient ways of utilizing limited sensor...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of the Chinese Institute of Engineers Ročník 32; číslo 7; s. 1025 - 1036
Hlavní autoři: Yen, Yun-Sheng, Huang, Kai-Chun, Chao, Han-Chieh, Park, Jong Hyuk
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis Group 01.11.2009
Témata:
energy-efficient
multi-hop routing protocol
wireless sensor networks (WSNs)
ISSN:0253-3839, 2158-7299
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Wireless Sensor Networks (WSNs) consist of numerous low cost, low power, low volume, and short-distance transmitting nodes. As sensor nodes are deployed in a sensing field they can help people to monitor and aggregate data. Researchers also try to find more efficient ways of utilizing limited sensor node energy to provide longer WSN lifetime. Therefore, finding a method to reduce node data transmission energy consumption has become a very important issue. The multi-hop routing protocol is well known for power saving in data gathering. Recently, several researchers have used cluster-based (e.g., LEACH), chain-based (e.g., PEGASIS), and tree-based (e.g., TREEPSI) methods to establish energy efficient routing protocols. In this paper, we propose a tree-clustered data gathering protocol (TCDGP) to improve upon the LEACH and TREEPSI methods. This novel protocol can preserve the advantages of the LEACH and TREEPSI methods and further reduce power consumption. The simulation results show that our proposal gives better performance than other methods.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0253-3839
2158-7299
DOI:10.1080/02533839.2009.9671589