Sciweavers

552 search results - page 96 / 111
» Routing complexity of faulty networks
Sort
View
IFIPTCS
2010
13 years 5 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
PODC
2009
ACM
14 years 2 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
IPPS
2003
IEEE
14 years 25 days ago
Contact-Based Architecture for Resource Discovery (CARD) in Large Scale MANets
In this paper we propose a novel architecture, CARD, for resource discovery in large scale MANets that may scale up to thousands of nodes. Our mechanism is suitable for resource d...
Ahmed Helmy, Saurabh Garg, Priyatham Pamu, Nitin N...
ICWN
2008
13 years 9 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
MOBIHOC
2008
ACM
14 years 7 months ago
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Recent research shows that significant energy saving can be achieved in wireless sensor networks with a mobile base station that collects data from sensor nodes via short-range co...
Guoliang Xing, Tian Wang, Weijia Jia, Minming Li