<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://hdl.handle.net/2117/1935">
    <title>DSpace Collection:</title>
    <link>http://hdl.handle.net/2117/1935</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://hdl.handle.net/2117/18153" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/18044" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/17447" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/17262" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/17181" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/17176" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/17166" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/17159" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/16590" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/16579" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/16578" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/16576" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/16575" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/16473" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/16081" />
      </rdf:Seq>
    </items>
    <dc:date>2013-05-25T14:31:56Z</dc:date>
  </channel>
  <item rdf:about="http://hdl.handle.net/2117/18153">
    <title>COACH: COllaborative certificate stAtus CHecking mechanism for VANETs</title>
    <link>http://hdl.handle.net/2117/18153</link>
    <description>Title: COACH: COllaborative certificate stAtus CHecking mechanism for VANETs
Authors: Hernández Gañán, Carlos; Muñoz Tapia, José Luis; Esparza Martín, Óscar; Mata Diaz, Jorge; Hernández Serrano, Juan; Alins Delgado, Juan José
Abstract: Vehicular Ad Hoc Networks (VANETs) require mechanisms to authenticate messages, identify valid vehicles, and remove misbehaving vehicles. A public key infrastructure (PKI) can be used to provide these functionalities using digital certificates. However, if a vehicle is no longer trusted, its certificates have to be revoked and this status information has to be made available to other vehicles as soon as possible. In this paper, we propose a collaborative certificate status checking mechanism called COACH to efficiently distribute certificate revocation information in VANETs. In COACH, we embed a hash tree in each standard Certificate Revocation List (CRL). This dual structure is called extended-CRL. A node possessing an extended-CRL can respond to certificate status requests without having to send the complete CRL. Instead, the node can send a short response (less than 1 kB) that fits in a single UDP message. Obviously, the substructures included in the short responses are authenticated. This means that any node possessing an extended-CRL can produce short responses that can be authenticated (including Road Side Units or intermediate vehicles). We also propose an extension to the COACH mechanism called EvCOACH that is more efficient than COACH in scenarios with relatively low revocation rates per CRL validity period. To build EvCOACH, we embed an additional hash chain in the extended-CRL. Finally, by conducting a detailed performance evaluation, COACH and EvCOACH are proved to be reliable, efficient, and scalable.</description>
    <dc:date>2013-03-08T18:53:14Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/18044">
    <title>On the measurement of privacy as an attacker's estimation error</title>
    <link>http://hdl.handle.net/2117/18044</link>
    <description>Title: On the measurement of privacy as an attacker's estimation error
Authors: Rebollo Monedero, David; Parra Arnau, Javier; Diaz, Claudia; Forné Muñoz, Jorge
Abstract: A wide variety of privacy metrics have been proposed in the literature to evaluate the level of protection offered by privacy enhancing-technologies. Most of these metrics are specific to concrete systems and adversarial models, and are difficult to generalize or translate to other contexts. Furthermore, a better understanding of the relationships between the different privacy metrics is needed to enable more grounded and&#xD;
systematic approach to measuring privacy, as well as to assist system designers in selecting the most appropriate metric for a&#xD;
given application.&#xD;
In this work we propose a theoretical framework for privacypreserving&#xD;
systems, endowed with a general definition of privacy in terms of the estimation error incurred by an attacker who aims&#xD;
to disclose the private information that the system is designed to conceal. We show that our framework permits interpreting and&#xD;
comparing a number of well-known metrics under a common perspective.&#xD;
The arguments behind these interpretations are based on fundamental results related to the theories of information, probability and Bayes decision.</description>
    <dc:date>2013-03-04T12:09:21Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/17447">
    <title>Leveraging 802.11n frame aggregation to enhance QoS and power consumption in Wi-Fi networks</title>
    <link>http://hdl.handle.net/2117/17447</link>
    <description>Title: Leveraging 802.11n frame aggregation to enhance QoS and power consumption in Wi-Fi networks
