Abstract
Continuous data collection applications in wireless sensor networks require sensor nodes to continuously sample the surrounding physical phenomenon and then return the data to a processing center. Battery-operated sensors have to avoid heavy use of their wireless radio by compressing the time series sensed data instead of transmitting it in raw form. One of the most commonly used compacting methods is piecewise linear approximation. Previously, Liu et al. proposed a greedy PLAMLiS algorithm to approximate the time series into a number of line segments running in Θ(script N2log script N) time, however this is not appropriate for processing in the sensors. Therefore, based on our study we propose an alternative algorithm which obtains the same result but needs a shorter running time. Based on theoretical analysis and comprehensive simulations, it is shown that the new proposed algorithm has a competitive computational cost of Θ(script N log script N) as well as reducing the number of line segments and so it can decrease the overall radio transmission load in order to save energy of the sensor nodes.
Original language | English |
---|---|
Title of host publication | RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 204-208 |
Number of pages | 5 |
ISBN (Print) | 9781424423798 |
DOIs | |
Publication status | Published - 2008 |
Externally published | Yes |
Event | IEEE-RIVF International Conference on Computing and Communication Technologies 2008 - Ho Chi Minh City, Vietnam Duration: 13 Jul 2008 → 17 Jul 2008 https://ieeexplore.ieee.org/xpl/conhome/4586318/proceeding (Proceedings) |
Conference
Conference | IEEE-RIVF International Conference on Computing and Communication Technologies 2008 |
---|---|
Abbreviated title | RIVF 2008 |
Country/Territory | Vietnam |
City | Ho Chi Minh City |
Period | 13/07/08 → 17/07/08 |
Internet address |