Optimum routing and scheduling for estimation in wireless sensor networks

In this paper, the distributed estimation in wireless sensor network using optimal task scheduling is considered. The main goal is to maximize network lifetime where it consists of a fusion center and a set of sensor nodes. Lifetime defined as the number of rounds accomplished before network becomes...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Mohajerzadeh, A. H., Fakoor, V., Yaghmaee, M. H., Mirfarah, E.
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 247
container_issue
container_start_page 243
container_title
container_volume
creator Mohajerzadeh, A. H.
Fakoor, V.
Yaghmaee, M. H.
Mirfarah, E.
description In this paper, the distributed estimation in wireless sensor network using optimal task scheduling is considered. The main goal is to maximize network lifetime where it consists of a fusion center and a set of sensor nodes. Lifetime defined as the number of rounds accomplished before network becomes nonfunctional. In order to prolong network lifetime, we determine the optimal number of active sensor nodes and the number of samples provided by each of them using linear optimization problem. Sensor observations are quantized into messages and then forwarded to a fusion center where a final estimation is performed based on degree of certainty. Simulation results show that our optimal proposed algorithm has achieved significant efficiency when compared with other heuristic methods.
doi_str_mv 10.1109/ICCKE.2012.6395386
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6395386</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6395386</ieee_id><sourcerecordid>6395386</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-457160a8d9977b5dede8036846027a894acefbddb6b929d5a24c670a4475face3</originalsourceid><addsrcrecordid>eNo1T8lOwzAUNEKVgJIfgIt_IMFbvBxRVGhEpV56r5z4pRhSp7ITVfw9qSin0WgWzSD0RElBKTEvdVV9rApGKCskNyXX8gZlRmkqpOJCKCFv0cM_KfkdylL6IoTMYcmouEf19jT643TEcZhGHw7YBodT-wlu6i-0GyKGNFvs6IeAfcBnH6GHlHCCkGY1wHge4nd6RIvO9gmyKy7R7m21q9b5ZvteV6-b3Bsy5qJUVBKrnTFKNaUDB5pwqYUkTFlthG2ha5xrZGOYcaVlopWK2Mv8btb4Ej3_1XoA2J_ivCz-7K_n-S93kk70</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimum routing and scheduling for estimation in wireless sensor networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Mohajerzadeh, A. H. ; Fakoor, V. ; Yaghmaee, M. H. ; Mirfarah, E.</creator><creatorcontrib>Mohajerzadeh, A. H. ; Fakoor, V. ; Yaghmaee, M. H. ; Mirfarah, E.</creatorcontrib><description>In this paper, the distributed estimation in wireless sensor network using optimal task scheduling is considered. The main goal is to maximize network lifetime where it consists of a fusion center and a set of sensor nodes. Lifetime defined as the number of rounds accomplished before network becomes nonfunctional. In order to prolong network lifetime, we determine the optimal number of active sensor nodes and the number of samples provided by each of them using linear optimization problem. Sensor observations are quantized into messages and then forwarded to a fusion center where a final estimation is performed based on degree of certainty. Simulation results show that our optimal proposed algorithm has achieved significant efficiency when compared with other heuristic methods.</description><identifier>ISBN: 1467344753</identifier><identifier>ISBN: 9781467344753</identifier><identifier>EISBN: 9781467344746</identifier><identifier>EISBN: 9781467344760</identifier><identifier>EISBN: 1467344761</identifier><identifier>EISBN: 1467344745</identifier><identifier>DOI: 10.1109/ICCKE.2012.6395386</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Degree of Certainty ; Energy consumption ; Equations ; Estimation ; Mathematical model ; Network lifetime ; Optimization ; Task scheduling ; Wireless sensor networks</subject><ispartof>2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE), 2012, p.243-247</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/6395386$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6395386$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mohajerzadeh, A. H.</creatorcontrib><creatorcontrib>Fakoor, V.</creatorcontrib><creatorcontrib>Yaghmaee, M. H.</creatorcontrib><creatorcontrib>Mirfarah, E.</creatorcontrib><title>Optimum routing and scheduling for estimation in wireless sensor networks</title><title>2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)</title><addtitle>ICCKE</addtitle><description>In this paper, the distributed estimation in wireless sensor network using optimal task scheduling is considered. The main goal is to maximize network lifetime where it consists of a fusion center and a set of sensor nodes. Lifetime defined as the number of rounds accomplished before network becomes nonfunctional. In order to prolong network lifetime, we determine the optimal number of active sensor nodes and the number of samples provided by each of them using linear optimization problem. Sensor observations are quantized into messages and then forwarded to a fusion center where a final estimation is performed based on degree of certainty. Simulation results show that our optimal proposed algorithm has achieved significant efficiency when compared with other heuristic methods.</description><subject>Algorithm design and analysis</subject><subject>Degree of Certainty</subject><subject>Energy consumption</subject><subject>Equations</subject><subject>Estimation</subject><subject>Mathematical model</subject><subject>Network lifetime</subject><subject>Optimization</subject><subject>Task scheduling</subject><subject>Wireless sensor networks</subject><isbn>1467344753</isbn><isbn>9781467344753</isbn><isbn>9781467344746</isbn><isbn>9781467344760</isbn><isbn>1467344761</isbn><isbn>1467344745</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1T8lOwzAUNEKVgJIfgIt_IMFbvBxRVGhEpV56r5z4pRhSp7ITVfw9qSin0WgWzSD0RElBKTEvdVV9rApGKCskNyXX8gZlRmkqpOJCKCFv0cM_KfkdylL6IoTMYcmouEf19jT643TEcZhGHw7YBodT-wlu6i-0GyKGNFvs6IeAfcBnH6GHlHCCkGY1wHge4nd6RIvO9gmyKy7R7m21q9b5ZvteV6-b3Bsy5qJUVBKrnTFKNaUDB5pwqYUkTFlthG2ha5xrZGOYcaVlopWK2Mv8btb4Ej3_1XoA2J_ivCz-7K_n-S93kk70</recordid><startdate>201210</startdate><enddate>201210</enddate><creator>Mohajerzadeh, A. H.</creator><creator>Fakoor, V.</creator><creator>Yaghmaee, M. H.</creator><creator>Mirfarah, E.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201210</creationdate><title>Optimum routing and scheduling for estimation in wireless sensor networks</title><author>Mohajerzadeh, A. H. ; Fakoor, V. ; Yaghmaee, M. H. ; Mirfarah, E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-457160a8d9977b5dede8036846027a894acefbddb6b929d5a24c670a4475face3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithm design and analysis</topic><topic>Degree of Certainty</topic><topic>Energy consumption</topic><topic>Equations</topic><topic>Estimation</topic><topic>Mathematical model</topic><topic>Network lifetime</topic><topic>Optimization</topic><topic>Task scheduling</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Mohajerzadeh, A. H.</creatorcontrib><creatorcontrib>Fakoor, V.</creatorcontrib><creatorcontrib>Yaghmaee, M. H.</creatorcontrib><creatorcontrib>Mirfarah, E.</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>Mohajerzadeh, A. H.</au><au>Fakoor, V.</au><au>Yaghmaee, M. H.</au><au>Mirfarah, E.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimum routing and scheduling for estimation in wireless sensor networks</atitle><btitle>2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)</btitle><stitle>ICCKE</stitle><date>2012-10</date><risdate>2012</risdate><spage>243</spage><epage>247</epage><pages>243-247</pages><isbn>1467344753</isbn><isbn>9781467344753</isbn><eisbn>9781467344746</eisbn><eisbn>9781467344760</eisbn><eisbn>1467344761</eisbn><eisbn>1467344745</eisbn><abstract>In this paper, the distributed estimation in wireless sensor network using optimal task scheduling is considered. The main goal is to maximize network lifetime where it consists of a fusion center and a set of sensor nodes. Lifetime defined as the number of rounds accomplished before network becomes nonfunctional. In order to prolong network lifetime, we determine the optimal number of active sensor nodes and the number of samples provided by each of them using linear optimization problem. Sensor observations are quantized into messages and then forwarded to a fusion center where a final estimation is performed based on degree of certainty. Simulation results show that our optimal proposed algorithm has achieved significant efficiency when compared with other heuristic methods.</abstract><pub>IEEE</pub><doi>10.1109/ICCKE.2012.6395386</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 1467344753
ispartof 2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE), 2012, p.243-247
issn
language eng
recordid cdi_ieee_primary_6395386
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Algorithm design and analysis
Degree of Certainty
Energy consumption
Equations
Estimation
Mathematical model
Network lifetime
Optimization
Task scheduling
Wireless sensor networks
title Optimum routing and scheduling for estimation 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=2025-02-06T13%3A18%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=Optimum%20routing%20and%20scheduling%20for%20estimation%20in%20wireless%20sensor%20networks&rft.btitle=2012%202nd%20International%20eConference%20on%20Computer%20and%20Knowledge%20Engineering%20(ICCKE)&rft.au=Mohajerzadeh,%20A.%20H.&rft.date=2012-10&rft.spage=243&rft.epage=247&rft.pages=243-247&rft.isbn=1467344753&rft.isbn_list=9781467344753&rft_id=info:doi/10.1109/ICCKE.2012.6395386&rft_dat=%3Cieee_6IE%3E6395386%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467344746&rft.eisbn_list=9781467344760&rft.eisbn_list=1467344761&rft.eisbn_list=1467344745&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6395386&rfr_iscdi=true