Single-Step Creation of Localized Delaunay Triangulations
Main Author: | |
---|---|
Publication Date: | 2006 |
Other Authors: | |
Format: | Report |
Language: | eng |
Source: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Download full: | http://hdl.handle.net/10316/13602 |
Summary: | A localized Delaunay triangulation owns the following interesting properties for sensor and wireless ad hoc networks: it can be built with localized information, the communication cost imposed by control information is limited, and it supports geographical routing algorithms that offer guaranteed convergence. This paper presents two localized algorithms, FLDT1 and FLDT2, that build a graph called planar localized Delaunay triangulation, P LDel, known to be a good spanner of the Unit Disk Graph, UDG. Our algorithms improve previous algorithms with similar theoretical bounds in the following aspects: unlike previous work, FLDT1 and FLDT2 build P LDel in a single communication step, maintaining a communication cost of O(n log n), which is within a constant of the optimal. Additionally, we show that FLDT1 is more robust than previous triangulation algorithms, because it does not require the strict UDG connectivity model to work. The small signaling cost of our algorithms allows us to improve routing performance, by efficiently using the P LDel graph instead of sparser graphs, like the Gabriel or the Relative Neighborhood graphs. |
id |
RCAP_ad1abf7e02513b5e47085c1bd4829d71 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/13602 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Single-Step Creation of Localized Delaunay TriangulationsWireless communicationRouting protocolsDelaunay triangulationA localized Delaunay triangulation owns the following interesting properties for sensor and wireless ad hoc networks: it can be built with localized information, the communication cost imposed by control information is limited, and it supports geographical routing algorithms that offer guaranteed convergence. This paper presents two localized algorithms, FLDT1 and FLDT2, that build a graph called planar localized Delaunay triangulation, P LDel, known to be a good spanner of the Unit Disk Graph, UDG. Our algorithms improve previous algorithms with similar theoretical bounds in the following aspects: unlike previous work, FLDT1 and FLDT2 build P LDel in a single communication step, maintaining a communication cost of O(n log n), which is within a constant of the optimal. Additionally, we show that FLDT1 is more robust than previous triangulation algorithms, because it does not require the strict UDG connectivity model to work. The small signaling cost of our algorithms allows us to improve routing performance, by efficiently using the P LDel graph instead of sparser graphs, like the Gabriel or the Relative Neighborhood graphs.Univesity of Coimbra. Centre for Informatics and Systems2006info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reporthttp://hdl.handle.net/10316/13602http://hdl.handle.net/10316/13602engARAÚJO, Filipe; RODRIGUES, Luís - Single-Step Creation of Localized Delaunay Triangulations. Coimbra : CISUC, 2006. (CISUC, TR-3)0874-338XAraújo, FilipeRodrigues, Luísinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2020-05-25T12:19:28Zoai:estudogeral.uc.pt:10316/13602Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:58:19.237165Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Single-Step Creation of Localized Delaunay Triangulations |
title |
Single-Step Creation of Localized Delaunay Triangulations |
spellingShingle |
Single-Step Creation of Localized Delaunay Triangulations Araújo, Filipe Wireless communication Routing protocols Delaunay triangulation |
title_short |
Single-Step Creation of Localized Delaunay Triangulations |
title_full |
Single-Step Creation of Localized Delaunay Triangulations |
title_fullStr |
Single-Step Creation of Localized Delaunay Triangulations |
title_full_unstemmed |
Single-Step Creation of Localized Delaunay Triangulations |
title_sort |
Single-Step Creation of Localized Delaunay Triangulations |
author |
Araújo, Filipe |
author_facet |
Araújo, Filipe Rodrigues, Luís |
author_role |
author |
author2 |
Rodrigues, Luís |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Araújo, Filipe Rodrigues, Luís |
dc.subject.por.fl_str_mv |
Wireless communication Routing protocols Delaunay triangulation |
topic |
Wireless communication Routing protocols Delaunay triangulation |
description |
A localized Delaunay triangulation owns the following interesting properties for sensor and wireless ad hoc networks: it can be built with localized information, the communication cost imposed by control information is limited, and it supports geographical routing algorithms that offer guaranteed convergence. This paper presents two localized algorithms, FLDT1 and FLDT2, that build a graph called planar localized Delaunay triangulation, P LDel, known to be a good spanner of the Unit Disk Graph, UDG. Our algorithms improve previous algorithms with similar theoretical bounds in the following aspects: unlike previous work, FLDT1 and FLDT2 build P LDel in a single communication step, maintaining a communication cost of O(n log n), which is within a constant of the optimal. Additionally, we show that FLDT1 is more robust than previous triangulation algorithms, because it does not require the strict UDG connectivity model to work. The small signaling cost of our algorithms allows us to improve routing performance, by efficiently using the P LDel graph instead of sparser graphs, like the Gabriel or the Relative Neighborhood graphs. |
publishDate |
2006 |
dc.date.none.fl_str_mv |
2006 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/report |
format |
report |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10316/13602 http://hdl.handle.net/10316/13602 |
url |
http://hdl.handle.net/10316/13602 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
ARAÚJO, Filipe; RODRIGUES, Luís - Single-Step Creation of Localized Delaunay Triangulations. Coimbra : CISUC, 2006. (CISUC, TR-3) 0874-338X |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Univesity of Coimbra. Centre for Informatics and Systems |
publisher.none.fl_str_mv |
Univesity of Coimbra. Centre for Informatics and Systems |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799133873994465280 |