Publication

Neighbor Discovery in Wireless Networks and the Coupon Collector's Problem

Publications associées (88)

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

Distributed average consensus for wireless sensor networks

Florence Bénézit

Wireless sensor networks have emerged a few years ago, enabling large scale sensing at low cost. There are many interesting problems related to this new sensing tool: designing robust and small hardware, defining adapted routing protocols, minimizing the e ...

EPFL2009

YaQ: An Architecture for Real-Time Navigation and Rendering of Varied Crowds

Daniel Thalmann, Jonathan Maim, Barbara Yersin

The YaQ software platform is a complete system dedicated to real-time crowd simulation and rendering. Fitting multiple application domains, such as video games and VR, YaQ aims to provide efficient algorithms to generate crowds comprising up to thousands o ...

Institute of Electrical and Electronics Engineers2009

The scale axis picture show

Mark Pauly

We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of a shape, in a scale-adaptive manner. Here a shape O is any bounded open subs ...

2009

Nonlinear Average Consensus

Martin Hasler, Leonidas Georgopoulos

We present an algorithm for nonlinear consensus in complex networks. Our motivation draws from analysis on the algorithm based on a weighted linear update protocol. Comparison of the asymptotic with early convergence rate encourages an alternative algorith ...

IEICE2009

Sensor Network Localization from Local Connectivity : Performance Analysis for the MDS-MAP Algorithm

Amin Karbasi, Andrea Montanari

Sensor localization from only connectivity information is a highly challenging problem. To this end, our result for the first time establishes an analytic bound on the performance of the popular MDS-MAP algorithm based on multidimensional scaling. For a ne ...

2009

Efficient Broadcasting Using Network Coding

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We consider the problem of broadcasting in an ad-hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless netwo ...

2008

Low-complexity Algorithms for Energy Efficient Broadcasting in Wireless Networks

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless net- ...

2008

Security and Cooperation in Wireless Networks

Jean-Pierre Hubaux, Levente Buttyan

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 ...

Cambridge University Press2008

Securing Coding Based Distributed Storage in Wireless Sensor Networks

László Czap, Levente Buttyan

We address the problem of pollution attacks in coding based distributed storage systems proposed for wireless sensor networks. In a pollution attack, the adversary maliciously alters some of the stored encoded packets, which results in the incorrect decodi ...

2008

Survey Propagation Inspired Algorithms for Satisfiability

Nicolas Macris, Shrinivas Kudekar

In this note we develop generalized Survey Propagation (SP) equations from the cavity method. We quantize the message space of the messages to develop a message passing rule. We investigate a framework of greedy algorithms for finding out satisfying assign ...

2008