Mostra el registre d'ítem simple
Minimizing interference in ad hoc networks with bounded communication radius
dc.contributor.author | Korman Cozzetti, Matías |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
dc.date.accessioned | 2013-07-05T08:09:40Z |
dc.date.created | 2012-10-15 |
dc.date.issued | 2012-10-15 |
dc.identifier.citation | Korman, M. Minimizing interference in ad hoc networks with bounded communication radius. "Information processing letters", 15 Octubre 2012, vol. 112, núm. 19, p. 748-752. |
dc.identifier.issn | 0020-0190 |
dc.identifier.uri | http://hdl.handle.net/2117/19814 |
dc.description.abstract | We consider a topology control problem in which we are given a set of sensors in RdRd and we would like to assign a communication radius to each of them so that they generate a connected network and have low receiver-based interference (defined as the largest in-degree of the network). We show that any radii assignment that generates a connected network can be modified so that interference is (asymptotically) unaffected and no sensor is assigned communication radius larger than RminRmin, where RminRmin is the smallest possible radius needed to obtain strong connectivity. Combining this result with the previous network construction methods (see Halldórsson and Tokuyama (2008) [7] and von Rickenbach et al. (2009) [11]), we obtain a way to construct a connected network of low interference and bounded radii. Since the radius of a sensor is only affected by neighboring sensors, this construction can be done in a distributed fashion. |
dc.format.extent | 5 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències |
dc.subject.lcsh | Ad hoc networks |
dc.subject.lcsh | Algorithm |
dc.subject.other | Algorithms |
dc.subject.other | Ad hoc networks |
dc.subject.other | Interference |
dc.subject.other | Minimum spanning tree |
dc.subject.other | Bucketing |
dc.title | Minimizing interference in ad hoc networks with bounded communication radius |
dc.type | Article |
dc.subject.lemac | Xarxes ad hoc |
dc.subject.lemac | Algorismes |
dc.identifier.doi | 10.1016/j.ipl.2012.06.021 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S002001901200172X |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 11056677 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Korman, M. |
local.citation.publicationName | Information processing letters |
local.citation.volume | 112 |
local.citation.number | 19 |
local.citation.startingPage | 748 |
local.citation.endingPage | 752 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.261]