Cloud of Things for Sensing as a Service: Sensing Resource Discovery and Virtualization

被引:26
作者
Abdelwahab, Sherif [1 ]
Hamdaoui, Bechir [1 ]
Guizani, Mohsen [2 ]
Znati, Taieb [3 ]
机构
[1] Oregon State Univ, Corvallis, OR 97331 USA
[2] Qatar Univ, Doha, Qatar
[3] Univ Pittsburgh, Pittsburgh, PA 15260 USA
来源
2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) | 2015年
关键词
D O I
10.1109/GLOCOM.2015.7417252
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We propose Cloud of Things for Sensing as a Service: a global architecture that scales up cloud computing by exploiting the global sensing resources of the highly dynamic and growing Internet of Things (IoT) to enable remote sensing. The proposed architecture scales out by augmenting the role of edge computing platforms as cloud agents that discover and virtualize sensing resources of IoT devices. Cloud of Things enables performing in-network distributed processing of sensing data offered by the globally available IoT devices and provides a global platform for meaningful and responsive sensing data analysis and decision making. We design cloud agents algorithmic solutions bearing in mind the onerous to track dynamics of the IoT devices by centralized solutions. First, we propose a distributed sensing resource discovery algorithm based on a gossip policy that selects IoT devices with predefined sensing capabilities as fast as possible. We also propose RADV: a distributed virtualization algorithm that efficiently deploys virtual sensor networks on top of a subset of the selected IoT devices. We show, through analysis and simulations, the potential of the proposed algorithmic solutions to realize virtual sensor networks with minimal physical resources, reduced communication overhead, and low complexity.
引用
收藏
页数:7
相关论文
共 17 条
[1]  
Abdelwahab S., 2014, INTERNET THINGS J IE, V1
[2]  
Abdelwahab S., 2014, P IEEE GLOB TEL C
[3]  
Abdelwahab S., 2015, ARXIV150103547
[4]  
[Anonymous], 2009, Gossip Algorithms
[5]   Highly connected random geometric graphs [J].
Balister, Paul ;
Bollobas, Bela ;
Sarkar, Amites ;
Walters, Mark .
DISCRETE APPLIED MATHEMATICS, 2009, 157 (02) :309-320
[6]  
Bonomi F., 2012, P 1 ED MCC WORKSH MO, P13, DOI DOI 10.1145/2342509.2342513
[7]  
Boyd S., 2006, INFORM THEORY IEEE T, V52
[8]   Linear-Time Approximation for Maximum Weight Matching [J].
Duan, Ran ;
Pettie, Seth .
JOURNAL OF THE ACM, 2014, 61 (01)
[9]  
Koukoumidis E., 2012, ACM SIGPLAN NOTICES, V47
[10]   A Survey of Mobile Phone Sensing [J].
Lane, Nicholas D. ;
Miluzzo, Emiliano ;
Lu, Hong ;
Peebles, Daniel ;
Choudhury, Tanzeem ;
Campbell, Andrew T. .
IEEE COMMUNICATIONS MAGAZINE, 2010, 48 (09) :140-150