Broadcast anti-jamming systems
Desmedt, Yvo, Safavi-Naini, Rei, Wang, Huaxiong, Batten, Lynn, Charnes, Chris, & Pieprzyk, Josef (2001) Broadcast anti-jamming systems. Computer Networks, 35(2-3), pp. 223-236.
In a traditional anti-jamming system a transmitter who wants to send a signal to a single receiver spreads the signal power over a wide frequency spectrum with the aim of stopping a jammer from blocking the transmission. In this paper, we consider the case that there are multiple receivers and the transmitter wants to broadcast a message to all receivers such that colluding groups of receivers cannot jam the reception of any other receiver. We propose efficient coding methods that achieve this goal and link this problem to well-known problems in combinatorics. We also link a generalisation of this problem to the Key Distribution Pattern problem studied in combinatorial cryptography.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Keywords:||Anti-jamming; Cover-free family; Perfect hash family; Key distribution pattern|
|Divisions:||Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
|Copyright Owner:||Copyright 2001 Elsevier Science B.V.|
|Deposited On:||03 Jul 2014 02:28|
|Last Modified:||03 Jul 2014 02:28|
Repository Staff Only: item control page