Anti-Jamming Schedules for Wireless Broadcast Systems
Abstract
Modern society is heavily dependent on wireless networks for providing voice and data communications. Wireless data broadcast has recently emerged as an attractive way to disseminate data to a large number of clients. In data broadcast systems, the server proactively transmits the information on a downlink channel; the clients access the data by listening to the channel. Wireless data broadcast systems can serve a large number of heterogeneous clients, minimizing power consumption as well as protecting the privacy of the clients' locations. The availability and relatively low cost of antennas resulted in a number of potential threats to the integrity of the wireless infrastructure. The existing solutions and schedules for wireless data broadcast are vulnerable to jamming, i.e., the use of active signals to prevent data distribution. The goal of jammers is to disrupt the normal operation of the broadcast system, which results in high waiting time and excessive power consumption for the clients. In this paper we investigate efficient schedules for wireless data broadcast that perform well in the presence of a jammer. We show that the waiting time of client can be efficiently reduced by adding redundancy to the schedule. The main challenge in the design of redundant broadcast schedules is to ensure that the transmitted information is always up-to-date. Accordingly, we present schedules that guarantee low waiting time and low staleness of data in the presence of a jammer. We prove that our schedules are optimal if the jamming signal has certain energy limitations.
Files
Name | Size | Download all |
---|---|---|
md5:19551d970cfdc775d21c660e0e483c0f
|
405.7 kB | Preview Download |
Additional details
- Eprint ID
- 26101
- Resolver ID
- CaltechPARADISE:2005.ETR070
- Created
-
2005-07-29Created from EPrint's datestamp field
- Updated
-
2019-11-22Created from EPrint's last_modified field
- Caltech groups
- Parallel and Distributed Systems Group