{"title":"Smart Disaster Detection and Response System for Smart Cities","authors":"A. Boukerche, Rodolfo W. L. Coutinho","doi":"10.1109/ISCC.2018.8538356","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538356","url":null,"abstract":"Every year, natural and human-induced disasters result in infrastructural damages, monetary costs, distresses, injuries and deaths. Unfortunately, climate change is strengthening the destructive power of natural disasters. In this context, Internet-of-Things (IoT)-based disaster detection and response systems have been proposed to cope with disasters and emergencies by improving the disaster detection and search and rescue missions during disaster response. Accordingly, IoT devices are used to collect data and help to identify hazards after disasters and to localize injured people. However, a solely IoT-based detection and response system will not be totally suitable for emergency response in smart cities, as the lack of connectivity with IoT devices might occur, due to breakages in communication infrastructures or network congestions. Therefore, we propose a novel architecture for smart disaster detection and response system for smart cities. We discuss the main building blocks of our envisioned smart system, as well as the critical challenges that will be faced ahead to implement our smart system.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132594031","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}
Keke Hu, Y. Wang, Zhongfang Wang, Shunliang Zhang, Yong-mei Wang
{"title":"Pseudo Downlink Channel Scheme for Eavesdroppers to Work Against Two-way Training DCE in Non-reciprocal MIMO Channel","authors":"Keke Hu, Y. Wang, Zhongfang Wang, Shunliang Zhang, Yong-mei Wang","doi":"10.1109/ISCC.2018.8538741","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538741","url":null,"abstract":"The two-way training discriminatory channel estimation (DCE) for non-reciprocal wireless MIMO channels can efficiently differentiate the performance at the legitimate receiver (Bob) and the eavesdropper (Eve). Eve’s channel estimation performance is deliberately degraded by the artificial noise (AN) inserted into the training sequence. However, it ignores the possibility that Eve can derive any useful information which can be used to reduce the AN interference during the round-trip stage. In this paper, we discuss the feasibility that Eve can derive certain helpful information from its observations during the two-way training DCE. Then, we propose a pseudo downlink channel (PDC) scheme for Eve to improve its channel estimation performance, which collapses the security of legitimate receiver.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123916344","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}
{"title":"A Broker-guided Trust Calculation Model for Mobile Devices of D2D Communications","authors":"Jie Yuan, Xiaoyong Li","doi":"10.1109/ISCC.2018.8538561","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538561","url":null,"abstract":"In Device-to-Device (D2D)communications, the communication environments are multifarious and it is difficult for devices to distinguish undependable services and get successful cooperation. In this paper, we originally propose a broker-guided trust calculation model based on feedback from brokers of BSs which provide mobile network services. And we adopt lightweight trust evaluating mechanism which facilitates low-overhead trust computing algorithms to reduce networking risk and improve system efficiency. Compared with existing models, the experimental results show that our model have great advantage in both reliability and efficiency.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"453 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123637570","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}
{"title":"MPP: A Join-dividing Method for Multi-table Privacy Preservation","authors":"Wei-qing Huang, Jianfeng Xia, Min Yu, Chao Liu","doi":"10.1109/ISCC.2018.8538724","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538724","url":null,"abstract":"In regard to relational databases, studies in this area typically focus on individual privacy leakage in one table. However, in reality, a database usually has many tables, some of them contain correlation information about individual, which can provide additional implication as background knowledge to attacker. In this paper, we innovatively propose a new method named MPP (Multi-table Privacy Preservation) which combines Lossy-join with Bucketization to enhance the individual privacy in database. We consider the privacy disclosure problem from the global sight of the entire dataset instead of a table. Based on this method, we not only solve the correlation information leakage by other tables, but also improve the data utility. Extensive experiments on 32.8GB real-world Express data demonstrate the effectiveness and efficiency of our approach in terms of data utility and computational cost.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125743209","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}
{"title":"CNN based Indoor Localization using RSS Time-Series","authors":"Mai Ibrahim, Marwan Torki, Mustafa ElNainay","doi":"10.1109/ISCC.2018.8538530","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538530","url":null,"abstract":"Indoor localization of mobile nodes is receiving great interest due to the recent advances in mobile devices and the increasing number of location-based services. Fingerprinting based on Wifi received signal strength (RSS) is widely used for indoor localization due to its simplicity and low hardware requirements. However, its positioning accuracy is significantly affected by random fluctuations of RSS values caused by fading and multi-path phenomena. This paper presents a convolutional neural network (CNN) based approach for indoor localization using RSS time-series from wireless local area network (WLAN) access points. Applying CNN on a time-series of RSS readings is expected to reduce the noise and randomness present in separate RSS values and hence improve the localization accuracy. The proposed model is implemented and evaluated on a multi-building and multi-floor dataset, UJIIndoorLoc dataset. The proposed approach provides 100% accuracy for building prediction, 100% accuracy for floor prediction and the mean error in coordinates estimation is 2.77 m.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128500149","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}
{"title":"Proactive Mitigation to Table-Overflow in Software-Defined Networking","authors":"Jianfeng Xu, Liming Wang, Chen Song, Zhen Xu","doi":"10.1109/ISCC.2018.8538670","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538670","url":null,"abstract":"Table-overflow occurs frequently in switches due to the limited flow table storage space, which has seriously hampered thelarge-scale deployment of SDN. To mitigate this threat, we introduce a new, proactive switch space intelligent management framework that can react actively before table- overflow occurs. Our solution, referred to as CPD, contains three modules: flow table status collection, flow prediction and proactive flow entry deletion. To preserve the function of switch, flow prediction predicts the number of new flows entering the network based on historical information, and proactive flow entry deletion evaluates the likelihood of table-overflow according to the predicted value and the state of current flow table gathered by status collection and proactively deletes the flow entries through a flow-based eviction algorithm. Further, we determine the best sampling period by solving a multi-objective optimization problem. Finally, the simulation results show that CPD can prevent about 90% of table-overflow and significantly reduce over 20% occurrences of table-miss compared with existing mechanisms.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129540660","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}
L. J. Braulio, E. Moreno, D. D. J. D. Macedo, D. Kreutz, M. Dantas
{"title":"Towards a Hybrid Storage Architecture for IoT","authors":"L. J. Braulio, E. Moreno, D. D. J. D. Macedo, D. Kreutz, M. Dantas","doi":"10.1109/ISCC.2018.8538474","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538474","url":null,"abstract":"Internet of Things (IoT) is becoming part of our daily life. Indeed, studies predict a sharp market growth by 2020. One of the challenges of this fast-growing market is how to store and manage the amount of non-structured data generated by IoT devices. In this paper, we propose a hybrid storage architecture for IoT for addressing scalability, performance, and heterogeneity issues. We selected three of the most commonly used NoSQL databases (Redis, MongoDB, and Cassandra) to perform the first evaluation of our architecture. Our results suggest that the hybrid storage architecture is a feasible and promising approach to address some of the issues related to the ever-growing amount of data generated by IoT devices. Additionally, our findings also show that Redis achieves a better overall performance for the two chosen types of data, namely scalar and positional.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129776782","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}
E. B. Nascimento, D. D. J. D. Macedo, E. Moreno, L. C. E. Bona, Miriam A. M. Capretz
{"title":"Evaluation of Cache for Bandwidth Optimization in ICN Through Software-Defined Networks","authors":"E. B. Nascimento, D. D. J. D. Macedo, E. Moreno, L. C. E. Bona, Miriam A. M. Capretz","doi":"10.1109/ISCC.2018.8538498","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538498","url":null,"abstract":"Traffic reduction in network segments through cache implementations has become a major research topic due to the exponential increase in data requests through the network. Even with high-speed connections, the conventional model still depends on point-to-point communication between two systems. Throughout the world, more connected devices are, accessing services and obtaining information. To support this activity, servers must have massive storage to support creation, retrieval, updated and deletion of large amounts of data. Therefore, in studies of Information Centric Networks (ICN), this model has been widely discussed as the new content distribution model for the Internet. To provide improved network management many approaches are using software-defined networks (SDN) to develop flexible content-based networks. This paper proposes to use cache replication for ICN through SDN to avoid duplicated requests in the same connection. The redundant cache reduced the bandwidth consumed by duplicated requests, from a maximum of 3.20 Gbps to 2.07 Gbps, reducing the bandwidth consumption by 11.3%.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130175447","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}
M. Occello, Luis-Felipe Rodriguez, Y. A. Rios-Solis, M. Dikaiakos, Mohand-Said Hacid, M. Kantarcioglu, Shangguang Wang, Anand Dersingh, S. Aly, Jungpil Shin, H. Hosny, Dashun Wang, Nan Shao, Guangjie Ren, Yu Deng, Sai Zeng, R. Dijkman, Dickson K. W. Chiu, H. Leong, Masahiro Tanaka, Junhua Ding, E. Kafeza, San-Yih Hwang
{"title":"ISCC 2018 Technical Program Committee","authors":"M. Occello, Luis-Felipe Rodriguez, Y. A. Rios-Solis, M. Dikaiakos, Mohand-Said Hacid, M. Kantarcioglu, Shangguang Wang, Anand Dersingh, S. Aly, Jungpil Shin, H. Hosny, Dashun Wang, Nan Shao, Guangjie Ren, Yu Deng, Sai Zeng, R. Dijkman, Dickson K. W. Chiu, H. Leong, Masahiro Tanaka, Junhua Ding, E. Kafeza, San-Yih Hwang","doi":"10.1109/iscc.2018.8538764","DOIUrl":"https://doi.org/10.1109/iscc.2018.8538764","url":null,"abstract":"Michel Occello, Pierre Mendes France University, France Jean-Paul Jamont, Universite de Grenoble, France Luis-Felipe Rodriguez, Instituto Tecnologico de Sonora, Mexico Yasmin A. Rios-Solis, Universidad Autonoma de Nuevo Leon, Mexico Osvaldo Cairo, Instituto Tecnologico Autonomo de Mexico, Mexico Marios D. Dikaiakos, University of Cyprus, Cyprus Mohand-Said Hacid, Universite Claude Bernard Lyon 1, France Sarūnas Girdzijauskas, KTH, Sweden Murat Kantarcioglu, University of Texas at Dallas, USA James Joshi, University of Pittsburg, USA Massimo Mecella, University of Rome, Italy Athman Bouguettaya, RMIT, Australia Bugra Gedik, Bilkent University, Turkey Shangguang Wang, Beijing University of Posts & Telecommunications, China Zaiwen Feng, Wuhan University, China Anand Dersingh, Assumption University, Thailand Lalita Narupiyakul, Mahidol University, Thailand Sherif G. Aly, The American University in Cairo, Egypt Sumon Shahriar, CSIRO, Australia Jungpil Shin, The University of Aizu, Japan Jinan Fiaidhi, Lakehead University, Canada Hoda M. Hosny, The American University in Cairo, Egypt Wesley Gifford, IBM T. J. Watson Research Center, USA Dashun Wang, IBM T. J. Watson Research Center, USA Nan Shao, IBM T. J. Watson Research Center, USA Sechan Oh, IBM Almaden Research Center, USA Guangjie Ren, IBM Almaden Research Center, USA Yu Deng, IBM T. J. Watson Research Center, USA E E Jan, IBM T. J. Watson Research Center, USA Sai Zeng, IBM T. J. Watson Research Center, USA Yixin Diao, IBM T. J. Watson Research Center, USA Remco Dijkman, Eindhoven University of Technology, The Netherlands Claude Godart, University Henri Poincare, France Akhilesh Bajaj, The University of Tulsa, USA Dickson Chiu, The University of Hong Kong, Hong Kong Hong-va Leong, Hong Kong Polytechnic University, Hong Kong Qing Li, City University of Hong Kong, Hong Kong Dragan Gasevic, Simon Fraser University, Canada Tilmann Rabl, University of Toronto, Canada Masahiro Tanaka, National Institute of Information and Communications Technology (NICT), Japan Ladjel Bellatreche, LIAS/ISAE-ENSMA, France Vijay Varadharajan, Macquarie University, Australia Armin Haller, CSIRO, Australia Luis Vaquero, HP Lab, UK Miguel Vargas Martin, University of Ontario Institute of Technology, Canada Fabio Casati, University of Trento, Italy Hangwei Qian, VMware, Inc., USA Junhua Ding, East Carolina University, USA Eleanna Kafeza, Athens University of Economics and Business, Greece Wei-Tek Tsai, Arizona State University, USA Jie Xu, University of Leeds, UK San-Yih Hwang, National Sun Yat-sen University, Taiwan Xiaoling Wang, Eash China Normal University, China","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130195560","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}