Authors: Camps Mur, Daniel; Gomony, M.D.; Pérez Costa, Xavier; Sallent Ribes, Sebastián
Abstract: The Wi-Fi technology, driven by its tremendous success, is expanding into a wide variety of&#xD;
devices and applications. However, many of these new devices, like handheld devices, pose&#xD;
new challenges in terms of QoS and energy efficiency. In order to address these challenges,&#xD;
in this paper we study how the novel MAC aggregation mechanisms developed in the&#xD;
802.11n standard can be used to enhance the current 802.11 QoS and power saving protocols.&#xD;
Our contribution is twofold. First, we present a simulation study that illustrates the&#xD;
interactions between 802.11n and the current 802.11 QoS and power saving protocols. This&#xD;
study reveals that the 802.11n MAC aggregation mechanisms perform better when combined&#xD;
with the power save mode included in the original 802.11 standard than with the&#xD;
802.11e U-APSD protocol. Second, we design CA-DFA, an algorithm that, using only information&#xD;
available at layer two, adapts the amount of 802.11n aggregation used by a Wi-Fi&#xD;
station according to the level of congestion in the network. A detailed performance evaluation&#xD;
demonstrates the benefits of CA-DFA in terms of QoS, energy efficiency and network&#xD;
capacity with respect to state of the art alternatives.</description>
    <dc:date>2013-01-21T16:37:51Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/17262">
    <title>Optimal mapping of virtual networks with hidden hops</title>
    <link>http://hdl.handle.net/2117/17262</link>
    <description>Title: Optimal mapping of virtual networks with hidden hops
Authors: Botero Vega, Juan Felipe; Hesselbach Serra, Xavier; Fischer, Andreas; de Meer, Hermann
Abstract: Network virtualization has emerged as a solution for the Internet inability to address the required challenges caused by the lack of coordination among Internet service providers for the deployment of new services. The allocation of resources is one of the main problems in network virtualization, mainly in the mapping of virtual nodes and links to specific substrate nodes and paths, also known as the virtual network embedding problem. This paper proposes an algorithm based on optimization theory, to map the virtual links and nodes requiring a specific demand, looking for the maximization of the spare bandwidth and spare CPU in the substrate network, taking into account the CPU demanded by the hidden hops when a virtual link is mapped. The components of the virtual networks (nodes and links) that do not ask for an specific demand are then allocated following a fairness criteria</description>
    <dc:date>2013-01-10T13:11:39Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/17181">
    <title>On centralized schedulers for 802.11e WLANs distribution versus grouping of resources allocation</title>
    <link>http://hdl.handle.net/2117/17181</link>
    <description>Title: On centralized schedulers for 802.11e WLANs distribution versus grouping of resources allocation
Authors: Mur, D.C.; Pérez Costa, Xavier; Marchenko, V.; Sallent Ribes, Sebastián
Abstract: Wireless LAN is becoming a pervasive wireless access technology that can be found in almost any mobile device such&#xD;
as laptops, PDAs, portable game consoles and mobile phones. Each of these groups of devices have a different set of&#xD;
requirements according to their intended use and applications but most of them share two main requirements: QoS support&#xD;
to satisfy applications’ demands and power saving functionality to achieve an operating time according to users’ expectations.&#xD;
IEEE 802.11e defines two centralized solutions in order to address these problems: Hybrid Coordination Channel Access&#xD;
(HCCA) for QoS and Scheduled Automatic Power Save Delivery (S-APSD) for power saving. The focus of our work&#xD;
in this paper is the analysis and evaluation of a proposed centralized scheduler that makes use of both aforementioned&#xD;
IEEE 802.11e QoS and power saving solutions. Our contributions are as follows: (i) Design and analytical modeling of a&#xD;
proposed centralized scheduler (DRA) that maximizes the minimum distance between the resource allocations with pseudopolynomial&#xD;
complexity, (ii) Extensive performance evaluation of the QoS and power saving benefits of the Distribution&#xD;
proposal (DRA) as compared to a generic Grouping one (GRA), and (iii) Evaluation of the complexity and scalability of&#xD;
the proposal to assess its feasibility in practice.</description>
    <dc:date>2012-12-20T15:40:48Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/17176">
    <title>Magnetic induction for underwater wireless communication networks</title>
    <link>http://hdl.handle.net/2117/17176</link>
    <description>Title: Magnetic induction for underwater wireless communication networks
