Proceedings of the 20th International Conference on Distributed Computing and Networking最新文献

STSDB: spatio-temporal sensor database for smart city query processing STSDB:用于智慧城市查询处理的时空传感器数据库

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3296015

Utsav Vyas, P. Panchal, Mayank Patel, Minal Bhise

{"title":"STSDB: spatio-temporal sensor database for smart city query processing","authors":"Utsav Vyas, P. Panchal, Mayank Patel, Minal Bhise","doi":"10.1145/3288599.3296015","DOIUrl":"https://doi.org/10.1145/3288599.3296015","url":null,"abstract":"Modern world smart devices are equipped with several sensors which continuously generate the data. Managing and analyzing these data efficiently is a key need of the current sensor world. Present applications require real-time analysis of past sensor data for decision making. The goal of this work is to efficiently process the spatio-temporal queries for sensor data. Spatio-Temporal Sensor Index STSI helps in managing the sensor details and leads to faster query processing. The types of queries that have been considered are; 1) Spatio-Time Travel, 2) Temporal Aggregation and 3) Time Travel, 4) Spatio-temporal Aggregation. Spatio-Temporal Sensor Database STSDB is built by including STSI index in HBase. The STSDB performance is compared with HBase on two parameters Data Insertion Time DIT, and Query Execution Time QET. The DIT of STSDB is almost identical as compared to HBase. While the QET averaged over all four types of queries show 49% improvement for STSDB over HBase. Both the performance parameters continue to show similar trends for scaled data in HBase and STSDB. STSDB is demonstrated in this work using smart city data.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127113674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Cslim: automated extraction of IoT functionalities from legacy C codebases Cslim:从遗留C代码库中自动提取物联网功能

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3296013

Hyogi Sim, A. Paul, E. Tilevich, A. Butt, Muhammad Shahzad

{"title":"Cslim: automated extraction of IoT functionalities from legacy C codebases","authors":"Hyogi Sim, A. Paul, E. Tilevich, A. Butt, Muhammad Shahzad","doi":"10.1145/3288599.3296013","DOIUrl":"https://doi.org/10.1145/3288599.3296013","url":null,"abstract":"Many Internet of Things (IoT) devices are resource-poor, possessing limited memory, disk space, and processor capacity. To accommodate such resource scarcity, IoT software cannot include any extraneous functionalities not used in operating the underlying device. Although legacy systems software contains numerous functionalities that can be reused in IoT applications, these functionalities are exposed as part of a larger codebase with multiple complex dependencies and a heavy runtime footprint. To enable programmers to effectively reuse extant systems software in IoT applications, this paper presents Cslim, a cross-package function extraction tool for C. Cslim extracts programmer-specified functions from a source package and generates new source files for a target package, thereby enabling the reuse of systems software in resource-poor execution environments, such as the IoT devices. Cslim resolves all dependencies by recursively extracting required functions, while bypassing the complexities of preprocessor macro variabilities by operating on preprocessed source files. Furthermore, Cslim efficiently traverses and resolves the calling dependencies by maintaining an in-memory relational database. Finally, Cslim is easy to use, as it requires neither manual intervention nor source code modifications. Our prototype implementation of Cslim has successfully extracted a set of functions from SQLite and GlusterFS, producing slimmed down executables that can be deployed on IoT devices.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126025914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Compositional structures for streaming applications 流应用程序的组合结构

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3288642

K. Chandy, J. Bunn

引用次数: 0

CAN-based networked path-tracking control of a 4WS4WD electric vehicle: selection of sampling period and hardware-in-the-loop simulation 基于can的4WS4WD电动汽车网络路径跟踪控制:采样周期选择与硬件在环仿真

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3299726

A. Singh, R. Potluri

{"title":"CAN-based networked path-tracking control of a 4WS4WD electric vehicle: selection of sampling period and hardware-in-the-loop simulation","authors":"A. Singh, R. Potluri","doi":"10.1145/3288599.3299726","DOIUrl":"https://doi.org/10.1145/3288599.3299726","url":null,"abstract":"A four-wheel steering four-wheel drive (4WS4WD) electric vehicle has a steering motor and a driving motor for each wheel, for a total of eight motors. An earlier work of the authors [2] presented a multi-input multi-output (MIMO) path-tracking control system (PTCS) for an autonomous version of this vehicle. The practical implementation of the PTCS planned by the authors has these nine modules communicating and forming feedback loops over a Controller Area Network (CAN)-based serial link, thereby forming a networked control system (NCS). However, the MIMO nonlinear loops in the PTCS turn the selection of the sampling period TS for a digital implementation, while factoring the time delays introduced by the communication, into a non-trivial task. This work solves the difficulty of MIMO nonlinear loops by finding a SISO representation of the MIMO NCS using a procedure that is applicable to a class of MIMO NCS that evince a certain symmetry. This work solves the problem of conservativeness of the controller and order of controller by systematically accounting for the time delays caused by the communication and by controller code execution. It then validates the choice of TS through a hardware-in-the-loop simulation. The techniques shown in this work are promising for applications involving the coordination of multiple actuators and for CAN-based NCS. Almost all of the subsequent literature seems to have focussed on the challenges, and has not tried to construct an NCS where these challenges may be absent. In sharp contrast, this work focuses in the positives of the NCS architecture, and avoids the challenges by using the communication protocol carefully. As a consequence, this work shows another positive of the NCS architecture that seems to have been overlooked by all the existing literature: that of performance improvement. This paper shows that distributed processing can be used to reduce the sampling interval.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129276396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A study on rumor propagation trends and features in a post disaster situation 灾后情况下谣言传播趋势与特征研究

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3295581

T. Mondal, Tunir Roy, Indrajit Bhattacharya, Sourav Bhattacharya, Indranil Das

引用次数: 2

An accurate missing data prediction method using LSTM based deep learning for health care 基于LSTM的医疗卫生深度学习缺失数据准确预测方法

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3295580

Hemant Verma, Sudhir Kumar

引用次数: 26

Exploration and impact of blockchain-enabled adaptive non-binary trust models 区块链自适应非二元信任模型的探索和影响

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3288639

D. W. Kravitz

引用次数: 0

Odd-even based adaptive two-way routing in mesh NoCs for hotspot mitigation 基于奇偶的网状noc自适应双向路由热点缓解

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3288611

R. Raj, C. Gayathri, Saidalavi Kalady, P. Jayaraj

引用次数: 6

EnTER: an encounter based trowbox deployment strategy for enhancing network reliability in post-disaster scenarios over DTN 进入:一种基于偶遇的槽箱部署策略，通过DTN增强灾后场景下的网络可靠性

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3295593

S. Bhattacharjee, S. Bit

{"title":"EnTER: an encounter based trowbox deployment strategy for enhancing network reliability in post-disaster scenarios over DTN","authors":"S. Bhattacharjee, S. Bit","doi":"10.1145/3288599.3295593","DOIUrl":"https://doi.org/10.1145/3288599.3295593","url":null,"abstract":"Delay-tolerant network (DTN) has been employed as a viable option for exchanging situational information during post-disaster communication. In contrast to stable network, network reliability in DTN depends on the contact opportunities among the nodes (both mobile and static). Higher degree of contact opportunity implies improved message delivery with reduced delivery latency, which results in enhanced network reliability. In order to improve the degree of contact opportunity among the nodes the deployment of static relay nodes (Throwboxes) has been widely adopted. In order to deploy Throwboxes effectively, prior knowledge regarding network parameters like scale of the network, network topology and mobility pattern of nodes etc. is essential. However, availability of such parameters in post disaster scenarios becomes challenging. Therefore, in this work, we propose an encounter based Throwbox deployment strategy EnTER. The proposed strategy attempts to formulate an empirical relationship between the degree of contact opportunity and extent of network reliability in DTN. The extent of network reliability is measured in terms of Knowledge Sharing Ratio and Average Delivery Latency. This relationship helps in formulating a suitable strategy for deploying Throwboxes in a post-disaster scenario. Extensive simulation by implementing a realistic post-disaster scenario reveals that our proposed Throwbox deployment strategy outperforms one of the state-of-the-art Throwbox deployment strategies in terms of network reliability.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114793867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

iSecure: imperceptible and secure peer-to-peer communication of post-disaster situational data over opportunistic DTN iSecure:难以察觉的和安全的点对点通信的灾后情景数据通过机会DTN

Proceedings of the 20th International Conference on Distributed Computing and Networking Pub Date : 2019-01-04 DOI: 10.1145/3288599.3295585

Chandrima Chakrabarti, Siuli Roy

{"title":"iSecure: imperceptible and secure peer-to-peer communication of post-disaster situational data over opportunistic DTN","authors":"Chandrima Chakrabarti, Siuli Roy","doi":"10.1145/3288599.3295585","DOIUrl":"https://doi.org/10.1145/3288599.3295585","url":null,"abstract":"Researchers have proposed to set up \"infrastructure-less\" peer-to-peer opportunistic network (also known as Delay Tolerant Network) using smart phones carried by different victims or volunteers in post-disaster scenario. Volunteers may use this DTN to relay sensitive situational data. However, in such fragile network environment, some malicious nodes may try to intercept, manipulate data with the intention of corruption and fraud. Furthermore, an adversary node may compel a trusted node to compromise its security credentials or may physically capture the node. As a result, attackers get the authority to sign any message on behalf of the compromised node and can launch various attacks to perturb the network. To combat these attacks, we envision a compromise-tolerant DTN, where time-varying pseudonyms are used to obscure the actual identity and safeguard the privacy of genuine nodes. Unique implicit session key agreement facilitates the establishment of credential-free secure communication session between two legitimate nodes and protects the data from being revealed to the adversaries. Periodic certificate revocation scheme restricts use of any compromised credentials beyond a certain time. We evaluate iSecure scheme using ONE simulator to understand feasibility, performance and overhead.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124691631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2