Storage Placement in Path Networks

被引：2
作者：
Bertossi, Alan A. [1 ]
Diodati, Daniele [2 ]
Pinotti, Cristina M. [2 ]
机构：
[1] Univ Bologna, Dept Comp Sci & Engn, I-40126 Bologna, Italy
[2] Univ Perugia, Dept Comp Sci & Math, I-06123 Perugia, Italy
来源：
IEEE TRANSACTIONS ON COMPUTERS | 2015年 / 64卷 / 04期
关键词：
Sensor networks; convergecast; data gathering; storage placement; paths; combinatorial optimization; graph algorithms;
D O I：
10.1109/TC.2014.2315642
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：1201 / 1207
页数：7
相关论文
共 50 条
[21]   Collision-free path coloring with application to minimum-delay gathering in sensor networks [J].
Gargano, Luisa ;
Rescigno, Adele A. .
DISCRETE APPLIED MATHEMATICS, 2009, 157 (08) :1858-1872
[22]   Relay placement for higher order connectivity in wireless sensor networks [J].
Kashyap, Abhishek ;
Khuller, Samir ;
Shayman, Mark .
25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006, 2006, :2229-2240
[23]   Maximizing Capacity in Wireless Sensor Networks by Optimal Placement of Clusterheads [J].
Fakoorian, S. Ali. A. ;
Solat, G. R. ;
Taheri, Hassan ;
Eidi, Azam .
2008 CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-4, 2008, :1189-+
[24]   Aggregate node placement for maximizing network lifetime in sensor networks [J].
Liang, Weifa ;
Xu, Yinlong ;
Shi, Jiugen ;
Luo, Junzhou .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2012, 12 (03) :219-235
[25]   A Novel Node Placement for Long Belt Coverage in Wireless Networks [J].
Wang, Bang ;
Xu, Han ;
Liu, Wenyu ;
Liang, Hui .
IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (12) :2341-2353
[26]   Optimal Relay Station Placement in Broadband Wireless Access Networks [J].
Lin, Bin ;
Ho, Pin-Han ;
Xie, Liang-Liang ;
Shen, Xuemin ;
Tapolcai, Janos .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2010, 9 (02) :259-269
[27]   Placement of multiple mobile data collectors in wireless sensor networks [J].
Alsalih, Waleed ;
Hassanein, Hossam ;
Akl, Selim .
AD HOC NETWORKS, 2010, 8 (04) :378-390
[28]   Cache placement in sensor networks under an update cost constraint [J].
Tang, Bin ;
Gupta, Himanshu .
JOURNAL OF DISCRETE ALGORITHMS, 2007, 5 (03) :422-435
[29]   An efficient heuristic for placement, scheduling and routing in wireless sensor networks [J].
Turkogullari, Yavuz Bogac ;
Aras, Necati ;
Altinel, I. Kuban ;
Ersoy, Cem .
AD HOC NETWORKS, 2010, 8 (06) :654-667
[30]   The Optimal Node Placement for Long Belt Coverage in Wireless Networks [J].
Wang, Bang ;
Xu, Han ;
Liu, Wenyu ;
Yang, Laurence T. .
IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (02) :587-592
12345