Mostra el registre d'ítem simple

dc.contributor.authorKorman Cozzetti, Matías
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.date.accessioned2013-07-05T08:09:40Z
dc.date.created2012-10-15
dc.date.issued2012-10-15
dc.identifier.citationKorman, 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.issn0020-0190
dc.identifier.urihttp://hdl.handle.net/2117/19814
dc.description.abstractWe 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.extent5 p.
dc.language.isoeng
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.lcshAd hoc networks
dc.subject.lcshAlgorithm
dc.subject.otherAlgorithms
dc.subject.otherAd hoc networks
dc.subject.otherInterference
dc.subject.otherMinimum spanning tree
dc.subject.otherBucketing
dc.titleMinimizing interference in ad hoc networks with bounded communication radius
dc.typeArticle
dc.subject.lemacXarxes ad hoc
dc.subject.lemacAlgorismes
dc.identifier.doi10.1016/j.ipl.2012.06.021
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S002001901200172X
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac11056677
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorKorman, M.
local.citation.publicationNameInformation processing letters
local.citation.volume112
local.citation.number19
local.citation.startingPage748
local.citation.endingPage752


Fitxers d'aquest items

Imatge en miniatura

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple