Motivated by limited computational resources in sensor nodes, the impact of complexityconstraints on the communication efficiency of sensor networks is studied. A single-parameter characterization of processing limit...
详细信息
ISBN:
(纸本)1581138466
Motivated by limited computational resources in sensor nodes, the impact of complexityconstraints on the communication efficiency of sensor networks is studied. A single-parameter characterization of processing limitation of nodes in sensor networks is invoked. Specifically, the relaying nodes are assumed to "donate" only a small part of their total processor time to relay other nodes information. The amount of donated processor time is modelled by the node's ability to decode a channel code reliably at given rate (R) over bar. Focusing on a four node network, with two relays, prior work for a complexity constrained single relay network is built upon. In the proposed coding scheme, the transmitter sends a broadcast code such that the relays decode only the "coarse" information, and assist the receiver in removing ambiguity only in that information. Via numerical examples, the impact of different power constraints in the system, ranging from per node power bound to network wide power constraint is explored. As the complexity bound (R) over bar increases, the proposed scheme becomes identical to the recently proposed achievable rate by Gupta & Kumar. Both discrete memoryless and Gaussian channels are considered.
暂无评论