Publication

A Scalable Routing Scheme for Self-Organized Terminode Network

Publications associées (39)

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

Self Organized Terminode Routing

Jean-Yves Le Boudec, Ljubica Blazevic

We consider the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage ...

2002

Load Balancing in Data Networks

Load balancing apparatus for a data communications network comprises hash logic for computing a hash function on incoming data packets. A threshold detector is connected to the hash logic for triggering, in response to utilization of the downstream objects ...

2002

Locating Nodes with EASE: Mobility Diffusion of Last Encounters in Ad Hoc Networks

Martin Vetterli, Matthias Grossglauser

Routing in large-scale mobile ad hoc networks is challenging because all the nodes are potentially moving. Geographic routing can partially alleviate this problem, as nodes can make local routing decisions based solely on the destinations' geographic coord ...

2002

GPS-free Positioning in Mobile Ad-Hoc Networks

Jean-Pierre Hubaux, Srdan Capkun

We consider the problem of node positioning in ad hoc networks. We propose a distributed, infrastructure- free positioning algorithm that does not rely on GPS (Global Positioning System). Instead, the algorithm uses the distances between the nodes to build ...

2002

Securing the Internet Routing Infrastructure

Panagiotis Papadimitratos

The unprecedented growth of the Internet over the last years, and the expectation of an even faster increase in the numbers of users and networked systems, resulted in the Internet assuming its position as a mass communication medium. At the same time, the ...

2002

Self Organized Routing in Wide Area Mobile Ad Hoc Network

Jean-Yves Le Boudec, Ljubica Blazevic

This paper considers the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Our routing scheme is a combination of two protocols called Termin-ode Local Routing (TLR) and Terminode Remote Routing (TRR). TRR is activated when ...

2001

Self-Organizing Wide-Area Routing

Jean-Yves Le Boudec, Ljubica Blazevic

We consider the problem of routing in a Mobile Ad-Hoc wide area network called Terminodes Network. In our solution every node builds its personal view of the network, composed of local and remote views. Large scale routing in the terminode network is achie ...

2000

Self-Organizing Wide-Area Routing

Jean-Yves Le Boudec, Ljubica Blazevic

2000

Antigen binding properties of purified immunoglobulin A and reconstituted secretory immunoglobulin A antibodies

Horst Vogel, Urs von Stockar, Ian William Marison

The hybridoma cell line ZAC3 expresses Vibrio cholerae lipopolysaccharide (LPS)-specific mouse IgA mols., as a heterogeneous population of monomeric (IgAm), dimeric (IgAd), and polymeric (IgAp) forms. We describe a gentle method combining ultrafiltration, ...

1996