Sciweavers

1950 search results - page 246 / 390
» Two Abstractions for Distributed Systems of Mobile Nodes
Sort
View
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
16 years 22 days ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
CONCUR
2009
Springer
16 years 21 days ago
Query-Based Model Checking of Ad Hoc Network Protocols
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
INFOCOM
2007
IEEE
16 years 13 days ago
Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...
Ritesh Maheshwari, Jie Gao, Samir R. Das
197
Voted
INFOCOM
2008
IEEE
16 years 16 days ago
HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space
Abstract—Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications. CBR differs from classical routing paradigms as messages a...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
157
Voted
PPOPP
1997
ACM
15 years 10 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon