Sciweavers

787 search results - page 119 / 158
» A Distributed Message Passing Algorithm for Sensor Localizat...
Sort
View
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
14 years 24 days ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
IPSN
2009
Springer
14 years 3 months ago
Predictive QoS routing to mobile sinks in wireless sensor networks
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
Branislav Kusy, HyungJune Lee, Martin Wicke, Nikol...
INFOCOM
2010
IEEE
13 years 7 months ago
Network Coding for Multi-Resolution Multicast
—Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distribu...
MinJi Kim, Daniel Enrique Lucani, Xiaomeng Shi, Fa...
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
14 years 3 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza
COMCOM
2006
194views more  COMCOM 2006»
13 years 8 months ago
INSENS: Intrusion-tolerant routing for wireless sensor networks
This paper describes an INtrusion-tolerant routing protocol for wireless SEnsor NetworkS (INSENS). INSENS securely and efficiently constructs tree-structured routing for wireless ...
Jing Deng, Richard Han, Shivakant Mishra