The Impact of Speed on the Convergence of Gossip Algorithms with Mobility in Wireless Sensor Networks
This work presents two speed based mobility models for gossip algorithms in wireless sensor networks. The corresponding upper bounds on the convergence time are derived, which show the relationship between speed of agents and convergence rate of gossip algorithms. The influences of speed are examine...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2014-02, Vol.18 (2), p.221-224 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 224 |
|---|---|
| container_issue | 2 |
| container_start_page | 221 |
| container_title | IEEE communications letters |
| container_volume | 18 |
| creator | Yang, Bo Zhu, Guangxi Wu, Weimin |
| description | This work presents two speed based mobility models for gossip algorithms in wireless sensor networks. The corresponding upper bounds on the convergence time are derived, which show the relationship between speed of agents and convergence rate of gossip algorithms. The influences of speed are examined under both mobility models. Simulation results indicate that the speed based mobility model can offer more precise estimates of communication cost, which provide useful references for large-scale sensor network planning. |
| doi_str_mv | 10.1109/LCOMM.2013.120713.131595 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1505119679</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6697919</ieee_id><sourcerecordid>3240832121</sourcerecordid><originalsourceid>FETCH-LOGICAL-c282t-2492e96ae68f856e0f35535b3e04563b036ad5bdded099ff6b903ebda47a3ab73</originalsourceid><addsrcrecordid>eNo9kF9PwjAUxRejiYh-Al-aGB-H_UO79pEQRRKQBzA-Nt12B8WxznZo_PZujvDS09x77j3tL4oQwSNCsHpaTFfL5YhiwkaE4qQTRrjiF9GAcC5j2h6X7R1LFSeJktfRTQh7jLGknAwi2OwAzQ-1yRrkCrSuAXLkKtS05amrvsFvocqg681cCLZGk3LrvG12h4B-WkFLl9rSNr_IVujDeighBLSGKjiP3qD5cf4z3EZXhSkD3J10GL2_PG-mr_FiNZtPJ4s4o5I2MR0rCkoYELKQXAAuGOeMpwzwmAuWYiZMztM8hxwrVRQiVZhBmptxYphJEzaMHvq9tXdfRwiN3rujr9pITTjmhCiRqNYle1fm2y95KHTt7cH4X02w7qDqf6i6g6p7qLqH2o4-ngJMyExZeFNlNpznqRxjKkj3kPveZwHg3BZCJYoo9gf_2YES</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1505119679</pqid></control><display><type>article</type><title>The Impact of Speed on the Convergence of Gossip Algorithms with Mobility in Wireless Sensor Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Yang, Bo ; Zhu, Guangxi ; Wu, Weimin</creator><creatorcontrib>Yang, Bo ; Zhu, Guangxi ; Wu, Weimin</creatorcontrib><description>This work presents two speed based mobility models for gossip algorithms in wireless sensor networks. The corresponding upper bounds on the convergence time are derived, which show the relationship between speed of agents and convergence rate of gossip algorithms. The influences of speed are examined under both mobility models. Simulation results indicate that the speed based mobility model can offer more precise estimates of communication cost, which provide useful references for large-scale sensor network planning.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2013.120713.131595</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Ad hoc networks ; Applied sciences ; Convergence ; Detection, estimation, filtering, equalization, prediction ; distributed average consensus ; Estimation error ; Exact sciences and technology ; gossip algorithms ; Information, signal and communications theory ; Lattices ; mobility ; Organization and planning of networks (techniques and equipments) ; Services and terminals of telecommunications ; Signal and communications theory ; Signal processing algorithms ; Signal, noise ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Telemetry. Remote supervision. Telewarning. Remote control ; Upper bound ; Wireless sensor network ; Wireless sensor networks</subject><ispartof>IEEE communications letters, 2014-02, Vol.18 (2), p.221-224</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Feb 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c282t-2492e96ae68f856e0f35535b3e04563b036ad5bdded099ff6b903ebda47a3ab73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6697919$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6697919$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28402617$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yang, Bo</creatorcontrib><creatorcontrib>Zhu, Guangxi</creatorcontrib><creatorcontrib>Wu, Weimin</creatorcontrib><title>The Impact of Speed on the Convergence of Gossip Algorithms with Mobility in Wireless Sensor Networks</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>This work presents two speed based mobility models for gossip algorithms in wireless sensor networks. The corresponding upper bounds on the convergence time are derived, which show the relationship between speed of agents and convergence rate of gossip algorithms. The influences of speed are examined under both mobility models. Simulation results indicate that the speed based mobility model can offer more precise estimates of communication cost, which provide useful references for large-scale sensor network planning.</description><subject>Ad hoc networks</subject><subject>Applied sciences</subject><subject>Convergence</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>distributed average consensus</subject><subject>Estimation error</subject><subject>Exact sciences and technology</subject><subject>gossip algorithms</subject><subject>Information, signal and communications theory</subject><subject>Lattices</subject><subject>mobility</subject><subject>Organization and planning of networks (techniques and equipments)</subject><subject>Services and terminals of telecommunications</subject><subject>Signal and communications theory</subject><subject>Signal processing algorithms</subject><subject>Signal, noise</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Telemetry. Remote supervision. Telewarning. Remote control</subject><subject>Upper bound</subject><subject>Wireless sensor network</subject><subject>Wireless sensor networks</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kF9PwjAUxRejiYh-Al-aGB-H_UO79pEQRRKQBzA-Nt12B8WxznZo_PZujvDS09x77j3tL4oQwSNCsHpaTFfL5YhiwkaE4qQTRrjiF9GAcC5j2h6X7R1LFSeJktfRTQh7jLGknAwi2OwAzQ-1yRrkCrSuAXLkKtS05amrvsFvocqg681cCLZGk3LrvG12h4B-WkFLl9rSNr_IVujDeighBLSGKjiP3qD5cf4z3EZXhSkD3J10GL2_PG-mr_FiNZtPJ4s4o5I2MR0rCkoYELKQXAAuGOeMpwzwmAuWYiZMztM8hxwrVRQiVZhBmptxYphJEzaMHvq9tXdfRwiN3rujr9pITTjmhCiRqNYle1fm2y95KHTt7cH4X02w7qDqf6i6g6p7qLqH2o4-ngJMyExZeFNlNpznqRxjKkj3kPveZwHg3BZCJYoo9gf_2YES</recordid><startdate>20140201</startdate><enddate>20140201</enddate><creator>Yang, Bo</creator><creator>Zhu, Guangxi</creator><creator>Wu, Weimin</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>20140201</creationdate><title>The Impact of Speed on the Convergence of Gossip Algorithms with Mobility in Wireless Sensor Networks</title><author>Yang, Bo ; Zhu, Guangxi ; Wu, Weimin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c282t-2492e96ae68f856e0f35535b3e04563b036ad5bdded099ff6b903ebda47a3ab73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Ad hoc networks</topic><topic>Applied sciences</topic><topic>Convergence</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>distributed average consensus</topic><topic>Estimation error</topic><topic>Exact sciences and technology</topic><topic>gossip algorithms</topic><topic>Information, signal and communications theory</topic><topic>Lattices</topic><topic>mobility</topic><topic>Organization and planning of networks (techniques and equipments)</topic><topic>Services and terminals of telecommunications</topic><topic>Signal and communications theory</topic><topic>Signal processing algorithms</topic><topic>Signal, noise</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Telemetry. Remote supervision. Telewarning. Remote control</topic><topic>Upper bound</topic><topic>Wireless sensor network</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Bo</creatorcontrib><creatorcontrib>Zhu, Guangxi</creatorcontrib><creatorcontrib>Wu, Weimin</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yang, Bo</au><au>Zhu, Guangxi</au><au>Wu, Weimin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Impact of Speed on the Convergence of Gossip Algorithms with Mobility in Wireless Sensor Networks</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2014-02-01</date><risdate>2014</risdate><volume>18</volume><issue>2</issue><spage>221</spage><epage>224</epage><pages>221-224</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>This work presents two speed based mobility models for gossip algorithms in wireless sensor networks. The corresponding upper bounds on the convergence time are derived, which show the relationship between speed of agents and convergence rate of gossip algorithms. The influences of speed are examined under both mobility models. Simulation results indicate that the speed based mobility model can offer more precise estimates of communication cost, which provide useful references for large-scale sensor network planning.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2013.120713.131595</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2014-02, Vol.18 (2), p.221-224 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_proquest_journals_1505119679 |
| source | IEEE Electronic Library (IEL) |
| subjects | Ad hoc networks Applied sciences Convergence Detection, estimation, filtering, equalization, prediction distributed average consensus Estimation error Exact sciences and technology gossip algorithms Information, signal and communications theory Lattices mobility Organization and planning of networks (techniques and equipments) Services and terminals of telecommunications Signal and communications theory Signal processing algorithms Signal, noise Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Telemetry. Remote supervision. Telewarning. Remote control Upper bound Wireless sensor network Wireless sensor networks |
| title | The Impact of Speed on the Convergence of Gossip Algorithms with Mobility 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-25T13%3A59%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Impact%20of%20Speed%20on%20the%20Convergence%20of%20Gossip%20Algorithms%20with%20Mobility%20in%20Wireless%20Sensor%20Networks&rft.jtitle=IEEE%20communications%20letters&rft.au=Yang,%20Bo&rft.date=2014-02-01&rft.volume=18&rft.issue=2&rft.spage=221&rft.epage=224&rft.pages=221-224&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2013.120713.131595&rft_dat=%3Cproquest_RIE%3E3240832121%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1505119679&rft_id=info:pmid/&rft_ieee_id=6697919&rfr_iscdi=true |