完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChang, JHen_US
dc.contributor.authorJan, RHen_US
dc.date.accessioned2014-12-08T15:37:07Z-
dc.date.available2014-12-08T15:37:07Z-
dc.date.issued2005en_US
dc.identifier.isbn3-540-30807-5en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11536/25490-
dc.description.abstractCluster-based routing protocol has special advantages to enhance scalability and efficiency of the routing protocol. The technique to network clustering that maximizes the network lifetime is an important topic of research in wireless sensor networks. In this paper, we present all energy aware cluster-based routing algorithm (ECRA) for the wireless sensor networks such that the network lifetime can be maximized. ECRA randomly selects some nodes as cluster-heads to construct Voronoi diagram and rotates the intra-cluster nodes to distribute the energy load to all sensors in the network. The simulations show that ECRA algorithm outperforms than direct communication, static clustering and LEACH. The system lifetime of ECRA is approximately 2 times than LEACH. This is because the ECRA rotates intra-cluster-heads to balance the load to all nodes in the sensor networks.en_US
dc.language.isoen_USen_US
dc.titleAn energy aware, cluster-based routing algorithm for wireless sensor networksen_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.journalEMBEDDED AND UBIQUITOUS COMPUTING - EUC 2005en_US
dc.citation.volume3824en_US
dc.citation.spage255en_US
dc.citation.epage266en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000234715700025-
顯示於類別:會議論文