• Publications
  • Influence
Achieving high utilization with software-driven WAN
TLDR
A novel technique is developed that leverages a small amount of scratch capacity on links to apply updates in a provably congestion-free manner, without making any assumptions about the order and timing of updates at individual switches.
Information propagation in the Bitcoin network
TLDR
This paper analyzes how Bitcoin uses a multi-hop broadcast to propagate transactions and blocks through the network to update the ledger replicas, and verifies the conjecture that the propagation delay in the network is the primary cause for blockchain forks.
Complexity in geometric SINR
TLDR
The first NP-completeness proofs in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane, are presented, which proves two problems to be NP-complete: Scheduling and One-Shot Scheduling.
Geometric ad-hoc routing: of theory and practice
TLDR
A new geometric routing algorithm is proposed which is outstandingly efficient on practical average-case networks, however is also in theory asymptotically worst-case optimal and the formerly necessary assumption that the distance between network nodes may not fall below a constant value is dropped.
Does topology control reduce interference?
TLDR
This paper provides a concise and intuitive definition of interference and shows that most currently proposed topology control algorithms do not effectively constrain interference and proposes connectivity-preserving an spanner constructions that are interference-minimal.
Dynamic scheduling of network updates
TLDR
Dionysus is presented, a system for fast, consistent network updates in software-defined networks that encodes as a graph the consistency-related dependencies among updates at individual switche...
The Complexity of Connectivity in Wireless Networks
TLDR
This paper presents a novel scheduling algorithm that successfully schedules a strongly connected set of links in time O(logn) even in arbitrary worst-case networks, and proves that the scheduling complexity of connectivity grows only polylogarithmically in the number of nodes.
Gradient clock synchronization in wireless sensor networks
TLDR
The Gradient Time Synchronization Protocol (GTSP) is proposed which is designed to provide accurately synchronized clocks between neighbors and works in a completely decentralized fashion: Every node periodically broadcasts its time information.
Dozer: Ultra-Low Power Data Gathering in Sensor Networks
TLDR
This paper proposes Dozer, a data gathering protocol meeting the requirements of periodic data collection and ultra-low power consumption, which comprises MAC-layer, topology control, and routing all coordinated to reduce energy wastage of the communication subsystem.
Distributed topology control for power efficient operation in multihop wireless ad hoc networks
TLDR
This work proposes a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global connectivity and gives an approximation scheme in which the power consumption of each route can be made arbitrarily close to the optimal by carefully choosing the parameters.
...
...