The Terminodes Project: Towards Mobile Ad-Hoc WAN

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.

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach, simultaneously addressing three aspects: security, scalability and adaptability to changing network conditions. Our communication protocol, Castor, occupies a unique point in the design space: it does not use any control messages except simple packet acknowledgm

Network coding has recently emerged as an alternative to traditional routing algorithms in communication systems. In network coding, the network nodes can combine the packets they receive before forwarding them to the neighbouring nodes. Intensive research efforts have demonstrated that such a processing in the network nodes can provide advantages in terms of throughput or robustness. These potentials, combined with the advent of ad hoc and wireless delivery architectures have triggered the interest of rese

Solving consensus in wireless ad hoc networks has started to be addressed in several papers. Most of these papers adopt system models similar to those developed for wired networks. These models are focused towards node failures while ignoring link failures, and thus are poorly suited for wireless ad hoc networks. The HO model, which was proposed recently, does not have this drawback. The paper shows that an existing algorithm and the HO model can be used for multi-hop wireless ad hoc networks, if extended w

Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-to-point communication is sought, and hence a fundamental question is whether we can utilize the wireless channel properties to establish secrecy. In this paper we consider secret communication between two special nodes (source'' and destination'') in a wireless network with authenticated relays: the message communicated to the d

The IEEE 802.22 standard is the first proposed standard for the cognitive radio networks in which a set of base stations (BSs) make opportunistic spectrum access to provide wireless access to the customer-premise equipments (CPE) within their cells in wireless regional area networks (WRAN). The channel assignment and power control must be carried out in BSs and CPEs, such that no excessive interference is caused to the users of the primary network. We use a game-theoretic model to analyze the non- cooperati

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. However for many topologies that are realistic for wireless ad-hoc and sensor networks (like grids and random geometric graphs), the standard nearest-neighbor gossip converges very slowly. A recently proposed algorithm called geographic gossip improves gossip efficiency by a

\sqrt{n / \log n}

factor for random geometric graphs, by

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-based routing). The former implicitly assumes that geometry determines connectivity, whereas the latter does not exploit this inherent geometry of wireless networks, and assumes a general graph instead. In this paper, we explore ideas that attempt to bridge t

We present a new scheme that mimics pattern formation in biological systems to create transmission patterns in multi-hop ad hoc networks. Our scheme is decentralized and relies exclusively on local interactions between the network nodes to create global transmission patterns. A transmission inhibits other transmissions in its immediate surrounding and encourages nodes located further away to transmit. The transmission patterns created by our medium access control scheme combine the efficiency of allocation-

We consider the design of optimal strategies for joint power adaptation, rate adaptation and scheduling in a multi-hop wireless network. Most existing strategies control either power and scheduling, or rates and scheduling, but not the three together as we do. We assume the underlying physical layer is in the linear regime (the rate of a link can be approximated by a linear function of the signal-to-interference-and-noise ratio), like in time hopping UWB (TH-UWB) and low gain CDMA systems, and that it allow

Terminodes are personal devices that provide functionality of both the terminals and the nodes of the network. A network of terminodes is an autonomous, fully self-organized, wireless network, independent of any infrastructure. It must be able to scale up to millions of units, without any fixed backbone or server. In this paper we present the main challenges and discuss the main technical directions.

In this paper, we address the problem of service availability in mobile ad-hoc WANs. We present a secure mechanism to stimulate end users to keep their devices turned on, to refrain from overloading the network, and to thwart tampering aimed at converting the device into a selfish one. Our solution is based on the application of a tamper resistant security module in each device and cryptographic protection of messages.

The Terminodes Project: Towards Mobile Ad-Hoc WAN

Chattez avec Graph Search

More on Castor: the Scalable Secure Routing for Ad-hoc Networks

Network coding: from theory to media streaming

Consensus in Wireless Ad hoc Networks

On Cooperative Wireless Network Secrecy

Spectrum Sharing Games of Infrastructure-Based Cognitive Radio Networks

Gossip along the way: order-optimal consensus through randomized path averaging

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

Reaction-Diffusion Based Transmission Patterns for Ad Hoc Networks

Power Control is Not Required for Wireless Networks in the Linear Regime

Towards Mobile Ad-Hoc WANs: Terminodes

Enforcing Service Availability in Mobile Ad-Hoc WANs