Publication

MobiRoute: Routing towards a Mobile Sink for Improving Lifetime in Sensor Networks

Related publications (45)

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.

Energy Efficiency in Wireless Sensor Networks: A Utility-Based Architecture

Ioannis Alagiannis, Manoussos Gavriil Athanassoulis

Wireless Sensor Networks (WSN) comprise a fast developing research area with a vast spectrum of applications. A WSN design is influenced by many factors such as transmission errors, network topology and power consumption. Consequently, developing a WSN app ...

2007

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

Distributed MMSE Relay Strategies for Wireless Sensor Networks

Ali H. Sayed

A fundamental task in a wireless sensor network is to broadcast some measured data from an origin sensor to a destination sensor. Since the sensors are typically small, power limited, and low cost, they are only able to broadcast low-power signals. As a re ...

Institute of Electrical and Electronics Engineers2007

Similarity-Aware Query Allocation in Sensor Networks with Multiple Base Stations

In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be more energy efficient and scale well with the size of the sensor nodes. To su ...

2007

Infrastructure for data processing in large-scale interconnected sensor networks

Karl Aberer, Manfred Hauswirth, Ali Salehi

With the price of wireless sensor technologies diminishing rapidly we can expect large numbers of autonomous sensor networks being deployed in the near future. These sensor networks will typically not remain isolated but the need of interconnecting them on ...

IEEE Computer Society2007

Spatial feltering in sensor networks with computation codes

Michael Christoph Gastpar

A data collection problem in sensor networks is formulated in which the number of channel uses per source sample is greater than one. An example of this problem is given in which the objective of the data collector is to compute a filtered and downsampled ...

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

Design considerations for a heterogeneous network of bearings-only sensors using sensor management

Volkan Cevher

This paper presents a design characterization of heterogeneous sensor networks with the goal of geolocation accuracy. It is assumed that the network exploits sensor management to conserve node power usage. We focus on bearings-only sensor networks consisti ...

2007

Mobility in wireless networks: friend or foe

Jun Luo

Wireless networking technologies allow computing devices to move while keeping them online, but the device mobility poses considerable technical challenges. Network designers, on the one hand, consider mobility to be harmful because it leads to dynamic and ...

EPFL2006

Distributed routing algorithms for sensor networks

Guillermo Barrenetxea Kobas

Recent advances in wireless communications and computing technology are enabling the emergence of low-cost devices that incorporate sensing, processing, and communication functionalities. A large number of these devices are deployed in the field to create ...

EPFL2006

Anypath routing

Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. A well-known instance is with unreliable wireless links, where the probability that at least one node out ofnreceives a packet increas ...

EPFL2006