{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:44:23Z","timestamp":1777902263691,"version":"3.51.4"},"reference-count":22,"publisher":"SAGE Publications","issue":"7","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2013,7]]},"abstract":"<jats:p>In clustered sensor networks, because CHs (cluster heads) collect data from sensors and transmit the aggregated data to the sink, it is very important to elect the CHs in a secure manner. In order to protect CH elections from attackers, unpredictability, non-manipulability, and agreement property should be guaranteed in CH elections. However, existing schemes for secure CH election cannot prevent intelligent attackers from violating the properties via cooperation. In this paper, we propose a scheme that securely elects CHs by detecting intelligent attackers and excluding them. For every CH election round, each CH candidate provides reputation values to other CH candidates according to their behavior and extracts real reputation values. Then, each node evaluates the real reputation values of members in its cluster and excludes some disreputable nodes from CH candidates. The scheme greatly enhances the non-manipulability and agreement property of CH election results compared to other rival schemes. Furthermore, the scheme presents higher non-manipulability and higher agreement property than other schemes, even in an environment where message losses can occur.<\/jats:p>","DOI":"10.1177\/0037549713481012","type":"journal-article","created":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T20:52:46Z","timestamp":1364849566000},"page":"829-845","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":9,"title":["Reputation-based cluster head elections in wireless sensor networks"],"prefix":"10.1177","volume":"89","author":[{"given":"Gicheol","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Advanced KREONET Service, Korea Institute of Science and Technology Information, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gihwan","family":"Cho","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering (Cloud Open R&D Center), Chonbuk National University, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2013,4,1]]},"reference":[{"key":"bibr1-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2002.804190"},{"key":"bibr2-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2004.41"},{"key":"bibr3-0037549713481012","first-page":"1577","volume-title":"10th international conference on telecommunications (ICT\u201903)","volume":"2","author":"Gupta G"},{"key":"bibr4-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E93.D.1560"},{"key":"bibr5-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1587\/transcom.E92.B.612"},{"key":"bibr6-0037549713481012","first-page":"40","volume-title":"27th international conference on distributed computing systems (ICDCS \u201907)","author":"Liu D"},{"key":"bibr7-0037549713481012","first-page":"131","volume-title":"22nd annual computer security applications conference (ACSAC \u201906)","author":"Sun K"},{"key":"bibr8-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-010-9994-7"},{"key":"bibr9-0037549713481012","first-page":"1048","volume-title":"fifth IEEE international workshop on wireless and sensor network security (WSN \u201909)","author":"Buttyan L"},{"key":"bibr10-0037549713481012","first-page":"1","volume-title":"international symposium on modeling and optimization in mobile, ad hoc, and wireless networks (WiOpt \u201907)","author":"Sirivianos M"},{"key":"bibr11-0037549713481012","first-page":"108","volume-title":"IEEE 6th annual comm. society conference on sensor, mesh and ad hoc communications and networks (SECON \u201909)","author":"Dong Q"},{"key":"bibr12-0037549713481012","first-page":"449","volume-title":"4th IEEE international conference on networking (ICN \u201905)","volume":"3420","author":"Ferreira AC"},{"key":"bibr13-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016598314198"},{"key":"bibr14-0037549713481012","first-page":"145","volume-title":"5th IEEE international symposium on network computing and applications (NCA \u201907)","author":"Oliveira LB"},{"key":"bibr15-0037549713481012","first-page":"604","volume-title":"4th IEEE consumer communications and networking conference (CCNC \u201907)","author":"Crosby GV"},{"key":"bibr16-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"bibr17-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1177\/0037549708091643"},{"key":"bibr18-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1177\/0037549705056220"},{"key":"bibr19-0037549713481012","volume-title":"2009 spring simulation multiconference","author":"Hosseingholizadeh A","year":"2009"},{"key":"bibr20-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2010.2068044"},{"key":"bibr21-0037549713481012","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2009.4804403"},{"key":"bibr22-0037549713481012","unstructured":"The network simulator-ns-2, http:\/\/www.isi.edu\/nsnam\/ns\/. Accessed December 2012."}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549713481012","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0037549713481012","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549713481012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:24:31Z","timestamp":1777634671000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549713481012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":22,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["10.1177\/0037549713481012"],"URL":"https:\/\/doi.org\/10.1177\/0037549713481012","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,1]]}}}