AGRA: AI-augmented geographic routing approach for IoT-based incident-supporting applications

被引:23
作者
Chemodanov, Dmitrii [1 ]
Esposito, Flavio [3 ]
Sukhov, Andrei [4 ]
Calyam, Prasad [1 ]
Huy Trinh [1 ]
Oraibi, Zakariya [2 ]
机构
[1] Univ Missouri, Dept Comp Sci, Columbia, MO 65211 USA
[2] Univ Missouri, Comp Sci, Columbia, MO 65211 USA
[3] St Louis Univ, Comp Sci Dept, St Louis, MO 63103 USA
[4] Samara Natl Res Univ, Samara, Russia
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2019年 / 92卷
基金
美国国家科学基金会;
关键词
Incident-supporting applications; IoT; Deep learning; Geographic routing; Local minimum avoidance; Electrostatics;
D O I
10.1016/j.future.2017.08.009
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Applications that cater to the needs of disaster incident response generate large amount of data and demand large computational resource access. Such datasets are usually collected in real-time at the incident scenes using different Internet of Things (IoT) devices. Hierarchical clouds, i.e., core and edge clouds, can help these applications' real-time data orchestration challenges as well as with their IoT operations scalability, reliability and stability by overcoming infrastructure limitations at the ad-hoc wireless network edge. Routing is a crucial infrastructure management orchestration mechanism for such systems. Current geographic routing or greedy forwarding approaches designed for early wireless ad-hoc networks lack efficient solutions for disaster incident-supporting applications, given the high-speed and low-latency data delivery that edge cloud gateways impose. In this paper, we present a novel Artificial Intelligent (AI)-augmented geographic routing approach, that relies on an area knowledge obtained from the satellite imagery (available at the edge cloud) by applying deep learning. In particular, we propose a stateless greedy forwarding that uses such an environment learning to proactively avoid the local minimum problem by diverting traffic with an algorithm that emulates electrostatic repulsive forces. In our theoretical analysis, we show that our Greedy Forwarding achieves in the worst case a 3.291 path stretch approximation bound with respect to the shortest path, without assuming presence of symmetrical links or unit disk graphs. We evaluate our approach with both numerical and event-driven simulations, and we establish the practicality of our approach in a real incident-supporting hierarchical cloud deployment to demonstrate improvement of application level throughput due to a reduced path stretch under severe node failures and high mobility challenges of disaster response scenarios. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:1051 / 1065
页数:15
相关论文
共 46 条
[1]  
Akhtar F., ELSEVIER TELECOMMUNI, V40, P319
[2]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[3]  
[Anonymous], P IEEE INFOCOM
[4]  
[Anonymous], 2016 IEEE Conf. Comp. Vis. Patt. Recog. (CVPR)
[5]   Object based image analysis for remote sensing [J].
Blaschke, T. .
ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 2010, 65 (01) :2-16
[6]  
Bose P., 2001, WIREL NETW
[7]  
Burchard J., 2017, P IEEE ICNC
[8]  
Chemodanov D., 2016, IEEE TCSVT
[9]   A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS [J].
Chen, Dazhi ;
Varshney, Pramod K. .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2007, 9 (01) :50-67
[10]   A Novel Image-based Tool to Reunite Children With Their Families After Disasters [J].
Chung, Sarita ;
Christoudias, C. Mario ;
Darrell, Trevor ;
Ziniel, Sonja I. ;
Kalish, Leslie A. .
ACADEMIC EMERGENCY MEDICINE, 2012, 19 (11) :1227-1234