Buscar
Mostrando ítems 1-10 de 35
Throughput maximization in multi-hop wireless networks under a secrecy constraint
(2016-11-09)
This paper analyzes the achievable throughput of multi-hop sensor networks for industrial applications under a secrecy constraint and malicious jamming. The evaluation scenario comprises sensors that measure some relevant ...
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
(ELSEVIER SCIENCE BV, 2008)
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short ...
WAN design with demand, hop limit and path diversity constraints
(UR. FI-INCO,, 2008)
This thesis presents a challenging telecommunication network design problem, in which the network designer has to assure not only connectivity, but also some degree of performance guarantee and survivability to the solution. ...
An integer linear programming approach for approximate string comparison
(ELSEVIER SCIENCE BV, 2009)
We introduce a problem called maximum common characters in blocks (MCCB), which arises in applications of approximate string comparison, particularly in the unification of possibly erroneous textual data coming from different ...
The effects of polarization mode dispersion on 2D wavelength-hopping time spreading code routed networks
(SpringerNew YorkEUA, 2010)
A Biased Random-key Genetic Algorithm For Wireless Backhaul Network Design
(ELSEVIER SCIENCE BVAMSTERDAM, 2015)
Métodos integrados para organização de redes de sensores sem fio com sorvedouro móvel e controle de densidade
(Universidade Federal de Minas GeraisUFMG, 2007-03-09)
In this work we present two new methods for organization of Wireless Sensor Network (WSN). These methods integrate the density control and sink mobility to optimize some important WSN' metrics. In traditional methods, with ...