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.

BARP-A Dynamic Routing Protocol for Balanced Distribution of Traffic in NoCs to Avoid Congestion

Pejman Lotfi Kamran

A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. By evenly distributing input packets of a router among all its ...

2008

On Clustering Phenomenon in Mobile Partitioned Networks

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

According to different kinds of connectivity, we can distinguish three types of mobile ad-hoc networks: dense, sparse and clustered networks. This paper is about modeling mobility in clustered networks, where nodes are concentrated into clusters of dense c ...

ACM2008

Artificial immune system for the Internet

Slavisa Sarafijanovic

We investigate the usability of the Artificial Immune Systems (AIS) approach for solving selected problems in computer networks. Artificial immune systems are created by using the concepts and algorithms inspired by the theory of how the Human Immune Syste ...

EPFL2008

Mobility-Centric Geocasting For Mobile Partitioned Networks

We describe our design of a geocast service for mobile partitioned networks (MPNs). We focus mainly on minimizing the delivery latency. Our approach exploits the time-stability of the collective mobility pattern. In MPNs, in contrast to MANETs, the end-to- ...

IEEE2008

Routing in large-scale buses ad hoc networks

Michel Sède, Da Li

A Disruption-Tolerant Network (DTN) attempts to route packets between nodes that are temporarily connected. Difficulty in such networks is that nodes have no information about the network status and contact opportunities. The situation is different in publ ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Revocation Games in Ephemeral Networks

Jean-Pierre Hubaux, Mark Felegyhazi, Maxime Raya

A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact times between nodes are short and neighbors change frequently - reputations ...

2008

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp, Jörg Widmer

Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-bas ...

2007

Secure incentives to cooperate for wireless networks

The operating principle of certain wireless networks makes essential the cooperation between the mobile nodes. However, if each node is an autonomous selfish entity, cooperation is not guaranteed and therefore we need to use incentive techniques. In this t ...

EPFL2007

Hierarchical Routing in Dynamic $\alpha$-Doubling Networks

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp

In this paper we formulate the problem of routing over dynamic networks with finite doubling dimension. This is motivated by communication in mobile wireless networks, where the communication graph topology changes over time, but has some geometric propert ...

2007

Hierarchical Routing over Dynamic Wireless Networks

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp

Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of consuming throughput available for data transmission, which is a precious res ...

2007