Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, LCen_US
dc.contributor.authorWang, CWen_US
dc.contributor.authorLiu, CMen_US
dc.date.accessioned2014-12-08T15:25:18Z-
dc.date.available2014-12-08T15:25:18Z-
dc.date.issued2005en_US
dc.identifier.isbn0-7803-9152-7en_US
dc.identifier.issn1090-3038en_US
dc.identifier.urihttp://hdl.handle.net/11536/17673-
dc.description.abstractThe clustering architecture is essential in achieving the goal of energy efficiency for a wireless sensor network. In general, a clustering algorithm consists of the cluster head election and the cluster member assignment mechanism. This paper proposes an adaptive contention window (ACW)-based cluster head election mechanism. Unlike other legacy cluster head election mechanisms such as LEACH (Low Energy Adaptive Clustering Hierarchy) protocol, the proposed ACW algorithm can achieve four major goals in cluster head election for wireless sensor networks: 1) high successful probability of cluster head election, 2) appropriate number of cluster heads, 3) uniform distribution of cluster heads, and, 4) equal times to be a cluster head for each sensor, simultaneously.en_US
dc.language.isoen_USen_US
dc.titleAdaptive contention window-based cluster head election mechanisms for wireless sensor networksen_US
dc.typeProceedings Paperen_US
dc.identifier.journalVTC2005-FALL: 2005 IEEE 62ND VEHICULAR TECHNOLOGY CONFERENCE, 1-4, PROCEEDINGSen_US
dc.citation.spage1819en_US
dc.citation.epage1823en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.identifier.wosnumberWOS:000235046902088-
Appears in Collections:Conferences Paper