Authors: Domingo Aladrén, Mari Carmen
Abstract: Although acoustic waves are the most versatile and&#xD;
widely used physical layer technology for underwater wireless&#xD;
communication networks (UWCNs), they are adversely affected&#xD;
by ambient noise, multipath propagation, and fading. The large&#xD;
propagation delays, low bandwidth, and high bit error rates&#xD;
of the underwater acoustic channel hinder communication as&#xD;
well. These operational limits call for complementary technologies&#xD;
or communication alternatives when the acoustic channel&#xD;
is severely degraded. Magnetic induction (MI) is a promising&#xD;
technique for UWCNs that is not affected by large propagation&#xD;
delays, multipath propagation, and fading. In this paper, the&#xD;
MI communication channel has been modeled. Its propagation&#xD;
characteristics have been compared to the electromagnetic and&#xD;
acoustic communication systems through theoretical analysis and&#xD;
numerical evaluations. The results prove the feasibility of MI&#xD;
communication in underwater environments. The MI waveguide&#xD;
technique is developed to reduce path loss. The communication&#xD;
range between source and destination is considerably extended&#xD;
to hundreds of meters in fresh water due to its superior bit error&#xD;
rate performance.</description>
    <dc:date>2012-12-20T14:03:51Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/17166">
    <title>Energy efficient virtual network embedding</title>
    <link>http://hdl.handle.net/2117/17166</link>
    <description>Title: Energy efficient virtual network embedding
Authors: Botero Vega, Juan Felipe; Hesselbach Serra, Xavier; Duelli, Michael; Schlosser, Daniel; Fischer, A.; de Meer, Hermann
Abstract: Waste of energy due to over-provisioning and overdimensioning&#xD;
of network infrastructures has recently stimulated&#xD;
the interest on energy consumption reduction by Internet Service&#xD;
Providers (ISPs). By means of resource consolidation, network&#xD;
virtualization based architectures will enable energy saving. In&#xD;
this letter, we extend the well-known virtual network embedding&#xD;
problem (VNE) to energy awareness and propose a mixed&#xD;
integer program (MIP) which provides optimal energy efficient&#xD;
embeddings. Simulation results show the energy gains of the&#xD;
proposed MIP over the existing cost-based VNE approach.</description>
    <dc:date>2012-12-19T19:13:45Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/17159">
    <title>Throughput efficiency in body sensor networks: a clean-slate approach</title>
    <link>http://hdl.handle.net/2117/17159</link>
    <description>Title: Throughput efficiency in body sensor networks: a clean-slate approach
Authors: Domingo Aladrén, Mari Carmen
Abstract: In this paper, a flexible role-based architecture for Body Sensor Networks (BSNs) is introduced. The proposed non-layered context-aware architecture is application-oriented and able to incorporate future applications. Particular applications have certain requirements. Functional units (roles) instead of protocol layers are designed to perform the required tasks for applications to work properly. The role data of an application is inserted in the role headers of the container and is available for other applications with the same basic, specific or particular roles. Furthermore, the performance of Automatic Repeat Request (ARQ), Forward Error Correction (FEC) block codes and FEC convolutional codes with respect to the throughput efficiency has also been analyzed for a BSN following the proposed role-based architecture. The numerical results show that the proposed role-based architecture outperforms the traditional layered architecture with respect to the throughput efficiency for all error control schemes. FEC block codes are able to maintain a high throughput efficiency over longer distances because the hop length extension technique is applied.</description>
    <dc:date>2012-12-19T17:00:29Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/16590">
    <title>Cooperative detection of primary user emulation attacks in CRNs</title>
    <link>http://hdl.handle.net/2117/16590</link>
    <description>Title: Cooperative detection of primary user emulation attacks in CRNs
Authors: León Abarca, Olga; Hernández Serrano, Juan; Soriano Ibáñez, Miguel
Abstract: Cognitive radio networks (CRNs) can improve the utilization of the spectrum by making use of licensed spectrum in an opportunistic manner. With such purpose, coexistence mechanisms among CRN nodes or secondary users and legitimate users of the spectrum or primary users are defined. However, due to the particular features of CRNs, new security threats arise, such as the primary user emulation (PUE) attack, which is the most challenging among all. With the aim of detecting such kind of attacks, in this paper we propose a cooperative localization method specifically suited to CRNs which relies on TDoA measurements and Taylor-series estimations. Simulations results show the goodness of the proposed method and its suitability to typical CRN scenarios.</description>
    <dc:date>2012-09-27T16:00:01Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/16579">
    <title>Query profile obfuscation by means of optimal query exchange between users</title>
    <link>http://hdl.handle.net/2117/16579</link>
    <description>Title: Query profile obfuscation by means of optimal query exchange between users
