Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Sorting and selecting in rounds
SIAM Journal on Computing
Journal of Computer and System Sciences
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant broadcasting in radio networks
Journal of Algorithms
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Optimal Two-Stage Algorithms for Group Testing Problems
SIAM Journal on Computing
On reliable broadcast in a radio network
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Trusted Computing Platforms: TCPA Technology in Context
Trusted Computing Platforms: TCPA Technology in Context
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Theoretical Computer Science - Foundations of software science and computation structures
Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Efficient uncoordinated FHSS anti-jamming communication
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Reliable distributed computing on unreliable radio channels
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Securing every bit: authenticated broadcast in radio networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Information dissemination on multiple channels
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time-optimal information exchange on multiple channels
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Deterministic multi-channel information exchange
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
We consider a fault-prone wireless network in which communication may be subject to wireless interference. There are many possible causes for such interference: other applications may be sharing the same bandwidth; malfunctioning devices may be creating spurious noise; or malicious devices may be actively jamming communication. In all such cases, communication may be rendered impossible. In other areas of networking, the paradigm of "trusted computing" has proved an effective tool for reducing the power of unexpected attacks. In this paper, we ask the question: can some form of trusted computing enable devices to communicate reliably? In answering this question, we propose a simple "wireless trusted platform module" that limits the manner in which a process can access the airwaves by enabling and disabling the radio according to a pre-determined schedule. Unlike prior attempts to limit disruption via scheduling, the proposed "wireless trusted platform module" is general-purpose: it is independent of the application being executed and the topology of the network. In the context of such a "wireless trusted platform module," we develop a communication protocol that will allow any subset of devices in a region to communicate, despite the presence of other disruptive (possibly malicious) devices: up to k processes can exchange information in the presence of t malicious attackers in O(max(t3, k2) log2 n) time. We also show a lower bound: when t k, any such protocol requires Ω(min(k2, n) logk n) rounds; in general, at least Ω(min(t3, n2)) rounds are needed, when k 2.