Algebraic optimization of data delivery patterns in mobile sensor networks
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among participating sensor nodes with possible in-node data filtering or aggregation, and can be described as a tree-like data...
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 | 672 |
|---|---|
| container_issue | |
| container_start_page | 668 |
| container_title | |
| container_volume | |
| creator | Zadorozhny, V. Chrysanthis, P.K. Labrinidis, A. |
| description | Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among participating sensor nodes with possible in-node data filtering or aggregation, and can be described as a tree-like data delivery pattern. The data delivery pattern can also be considered as a query execution plan, or query routing tree. We propose an algebraic optimization of the query routing tree construction and reconfiguration. In particular, we aim at generating query trees that maximize collision-free concurrent data transmissions hence reducing energy and time wastes due to retransmissions. Towards this, we introduce a data transmission algebra (DTA) and apply it for efficient generation of such query trees. |
| doi_str_mv | 10.1109/DEXA.2004.1333551 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1333551</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1333551</ieee_id><sourcerecordid>1333551</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-14835ede3469ff40108f0ecc4047d85c00d69b468e1f9b25566a621351513ae3</originalsourceid><addsrcrecordid>eNotkM1KAzEURoM_YKl9AHGTF5h67yQ3kyxLrVUpuOnCXcnM3JHodKYkQalPb8F-m7M7HD4h7hDmiOAeHlfvi3kJoOeolCLCCzEpVWUL5ZAuxcxVFirjqERH-kpMkEpXaLT2RsxS-oTTUBFYOxGvi_6D6-hDI8dDDvvw63MYBzl2svXZy5b78M3xKA8-Z45DkmGQ-7EOPcvEQxqjHDj_jPEr3YrrzveJZ2dOxfZptV0-F5u39ctysSkCVpQL1FYRt6y0cV2nAcF2wE2jQVetpQagNa7WxjJ2ri6JjPGmPPUiofKspuL-XxuYeXeIYe_jcXc-Qv0BEKFPLA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Algebraic optimization of data delivery patterns in mobile sensor networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Zadorozhny, V. ; Chrysanthis, P.K. ; Labrinidis, A.</creator><creatorcontrib>Zadorozhny, V. ; Chrysanthis, P.K. ; Labrinidis, A.</creatorcontrib><description>Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among participating sensor nodes with possible in-node data filtering or aggregation, and can be described as a tree-like data delivery pattern. The data delivery pattern can also be considered as a query execution plan, or query routing tree. We propose an algebraic optimization of the query routing tree construction and reconfiguration. In particular, we aim at generating query trees that maximize collision-free concurrent data transmissions hence reducing energy and time wastes due to retransmissions. Towards this, we introduce a data transmission algebra (DTA) and apply it for efficient generation of such query trees.</description><identifier>ISSN: 1529-4188</identifier><identifier>ISBN: 9780769521954</identifier><identifier>ISBN: 0769521959</identifier><identifier>EISSN: 2378-3915</identifier><identifier>DOI: 10.1109/DEXA.2004.1333551</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algebra ; Computer science ; Data communication ; Filtering ; Intelligent networks ; Query processing ; Sensor phenomena and characterization ; Temperature sensors ; Wireless sensor networks</subject><ispartof>Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004, 2004, p.668-672</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/1333551$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,4036,4037,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1333551$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zadorozhny, V.</creatorcontrib><creatorcontrib>Chrysanthis, P.K.</creatorcontrib><creatorcontrib>Labrinidis, A.</creatorcontrib><title>Algebraic optimization of data delivery patterns in mobile sensor networks</title><title>Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004</title><addtitle>DEXA</addtitle><description>Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among participating sensor nodes with possible in-node data filtering or aggregation, and can be described as a tree-like data delivery pattern. The data delivery pattern can also be considered as a query execution plan, or query routing tree. We propose an algebraic optimization of the query routing tree construction and reconfiguration. In particular, we aim at generating query trees that maximize collision-free concurrent data transmissions hence reducing energy and time wastes due to retransmissions. Towards this, we introduce a data transmission algebra (DTA) and apply it for efficient generation of such query trees.</description><subject>Algebra</subject><subject>Computer science</subject><subject>Data communication</subject><subject>Filtering</subject><subject>Intelligent networks</subject><subject>Query processing</subject><subject>Sensor phenomena and characterization</subject><subject>Temperature sensors</subject><subject>Wireless sensor networks</subject><issn>1529-4188</issn><issn>2378-3915</issn><isbn>9780769521954</isbn><isbn>0769521959</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkM1KAzEURoM_YKl9AHGTF5h67yQ3kyxLrVUpuOnCXcnM3JHodKYkQalPb8F-m7M7HD4h7hDmiOAeHlfvi3kJoOeolCLCCzEpVWUL5ZAuxcxVFirjqERH-kpMkEpXaLT2RsxS-oTTUBFYOxGvi_6D6-hDI8dDDvvw63MYBzl2svXZy5b78M3xKA8-Z45DkmGQ-7EOPcvEQxqjHDj_jPEr3YrrzveJZ2dOxfZptV0-F5u39ctysSkCVpQL1FYRt6y0cV2nAcF2wE2jQVetpQagNa7WxjJ2ri6JjPGmPPUiofKspuL-XxuYeXeIYe_jcXc-Qv0BEKFPLA</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Zadorozhny, V.</creator><creator>Chrysanthis, P.K.</creator><creator>Labrinidis, A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2004</creationdate><title>Algebraic optimization of data delivery patterns in mobile sensor networks</title><author>Zadorozhny, V. ; Chrysanthis, P.K. ; Labrinidis, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-14835ede3469ff40108f0ecc4047d85c00d69b468e1f9b25566a621351513ae3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algebra</topic><topic>Computer science</topic><topic>Data communication</topic><topic>Filtering</topic><topic>Intelligent networks</topic><topic>Query processing</topic><topic>Sensor phenomena and characterization</topic><topic>Temperature sensors</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Zadorozhny, V.</creatorcontrib><creatorcontrib>Chrysanthis, P.K.</creatorcontrib><creatorcontrib>Labrinidis, A.</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>Zadorozhny, V.</au><au>Chrysanthis, P.K.</au><au>Labrinidis, A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Algebraic optimization of data delivery patterns in mobile sensor networks</atitle><btitle>Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004</btitle><stitle>DEXA</stitle><date>2004</date><risdate>2004</risdate><spage>668</spage><epage>672</epage><pages>668-672</pages><issn>1529-4188</issn><eissn>2378-3915</eissn><isbn>9780769521954</isbn><isbn>0769521959</isbn><abstract>Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among participating sensor nodes with possible in-node data filtering or aggregation, and can be described as a tree-like data delivery pattern. The data delivery pattern can also be considered as a query execution plan, or query routing tree. We propose an algebraic optimization of the query routing tree construction and reconfiguration. In particular, we aim at generating query trees that maximize collision-free concurrent data transmissions hence reducing energy and time wastes due to retransmissions. Towards this, we introduce a data transmission algebra (DTA) and apply it for efficient generation of such query trees.</abstract><pub>IEEE</pub><doi>10.1109/DEXA.2004.1333551</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1529-4188 |
| ispartof | Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004, 2004, p.668-672 |
| issn | 1529-4188 2378-3915 |
| language | eng |
| recordid | cdi_ieee_primary_1333551 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algebra Computer science Data communication Filtering Intelligent networks Query processing Sensor phenomena and characterization Temperature sensors Wireless sensor networks |
| title | Algebraic optimization of data delivery patterns in mobile sensor networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T01%3A07%3A26IST&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=Algebraic%20optimization%20of%20data%20delivery%20patterns%20in%20mobile%20sensor%20networks&rft.btitle=Proceedings.%2015th%20International%20Workshop%20on%20Database%20and%20Expert%20Systems%20Applications,%202004&rft.au=Zadorozhny,%20V.&rft.date=2004&rft.spage=668&rft.epage=672&rft.pages=668-672&rft.issn=1529-4188&rft.eissn=2378-3915&rft.isbn=9780769521954&rft.isbn_list=0769521959&rft_id=info:doi/10.1109/DEXA.2004.1333551&rft_dat=%3Cieee_6IE%3E1333551%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1333551&rfr_iscdi=true |