Data Gathering for Periodic Sensor Applications
In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect th...
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 | 220 |
|---|---|
| container_issue | |
| container_start_page | 215 |
| container_title | |
| container_volume | |
| creator | Almi'ani, K. Aalsalem, M. Al-Hashemi, R. |
| description | In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node must be visited by a mobile element, which then must deliver this node data to the sink with the given time interval. The goal is to plan the tours of the mobile elements that minimize the total travelling time. Several variations of this problem have been investigated in the literature. We propose an algorithmic solution that outperforms that best known comparable scheme for this problem by an average of 40%. |
| doi_str_mv | 10.1109/PDCAT.2011.34 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6118931</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6118931</ieee_id><sourcerecordid>6118931</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1294-cd4d7dc0eb5b1bb5e5d22ebb49ce1bd3b0982b5999cfd5c93cd8c44f57acb42d3</originalsourceid><addsrcrecordid>eNotjL1OwzAURo0AibZ0ZGLJCyT1tX3t3DFKoSBVohJlrvwXMCpJlGTh7YlEv-Wcs3yMPQAvADhtDtu6OhaCAxRSXbElN5pQoVZ4zZag0BgouZE3bCGkoRwliju2HsdvPk9rUhoWbLO1k812dvqKQ2o_s6YbssOsXUg-e4_tOHfV9-fk7ZS6drxnt409j3F94Yp9PD8d65d8_7Z7rat9nkCQyn1QwQTPo0MHzmHEIER0TpGP4IJ0nErhkIh8E9CT9KH0SjVorHdKBLlij_-_KcZ46of0Y4ffkwYoSYL8A9N0Rag</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Data Gathering for Periodic Sensor Applications</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Almi'ani, K. ; Aalsalem, M. ; Al-Hashemi, R.</creator><creatorcontrib>Almi'ani, K. ; Aalsalem, M. ; Al-Hashemi, R.</creatorcontrib><description>In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node must be visited by a mobile element, which then must deliver this node data to the sink with the given time interval. The goal is to plan the tours of the mobile elements that minimize the total travelling time. Several variations of this problem have been investigated in the literature. We propose an algorithmic solution that outperforms that best known comparable scheme for this problem by an average of 40%.</description><identifier>ISSN: 2379-5352</identifier><identifier>ISBN: 1457718073</identifier><identifier>ISBN: 9781457718076</identifier><identifier>EISBN: 0769545645</identifier><identifier>EISBN: 9780769545646</identifier><identifier>DOI: 10.1109/PDCAT.2011.34</identifier><language>eng</language><publisher>IEEE</publisher><subject>Approximation algorithms ; Benchmark testing ; Clustering algorithms ; Lreduction ; Mobile communication ; Mobile computing ; Partitioning algorithms ; TSP ; VRP ; wireless sensor network ; Wireless sensor networks</subject><ispartof>2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, 2011, p.215-220</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6118931$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6118931$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Almi'ani, K.</creatorcontrib><creatorcontrib>Aalsalem, M.</creatorcontrib><creatorcontrib>Al-Hashemi, R.</creatorcontrib><title>Data Gathering for Periodic Sensor Applications</title><title>2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies</title><addtitle>pdcat</addtitle><description>In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node must be visited by a mobile element, which then must deliver this node data to the sink with the given time interval. The goal is to plan the tours of the mobile elements that minimize the total travelling time. Several variations of this problem have been investigated in the literature. We propose an algorithmic solution that outperforms that best known comparable scheme for this problem by an average of 40%.</description><subject>Approximation algorithms</subject><subject>Benchmark testing</subject><subject>Clustering algorithms</subject><subject>Lreduction</subject><subject>Mobile communication</subject><subject>Mobile computing</subject><subject>Partitioning algorithms</subject><subject>TSP</subject><subject>VRP</subject><subject>wireless sensor network</subject><subject>Wireless sensor networks</subject><issn>2379-5352</issn><isbn>1457718073</isbn><isbn>9781457718076</isbn><isbn>0769545645</isbn><isbn>9780769545646</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjL1OwzAURo0AibZ0ZGLJCyT1tX3t3DFKoSBVohJlrvwXMCpJlGTh7YlEv-Wcs3yMPQAvADhtDtu6OhaCAxRSXbElN5pQoVZ4zZag0BgouZE3bCGkoRwliju2HsdvPk9rUhoWbLO1k812dvqKQ2o_s6YbssOsXUg-e4_tOHfV9-fk7ZS6drxnt409j3F94Yp9PD8d65d8_7Z7rat9nkCQyn1QwQTPo0MHzmHEIER0TpGP4IJ0nErhkIh8E9CT9KH0SjVorHdKBLlij_-_KcZ46of0Y4ffkwYoSYL8A9N0Rag</recordid><startdate>201110</startdate><enddate>201110</enddate><creator>Almi'ani, K.</creator><creator>Aalsalem, M.</creator><creator>Al-Hashemi, R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201110</creationdate><title>Data Gathering for Periodic Sensor Applications</title><author>Almi'ani, K. ; Aalsalem, M. ; Al-Hashemi, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1294-cd4d7dc0eb5b1bb5e5d22ebb49ce1bd3b0982b5999cfd5c93cd8c44f57acb42d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Approximation algorithms</topic><topic>Benchmark testing</topic><topic>Clustering algorithms</topic><topic>Lreduction</topic><topic>Mobile communication</topic><topic>Mobile computing</topic><topic>Partitioning algorithms</topic><topic>TSP</topic><topic>VRP</topic><topic>wireless sensor network</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Almi'ani, K.</creatorcontrib><creatorcontrib>Aalsalem, M.</creatorcontrib><creatorcontrib>Al-Hashemi, R.</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>Almi'ani, K.</au><au>Aalsalem, M.</au><au>Al-Hashemi, R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Data Gathering for Periodic Sensor Applications</atitle><btitle>2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies</btitle><stitle>pdcat</stitle><date>2011-10</date><risdate>2011</risdate><spage>215</spage><epage>220</epage><pages>215-220</pages><issn>2379-5352</issn><isbn>1457718073</isbn><isbn>9781457718076</isbn><eisbn>0769545645</eisbn><eisbn>9780769545646</eisbn><abstract>In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node must be visited by a mobile element, which then must deliver this node data to the sink with the given time interval. The goal is to plan the tours of the mobile elements that minimize the total travelling time. Several variations of this problem have been investigated in the literature. We propose an algorithmic solution that outperforms that best known comparable scheme for this problem by an average of 40%.</abstract><pub>IEEE</pub><doi>10.1109/PDCAT.2011.34</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2379-5352 |
| ispartof | 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, 2011, p.215-220 |
| issn | 2379-5352 |
| language | eng |
| recordid | cdi_ieee_primary_6118931 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Approximation algorithms Benchmark testing Clustering algorithms Lreduction Mobile communication Mobile computing Partitioning algorithms TSP VRP wireless sensor network Wireless sensor networks |
| title | Data Gathering for Periodic Sensor Applications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T20%3A16%3A11IST&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=Data%20Gathering%20for%20Periodic%20Sensor%20Applications&rft.btitle=2011%2012th%20International%20Conference%20on%20Parallel%20and%20Distributed%20Computing,%20Applications%20and%20Technologies&rft.au=Almi'ani,%20K.&rft.date=2011-10&rft.spage=215&rft.epage=220&rft.pages=215-220&rft.issn=2379-5352&rft.isbn=1457718073&rft.isbn_list=9781457718076&rft_id=info:doi/10.1109/PDCAT.2011.34&rft_dat=%3Cieee_6IE%3E6118931%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=0769545645&rft.eisbn_list=9780769545646&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6118931&rfr_iscdi=true |