VSF: An Energy-Efficient Sensing Framework Using Virtual Sensors

被引:25
作者
Sarkar, Chayan [1 ]
Rao, Vijay S. [1 ]
Prasad, R. Venkatesha [1 ]
Das, Sankar Narayan [2 ]
Misra, Sudip [3 ]
Vasilakos, Athanasios [4 ]
机构
[1] Delft Univ Technol, NL-2600 AA Delft, Netherlands
[2] IIT Kanpur, Kanpur 208016, Uttar Pradesh, India
[3] IIT Kharagpur, Kharagpur 721302, W Bengal, India
[4] Lulea Univ Technol, S-97187 Lulea, Sweden
关键词
Virtual sensing; non-geographical correlation; correlation-based sensing; sensor data estimation; ALGORITHM; AGGREGATION; COVERAGE;
D O I
10.1109/JSEN.2016.2546839
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we describe virtual sensing framework (VSF), which reduces sensing and data transmission activities of nodes in a sensor network without compromising on either the sensing interval or data quality. VSF creates virtual sensors (VSs) at the sink to exploit the temporal and spatial correlations amongst sensed data. Using an adaptive model at every sensing iteration, the VSs can predict multiple consecutive sensed data for all the nodes with the help of sensed data from a few active nodes. We show that even when the sensed data represent different physical parameters (e.g., temperature and humidity), our proposed technique still works making it independent of physical parameter sensed. Applying our technique can substantially reduce data communication among the nodes leading to reduced energy consumption per node yet maintaining high accuracy of the sensed data. In particular, using VSF on the temperature data from IntelLab and GreenOrb data set, we have reduced the total data traffic within the network up to 98% and 79%, respectively. Corresponding average root mean squared error of the predicted data per node is as low as 0.36 degrees C and 0.71 degrees C, respectively. This paper is expected to support deployment of many sensors as part of Internet of Things in large scales.
引用
收藏
页码:5046 / 5059
页数:14
相关论文
共 36 条
  • [1] [Anonymous], P 20 NAT C COMM NCC
  • [2] [Anonymous], 2011, T201113 SICS
  • [3] [Anonymous], 1972, P COMPLEXITY COMPUTE
  • [4] A Clustering Algorithm for Wireless Sensor Networks Based on Social Insect Colonies
    Cheng, Chi-Tsun
    Tse, Chi K.
    Lau, Francis C. M.
    [J]. IEEE SENSORS JOURNAL, 2011, 11 (03) : 711 - 721
  • [5] Chu D., 2006, P 22 INT C DATA ENG, P48, DOI DOI 10.1109/ICDE.2006.21
  • [6] Cristescu R., 2005, P 4 INT S INF PROC S, P21
  • [7] Crowcroft J, 2014, IEEE INFOCOM SER, P1375, DOI 10.1109/INFOCOM.2014.6848071
  • [8] Guestrin C, 2004, IPSN '04: THIRD INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING IN SENSOR NETWORKS, P1
  • [9] Guo C., 2010, P 6 INT C, P15
  • [10] Efficient gathering of correlated data in sensor networks
    Gupta, Himanshu
    Navda, Vishnu
    Das, Samir
    Chowdhary, Vishal
    [J]. ACM TRANSACTIONS ON SENSOR NETWORKS, 2008, 4 (01)