#### Filter Results:

- Full text PDF available (412)

#### Publication Year

1983

2017

- This year (25)
- Last 5 years (122)
- Last 10 years (265)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Atul Adya, William J. Bolosky, +7 authors Roger Wattenhofer
- OSDI
- 2002

Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides file availability and reliability through randomized replicated storage; it ensures the secrecy of file contents with cryptographic techniques; it maintains the integrity of fileâ€¦ (More)

- Chi-Yao Hong, Srikanth Kandula, +4 authors Roger Wattenhofer
- SIGCOMM
- 2013

We present SWAN, a system that boosts the utilization of inter-datacenter networks by centrally controlling when and how much traffic each service sends and frequently re-configuring the network's data plane to match current traffic demand. But done simplistically, these re-configurations can also cause severe, transient congestion because differentâ€¦ (More)

- Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger
- PODC
- 2003

All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly efficient on <i>practical</i> average-case networks, however is alsoâ€¦ (More)

- Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
- MobiHoc
- 2003

In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first ad-hoc algorithm to be both asymptotically optimal and average-case efficient. For our simulations we identify a network density range critical forâ€¦ (More)

- Olga Goussevskaia, Yvonne Anne Pignolet, Roger Wattenhofer
- MobiHoc
- 2007

In this paper we study the problem of scheduling wireless links in the geometric <i>SINR</i> model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We present the first NP-completeness proofs in such a model. In particular, we prove two problems to be NP-complete: Scheduling and One-Shot Scheduling. The first problemâ€¦ (More)

- Martin Burkhart, Pascal von Rickenbach, Roger Wattenhofer, Aaron Zollinger
- MobiHoc
- 2004

Topology control in ad-hoc networks tries to lower node energy consumption by reducing transmission power and by confining interference, collisions and consequently retransmissions. Commonly low interference is claimed to be a consequence to sparseness of the resulting topology. In this paper we disprove this implication. In contrast to most of the relatedâ€¦ (More)

- Nicolas Burri, Pascal von Rickenbach, Roger Wattenhofer
- 2007 6th International Symposium on Informationâ€¦
- 2007

Environmental monitoring is one of the driving applications in the domain of sensor networks. The lifetime of such systems is envisioned to exceed several years. To achieve this longevity in unattended operation it is crucial to minimize energy consumption of the battery-powered sensor nodes. This paper proposes Dozer, a data gathering protocol meeting theâ€¦ (More)

The topology of a wireless multi-hop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a cone-based distributed topology control algorithm. This algorithm, introduced in [16], does not assume that nodes have GPS information available; rather it depends only on directional information.â€¦ (More)

- Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
- DIAL-M
- 2002

In this paper we present AFR, a new geometric mobile ad-hoc routing algorithm. The algorithm is completely distributed; nodes need to communicate only with direct neighbors in their transmission range. We show that if a best route has cost <i>c</i>, AFR finds a route and terminates with cost &Ogr;(c<sup>2</sup>) in the worst case. AFR is the first algorithmâ€¦ (More)

- Thomas Moscibroda, Roger Wattenhofer
- Proceedings IEEE INFOCOM 2006. 25TH IEEEâ€¦
- 2006

We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communication requests in arbitrary networks, the scheduling complexity describes the amount of time required to successfully schedule all requests. The most basic and important network structureâ€¦ (More)