Please use this identifier to cite or link to this item: https://repository.cihe.edu.hk/jspui/handle/cihe/1468
DC FieldValueLanguage
dc.contributor.authorChan, Anthony Hing-Hungen_US
dc.contributor.otherWei, D.-
dc.date.accessioned2021-08-31T04:36:10Z-
dc.date.available2021-08-31T04:36:10Z-
dc.date.issued2005-
dc.identifier.urihttps://repository.cihe.edu.hk/jspui/handle/cihe/1468-
dc.description.abstractEfficient cluster schemes play an important role in the self-organizing ad hoc wireless networks. This paper surveys and compares recent cluster schemes. We classify some of these schemes into the 3 major categories of (1) energy efficient schemes, (2) K-tree schemes, and (3) management schemes. Issues in these schemes are considered: overlaps between the clusters; clusterhead (CH) not at the center of the cluster; higher power consumption in CHs than in normal nodes; energy wasted by duplicated transmission of data. A TMDA dynamic cluster (TDC) algorithm trying to solve these problems is also proposed for ad hoc wireless sensor networks.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.titleA survey on cluster schemes in ad hoc wireless networksen_US
dc.typeconference proceedingsen_US
dc.relation.publicationProceedings of the 2nd International Conference on Mobile Technology, Applications and Systems (Mobility 2005)en_US
dc.identifier.doi10.1049/cp:20051497-
dc.contributor.affiliationSchool of Computing and Information Sciencesen_US
dc.relation.isbn9789810545734en_US
dc.description.startpage347-
dc.description.endpage354-
dc.cihe.affiliatedNo-
item.languageiso639-1en-
item.fulltextNo Fulltext-
item.openairetypeconference proceedings-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_5794-
item.cerifentitytypePublications-
crisitem.author.deptYam Pak Charitable Foundation School of Computing and Information Sciences-
crisitem.author.orcid0000-0001-7479-0787-
Appears in Collections:CIS Publication
SFX Query Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.