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.
翻译：根据可接受编码率约束的Slepian-Wolf构成分布源编码的最根本方面。 因此,有必要提供一个框架,用以模拟关于节点安排的更实际的设想情景,以便使Slepian-Wolf的编码更适合多点无线传感器网络。本文件提供了两种切实可行的设想情景,以实现这一目标。第一个设想情景是根据相关关系对节点进行分组,第二个设想情景则涉及利用Markov相关关系简化结构。人们发现,虽然这些设想情景的界限比最初的Slepian-Wolf受约束的Slepian-Wolf更为严格,但总体模式和约束是简化的。
相关内容
微信扫码咨询专知VIP会员