News Archives

RSS Feed

[Colloquium] Resource-Competitive Broadcast

September 25, 2014

Watch Colloquium: 

MOV FILE

  • Date: Thursday, September 25, 2014
  • Time: 11:00 - 12:15 PM
  • Place: Dane Smith Hall 125


Maxwell Young,
Department of Computing
Drexel University

Abstract:
We consider the problem of broadcasting a message from a sender to n >= 1 receivers in a time-slotted, single-hop, wireless network with a single communication channel. Sending and listening dominate the energy usage of small wireless devices and this is abstracted as a unit cost per time slot. A jamming adversary exists who can disrupt the channel at unit cost per time slot, and aims to prevent the transmission of the message. Let T be the number of slots jammed by the adversary. Our goal is to design algorithms whose cost is resource-competitive, that is, whose per-device cost is a function, preferably o(T), of the adversary's cost. Devices must work without knowledge of n,T, or the adversary's jamming strategy.

Short Bio:
Maxwell Young is an Assistant Professor in the Department of Computing at Drexel University. Before moving to Philadelphia, he held postdoctoral positions at the University of Michigan and at the National University of Singapore, and he earned his Ph.D. in computer science at the University of Waterloo, Canada. His research interests include security and distributed computing.