Overcoming untuned radios in wireless networks with network coding
Petrovic, D.
Ramchandran, K.
Rabaey, J.
Dept. of Electr. Eng. & Comput. Sci., Univ. of California, USA;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: June 2006
Volume: 52,
Issue: 6
On page(s): 2649- 2657
ISSN: 0018-9448
INSPEC Accession Number: 8943034
Digital Object Identifier: 10.1109/TIT.2006.874396
Current Version Published: 2006-06-05
Abstract
The drive toward the implementation and massive deployment of wireless sensor networks calls for ultralow-cost and low-power nodes. While the digital subsystems of the nodes are still following Moore's Law, there is no such trend regarding the performance of analog components. This work proposes a fully integrated architecture of both digital and analog components (including local oscillator) that offers significant reduction in cost, size, and overall power consumption of the node. Even though such a radical architecture cannot offer the reliable tuning of standard designs, it is shown that by using random network coding, a dense network of such nodes can achieve throughput linear in the number of channels available for communication. Moreover, the ratio of the achievable throughput of the untuned network to the throughput of a tuned network with perfect coordination is shown to be close to 1/e. This work uses network coding to leverage the fact that throughput equal to the max-flow in a graph is achievable even if the topology is not know a priori. However, the challenge here is finding the max-flow of the random graph corresponding to the network.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
