Publication

Malice, Selfishness, and Slander in Mobile Ad-hoc Networks.

Related publications (96)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Routing for Wireless Sensor Networks: From Collection to Event-Triggered Applications

Daniel Camilo Rojas Quirós

Wireless Sensor Networks (WSNs) are collections of sensing devices using wireless communication to exchange data. In the past decades, steep advancements in the areas of microelectronics and communication systems have driven an explosive growth in the depl ...

EPFL2018

Dynamic Routing for Flying Ad Hoc Networks

Dario Floreano, Bixio Rimoldi, Stefano Rosati, Grégoire Hilaire Marie Heitz, Karol Jacek Kruzelecki

This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive and fast to deploy. This makes them a v ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Hierarchical Routing Over Dynamic Wireless Networks

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp

The topology of a mobile wireless network changes over time. Maintaining routes between all nodes requires the continuous transmission of control information, which consumes precious power and bandwidth resources. Many routing protocols have been developed ...

Wiley-Blackwell2015

Wireless Network Simplification: The Gaussian N-Relay Diamond Network

Christina Fragouli

We consider the Gaussian N-relay diamond network, where a source wants to communicate to destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain using only k out of the N avail ...

Institute of Electrical and Electronics Engineers2014

Measuring and Controlling Energy Consumption of Sensor networks

Bin Lu

A wireless sensor network (WSN) is built of two types of nodes: regular sensor nodes and base stations. The regular sensor nodes monitor physical or environmental conditions, such as temperature, sound, pressure, etc. and cooperatively pass their data thro ...

2014

Speed-Aware Routing for UAV Ad-Hoc Networks

Bixio Rimoldi, Stefano Rosati, Karol Jacek Kruzelecki, Louis François Traynard

In this paper we examine mobile ad-hoc networks (MANET) composed by unmanned aerial vehicles (UAVs). Due to the high-mobility of the nodes, these networks are very dynamic and the existing routing protocols partly fail to provide a reliable communication.W ...

2013

Stable Routing And Unique-Max Coloring On Trees

Laura Sanità, Rico Zenklusen

Some of the routing protocols used in telecommunication networks route traffic on a shortest path tree according to configurable integral link weights. One crucial issue for network operators is finding a weight function that ensures a stable routing: when ...

Siam Publications2013

A practical reputation system for pervasive social chatting

Yu Chen, Yue Shen

A Mobile Ad Hoc Network (MANET) is becoming a practical platform for pervasive social networking. For example, people chat with each other via MANET for instant social activities. How to help mobile users build up trust in pervasive social chatting is beco ...

Academic Press Inc Elsevier Science2013

UC and EUC Weak Bit-Commitments Using Seal-Once Tamper-Evidence

Serge Vaudenay

Based on tamper-evident devices, i.e., a type of distinguishable, sealed envelopes, we put forward weak bit-commitment protocols which are UC-secure. These commitments are weak in that it is legitimate that a party could cheat. Unlike in several similar li ...

2013

On the efficiency of routing in sensor networks

Florian Huc

In sensor networks, a key efficiency measure for routing protocols is the stretch of the computed paths, where the stretch is the ratio of the path length and the Euclidean distance covered. In the literature, many protocols have been evaluated via extensi ...

2012