DocumentCode :
61631
Title :
Storage Placement in Path Networks
Author :
Bertossi, Alan A. ; Diodati, Daniele ; Pinotti, Cristina M.
Author_Institution :
Dept. of Comput. Sci. & Eng., Univ. of Bologna, Bologna, Italy
Volume :
64
Issue :
4
fYear :
2015
fDate :
April 1 2015
Firstpage :
1201
Lastpage :
1207
Abstract :
New algorithms are presented to optimally place storage nodes in a sensor network consisting of a path so as to minimize the communication cost of convergecasting towards the sink the data gathered into storage nodes in reply to queries. Such algorithms are faster than previously known algorithms and require optimal running time for finding the optimal storage placement.
Keywords :
sensors; convergecasting; optimal running time; optimal storage placement; path networks; sensor network; storage nodes; Educational institutions; Equations; Indexes; Linear programming; Monitoring; Temperature sensors; Vegetation; Sensor networks; combinatorial optimization; convergecast; data gathering; graph algorithms; paths; storage placement;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.2014.2315642
Filename :
6782633
Link To Document :
بازگشت