Article thumbnail

Complexity Constrained Sensor Networks: Achievable Rates for Two Relay Networks and Generalizations

By Urbashi Mitra and Ashutosh Sabharwal

Abstract

Motivated by limited computational resources in sensor nodes, the impact of complexity constraints 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. Focusingon 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 increases, the proposed scheme becomes identical to the recently proposed achievable rate by Gupta & Kumar. Both discrete memoryless and Gaussian channels are considered. Categories and Subject Descriptors: B.H.1 [Models and Principles]: Systems and Informatio

Topics: Theory General Terms, Algorithms, Performance, Theory
Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.120.8454
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ece.rice.edu/~ashu/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.