File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이재용

Lee, Jaiyong
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 153 -
dc.citation.number 11 -
dc.citation.startPage 150 -
dc.citation.title JISUANJIKEXUE -
dc.citation.volume 35 -
dc.contributor.author Kim, Jaehyun -
dc.contributor.author Lee, Jaiyong -
dc.date.accessioned 2023-12-22T08:15:16Z -
dc.date.available 2023-12-22T08:15:16Z -
dc.date.created 2020-05-25 -
dc.date.issued 2008-11 -
dc.description.abstract We propose a multi-hop clustering scheme for topology management of wireless sensor networks using a dynamic pre-clusterhead scheme to reduce overhead in the cluster reconstruction and improve load balancing.In the proposed algorithm,a clusterhead has a weight map and threshold to hand over the role of the clusterhead to a preclusterhead with minimizing overhead and reducing reaffiliation frequency.Moreover,the optimum number of dusterheads and clusters are analyzed and taken based on the power and density of nodes.The simulation results show that our algorithm can reduce overhead cost and perform better load balancing than existing other algorithms.Consequently.the whole network lifetime will be prolonged. -
dc.identifier.bibliographicCitation JISUANJIKEXUE, v.35, no.11, pp.150 - 153 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/32240 -
dc.identifier.url https://www.airitilibrary.com/Publication/alDetailedMesh?docid=6878463 -
dc.language 영어 -
dc.title An Effective Topology Management with a Dynamic Preclusterhead Scheme for Wireless Sensor Networks -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.type.docType Article -
dc.description.journalRegisteredClass other -
dc.subject.keywordAuthor Wireless sensor network ; Load balancing ; map -

qrcode

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