DocumentCode :
426185
Title :
Gradient calculation in sensor networks
Author :
Henderson, Thomas C. ; Grant, Eddie
Author_Institution :
Sch. of Comput., Utah Univ., Salt Lake City, UT, USA
Volume :
2
fYear :
2004
fDate :
28 Sept.-2 Oct. 2004
Firstpage :
1792
Abstract :
Sensor networks are comprised of devices having the ability to communicate, compute and sense the environment. A wide range of information processing tasks has been studied for such networks, including operating systems, issues, architecture optimization, and distributed data processing. In this paper, we analyze and compare four different techniques to estimate the gradient of the function represented by the sensor samples. These include: (GA1) a simple device ID defined direction, (GA2) directional derivative, (GA3) polynomial approximation with a plane, and (GA4) polynomial approximation with a quadratic. We compare these based on density of devices per unit area, and noise in the position and sensed data. The interesting result is that GA3 significantly outperforms the other algorithms, although GA1 performs very well and is much easier to compute than the others.
Keywords :
distributed sensors; gradient methods; polynomial approximation; sensor fusion; directional derivative; gradient calculation; information processing task; polynomial approximation; sensor network; Cities and towns; Computer architecture; Computer networks; Humans; Information security; Intelligent networks; Mobile agents; Monitoring; Operating systems; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Robots and Systems, 2004. (IROS 2004). Proceedings. 2004 IEEE/RSJ International Conference on
Print_ISBN :
0-7803-8463-6
Type :
conf
DOI :
10.1109/IROS.2004.1389656
Filename :
1389656
Link To Document :
بازگشت