A practical approach for provenance transmission in wireless sensor networks

被引:21
作者
Alam, S. M. Iftekharul [1 ]
Fahmy, Sonia [2 ]
机构
[1] Purdue Univ, Sch Elect & Comp Engn, W Lafayette, IN 47907 USA
[2] Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA
基金
美国国家科学基金会;
关键词
Provenance; Trust framework; Energy-efficiency; Sensor networks;
D O I
10.1016/j.adhoc.2013.12.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Assessing the trustworthiness of sensor data and transmitters of this data is critical for quality assurance. Trust evaluation frameworks utilize data provenance along with the sensed data values to compute the trustworthiness of each data item. However, in a sizeable multi-hop sensor network, provenance information requires a large and variable number of bits in each packet, resulting in high energy dissipation due to the extended period of radio communication. In this paper, we design energy-efficient provenance encoding and construction schemes, which we refer to as Probabilistic Provenance Flow (PPF). Our work demonstrates the feasibility of adapting the Probabilistic Packet Marking (PPM) technique in IP traceback to wireless sensor networks. We design two bit-efficient provenance encoding schemes along with a complementary vanilla scheme. Depending on the network size and bit budget, we select the best method based on mathematical approximations and numerical analysis. We integrate PPF with provenance-based trust frameworks and investigate the trade-off between trustworthiness of data items and transmission overhead. We conduct TOSSIM simulations with realistic wireless links, and perform testbed experiments on 15-20 TelosB motes to demonstrate the effectiveness of PPF. Our results show that the encoding schemes of PPF have identical performance with a low bit budget (similar to 32-bit), requiring 33% fewer packets and 30% less energy than PPM variants to construct provenance. With a twofold increase in bit budget, PPF with the selected encoding scheme reduces energy consumption by 46-60%. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:28 / 45
页数:18
相关论文
共 34 条
[1]  
Alam S.M.I., 2011, P IEEE INT WORKSH D
[2]  
Alam S.M.I., 2012, P IEEE SECON
[3]  
[Anonymous], 1981, TRCSE0301 HARV U CTR
[4]  
[Anonymous], **DROPPED REF**
[5]  
[Anonymous], 2005, WISE 05 P 4 ACM WORK
[6]  
Arora A., 2005, P IEEE INT C REAL TI
[7]   On IP traceback [J].
Belenky, A ;
Ansari, N .
IEEE COMMUNICATIONS MAGAZINE, 2003, 41 (07) :142-153
[8]  
Broder A.Z., 1993, SEQ 2 METHODS COMMUN, V5, P143
[9]  
Burch H., 2000, P USENIX C SYST ADM
[10]   Everything, everywhere [J].
Butler, D .
NATURE, 2006, 440 (7083) :402-405