Publications related to Routing loop

An Artificial Immune System for Misbehavior Detection in Mobile Ad-Hoc Networks with Virtual Thymus, Clustering, Danger Signal and Memory Detectors

Jean-Yves Le Boudec, Slavisa Sarafijanovic

In mobile ad-hoc networks, nodes act both as terminals and information relays, and participate in a common routing protocol, such as Dynamic Source Routing (DSR). The network is vulnerable to routing misbehavior, due to faulty or malicious nodes. Misbehavi ...

2004

On Average Throughput Benefits for Network Coding

Christina Fragouli, Emina Soljanin

We calculate the average throughput benefit that network coding can offer as compared to routing for different classes of multicast configurations over directed graphs. The averaging is over the throughput each individual receiver experiences. For the case ...

2004

Efficient, self-contained handling of identity in Peer-to-Peer systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

Identification is an essential building block for many services in distributed information systems. The quality and purpose of identification may differ, but the basic underlying problem is always to bind a set of attributes to an identifier in a unique an ...

2004

Lattice Sensor Networks: Capacity Limits, Optimal Routing and Robustness to Failures

Martin Vetterli, Guillermo Barrenetxea Kobas

We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failures) and the dynamic case (node failures). For static networks, we derive upp ...

2004

An Artificial Immune System Approach to Misbehavior Detection in Mobile Ad-Hoc Networks

Jean-Yves Le Boudec, Slavisa Sarafijanovic

In mobile ad-hoc networks, nodes act both as terminals and information relays, and participate in a common routing protocol, such as Dynamic Source Routing (DSR). The network is vulnerable to routing misbehavior, due to faulty or malicious nodes. Misbehavi ...

2004

On the Throughput of Ad-Hoc Networks using Connectivity Graphs

Christina Fragouli

In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair ...

2004

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

A Test-Bed for Misbehavior Detection in Mobile Ad-hoc Networks --- How Much Can Watchdogs Really Do?

Jean-Yves Le Boudec, Cédric Tissières, Sonja Buchegger

Several misbehavior detection and reputation systems have been proposed for mobile ad-hoc networks, relying on direct network observation mechanisms, so-called watchdogs. While these approaches have so far only been evaluated in simulations and restricted ...

2003

Handling Identity in Peer-to-Peer Systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

Due to the limited number of available IP addresses most computers on the Internet use dynamic IP addresses which causes problems for applications that have to maintain rout-ing tables, for example, peer-to-peer systems. To overcome this we propose unique ...

2003

An Artificial Immune System Approach to Misbehavior Detection in Mobile Ad-Hoc Networks

Jean-Yves Le Boudec, Slavisa Sarafijanovic

In mobile ad-hoc networks, nodes act both as terminals and information relays, and participate in a common routing protocol, such as Dynamic Source Routing (DSR). The network is vulnerable to routing misbehavior, due to faulty or malicious nodes. Misbehavi ...

2003

Routing loop

An Artificial Immune System for Misbehavior Detection in Mobile Ad-Hoc Networks with Virtual Thymus, Clustering, Danger Signal and Memory Detectors

On Average Throughput Benefits for Network Coding

Efficient, self-contained handling of identity in Peer-to-Peer systems

Lattice Sensor Networks: Capacity Limits, Optimal Routing and Robustness to Failures

An Artificial Immune System Approach to Misbehavior Detection in Mobile Ad-Hoc Networks

On the Throughput of Ad-Hoc Networks using Connectivity Graphs

A Location Based Routing Method for Irregular Mobile Ad Hoc Networks

A Test-Bed for Misbehavior Detection in Mobile Ad-hoc Networks --- How Much Can Watchdogs Really Do?

Handling Identity in Peer-to-Peer Systems

An Artificial Immune System Approach to Misbehavior Detection in Mobile Ad-Hoc Networks

Graph Chatbot

Chat with Graph Search

An Artificial Immune System for Misbehavior Detection in Mobile Ad-Hoc Networks with Virtual Thymus, Clustering, Danger Signal and Memory Detectors

Efficient, self-contained handling of identity in Peer-to-Peer systems

On Average Throughput Benefits for Network Coding

An Artificial Immune System Approach to Misbehavior Detection in Mobile Ad-Hoc Networks

Lattice Sensor Networks: Capacity Limits, Optimal Routing and Robustness to Failures

A Location Based Routing Method for Irregular Mobile Ad Hoc Networks

On the Throughput of Ad-Hoc Networks using Connectivity Graphs

A Test-Bed for Misbehavior Detection in Mobile Ad-hoc Networks --- How Much Can Watchdogs Really Do?

An Artificial Immune System Approach to Misbehavior Detection in Mobile Ad-Hoc Networks

Handling Identity in Peer-to-Peer Systems