Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Computer networks (3rd ed.)
Effective erasure codes for reliable computer communication protocols
ACM SIGCOMM Computer Communication Review
Asymptotically optimal erasure-resilient codes for large disk arrays
Discrete Applied Mathematics - Coding, cryptography and computer security
Communication Networks: Fundamental Concepts and Key Architectures
Communication Networks: Fundamental Concepts and Key Architectures
Lossless data embedding--new paradigm in digital watermarking
EURASIP Journal on Applied Signal Processing - Emerging applications of multimedia data hiding
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Efficient erasure correcting codes
IEEE Transactions on Information Theory
A digital fountain approach to asynchronous reliable multicast
IEEE Journal on Selected Areas in Communications
A multi-channel MAC for opportunistic spectrum sharing in cognitive networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Hi-index | 0.00 |
This paper considers the problem of adaptively utilizing temporal and spatial "holes" in spectrum for communications. In addition to improving spectrum utilization, it also enables the rapid deployment of military assets into remote areas where the spectrum assignment may differ. The problem raises issues related to modelling available spectrum, link establishment, and methods to employ the holes. In a tactical environment, evading interception and detection is critical; hence coding and steganographic techniques are applied. A simulation study investigates trade-offs between an automatic repeat request (ARQ) scheme and a scheme employing erasure codes in predicted holes for high packet loss rates.