Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks: Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks
A new algorithm named QGCC (Quasi-Grid based Cooperative Coverage) is proposed in this paper, which employs virtual quasi-grid structure and cooperative sensing model to reduce the number of active nodes, and to prolong the coverage lifetime. In QGCC, a low-complexity distributed method is designed...
Gespeichert in:
| Veröffentlicht in: | Dian zi yu xin xi xue bao = Journal of electronics & information technology 2010-10, Vol.32 (10), p.2531-2535 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | chi |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2535 |
|---|---|
| container_issue | 10 |
| container_start_page | 2531 |
| container_title | Dian zi yu xin xi xue bao = Journal of electronics & information technology |
| container_volume | 32 |
| creator | Liu, Zhi Qiu, Zheng-Ding |
| description | A new algorithm named QGCC (Quasi-Grid based Cooperative Coverage) is proposed in this paper, which employs virtual quasi-grid structure and cooperative sensing model to reduce the number of active nodes, and to prolong the coverage lifetime. In QGCC, a low-complexity distributed method is designed to determine the vertexes of grid, and an energy efficient node scheduling scheme is presented. QGCC also introduces a new metric named irregularity to analyze the impact of the deviation between keeper and its ideal vertex. Simulations show that, compared to the reference algorithms, QGCC can efficiently reduce the number of active nodes, and prolong the coverage lifetime. Another notable feature of QGCC is that, the coverage lifetime is approximate linear related to the number of nodes, which means this algorithm can make good use of redundant nodes. |
| doi_str_mv | 10.3724/SP.J.1146.2009.01420 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_861555572</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>861555572</sourcerecordid><originalsourceid>FETCH-LOGICAL-c231t-cb81f4bdb720d052e4f71f9eb7a4f0a3cad275c08f5b84f885670ea976245663</originalsourceid><addsrcrecordid>eNp9kDtPwzAUhT2ARFX6DxiywZJw7fiRjKXiVVVQ1EqMlpNcl0BaFzst4t_jUmbucs6RPt3hI-SCQpYrxq8X82yaUcplxgDKDChncEIGNI5UFKU8I6MQ3gGA5kzKkg3I7GVnQpuufNskNyZgk0yc26I3fbvH2PexrjAZdyvn2_5tnVjnk9fWY4chJAvchLifsP9y_iOck1NruoCjvxyS5d3tcvKQzp7vHyfjWVqznPZpXRXU8qqpFIMGBENuFbUlVspwCyavTcOUqKGwoiq4LQohFaAplWRcSJkPyeXx7da7zx2GXq_bUGPXmQ26XdCFpCKeYpG8-pekKppRJXARUX5Ea-9C8Gj11rdr4781BX2QqxdzPdUHufogV__KzX8A105uyw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1700979045</pqid></control><display><type>article</type><title>Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks: Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks</title><source>Alma/SFX Local Collection</source><creator>Liu, Zhi ; Qiu, Zheng-Ding</creator><creatorcontrib>Liu, Zhi ; Qiu, Zheng-Ding</creatorcontrib><description>A new algorithm named QGCC (Quasi-Grid based Cooperative Coverage) is proposed in this paper, which employs virtual quasi-grid structure and cooperative sensing model to reduce the number of active nodes, and to prolong the coverage lifetime. In QGCC, a low-complexity distributed method is designed to determine the vertexes of grid, and an energy efficient node scheduling scheme is presented. QGCC also introduces a new metric named irregularity to analyze the impact of the deviation between keeper and its ideal vertex. Simulations show that, compared to the reference algorithms, QGCC can efficiently reduce the number of active nodes, and prolong the coverage lifetime. Another notable feature of QGCC is that, the coverage lifetime is approximate linear related to the number of nodes, which means this algorithm can make good use of redundant nodes.</description><identifier>ISSN: 1009-5896</identifier><identifier>DOI: 10.3724/SP.J.1146.2009.01420</identifier><language>chi</language><subject>Algorithms ; Approximation ; Computer simulation ; Deviation ; Electronics ; Information systems ; Redundant ; Scheduling</subject><ispartof>Dian zi yu xin xi xue bao = Journal of electronics & information technology, 2010-10, Vol.32 (10), p.2531-2535</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c231t-cb81f4bdb720d052e4f71f9eb7a4f0a3cad275c08f5b84f885670ea976245663</citedby><cites>FETCH-LOGICAL-c231t-cb81f4bdb720d052e4f71f9eb7a4f0a3cad275c08f5b84f885670ea976245663</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Liu, Zhi</creatorcontrib><creatorcontrib>Qiu, Zheng-Ding</creatorcontrib><title>Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks: Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks</title><title>Dian zi yu xin xi xue bao = Journal of electronics & information technology</title><description>A new algorithm named QGCC (Quasi-Grid based Cooperative Coverage) is proposed in this paper, which employs virtual quasi-grid structure and cooperative sensing model to reduce the number of active nodes, and to prolong the coverage lifetime. In QGCC, a low-complexity distributed method is designed to determine the vertexes of grid, and an energy efficient node scheduling scheme is presented. QGCC also introduces a new metric named irregularity to analyze the impact of the deviation between keeper and its ideal vertex. Simulations show that, compared to the reference algorithms, QGCC can efficiently reduce the number of active nodes, and prolong the coverage lifetime. Another notable feature of QGCC is that, the coverage lifetime is approximate linear related to the number of nodes, which means this algorithm can make good use of redundant nodes.</description><subject>Algorithms</subject><subject>Approximation</subject><subject>Computer simulation</subject><subject>Deviation</subject><subject>Electronics</subject><subject>Information systems</subject><subject>Redundant</subject><subject>Scheduling</subject><issn>1009-5896</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNp9kDtPwzAUhT2ARFX6DxiywZJw7fiRjKXiVVVQ1EqMlpNcl0BaFzst4t_jUmbucs6RPt3hI-SCQpYrxq8X82yaUcplxgDKDChncEIGNI5UFKU8I6MQ3gGA5kzKkg3I7GVnQpuufNskNyZgk0yc26I3fbvH2PexrjAZdyvn2_5tnVjnk9fWY4chJAvchLifsP9y_iOck1NruoCjvxyS5d3tcvKQzp7vHyfjWVqznPZpXRXU8qqpFIMGBENuFbUlVspwCyavTcOUqKGwoiq4LQohFaAplWRcSJkPyeXx7da7zx2GXq_bUGPXmQ26XdCFpCKeYpG8-pekKppRJXARUX5Ea-9C8Gj11rdr4781BX2QqxdzPdUHufogV__KzX8A105uyw</recordid><startdate>201010</startdate><enddate>201010</enddate><creator>Liu, Zhi</creator><creator>Qiu, Zheng-Ding</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201010</creationdate><title>Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks</title><author>Liu, Zhi ; Qiu, Zheng-Ding</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c231t-cb81f4bdb720d052e4f71f9eb7a4f0a3cad275c08f5b84f885670ea976245663</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>chi</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Approximation</topic><topic>Computer simulation</topic><topic>Deviation</topic><topic>Electronics</topic><topic>Information systems</topic><topic>Redundant</topic><topic>Scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Zhi</creatorcontrib><creatorcontrib>Qiu, Zheng-Ding</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Dian zi yu xin xi xue bao = Journal of electronics & information technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Zhi</au><au>Qiu, Zheng-Ding</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks: Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks</atitle><jtitle>Dian zi yu xin xi xue bao = Journal of electronics & information technology</jtitle><date>2010-10</date><risdate>2010</risdate><volume>32</volume><issue>10</issue><spage>2531</spage><epage>2535</epage><pages>2531-2535</pages><issn>1009-5896</issn><abstract>A new algorithm named QGCC (Quasi-Grid based Cooperative Coverage) is proposed in this paper, which employs virtual quasi-grid structure and cooperative sensing model to reduce the number of active nodes, and to prolong the coverage lifetime. In QGCC, a low-complexity distributed method is designed to determine the vertexes of grid, and an energy efficient node scheduling scheme is presented. QGCC also introduces a new metric named irregularity to analyze the impact of the deviation between keeper and its ideal vertex. Simulations show that, compared to the reference algorithms, QGCC can efficiently reduce the number of active nodes, and prolong the coverage lifetime. Another notable feature of QGCC is that, the coverage lifetime is approximate linear related to the number of nodes, which means this algorithm can make good use of redundant nodes.</abstract><doi>10.3724/SP.J.1146.2009.01420</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1009-5896 |
| ispartof | Dian zi yu xin xi xue bao = Journal of electronics & information technology, 2010-10, Vol.32 (10), p.2531-2535 |
| issn | 1009-5896 |
| language | chi |
| recordid | cdi_proquest_miscellaneous_861555572 |
| source | Alma/SFX Local Collection |
| subjects | Algorithms Approximation Computer simulation Deviation Electronics Information systems Redundant Scheduling |
| title | Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks: Quasi-grid Based Cooperative Coverage Algorithm 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-02-04T14%3A00%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quasi-grid%20Based%20Cooperative%20Coverage%20Algorithm%20for%20Wireless%20Sensor%20Networks:%20Quasi-grid%20Based%20Cooperative%20Coverage%20Algorithm%20for%20Wireless%20Sensor%20Networks&rft.jtitle=Dian%20zi%20yu%20xin%20xi%20xue%20bao%20=%20Journal%20of%20electronics%20&%20information%20technology&rft.au=Liu,%20Zhi&rft.date=2010-10&rft.volume=32&rft.issue=10&rft.spage=2531&rft.epage=2535&rft.pages=2531-2535&rft.issn=1009-5896&rft_id=info:doi/10.3724/SP.J.1146.2009.01420&rft_dat=%3Cproquest_cross%3E861555572%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1700979045&rft_id=info:pmid/&rfr_iscdi=true |