According to most technology pundits, progress in wireless and sensor networks will lead us into a world of ubiquitous computing, in which myriads of tiny, untethered sensors and actuators will communicate with each other. Information technology will thus deliver its most encompassing and pervasive accomplishment to mankind, promptly taking care of the needs and wishes of everyone.

The steadily raising energy costs and the increasing number of evidences of climate changes induced by high levels of CO2 in the atmosphere have brought the issue of a sustainable use of energy to the attention of governments and of people all over the world. The need for a more responsible use of energy has emerged in all sectors, together with the awareness that a decrease in carbon emissions is vital to ensuring a future to mankind. The ICT sector, which has brought deep transformations and a rapid increase in productivity in many domains in the last decades, is at the center of this transformation. In all fields of communications, researchers have started to investigate approaches to reduce energy consumption, both by designing new devices, and by exploring new network architectures. In particula r, dynamic network planning, which implies decreasing the power consumption of those network resources which are underutilized, is seen as one of the most promising techniques to improve the energy efficiency of networks.

In this talk I present a platform to extract models of security-relevant functionality from program binaries, enabling multiple security applications such as active botnet infiltration, finding deviations between implementations of the same functionality, vulnerability signature generation, and finding content-sniffing cross-site scripting (XSS) attacks.
In this talk, I present two applications: active botnet infiltration and finding content-sniffing XSS attacks.

His talk consists out of two parts. The first part will give an overview on the current research activities and achievements of the Distributed Multimedia Systems Research Group at the University of Oslo. This includes video streaming in MANETs and disruptive environments, publish subscribe for sparse MANETs, deviation detection with complex event processing for automated home care systems, and clean-slate Future Internet research work. The second part will focus on CacheCast, which is joint work with Lancaster University and has been initiated in the Content NoE. Due to the lack of multicast services in the Internet, applications based on single source multiple destinations transfers such as video conferencing, IP radio, IPTV must use unicast or application layer multicast. 

Nowadays it is possible to watch some TV channels in the Internet using P2P mechanisms. There are basically two ways to construct a P2P network to transmit streaming video: mesh-based and tree-based (there is also a mix of both called hybrid-based). No matter how we construct the overlay, a fundamental problem is: what is the best peer to connect with, in order to obtain the best performance? This question is even more important in the tree-based P2P networks where there is just one connection between a "parent" peer and each one of its children, so, the leaving of a parent forces all its children to reconnect to other parents. Our goal in this study is to minimize the number of orphan peers per minute, i.e. select a parent who minimizes the probability of leaving before a given peer. In order to do that, it is necessary to have other results like the distribution of the channel holding time per peer, the future lifetime of a peer given its elapsed time in a given channel and other stuff that will be described during the presentation.

The conference will be conducted in English

Wireless ad hoc networks have emerged to be used in scenarios where it is required or desired to have wireless communications among a variety of devices without relying on any infrastructure or central management.

One of the fundamental operations in wireless ad hoc networks is broadcasting, where a wireless device (simply called a node) disseminates a message to all other nodes in the network. A major challenge of efficient broadcast algorithms is to reduce the number of transmissions required to disseminate a message. Unfortunately, minimizing the total number of required transmissions is an NP-hard problem even when the whole network topology is known by every node. Reducing the number of transmissions becomes more challenging in local broadcast algorithms, where each node makes decision (whether or not to transmit a received message) based on local neighborhood information. The common belief is that local broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions.

Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, content or information between nodes is exchanged (opportunistically), whenever two nodes are within range ("in contact"). Forwarding decisions are generally probabilistic and based on locally collected knowledge about node behavior (e.g., past contacts between nodes) to predict future contact opportunities. The use of complex network analysis has been recently suggested to perform this prediction task and improve the performance of opportunistic (DTN) routing. Contacts seen in the past are aggregated to a "Social Graph", and a variety of metrics (e.g., entrality and similarity) or algorithms (e.g., community detection) can be used to assess the utility of a node to deliver a content or bring it closer to the destination.

Multimedia content delivery is projected to be the biggest bandwidth consumer of the future Internet. For many years, the mechanism for content delivery envisioned by the networking community is network multicast.

Multicasting emulates traditional TV broadcasting; it is designed to be network efficient. But it falls short in at least two aspects: (a) it does not maximize throughput for content delivery; (b) like TV broadcasting, it does not provide on-demand access (i.e. Video-on-Demand).

Embedded sensor systems are well suited to provide context data, i.e. any information which allows determining the context of entities (e.g. a user's location, an object's environmental parameters, or the number of people in a room). The additional integration of actuators allows interaction with the real world, e.g. control of heating, ventilation, or lighting. However, the big gap between the heterogeneous set of devices providing sensing and/or actuation needs to be bridged to enable smart context-aware applications. Special consideration hereby needs to be given to the efficient use of the available energy budget and the support for device heterogeneity. In this talk, means towards energy-efficient data transfer by applying header and payload compression for Wireless Sensor and Actuator Networks (WSAN) are presented, as well as our approach towards the seamless integration of WSAN nodes through using semantic self-descriptions and means towards unifying the access to node resources.