Building an efficient overlay for publish/subscribe in wireless sensor networks
In this paper we examine how to efficiently build a brokers overlay to implement publish/subscribe in a wireless sensor network, trying to reduce sensor nodes energy consumption, memory required for buffering packets and delivery time. We evaluate, on the connectivity graph that represents the netwo...
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 | 370 |
|---|---|
| container_issue | |
| container_start_page | 362 |
| container_title | |
| container_volume | |
| creator | Chaudet, C. Costagliola, N. Demeure, I. Ktari, S. Tardieu, S. |
| description | In this paper we examine how to efficiently build a brokers overlay to implement publish/subscribe in a wireless sensor network, trying to reduce sensor nodes energy consumption, memory required for buffering packets and delivery time. We evaluate, on the connectivity graph that represents the network, the performance of various criteria that can be used to select brokers among the set of nodes. We compare a dominating set approach with the selection of the best ranked brokers based on centrality measures. We finally give hints on how to implement a distributed algorithm to approximate the most efficient overlays. |
| doi_str_mv | 10.1109/SECON.2012.6275798 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_6IE</sourceid><recordid>TN_cdi_ieee_primary_6275798</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6275798</ieee_id><sourcerecordid>oai_HAL_hal_00780006v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-h1688-d666a64d04a49e3488091954aa9eab8dcc8feef4db0862065eb516053ac28e3a3</originalsourceid><addsrcrecordid>eNo90MtOwzAQBVAjQKKU_ABsvGWRdhw_Yi9LVChSRRfAOnKSCTGEpLL7UP-eoBZWo7k6GukOIbcMJoyBmb7Os9XLJAGWTFSSytToM3LNhEo5M8DZOYlMqv92wS7IKGFSxlJodUWiED4BBqYNgByR1cPWtZXrPqjtKNa1Kx12G9rv0Lf2QOve0_W2aF1opmFbhNK7Aqnr6N55bDEEGrALA-pws-_9V7ghl7VtA0anOSbvj_O3bBEvV0_P2WwZN0xpHVdKKatEBcIKg1xoDYYZKaw1aAtdlaWuEWtRFaBVAkpiIZkCyW2ZaOSWj8n98W5j23zt3bf1h7y3Ll_MlvlvBpDqoajascHeHa1DxH98-h3_AZAAYHY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Building an efficient overlay for publish/subscribe in wireless sensor networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Chaudet, C. ; Costagliola, N. ; Demeure, I. ; Ktari, S. ; Tardieu, S.</creator><creatorcontrib>Chaudet, C. ; Costagliola, N. ; Demeure, I. ; Ktari, S. ; Tardieu, S.</creatorcontrib><description>In this paper we examine how to efficiently build a brokers overlay to implement publish/subscribe in a wireless sensor network, trying to reduce sensor nodes energy consumption, memory required for buffering packets and delivery time. We evaluate, on the connectivity graph that represents the network, the performance of various criteria that can be used to select brokers among the set of nodes. We compare a dominating set approach with the selection of the best ranked brokers based on centrality measures. We finally give hints on how to implement a distributed algorithm to approximate the most efficient overlays.</description><identifier>ISSN: 2155-5486</identifier><identifier>ISBN: 9781467319041</identifier><identifier>ISBN: 146731904X</identifier><identifier>EISBN: 1467319031</identifier><identifier>EISBN: 9781467319034</identifier><identifier>EISBN: 1467319058</identifier><identifier>EISBN: 9781467319058</identifier><identifier>DOI: 10.1109/SECON.2012.6275798</identifier><language>eng</language><publisher>IEEE</publisher><subject>brokers placement ; Clustering algorithms ; Computer Science ; Energy consumption ; Load modeling ; Measurement ; Networking and Internet Architecture ; Publish/Subscribe ; Routing ; Routing protocols ; Wireless sensor networks</subject><ispartof>2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2012, p.362-370</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0002-6885-1480</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6275798$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,310,311,782,786,791,792,887,2062,27934,54929</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6275798$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://hal.science/hal-00780006$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Chaudet, C.</creatorcontrib><creatorcontrib>Costagliola, N.</creatorcontrib><creatorcontrib>Demeure, I.</creatorcontrib><creatorcontrib>Ktari, S.</creatorcontrib><creatorcontrib>Tardieu, S.</creatorcontrib><title>Building an efficient overlay for publish/subscribe in wireless sensor networks</title><title>2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)</title><addtitle>SAHCN</addtitle><description>In this paper we examine how to efficiently build a brokers overlay to implement publish/subscribe in a wireless sensor network, trying to reduce sensor nodes energy consumption, memory required for buffering packets and delivery time. We evaluate, on the connectivity graph that represents the network, the performance of various criteria that can be used to select brokers among the set of nodes. We compare a dominating set approach with the selection of the best ranked brokers based on centrality measures. We finally give hints on how to implement a distributed algorithm to approximate the most efficient overlays.</description><subject>brokers placement</subject><subject>Clustering algorithms</subject><subject>Computer Science</subject><subject>Energy consumption</subject><subject>Load modeling</subject><subject>Measurement</subject><subject>Networking and Internet Architecture</subject><subject>Publish/Subscribe</subject><subject>Routing</subject><subject>Routing protocols</subject><subject>Wireless sensor networks</subject><issn>2155-5486</issn><isbn>9781467319041</isbn><isbn>146731904X</isbn><isbn>1467319031</isbn><isbn>9781467319034</isbn><isbn>1467319058</isbn><isbn>9781467319058</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo90MtOwzAQBVAjQKKU_ABsvGWRdhw_Yi9LVChSRRfAOnKSCTGEpLL7UP-eoBZWo7k6GukOIbcMJoyBmb7Os9XLJAGWTFSSytToM3LNhEo5M8DZOYlMqv92wS7IKGFSxlJodUWiED4BBqYNgByR1cPWtZXrPqjtKNa1Kx12G9rv0Lf2QOve0_W2aF1opmFbhNK7Aqnr6N55bDEEGrALA-pws-_9V7ghl7VtA0anOSbvj_O3bBEvV0_P2WwZN0xpHVdKKatEBcIKg1xoDYYZKaw1aAtdlaWuEWtRFaBVAkpiIZkCyW2ZaOSWj8n98W5j23zt3bf1h7y3Ll_MlvlvBpDqoajascHeHa1DxH98-h3_AZAAYHY</recordid><startdate>201206</startdate><enddate>201206</enddate><creator>Chaudet, C.</creator><creator>Costagliola, N.</creator><creator>Demeure, I.</creator><creator>Ktari, S.</creator><creator>Tardieu, S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-6885-1480</orcidid></search><sort><creationdate>201206</creationdate><title>Building an efficient overlay for publish/subscribe in wireless sensor networks</title><author>Chaudet, C. ; Costagliola, N. ; Demeure, I. ; Ktari, S. ; Tardieu, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h1688-d666a64d04a49e3488091954aa9eab8dcc8feef4db0862065eb516053ac28e3a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>brokers placement</topic><topic>Clustering algorithms</topic><topic>Computer Science</topic><topic>Energy consumption</topic><topic>Load modeling</topic><topic>Measurement</topic><topic>Networking and Internet Architecture</topic><topic>Publish/Subscribe</topic><topic>Routing</topic><topic>Routing protocols</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Chaudet, C.</creatorcontrib><creatorcontrib>Costagliola, N.</creatorcontrib><creatorcontrib>Demeure, I.</creatorcontrib><creatorcontrib>Ktari, S.</creatorcontrib><creatorcontrib>Tardieu, S.</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><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chaudet, C.</au><au>Costagliola, N.</au><au>Demeure, I.</au><au>Ktari, S.</au><au>Tardieu, S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Building an efficient overlay for publish/subscribe in wireless sensor networks</atitle><btitle>2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)</btitle><stitle>SAHCN</stitle><date>2012-06</date><risdate>2012</risdate><spage>362</spage><epage>370</epage><pages>362-370</pages><issn>2155-5486</issn><isbn>9781467319041</isbn><isbn>146731904X</isbn><eisbn>1467319031</eisbn><eisbn>9781467319034</eisbn><eisbn>1467319058</eisbn><eisbn>9781467319058</eisbn><abstract>In this paper we examine how to efficiently build a brokers overlay to implement publish/subscribe in a wireless sensor network, trying to reduce sensor nodes energy consumption, memory required for buffering packets and delivery time. We evaluate, on the connectivity graph that represents the network, the performance of various criteria that can be used to select brokers among the set of nodes. We compare a dominating set approach with the selection of the best ranked brokers based on centrality measures. We finally give hints on how to implement a distributed algorithm to approximate the most efficient overlays.</abstract><pub>IEEE</pub><doi>10.1109/SECON.2012.6275798</doi><tpages>9</tpages><orcidid>https://orcid.org/0000-0002-6885-1480</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2155-5486 |
| ispartof | 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2012, p.362-370 |
| issn | 2155-5486 |
| language | eng |
| recordid | cdi_ieee_primary_6275798 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | brokers placement Clustering algorithms Computer Science Energy consumption Load modeling Measurement Networking and Internet Architecture Publish/Subscribe Routing Routing protocols Wireless sensor networks |
| title | Building an efficient overlay for publish/subscribe in wireless sensor networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-02T19%3A36%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Building%20an%20efficient%20overlay%20for%20publish/subscribe%20in%20wireless%20sensor%20networks&rft.btitle=2012%209th%20Annual%20IEEE%20Communications%20Society%20Conference%20on%20Sensor,%20Mesh%20and%20Ad%20Hoc%20Communications%20and%20Networks%20(SECON)&rft.au=Chaudet,%20C.&rft.date=2012-06&rft.spage=362&rft.epage=370&rft.pages=362-370&rft.issn=2155-5486&rft.isbn=9781467319041&rft.isbn_list=146731904X&rft_id=info:doi/10.1109/SECON.2012.6275798&rft_dat=%3Chal_6IE%3Eoai_HAL_hal_00780006v1%3C/hal_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1467319031&rft.eisbn_list=9781467319034&rft.eisbn_list=1467319058&rft.eisbn_list=9781467319058&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6275798&rfr_iscdi=true |