Resumo (PT):
Abstract (EN):
We consider the problem of reachback communica- the lower the amount of information that any one node can
tion in wireless seusor networks: multiple sensors are deployed communicate to any other. However, in the context of sensor
On a and they local Of Some random networks, this inference is not correct: when sensors pick process which then need to be encoded and reproduced at a location. In ulis paper we present a of up correlated signals (a condition that must be necessarily
information thwretic bounds on the performance of a distributed true whenever we have a large number of nodes sensing a
transmission array that is formed by a large number of cheap, physical process within a confined area), the total amount of
unreliable Sellson. We formulate this problem in terms Of ClaSSi- infomation generated by the entire network is not necessarily
cal network information theory concepts, formulation which leads linear in the number of nodes, and therefore, provided that us to consider two important cases: transmission of correlated the mount Of data generated by each node decays at least as
with separate encoders. fast as network throughput does, the network should still have murcs over multiple independent chann
Language:
English
Type (Professor's evaluation):
Scientific
No. of pages:
4