Authors: Rebollo Monedero, David; Forné Muñoz, Jorge; Domingo Ferrer, Josep
Abstract: Abstract—We address the problem of query profile obfuscation by means of partial query exchanges between two users, in order for&#xD;
their profiles of interest to appear distorted to the information provider (database, search engine, etc.). We illustrate a methodology to&#xD;
reach mutual privacy gain, that is, a situation where both users increase their own privacy protection through collaboration in query&#xD;
exchange. To this end, our approach starts with a mathematical formulation, involving the modeling of the users’ apparent profiles as&#xD;
probability distributions over categories of interest, and the measure of their privacy as the corresponding Shannon entropy. The&#xD;
question of which query categories to exchange translates into finding optimization variables representing exchange policies, for&#xD;
various optimization objectives based on those entropies, possibly under exchange traffic constraints.</description>
    <dc:date>2012-09-26T09:32:52Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/16578">
    <title>A modeling of certificate revocation and its application to synthesis of revocation traces</title>
    <link>http://hdl.handle.net/2117/16578</link>
    <description>Title: A modeling of certificate revocation and its application to synthesis of revocation traces
Authors: Hernández Gañán, Carlos; Mata Diaz, Jorge; Muñoz Tapia, José Luis; Hernández Serrano, Juan; Esparza Martín, Óscar; Alins Delgado, Juan José
Abstract: One of the hardest tasks of a public key infrastructure (PKI) is to manage revocation. New&#xD;
communication paradigms push the revocation system to the limit and an accurate resource assessment&#xD;
is necessary before implementing a particular revocation distribution system. In this context, a precise&#xD;
modeling of certificate revocation is necessary. In this article, we analyze empirical data from real&#xD;
CAs to develop an accurate and rigorous model for certificate revocation. One of the key findings of&#xD;
our analysis is that the certificate revocation process is statistically self-similar. The proposed model&#xD;
is based on an autoregressive fractionally integrated moving average (ARFIMA) process. Then, using&#xD;
this model, we show how to build a synthetic revocation generator that can be used in simulations&#xD;
for resource assessment. Finally, we also show that our model produces synthetic revocation traces&#xD;
that are indistinguishable for practical purposes from those corresponding to actual revocations.</description>
    <dc:date>2012-09-26T09:21:41Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/16576">
    <title>Design of a P2P content recommendation system using affinity networks</title>
    <link>http://hdl.handle.net/2117/16576</link>
    <description>Title: Design of a P2P content recommendation system using affinity networks
Authors: Vera del Campo, Juan; Pegueroles Vallés, Josep R.; Hernández Serrano, Juan; Soriano Ibáñez, Miguel
Abstract: The success and intensive use of social networks makes strategies for efficient document location a hot&#xD;
topic of research. In this paper, we propose a common vector space to describe documents and users to&#xD;
create a social network based on affinities, and explore epidemic routing to recommend documents&#xD;
according to the user’s interests. Furthermore, we propose the creation of a SoftDHT structure to improve&#xD;
the recommendation results. Using these mechanisms, an efficient document recommender system with&#xD;
a fast organization of clusters of users based on their affinity can be provided, preventing the creation of&#xD;
unlinked communities. We show through simulations that the proposed system has a short convergence&#xD;
time and presents a high recall ratio.</description>
    <dc:date>2012-09-25T18:42:57Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/16575">
    <title>Low-cost group rekeying for unattended wireless sensor networks</title>
    <link>http://hdl.handle.net/2117/16575</link>
    <description>Title: Low-cost group rekeying for unattended wireless sensor networks
