國立高雄大學圖資館 |

Language: English

Back

Communication and compression in den...

Petrovic, Dragan Rade.

Communication and compression in dense networks of unreliable nodes.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Communication and compression in dense networks of unreliable nodes.
Author:	Petrovic, Dragan Rade.
Description:	117 p.
Notes:	Chair: Kannan Ramchandran.
Notes:	Source: Dissertation Abstracts International, Volume: 66-08, Section: B, page: 4405.
Contained By:	Dissertation Abstracts International66-08B.
Subject:	Engineering, Electronics and Electrical.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3187124
ISBN:	9780542291296

Communication and compression in dense networks of unreliable nodes.
Petrovic, Dragan Rade.

Communication and compression in dense networks of unreliable nodes. - 117 p.

Chair: Kannan Ramchandran.

Thesis (Ph.D.)--University of California, Berkeley, 2005.

Both the network coding for communication with untuned radios and the distributed source coding schemes require minimal complexity from the low-power sensor nodes. Instead, the complexity of the system is pushed toward the edge of the network where a gateway between the wireless network and the wired world resides.

ISBN: 9780542291296Subjects--Topical Terms:

226981
Engineering, Electronics and Electrical.

Communication and compression in dense networks of unreliable nodes.
LDR:04097nmm _2200289 _450 001 170816
005 20061228142253.5
008 090528s2005 eng d
020 $a 9780542291296
035 $a 00242846
040 $a UnM $c UnM
100 0 $a Petrovic, Dragan Rade. $3 244847
245 1 0 $a Communication and compression in dense networks of unreliable nodes.
300 $a 117 p.
500 $a Chair: Kannan Ramchandran.
500 $a Source: Dissertation Abstracts International, Volume: 66-08, Section: B, page: 4405.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2005.
520 # $a Both the network coding for communication with untuned radios and the distributed source coding schemes require minimal complexity from the low-power sensor nodes. Instead, the complexity of the system is pushed toward the edge of the network where a gateway between the wireless network and the wired world resides.
520 # $a The dissertation presents a fully integrated architecture of both digital and analog components (including local oscillator) that offers significant reduction in cost, size and power consumption of the overall 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. By contrast, it is also shown that if coding is not used (i.e. if nodes are only allowed to forward packets without processing them), the performance does not improve with increased density and available spectrum.
520 # $a The drive toward the implementation and massive deployment of wireless sensor networks calls for ultra-low-cost, low-power and ever smaller nodes. While the digital subsystems of the nodes are still experiencing exponential reduction of all of these metrics as described by Moore's Law, there is no such trend regarding the performance of analog components needed for the radios that enable the nodes to communicate wirelessly with one another. This dissertation presents a two part approach to reducing the energy consumption of the radios. First, a new radio architecture is presented that greatly reduces the power required to operate a transceiver, as well as reducing the cost and size of the nodes. Secondly, a novel distributed compression scheme is introduced that allows the sensor nodes to compress their data in order to reduce the amount of communication that the radios must perform.
520 # $a To reduce the amount of communication among nodes required, a novel approach to reducing energy consumption in sensor networks using a distributed adaptive signal processing framework and efficient algorithm is proposed. Specifically, the dissertation presents a distributed way of continuously exploiting existing correlations in sensor data based on adaptive signal processing and distributed source coding principles. This approach enables sensor nodes to blindly compress their readings with respect to one another without the need for explicit and energy-expensive inter-sensor communication to effect this compression. Furthermore, the distributed algorithm used by each sensor node is extremely low in complexity and easy to implement (i.e., one modulo operation), while an adaptive filtering framework is used at the data-gathering unit to continuously learn the relevant correlation structures in the sensor data. Applying the algorithm to testbed data resulted in energy savings of 10%--65% for a multitude of sensor modalities.
590 $a School code: 0028.
650 # 0 $a Engineering, Electronics and Electrical. $3 226981
690 $a 0544
710 0 # $a University of California, Berkeley. $3 212474
773 0 # $g 66-08B. $t Dissertation Abstracts International
790 $a 0028
790 1 0 $a Ramchandran, Kannan, $e advisor
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://libsw.nuk.edu.tw:81/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3187124 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3187124