A simple myopic mobile sink strategy for wireless sensor networks
Network lifetime maximization is an important problem particularly for large-scale wireless sensor networks. To this end, we take an approach that exploits the `sink mobility'. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations. As t...
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 | 8 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Young-Hun Kim Keon-Taek Lee Semin Sim Seung-Jae Han |
| description | Network lifetime maximization is an important problem particularly for large-scale wireless sensor networks. To this end, we take an approach that exploits the `sink mobility'. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations. As the sink node moves around, such energy bottleneck can be alleviated. We analyze the optimal sink mobility pattern obtained by solving a linear programming model and use the insights from the analysis to design a simple practical heuristic. Our heuristic utilizes only local information, e.g., the standard deviation of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal performance even with the slowly moving mobile sink. |
| doi_str_mv | 10.1109/PCCC.2011.6108064 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6108064</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6108064</ieee_id><sourcerecordid>6108064</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-f0350e11f09a31315bed7649584d98825e272a2f82dc113ddc93c59c83390b583</originalsourceid><addsrcrecordid>eNo1kMlqwzAURdUJ6qT5gNKNfsDuexosaWlMJwi0i-yDh-eixhOWIfjva2i6upx74SwuY48ICSK45688zxMBiEmKYCFVV2znjEWVGglrba5ZJKRRsUuFvWGb_wHwlkWrwMQiVXjPNiH8AIC0wkQsy3jw3dgS75Zh9BXvhtKvFHx_4mGeipm-F94MEz_7iVoKgQfqw8o9zedhOoUHdtcUbaDdJbfs8PpyyN_j_efbR57tY-9gjhuQGgixAVdIlKhLqk2qnLaqdtYKTcKIQjRW1BWirOvKyUq7ykrpoNRWbtnTn9YT0XGcfFdMy_HyhPwFOlRM-g</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A simple myopic mobile sink strategy for wireless sensor networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Young-Hun Kim ; Keon-Taek Lee ; Semin Sim ; Seung-Jae Han</creator><creatorcontrib>Young-Hun Kim ; Keon-Taek Lee ; Semin Sim ; Seung-Jae Han</creatorcontrib><description>Network lifetime maximization is an important problem particularly for large-scale wireless sensor networks. To this end, we take an approach that exploits the `sink mobility'. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations. As the sink node moves around, such energy bottleneck can be alleviated. We analyze the optimal sink mobility pattern obtained by solving a linear programming model and use the insights from the analysis to design a simple practical heuristic. Our heuristic utilizes only local information, e.g., the standard deviation of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal performance even with the slowly moving mobile sink.</description><identifier>ISSN: 1097-2641</identifier><identifier>ISBN: 1467300101</identifier><identifier>ISBN: 9781467300100</identifier><identifier>EISSN: 2374-9628</identifier><identifier>EISBN: 9781467300117</identifier><identifier>EISBN: 146730011X</identifier><identifier>EISBN: 9781467300124</identifier><identifier>EISBN: 1467300128</identifier><identifier>DOI: 10.1109/PCCC.2011.6108064</identifier><language>eng</language><publisher>IEEE</publisher><subject>Energy consumption ; Heuristic algorithms ; linear programming ; Mobile communication ; Mobile computing ; mobile sink ; network lifetime ; Network topology ; Topology ; Wireless sensor networks</subject><ispartof>30th IEEE International Performance Computing and Communications Conference, 2011, p.1-8</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/6108064$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6108064$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Young-Hun Kim</creatorcontrib><creatorcontrib>Keon-Taek Lee</creatorcontrib><creatorcontrib>Semin Sim</creatorcontrib><creatorcontrib>Seung-Jae Han</creatorcontrib><title>A simple myopic mobile sink strategy for wireless sensor networks</title><title>30th IEEE International Performance Computing and Communications Conference</title><addtitle>PCCC</addtitle><description>Network lifetime maximization is an important problem particularly for large-scale wireless sensor networks. To this end, we take an approach that exploits the `sink mobility'. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations. As the sink node moves around, such energy bottleneck can be alleviated. We analyze the optimal sink mobility pattern obtained by solving a linear programming model and use the insights from the analysis to design a simple practical heuristic. Our heuristic utilizes only local information, e.g., the standard deviation of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal performance even with the slowly moving mobile sink.</description><subject>Energy consumption</subject><subject>Heuristic algorithms</subject><subject>linear programming</subject><subject>Mobile communication</subject><subject>Mobile computing</subject><subject>mobile sink</subject><subject>network lifetime</subject><subject>Network topology</subject><subject>Topology</subject><subject>Wireless sensor networks</subject><issn>1097-2641</issn><issn>2374-9628</issn><isbn>1467300101</isbn><isbn>9781467300100</isbn><isbn>9781467300117</isbn><isbn>146730011X</isbn><isbn>9781467300124</isbn><isbn>1467300128</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kMlqwzAURdUJ6qT5gNKNfsDuexosaWlMJwi0i-yDh-eixhOWIfjva2i6upx74SwuY48ICSK45688zxMBiEmKYCFVV2znjEWVGglrba5ZJKRRsUuFvWGb_wHwlkWrwMQiVXjPNiH8AIC0wkQsy3jw3dgS75Zh9BXvhtKvFHx_4mGeipm-F94MEz_7iVoKgQfqw8o9zedhOoUHdtcUbaDdJbfs8PpyyN_j_efbR57tY-9gjhuQGgixAVdIlKhLqk2qnLaqdtYKTcKIQjRW1BWirOvKyUq7ykrpoNRWbtnTn9YT0XGcfFdMy_HyhPwFOlRM-g</recordid><startdate>201111</startdate><enddate>201111</enddate><creator>Young-Hun Kim</creator><creator>Keon-Taek Lee</creator><creator>Semin Sim</creator><creator>Seung-Jae Han</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201111</creationdate><title>A simple myopic mobile sink strategy for wireless sensor networks</title><author>Young-Hun Kim ; Keon-Taek Lee ; Semin Sim ; Seung-Jae Han</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-f0350e11f09a31315bed7649584d98825e272a2f82dc113ddc93c59c83390b583</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Energy consumption</topic><topic>Heuristic algorithms</topic><topic>linear programming</topic><topic>Mobile communication</topic><topic>Mobile computing</topic><topic>mobile sink</topic><topic>network lifetime</topic><topic>Network topology</topic><topic>Topology</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Young-Hun Kim</creatorcontrib><creatorcontrib>Keon-Taek Lee</creatorcontrib><creatorcontrib>Semin Sim</creatorcontrib><creatorcontrib>Seung-Jae Han</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Young-Hun Kim</au><au>Keon-Taek Lee</au><au>Semin Sim</au><au>Seung-Jae Han</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A simple myopic mobile sink strategy for wireless sensor networks</atitle><btitle>30th IEEE International Performance Computing and Communications Conference</btitle><stitle>PCCC</stitle><date>2011-11</date><risdate>2011</risdate><spage>1</spage><epage>8</epage><pages>1-8</pages><issn>1097-2641</issn><eissn>2374-9628</eissn><isbn>1467300101</isbn><isbn>9781467300100</isbn><eisbn>9781467300117</eisbn><eisbn>146730011X</eisbn><eisbn>9781467300124</eisbn><eisbn>1467300128</eisbn><abstract>Network lifetime maximization is an important problem particularly for large-scale wireless sensor networks. To this end, we take an approach that exploits the `sink mobility'. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations. As the sink node moves around, such energy bottleneck can be alleviated. We analyze the optimal sink mobility pattern obtained by solving a linear programming model and use the insights from the analysis to design a simple practical heuristic. Our heuristic utilizes only local information, e.g., the standard deviation of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal performance even with the slowly moving mobile sink.</abstract><pub>IEEE</pub><doi>10.1109/PCCC.2011.6108064</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1097-2641 |
| ispartof | 30th IEEE International Performance Computing and Communications Conference, 2011, p.1-8 |
| issn | 1097-2641 2374-9628 |
| language | eng |
| recordid | cdi_ieee_primary_6108064 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Energy consumption Heuristic algorithms linear programming Mobile communication Mobile computing mobile sink network lifetime Network topology Topology Wireless sensor networks |
| title | A simple myopic mobile sink strategy for 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=2025-01-09T11%3A19%3A13IST&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=A%20simple%20myopic%20mobile%20sink%20strategy%20for%20wireless%20sensor%20networks&rft.btitle=30th%20IEEE%20International%20Performance%20Computing%20and%20Communications%20Conference&rft.au=Young-Hun%20Kim&rft.date=2011-11&rft.spage=1&rft.epage=8&rft.pages=1-8&rft.issn=1097-2641&rft.eissn=2374-9628&rft.isbn=1467300101&rft.isbn_list=9781467300100&rft_id=info:doi/10.1109/PCCC.2011.6108064&rft_dat=%3Cieee_6IE%3E6108064%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467300117&rft.eisbn_list=146730011X&rft.eisbn_list=9781467300124&rft.eisbn_list=1467300128&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6108064&rfr_iscdi=true |