2021/04/20 by Benjamin Rosen, Adnan M. Abu‐Mahfouz, Rosen, Benjamin +4
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.2104.09925
4 pages, 5 figures
arxiv created 2021/04/20 · openalex publication_date 2021/04/20 · arxiv updated 2021/04/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Slepian-Wolf bound on the admissible coding rate forms the most fundamental aspect of distributed source coding. As such, it is necessary to provide a framework with which to model more practical scenarios with respect to the arrangement of nodes in order to make Slepian-Wolf coding more suitable for multi-node Wireless Sensor Networks. This paper provides two practical scenarios in order to achieve this aim. The first is by grouping the nodes based on correlation while the second involves simplifying the structure using Markov correlation. It is found that although the bounds of these scenarios are more restrictive than the original Slepian-Wolf bound, the overall model and bound are simplified.