Authors: Hernández Serrano, Juan; Vera del Campo, Juan; Pegueroles Vallés, Josep R.; Gañán, Carlos
Abstract: Wireless sensor networks (WSNs) are made up&#xD;
of large groups of nodes that perform distributed monitoring&#xD;
services. Since sensor measurements are often sensitive&#xD;
data acquired in hostile environments, securing WSN&#xD;
becomes mandatory. However, WSNs consists of low-end&#xD;
devices and frequently preclude the presence of a centralized&#xD;
security manager. Therefore, achieving security is&#xD;
even more challenging. State-of-the-art proposals rely on:&#xD;
(1) attended and centralized security systems; or (2)&#xD;
establishing initial keys without taking into account how to&#xD;
efficiently manage rekeying. In this paper we present a&#xD;
scalable group key management proposal for unattended&#xD;
WSNs that is designed to reduce the rekeying cost when&#xD;
the group membership changes.</description>
    <dc:date>2012-09-25T18:32:22Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/16473">
    <title>Decentralized certification scheme for secure admission in on-the-fly peer-to-peer systems</title>
    <link>http://hdl.handle.net/2117/16473</link>
    <description>Title: Decentralized certification scheme for secure admission in on-the-fly peer-to-peer systems
Authors: Touceda, D.S.; Cámara, J.M.S.; Soriano Ibáñez, Miguel
Abstract: Several alternative schemes have been presented&#xD;
in the literature to try to solve the users’ admission&#xD;
problem in P2P systems when it is not possible to&#xD;
include a logically centralized authority (either online&#xD;
or offline) in the system. However,most of them are not&#xD;
suitable for on-the-fly P2P systems and the most typical&#xD;
ones (IP based, shared secret and threshold cryptography)&#xD;
have several security and performance drawbacks.&#xD;
From the deficiencies of the existing schemes, in this paper&#xD;
we present a new decentralized certification scheme&#xD;
for on-the-fly P2P systems which is based on the recently&#xD;
published Internet Attribute Certificate Profile&#xD;
for Authorization. Our proposal greatly improves the&#xD;
security and flexibility of IP based and shared secret&#xD;
D. Suárez Touceda (B)&#xD;
Evalues - IT Security Evaluation, Parque Leganés&#xD;
Tecnológico, Avda. Gregorio Peces Barba 1,&#xD;
28918 Leganés (Madrid), Spain&#xD;
e-mail: diego.suarez@uc3m.es&#xD;
J. M. Sierra Cámara&#xD;
Computer Science Department, Universidad Carlos III&#xD;
de Madrid, Avda. de la Universidad 30,&#xD;
28911 Leganés (Madrid), Spain&#xD;
e-mail: sierra@inf.uc3m.es&#xD;
M. Soriano&#xD;
Department of Telematics Engineering,&#xD;
Universitat Politècnica de Catalunya (UPC),&#xD;
08034 Barcelona, Spain&#xD;
e-mail: soriano@entel.upc.edu&#xD;
M. Soriano&#xD;
Centre Tecnolgic de Telecomunicacions de Catalunya&#xD;
(CTTC), 08860 Castelldefels (Barcelona), Spain&#xD;
schemes with no infrastructure cost and with a minimal&#xD;
performance charge. Also, it achieves a similar level&#xD;
of security than threshold cryptography while highly&#xD;
reducing its computational and communicational cost.&#xD;
All these facts position our certification proposal as a&#xD;
users’ admission alternative for on-the-fly P2P systems&#xD;
in non very hostile environments where performance&#xD;
and security are key factors.</description>
    <dc:date>2012-09-12T11:43:18Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/16081">
    <title>Presence-based architecture for wireless sensor networks using publish/subscribe paradigm</title>
    <link>http://hdl.handle.net/2117/16081</link>
    <description>Title: Presence-based architecture for wireless sensor networks using publish/subscribe paradigm
Authors: García Davis, Ernesto; Calveras Augé, Anna M.
Abstract: Ubiquitous communication is a key component of Ambient Intelligence, enabling objects to communicate with each-other by means of a&#xD;
wireless ad-hoc network. A presence service allows knowing the availability or responsiveness status of elements in a communication (entities). Traditionally,&#xD;
only human use this service, however all smart devices or objects (with embedded&#xD;
wireless sensor nodes) could interact with each other thus a presence service could&#xD;
also enhance communication among them. To achieve this objective we look into&#xD;
existing protocols to propose the  requirements needed to provide presence service on Wireless Sensor Networks (WSN). The main contribution of this paper is the&#xD;
discussion of requirements for presence services on WSN and the new proposed&#xD;
architecture to cope with presence services in WSN.</description>
    <dc:date>2012-06-18T14:39:06Z</dc:date>
  </item>
</rdf:RDF>

