Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/13602
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Araújo, Filipe | - |
dc.contributor.author | Rodrigues, Luís | - |
dc.date.accessioned | 2010-08-17T10:23:35Z | - |
dc.date.available | 2010-08-17T10:23:35Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | ARAÚJO, Filipe; RODRIGUES, Luís - Single-Step Creation of Localized Delaunay Triangulations. Coimbra : CISUC, 2006. (CISUC, TR-3) | en_US |
dc.identifier.issn | 0874-338X | - |
dc.identifier.uri | https://hdl.handle.net/10316/13602 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Univesity of Coimbra. Centre for Informatics and Systems | en_US |
dc.rights | openAccess | en_US |
dc.subject | Wireless communication | en_US |
dc.subject | Routing protocols | en_US |
dc.subject | Delaunay triangulation | en_US |
dc.title | Single-Step Creation of Localized Delaunay Triangulations | en_US |
dc.type | report | en_US |
degois.publication.location | Coimbra | en_US |
degois.publication.title | Single-Step Creation of Localized Delaunay Triangulations | en_US |
uc.controloAutoridade | Sim | - |
item.grantfulltext | open | - |
item.fulltext | Com Texto completo | - |
item.openairetype | report | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_93fc | - |
item.cerifentitytype | Publications | - |
crisitem.author.researchunit | CISUC - Centre for Informatics and Systems of the University of Coimbra | - |
crisitem.author.parentresearchunit | Faculty of Sciences and Technology | - |
crisitem.author.orcid | 0000-0002-1663-1937 | - |
Appears in Collections: | FCTUC Eng.Informática - Relatórios Técnicos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Single-Step Creation of Localized Delaunay Triangulations.pdf | 334.06 kB | Adobe PDF | View/Open |
Page view(s) 50
454
checked on Apr 23, 2024
Download(s) 50
568
checked on Apr 23, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.