#### Filter Results:

#### Publication Year

2011

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Signal-strength models of wireless communications capture the gradual fading of signals and the additivity of interference. As such, they are closer to reality than other models. However, nearly all theoretic work in the SINR model depends on the assumption of smooth geometric decay, one that is true in free space but is far off in actual environments. The… (More)

We present randomized distributed algorithms for connectivity and aggregation in multi-hop wireless networks under the SINR model. The connectivity problem asks for a set of links that strongly connect a given set of wireless nodes, along with an efficient schedule. Aggregation asks for a spanning in-arborescence (converge-cast tree), along with a schedule… (More)

—Modeling physical layer behavior of packet reception in the presence of interference is central to achieving efficient spectrum use in wireless sensor networks via spatial reuse. On one hand, analytic and simulations research has largely relied on assumptions of geometric path loss and isotropic transmission which have not been borne out in experiments.… (More)

This paper combines two classic results from two different fields: the result by Lauritzen and Spiegelhalter [21] that the probabilis-tic inference problem on probabilistic networks can be solved in linear time on networks with a moralization of bounded treewidth, and the result by Courcelle [10] that problems that can be formulated in counting monadic… (More)

We investigate a combinatorial two-player game, in which one player wants to keep the behavior of an underlying water-bucket system stable whereas the other player wants to cause overflows. This game is motivated by data management applications in wireless sensor networks. We construct optimal strategies and characterize optimal bucket sizes for many… (More)

We show that the first phase of the Linial-Saks network decomposition algorithm gives a randomized distributed O(n<sup>ε</sup>)-approximation algorithm for the maximum independent set problem that operates in O(1/ε) rounds, and we give a matching lower bound that holds even for bipartite graphs.

Efficient spectrum use in wireless sensor networks through spatial reuse requires effective models of packet reception at the physical layer in the presence of interference. Despite recent progress in analytic and simulations research into worst-case behavior from interference effects, these efforts generally assume geometric path loss and isotropic… (More)

- ‹
- 1
- ›