On the interdependence of routing and data compression in multi-hop sensor networks

摘要: We consider a problem of broadcast communication in multi-hop sensor network, which samples random field are collected at each node the and goal is for all nodes to obtain an estimate entire within prescribed distortion value. The main idea we explore this paper that jointly compressing data generated by different as information travels over multiple hops, eliminate correlations representation sampled field. Our contributions are: (a) obtain, using simple network flow concepts, conditions on rate/distortion function field, so guarantee any can measurements every other quantized value; (b), construct large class physically-motivated stochastic models data, able prove joint whole grows slower than bounds found (a). A truly novel aspect our work tight coupling between routing source coding, explicitly formulated analytically tractable model---to best knowledge, connection had not been studied before.