東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Energy efficient data representation...

Banerjee, Torsha.

FindBook

Google Book

Amazon

博客來

Energy efficient data representation and aggregation with event region detection in wireless sensor networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Energy efficient data representation and aggregation with event region detection in wireless sensor networks./
作者:	Banerjee, Torsha.
面頁冊數:	161 p.
附註:	Adviser: Dharma P. Agrawal.
Contained By:	Dissertation Abstracts International69-02B.
標題:	Remote Sensing. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3302689
ISBN:	9780549484523

Energy efficient data representation and aggregation with event region detection in wireless sensor networks.
Banerjee, Torsha.

Energy efficient data representation and aggregation with event region detection in wireless sensor networks. - 161 p.

Adviser: Dharma P. Agrawal.

Thesis (Ph.D.)--University of Cincinnati, 2008.

Unlike conventional networks, wireless sensor networks (WSNs) are limited in power, have much smaller memory buffers, and possess relatively slower processing speeds. These characteristics necessitate minimum transfer and storage of information in order to prolong the network lifetime. In this dissertation, we exploit the spatio-temporal nature of sensor data to approximate the current values of the sensors based on readings obtained from neighboring sensors and itself.

ISBN: 9780549484523Subjects--Topical Terms:

1018559
Remote Sensing.

Energy efficient data representation and aggregation with event region detection in wireless sensor networks.
LDR:06193nam 2200325 a 45 001 939964
005 20110517
008 110517s2008 ||||||||||||||||| ||eng d
020 $a 9780549484523
035 $a (UMI)AAI3302689
035 $a AAI3302689
040 $a UMI $c UMI
100 1 $a Banerjee, Torsha. $3 1264071
245 1 0 $a Energy efficient data representation and aggregation with event region detection in wireless sensor networks.
300 $a 161 p.
500 $a Adviser: Dharma P. Agrawal.
500 $a Source: Dissertation Abstracts International, Volume: 69-02, Section: B, page: 0903.
502 $a Thesis (Ph.D.)--University of Cincinnati, 2008.
520 $a Unlike conventional networks, wireless sensor networks (WSNs) are limited in power, have much smaller memory buffers, and possess relatively slower processing speeds. These characteristics necessitate minimum transfer and storage of information in order to prolong the network lifetime. In this dissertation, we exploit the spatio-temporal nature of sensor data to approximate the current values of the sensors based on readings obtained from neighboring sensors and itself.
520 $a We propose a Tree based polynomial REGression algorithm, (TREG) that addresses the problem of data compression in wireless sensor networks. Instead of aggregated data, a polynomial function (P) is computed by the regression function, TREG. The coefficients of P are then passed to achieve the following goals: (i) The sink can get attribute values in the regions devoid of sensor nodes, and (ii) Readings over any portion of the region can be obtained at one time by querying the root of the tree. As the size of the data packet from each tree node to its parent remains constant, the proposed scheme scales very well with growing network density or increased coverage area.
520 $a Since physical attributes exhibit a gradual change over time, we propose an iterative scheme, UPDATE_COEFF, which obviates the need to perform the regression function repeatedly and uses approximations based on previous readings. Extensive simulations are performed on real world data to demonstrate the effectiveness of our proposed aggregation algorithm, TREG. Results reveal that for a network density of 0.0025 nodes/m2, a complete binary tree of depth 4 could provide the absolute error to be less than 6%. A data compression ratio of about 0.02 is achieved using our proposed algorithm, which is almost independent of the tree depth. In addition, our proposed updating scheme makes the aggregation process faster while maintaining the desired error bounds.
520 $a We also propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for WSNs. When a single event occurs, a child of the tree sends a Flagged Polynomial (FP) to its parent, if the readings approximated by it falls outside the data range defining the existing phenomenon. After the aggregation process is over, the root having the two polynomials, P and FP can be queried for FP (approximating the new event region) instead of flooding the whole network. For multiple such events, instead of computing a polynomial corresponding to each new event, areas with same data range are combined by the corresponding tree nodes and the aggregated coefficients are passed on. Results reveal that a new event can be detected by PERD while error in detection remains constant and is less than a threshold of 10%. As the node density increases, accuracy and delay for event detection are found to remain almost constant, making PERD highly scalable.
520 $a Whenever an event occurs in a WSN, data is generated by closeby sensors and relaying the data to the base station (BS) make sensors closer to the BS run out of energy at a much faster rate than sensors in other parts of the network. This gives rise to an unequal distribution of residual energy in the network and makes those sensors with lower remaining energy level die at much faster rate than others. We propose a scheme for enhancing network Lifetime using mobile cluster heads (CH) in a WSN. To maintain remaining energy more evenly, some energy-rich nodes are designated as CHs which move in a controlled manner towards sensors rich in energy and data. This eliminates multihop transmission required by the static sensors and thus increases the overall lifetime of the WSN. We combine the idea of clustering and mobile CH to first form clusters of static sensor nodes.
520 $a A collaborative strategy among the CHs further increases the lifetime of the network. Time taken for transmitting data to the BS is reduced further by making the CHs follow a connectivity strategy that always maintain a connected path to the BS. Spatial correlation of sensor data can be further exploited for dynamic channel selection in Cellular Communication. In such a scenario within a licensed band, wireless sensors can be deployed (each sensor tuned to a frequency of the channel at a particular time) to sense the interference power of the frequency band. In an ideal channel, interference temperature (IT) which is directly proportional to the interference power, can be assumed to vary spatially with the frequency of the sub channel. We propose a scheme for fitting the sub channel frequencies and corresponding ITs to a regression model for calculating the IT of a random sub channel for further analysis of the channel interference at the base station. Our scheme, based on the readings reported by Sensors helps in Dynamic Channel Selection (S-DCS) in extended C-band for assignment to unlicensed secondary users. S-DCS proves to be economic from energy consumption point of view and it also achieves accuracy with error bound within 6.8%. Again, users are assigned empty sub channels without actually probing them, incurring minimum delay in the process. The overall channel throughput is maximized along with fairness to individual users.
590 $a School code: 0045.
650 4 $a Remote Sensing. $3 1018559
690 $a 0799
710 2 $a University of Cincinnati. $3 960309
773 0 $t Dissertation Abstracts International $g 69-02B.
790 $a 0045
790 1 0 $a Agrawal, Dharma P., $e advisor
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3302689