Many applications in ubiquitous computing rely on knowing where people and objects are relative to each other. By placing small wireless sensors on people, at specific locations, ...
Waylon Brunette, Carl Hartung, Ben Nordstrom, Gaet...
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
Node localization is an important task in the context of wireless sensor networks. Although algorithms already exist to carry out localization using measurements of received signa...
Andrea Edelstein, Xi Chen, Yunpeng Li, Michael Rab...
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood part...
Loop fusion improves data locality and reduces synchronization in data-parallel applications. However, loop fusion is not always legal. Even when legal, fusion may introduce loop-...