Cost- and reward-based clustering for wireless sensor networks: A performance tradeoff
In wireless sensor networks, energy conservation is one of the main issues since sensor nodes have limited energy source. Clustering came as an effort to reduce the energy consumption of sensor nodes. Besides energy conservation, the sensor nodes should also deliver their data to the sink effectivel...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 425 |
---|---|
container_issue | |
container_start_page | 421 |
container_title | |
container_volume | |
creator | Salim, Shelly Xiang Li Moh, Sangman |
description | In wireless sensor networks, energy conservation is one of the main issues since sensor nodes have limited energy source. Clustering came as an effort to reduce the energy consumption of sensor nodes. Besides energy conservation, the sensor nodes should also deliver their data to the sink effectively. In this paper, a cost- and reward-based clustering (CORE) algorithm using game theory is proposed. In the cluster head selection, CORE considers the cost and reward of being a cluster head. The proposed CORE gives a performance tradeoff between energy consumption and the amount of data sent to the sink. Note that the energy consumption determines network lifetime. As a result, CORE is between probability-based clustering and clustered routing of selfish sensors (CROSS) with regard to performance. |
doi_str_mv | 10.1109/WOCC.2013.6676404 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6676404</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6676404</ieee_id><sourcerecordid>6676404</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-e16ed0b63c97d97ba5f6cfe939dab5c2f6e9497da69140876e93a21d97a4cdf3</originalsourceid><addsrcrecordid>eNo9kM9KxDAYxKMouKx9APGSF0jNv35pvC1FV2FhL4selzT5ItXddkkqxbe34OJpfsMMcxhC7gQvheD24X3bNKXkQpUABjTXF6SwphYajKpgpkuykMpYJqSBq3-G-oYUOX9yzoUBqCQsyFsz5JFR1weacHIpsNZlDNQfvvOIqes_aBwSnbqEB8yZZuzz7HscpyF95Ue6oidMc-Xoeo90TC7gEOMtuY7ukLE465Lsnp92zQvbbNevzWrDOmGqkaEADLwF5a0J1rSuiuAjWmWDaysvI6DVc-TACs1rM1vlpJirTvsQ1ZLc_812iLg_pe7o0s_-fIr6BbdLVPI</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Cost- and reward-based clustering for wireless sensor networks: A performance tradeoff</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Salim, Shelly ; Xiang Li ; Moh, Sangman</creator><creatorcontrib>Salim, Shelly ; Xiang Li ; Moh, Sangman</creatorcontrib><description>In wireless sensor networks, energy conservation is one of the main issues since sensor nodes have limited energy source. Clustering came as an effort to reduce the energy consumption of sensor nodes. Besides energy conservation, the sensor nodes should also deliver their data to the sink effectively. In this paper, a cost- and reward-based clustering (CORE) algorithm using game theory is proposed. In the cluster head selection, CORE considers the cost and reward of being a cluster head. The proposed CORE gives a performance tradeoff between energy consumption and the amount of data sent to the sink. Note that the energy consumption determines network lifetime. As a result, CORE is between probability-based clustering and clustered routing of selfish sensors (CROSS) with regard to performance.</description><identifier>ISSN: 2379-1268</identifier><identifier>EISSN: 2379-1276</identifier><identifier>EISBN: 9781467356978</identifier><identifier>EISBN: 9781467356992</identifier><identifier>EISBN: 1467356972</identifier><identifier>EISBN: 1467356999</identifier><identifier>DOI: 10.1109/WOCC.2013.6676404</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ad hoc networks ; cluster head selection ; clustering ; Clustering methods ; Energy conservation ; Energy consumption ; Game theory ; Games ; performance tradeoff ; Wireless sensor network ; Wireless sensor networks</subject><ispartof>2013 22nd Wireless and Optical Communication Conference, 2013, p.421-425</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6676404$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6676404$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Salim, Shelly</creatorcontrib><creatorcontrib>Xiang Li</creatorcontrib><creatorcontrib>Moh, Sangman</creatorcontrib><title>Cost- and reward-based clustering for wireless sensor networks: A performance tradeoff</title><title>2013 22nd Wireless and Optical Communication Conference</title><addtitle>WOCC</addtitle><description>In wireless sensor networks, energy conservation is one of the main issues since sensor nodes have limited energy source. Clustering came as an effort to reduce the energy consumption of sensor nodes. Besides energy conservation, the sensor nodes should also deliver their data to the sink effectively. In this paper, a cost- and reward-based clustering (CORE) algorithm using game theory is proposed. In the cluster head selection, CORE considers the cost and reward of being a cluster head. The proposed CORE gives a performance tradeoff between energy consumption and the amount of data sent to the sink. Note that the energy consumption determines network lifetime. As a result, CORE is between probability-based clustering and clustered routing of selfish sensors (CROSS) with regard to performance.</description><subject>Ad hoc networks</subject><subject>cluster head selection</subject><subject>clustering</subject><subject>Clustering methods</subject><subject>Energy conservation</subject><subject>Energy consumption</subject><subject>Game theory</subject><subject>Games</subject><subject>performance tradeoff</subject><subject>Wireless sensor network</subject><subject>Wireless sensor networks</subject><issn>2379-1268</issn><issn>2379-1276</issn><isbn>9781467356978</isbn><isbn>9781467356992</isbn><isbn>1467356972</isbn><isbn>1467356999</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9kM9KxDAYxKMouKx9APGSF0jNv35pvC1FV2FhL4selzT5ItXddkkqxbe34OJpfsMMcxhC7gQvheD24X3bNKXkQpUABjTXF6SwphYajKpgpkuykMpYJqSBq3-G-oYUOX9yzoUBqCQsyFsz5JFR1weacHIpsNZlDNQfvvOIqes_aBwSnbqEB8yZZuzz7HscpyF95Ue6oidMc-Xoeo90TC7gEOMtuY7ukLE465Lsnp92zQvbbNevzWrDOmGqkaEADLwF5a0J1rSuiuAjWmWDaysvI6DVc-TACs1rM1vlpJirTvsQ1ZLc_812iLg_pe7o0s_-fIr6BbdLVPI</recordid><startdate>201305</startdate><enddate>201305</enddate><creator>Salim, Shelly</creator><creator>Xiang Li</creator><creator>Moh, Sangman</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201305</creationdate><title>Cost- and reward-based clustering for wireless sensor networks: A performance tradeoff</title><author>Salim, Shelly ; Xiang Li ; Moh, Sangman</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-e16ed0b63c97d97ba5f6cfe939dab5c2f6e9497da69140876e93a21d97a4cdf3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Ad hoc networks</topic><topic>cluster head selection</topic><topic>clustering</topic><topic>Clustering methods</topic><topic>Energy conservation</topic><topic>Energy consumption</topic><topic>Game theory</topic><topic>Games</topic><topic>performance tradeoff</topic><topic>Wireless sensor network</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Salim, Shelly</creatorcontrib><creatorcontrib>Xiang Li</creatorcontrib><creatorcontrib>Moh, Sangman</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Salim, Shelly</au><au>Xiang Li</au><au>Moh, Sangman</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Cost- and reward-based clustering for wireless sensor networks: A performance tradeoff</atitle><btitle>2013 22nd Wireless and Optical Communication Conference</btitle><stitle>WOCC</stitle><date>2013-05</date><risdate>2013</risdate><spage>421</spage><epage>425</epage><pages>421-425</pages><issn>2379-1268</issn><eissn>2379-1276</eissn><eisbn>9781467356978</eisbn><eisbn>9781467356992</eisbn><eisbn>1467356972</eisbn><eisbn>1467356999</eisbn><abstract>In wireless sensor networks, energy conservation is one of the main issues since sensor nodes have limited energy source. Clustering came as an effort to reduce the energy consumption of sensor nodes. Besides energy conservation, the sensor nodes should also deliver their data to the sink effectively. In this paper, a cost- and reward-based clustering (CORE) algorithm using game theory is proposed. In the cluster head selection, CORE considers the cost and reward of being a cluster head. The proposed CORE gives a performance tradeoff between energy consumption and the amount of data sent to the sink. Note that the energy consumption determines network lifetime. As a result, CORE is between probability-based clustering and clustered routing of selfish sensors (CROSS) with regard to performance.</abstract><pub>IEEE</pub><doi>10.1109/WOCC.2013.6676404</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2379-1268 |
ispartof | 2013 22nd Wireless and Optical Communication Conference, 2013, p.421-425 |
issn | 2379-1268 2379-1276 |
language | eng |
recordid | cdi_ieee_primary_6676404 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Ad hoc networks cluster head selection clustering Clustering methods Energy conservation Energy consumption Game theory Games performance tradeoff Wireless sensor network Wireless sensor networks |
title | Cost- and reward-based clustering for wireless sensor networks: A performance tradeoff |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T20%3A30%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Cost-%20and%20reward-based%20clustering%20for%20wireless%20sensor%20networks:%20A%20performance%20tradeoff&rft.btitle=2013%2022nd%20Wireless%20and%20Optical%20Communication%20Conference&rft.au=Salim,%20Shelly&rft.date=2013-05&rft.spage=421&rft.epage=425&rft.pages=421-425&rft.issn=2379-1268&rft.eissn=2379-1276&rft_id=info:doi/10.1109/WOCC.2013.6676404&rft_dat=%3Cieee_6IE%3E6676404%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467356978&rft.eisbn_list=9781467356992&rft.eisbn_list=1467356972&rft.eisbn_list=1467356999&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6676404&rfr_iscdi=true |