Events agenda

27 Apr
2010

Multimedia Streaming in Dynamic Peer-to-Peer Systems and Mobile Wireless Networks

Prof. Dr. Mohamed Hefeeda
Mohamed Hefeeda is an assistant professor in the School of Computing Science, Simon Fraser University, Canada, where he leads the Network Systems Lab. He holds a Ph.D. from Purdue University, USA, and M.Sc. and B.Sc. from Mansoura University, Egypt. His research interests include multimedia networking over wired and wireless networks, peer-to-peer systems, network security, and wireless sensor networks. 
Read more arrow_right_alt
21 Apr
2010

Seminar-IP Autoconfiguration for Vehicular Networks

Marco Gramaglia, Research Assistant, IMDEA Networks
Read more arrow_right_alt
21 Apr
2010

iNEXT and An Energy Driven Architecture for Modelling Energy Consumption in Wireless Sensor Networks

Dr. Doan B. Hoang, Visiting Professor in Ingenieria Telematica Department at UC3M
The talk consists of two parts. The first part will present an overview on the current research activities of iNEXT (Centre for Innovation in IT applications and Services) at the University of Technology, Sydney. This includes a brief description of our Sensor Grid for Assistive Healthcare project.
Read more arrow_right_alt
14 Apr
2010

Dynamic Control Channel Assignment in Opportunistic Cognitive Radio Networks

Dr. Marwan Krunz, Visiting Researcher, IMDEA Networks; Cátedra de Excelencia, University Carlos III of Madrid
Cognitive radio networks (CRNs) involve extensive exchange of control messages, which are used to coordinate critical network functions such as distributed spectrum sensing, medium access, and routing, to name a few. Typically, control messages are broadcasted on a pre-assigned common control channel (e.g., a separate frequency band, a given time slot, or a spreading sequence). Such a static channel allocation policy is contrary to the opportunistic access paradigm. In this work, we address the problem of dynamically assigning the control channel in CRNs according to spatiotemporally varying spectrum opportunities. We propose a cluster-based architecture that allocates different control channels to various clusters in the network. The clustering problem is formulated as a bipartite graph problem, for which we develop a class of algorithms that provide different tradeoffs between two conflicting factors: number of common channels in a cluster and the cluster size. Clusters are guaranteed to have a desirable number of common channels for control, which facilitates graceful channel migration when primary-radio activity is detected, without the need for frequent re-clustering. We use simulations to verify the agility of our algorithms in adapting to variations in spectrum availability.
Read more arrow_right_alt
9 Apr
2010

Social Network Analysis for Delay Tolerant Networks

Dr. Thrasyvoulos Spyropoulos
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.
Read more arrow_right_alt
7 Apr
2010

PhD Defense: Dynamic and Location-Aware Server Discovery based on fair DHTs

Ruben Cuevas
The current Internet includes a large number of distributed services. In order to guarantee the QoS of the communication in these services, a client has to select a close-by server with enough available resources. In order to achieve this objective, in this Thesis, we propose a simple and practical solution for Dynamic and Location Aware Server Discovery based on a Distributed Hash Table (DHT). Specifically, we decide to use a Chord DHT system (although any other DHT scheme can be used). In more detail, the solution works as follows. The servers offering a given service form a Chord-like DHT. In addition, they register their location (topological and/or geographical) information in the DHT. Each client using the service is connected to at least one server from the DHT. Eventually, a given client realizes that it is connected to a server providing a bad QoS, then, it queries the DHT in order to find an appropriate server (i.e. a close-by server with enough available resources). We define 11 design criteria, and compare our solution to the State of the Art based on them. We show that our solution is the most complete one. Furthermore, we validate the performance of our solution in two different scenarios: NAT Traversal Server Discovery and Home Agent Discovery in Mobile IP scenarios. The former serves to validate our solution in a highly dynamic environment whereas the latter demonstrates the appropriateness of our solution in more classical environments where the servers are typically hosts.
Read more arrow_right_alt
6 Apr
2010

Overview of the IEEE 802.21 standard and its future steps

Dr. Juan Carlos Zuniga, Senior staff member at Interdigital and Vice-Chair of IEEE 802.21.
The conference will be conducted in English
Read more arrow_right_alt
31 Mar
2010

Broadcasting in Wireless Ad Hoc Networks

Dr. Majid Khabbazian
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.
Read more arrow_right_alt
25 Mar
2010

Binary Program Analysis and Model Extraction for Security Applications

Juan Caballero, Carnegie Mellon University and University of California, Berkeley (USA)
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.
Read more arrow_right_alt
24 Mar
2010

CacheCast: Eliminating Redundant Link Traffic for Single Source Multiple Destination Transfers

Prof. Dr. Thomas Plagemann, University of Oslo (Norway)
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. 
Read more arrow_right_alt