Optimal coverage deployment for wireless sensor networks

Wireless sensor networks provide an alternative way of improving our environments, such as environment surveillance, hazard monitoring, and other customized environmental applications. Good coverage of service in a sensor network is an essential issue to ensure the quality of service. This paper stu...

Full description

Saved in:
Bibliographic Details
Main Authors: Yung-Tsung Hou, Tzu-Chen Lee, Bing-Chiang Jeng, Chia-Mei Chen
Format: Conference Proceeding
Language:English
Subjects:
best-case coverage
Computational geometry
coverage
deployment
Environmental management
Graph theory
Hazards
Monitoring
Observability
Polynomials
Quality of service
Sensor networks
Surveillance
Wireless sensor networks
worst-case coverage
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 527
container_issue
container_start_page 5 pp.
container_title
container_volume 1
creator Yung-Tsung Hou
Tzu-Chen Lee
Bing-Chiang Jeng
Chia-Mei Chen
description Wireless sensor networks provide an alternative way of improving our environments, such as environment surveillance, hazard monitoring, and other customized environmental applications. Good coverage of service in a sensor network is an essential issue to ensure the quality of service. This paper studies the deployment of new sensor nodes such that the improvement of the coverage is optimized. Based on computational geometry and graph theory, we propose an optimal polynomial time algorithm for sensor node deployment. We also prove the properties of such deployment and the correctness of the optimal solution
doi_str_mv 10.1109/ICACT.2006.206022
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1625627</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1625627</ieee_id><sourcerecordid>1625627</sourcerecordid><originalsourceid>FETCH-ieee_primary_16256273</originalsourceid><addsrcrecordid>eNp9jL0KwjAUhS-I4F8fQFzyAtYkNbEZpSg6uXQvRW-lmjYlt1j69mZw9gzn4_DBAVgLHgvBze6aHbM8lpzrUJpLOYFFapQSRkizn0FE9OIhiUmUTOeQ3rq-bkrL7u6Dvnwie2Bn3dhg27PKeTbUHi0SMcKWwm6xH5x_0wqmVWkJox-XsDmf8uyyrRGx6Hw49WMhtFRaHpL_9gsbSzaz</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimal coverage deployment for wireless sensor networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yung-Tsung Hou ; Tzu-Chen Lee ; Bing-Chiang Jeng ; Chia-Mei Chen</creator><creatorcontrib>Yung-Tsung Hou ; Tzu-Chen Lee ; Bing-Chiang Jeng ; Chia-Mei Chen</creatorcontrib><description>Wireless sensor networks provide an alternative way of improving our environments, such as environment surveillance, hazard monitoring, and other customized environmental applications. Good coverage of service in a sensor network is an essential issue to ensure the quality of service. This paper studies the deployment of new sensor nodes such that the improvement of the coverage is optimized. Based on computational geometry and graph theory, we propose an optimal polynomial time algorithm for sensor node deployment. We also prove the properties of such deployment and the correctness of the optimal solution</description><identifier>ISBN: 8955191294</identifier><identifier>ISBN: 9788955191295</identifier><identifier>DOI: 10.1109/ICACT.2006.206022</identifier><language>eng</language><publisher>IEEE</publisher><subject>best-case coverage ; Computational geometry ; coverage ; deployment ; Environmental management ; Graph theory ; Hazards ; Monitoring ; Observability ; Polynomials ; Quality of service ; Sensor networks ; Surveillance ; Wireless sensor networks ; worst-case coverage</subject><ispartof>2006 8th International Conference Advanced Communication Technology, 2006, Vol.1, p.5 pp.-527</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/1625627$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1625627$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yung-Tsung Hou</creatorcontrib><creatorcontrib>Tzu-Chen Lee</creatorcontrib><creatorcontrib>Bing-Chiang Jeng</creatorcontrib><creatorcontrib>Chia-Mei Chen</creatorcontrib><title>Optimal coverage deployment for wireless sensor networks</title><title>2006 8th International Conference Advanced Communication Technology</title><addtitle>ICACT</addtitle><description>Wireless sensor networks provide an alternative way of improving our environments, such as environment surveillance, hazard monitoring, and other customized environmental applications. Good coverage of service in a sensor network is an essential issue to ensure the quality of service. This paper studies the deployment of new sensor nodes such that the improvement of the coverage is optimized. Based on computational geometry and graph theory, we propose an optimal polynomial time algorithm for sensor node deployment. We also prove the properties of such deployment and the correctness of the optimal solution</description><subject>best-case coverage</subject><subject>Computational geometry</subject><subject>coverage</subject><subject>deployment</subject><subject>Environmental management</subject><subject>Graph theory</subject><subject>Hazards</subject><subject>Monitoring</subject><subject>Observability</subject><subject>Polynomials</subject><subject>Quality of service</subject><subject>Sensor networks</subject><subject>Surveillance</subject><subject>Wireless sensor networks</subject><subject>worst-case coverage</subject><isbn>8955191294</isbn><isbn>9788955191295</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNp9jL0KwjAUhS-I4F8fQFzyAtYkNbEZpSg6uXQvRW-lmjYlt1j69mZw9gzn4_DBAVgLHgvBze6aHbM8lpzrUJpLOYFFapQSRkizn0FE9OIhiUmUTOeQ3rq-bkrL7u6Dvnwie2Bn3dhg27PKeTbUHi0SMcKWwm6xH5x_0wqmVWkJox-XsDmf8uyyrRGx6Hw49WMhtFRaHpL_9gsbSzaz</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Yung-Tsung Hou</creator><creator>Tzu-Chen Lee</creator><creator>Bing-Chiang Jeng</creator><creator>Chia-Mei Chen</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2006</creationdate><title>Optimal coverage deployment for wireless sensor networks</title><author>Yung-Tsung Hou ; Tzu-Chen Lee ; Bing-Chiang Jeng ; Chia-Mei Chen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-ieee_primary_16256273</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>best-case coverage</topic><topic>Computational geometry</topic><topic>coverage</topic><topic>deployment</topic><topic>Environmental management</topic><topic>Graph theory</topic><topic>Hazards</topic><topic>Monitoring</topic><topic>Observability</topic><topic>Polynomials</topic><topic>Quality of service</topic><topic>Sensor networks</topic><topic>Surveillance</topic><topic>Wireless sensor networks</topic><topic>worst-case coverage</topic><toplevel>online_resources</toplevel><creatorcontrib>Yung-Tsung Hou</creatorcontrib><creatorcontrib>Tzu-Chen Lee</creatorcontrib><creatorcontrib>Bing-Chiang Jeng</creatorcontrib><creatorcontrib>Chia-Mei Chen</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 Xplore (IEEE/IET 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>Yung-Tsung Hou</au><au>Tzu-Chen Lee</au><au>Bing-Chiang Jeng</au><au>Chia-Mei Chen</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimal coverage deployment for wireless sensor networks</atitle><btitle>2006 8th International Conference Advanced Communication Technology</btitle><stitle>ICACT</stitle><date>2006</date><risdate>2006</risdate><volume>1</volume><spage>5 pp.</spage><epage>527</epage><pages>5 pp.-527</pages><isbn>8955191294</isbn><isbn>9788955191295</isbn><abstract>Wireless sensor networks provide an alternative way of improving our environments, such as environment surveillance, hazard monitoring, and other customized environmental applications. Good coverage of service in a sensor network is an essential issue to ensure the quality of service. This paper studies the deployment of new sensor nodes such that the improvement of the coverage is optimized. Based on computational geometry and graph theory, we propose an optimal polynomial time algorithm for sensor node deployment. We also prove the properties of such deployment and the correctness of the optimal solution</abstract><pub>IEEE</pub><doi>10.1109/ICACT.2006.206022</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 8955191294
ispartof 2006 8th International Conference Advanced Communication Technology, 2006, Vol.1, p.5 pp.-527
issn
language eng
recordid cdi_ieee_primary_1625627
source IEEE Electronic Library (IEL) Conference Proceedings
subjects best-case coverage
Computational geometry
coverage
deployment
Environmental management
Graph theory
Hazards
Monitoring
Observability
Polynomials
Quality of service
Sensor networks
Surveillance
Wireless sensor networks
worst-case coverage
title Optimal coverage deployment for wireless sensor networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T20%3A15%3A58IST&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=Optimal%20coverage%20deployment%20for%20wireless%20sensor%20networks&rft.btitle=2006%208th%20International%20Conference%20Advanced%20Communication%20Technology&rft.au=Yung-Tsung%20Hou&rft.date=2006&rft.volume=1&rft.spage=5%20pp.&rft.epage=527&rft.pages=5%20pp.-527&rft.isbn=8955191294&rft.isbn_list=9788955191295&rft_id=info:doi/10.1109/ICACT.2006.206022&rft_dat=%3Cieee_6IE%3E1625627%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-ieee_primary_16256273%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1625627&rfr_iscdi=true