Concept

Réseau en anneau

Publications associées (81)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The evolution of network topology by selective removal

Marcel Salathé

The topology of large social, technical and biological networks such as the World Wide Web or protein interaction networks has caught considerable attention in the past few years (reviewed in Newman 2003), and analysis of the structure of such networks rev ...

2005

Decentralized Network Coding

Christina Fragouli, Emina Soljanin

This paper proposes deterministic algorithms for decentralized network coding. Decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the ...

2004

Rate Performance Objectives of Multihop Wireless Networks

Jean-Yves Le Boudec

We consider the question of what performance metric to maximize when designing ad hoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery-lifetime and power constraints. Commonly used metrics are total capacity (in ...

2004

Rate Performance Objectives of Multi-hop Wireless Networks

Jean-Yves Le Boudec

We consider the question of what performance metric to maximize when designing adhoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery lifetime and power constraints. Commonly used metrics are total capacity (in ...

2004

Secure Positioning in Sensor Networks

Jean-Pierre Hubaux, Srdan Capkun

So far, the problem of positioning in sensor and ad hoc networks has been studied in a non-adversarial setting. We show that most of the proposed positioning algorithms are highly vulnerable to attacks from compromised network nodes and malicious (outside) ...

2004

Network structures from selection principles

Andrea Rinaldo, Amos Maritan

Analysis of a class of models was performed in which the key selection criterion for network topology is optimality. Optimality leads to the emergence of several distinct network structures including an apparent scale-free arrangement in the treelike topol ...

2004

Rate Performance Objectives of Multi-hop Wireless Networks

Jean-Yves Le Boudec

We consider the question of what performance metric to maximize when designing ad-hoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery lifetime and power constraints. Commonly used metrics are total capacity (in ...

2003

A Location Based Routing Method for Irregular Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Ljubica Blazevic

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad-hoc networks. However, location based routing is difficult when there are holes in the network topology and nodes are mobile. Terminode routin ...

2003

Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues

Jean-Pierre Hubaux, Christian Enz, Mario Cagalj

In all-wireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of the radio transmissio ...

2002

Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Jean-Pierre Hubaux, Christian Enz, Mario Cagalj

ACM2002