Scalable and Accurate Data Aggregation Mechanism on Structured P2P Network

被引:0
作者
Takeda, Atsushi [1 ]
Oide, Takuma [2 ]
Takahashi, Akiko [3 ]
Suganuma, Takuo [2 ]
机构
[1] Tohoku Gakuin Univ, Sendai, Miyagi, Japan
[2] Tohoku Univ, Sendai, Miyagi, Japan
[3] Sendai Natl Coll Technol, Sendai, Miyagi, Japan
来源
2014 NINTH INTERNATIONAL CONFERENCE ON BROADBAND AND WIRELESS COMPUTING, COMMUNICATION AND APPLICATIONS (BWCCA) | 2014年
关键词
RANGE QUERIES; OVERLAY;
D O I
10.1109/BWCCA.2014.94
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Sensor devices of many types have come into widespread use, producing huge amounts of data. If the observed data can be aggregated via the internet, then new applications can be produced to provide useful information for wide areas. As described in this paper, we propose a time-slot-based data aggregation mechanism on a structured p2p network. The proposed mechanism uses routing tables of the structured p2p network to achieve scalable data collection. In addition, the proposed system uses a time-slot idea to aggregate the observed data accurately. Nodes in the system record the observed data as time slot values. Then the nodes send the time slot values to other nodes. When nodes receive the time slot values, the nodes aggregate the received values as data aggregation results. As described in this paper, we explain an algorithm and a communication protocol for the proposed data aggregation mechanism. Furthermore, using experimentally obtained results, we demonstrate that the proposed mechanism achieves more accurate data aggregation than existing mechanisms.
引用
收藏
页码:389 / 394
页数:6
相关论文
共 15 条
[1]  
Abe T, 2012, INT J ADV INTERNET T, V4, P103
[2]  
[Anonymous], 2007, P 21 IEEE INT PAR DI, DOI DOI 10.1109/IPDPS.2007.370313
[3]   Skip Graphs [J].
Aspnes, James ;
Shah, Gauri .
ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (04)
[4]   Mercury: Supporting scalable multi-attribute range queries [J].
Bharambe, AR ;
Agrawal, M ;
Seshan, S .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) :353-366
[5]   Range queries over skip tree graphs [J].
Gonzalez-Beltran, A. ;
Milligan, P. ;
Sage, P. .
COMPUTER COMMUNICATIONS, 2008, 31 (02) :358-374
[6]   Monitoring and Management of Structured Peer-to-Peer Systems [J].
Graffi, Kalman ;
Stingl, Dominik ;
Rueckert, Julius ;
Kovacevic, Aleksandra ;
Steinmetz, Ralf .
2009 IEEE NINTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P 2009), 2009, :311-320
[7]  
Oide Takuma, 2013, International Journal of Software Science and Computational Intelligence, V5, P20, DOI 10.4018/ijssci.2013100102
[8]  
Rowstron A., 2001, Proceedings of the Middleware 2001, P329, DOI DOI 10.1007/3-540-45518-3_18
[9]   Range queries on structured overlay networks [J].
Schuett, Thorsten ;
Schintke, Florian ;
Reinefeld, Alexander .
COMPUTER COMMUNICATIONS, 2008, 31 (02) :280-291
[10]   Capability-Aware Information Aggregation in Peer-to-Peer Grids [J].
Schulz, Sven ;
Blochinger, Wolfgang ;
Hannak, Hannes .
JOURNAL OF GRID COMPUTING, 2009, 7 (02) :135-167