Hyeryun Lee, Kyunghee Choi, K. Chung, Jaein Kim, Kangbin Yim
There have been many warnings that automobiles are vulnerable to the attacks through the network, CAN which connects the ECUs (Electrical Control Units) embedded in the automobiles. Some previous studies showed that the warnings were actual treats. They analyzed the packets flowing on the network and used the packets constructed based on the analysis. We show that it is possible to attack automobiles without any in-depth knowledge about automobiles and specially designed tools to analyze the packets. Experiments are performed in two phases. In the first phase, the victims automobiles are attacked with the packets constructed with the CAN IDs gathered from the sniffed packets flowing in the automobiles. It is not a problem at all to gather CANIDs since CAN is an open simple standard protocol and there are many tools to sniff CAN packets in the Internet. In the second phase, the attack packets are constructed in a completely random manner without any previous information such as CAN IDs. The packets are injected into the network via Bluetooth, a wireless channel. Through the experiments, we show the network vulnerability of automobiles.
{"title":"Fuzzing CAN Packets into Automobiles","authors":"Hyeryun Lee, Kyunghee Choi, K. Chung, Jaein Kim, Kangbin Yim","doi":"10.1109/AINA.2015.274","DOIUrl":"https://doi.org/10.1109/AINA.2015.274","url":null,"abstract":"There have been many warnings that automobiles are vulnerable to the attacks through the network, CAN which connects the ECUs (Electrical Control Units) embedded in the automobiles. Some previous studies showed that the warnings were actual treats. They analyzed the packets flowing on the network and used the packets constructed based on the analysis. We show that it is possible to attack automobiles without any in-depth knowledge about automobiles and specially designed tools to analyze the packets. Experiments are performed in two phases. In the first phase, the victims automobiles are attacked with the packets constructed with the CAN IDs gathered from the sniffed packets flowing in the automobiles. It is not a problem at all to gather CANIDs since CAN is an open simple standard protocol and there are many tools to sniff CAN packets in the Internet. In the second phase, the attack packets are constructed in a completely random manner without any previous information such as CAN IDs. The packets are injected into the network via Bluetooth, a wireless channel. Through the experiments, we show the network vulnerability of automobiles.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"228 1","pages":"817-821"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74468328","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}
This paper presents an object-based method for indexing recursive structured XML data and process branched queries efficiently. The proposed method is called Object-based Twig Query processing for Recursive data (OTQℜ). It is an extended approach of our existing work in [1] in order to handle recursion in XML data. Our motivation of extending OTQ to OTQℜ is to support many applications that require recursive data structure to be fully functional. OTQℜ is proposed to utilize semantics of XML data to efficiently process branched queries on recursive XML data. The experiments and evaluation are presented to cover variant evaluating points and the efficiency of our approach.
{"title":"Efficient Processing of Queries over Recursive XML Data","authors":"N. Alghamdi, J. Rahayu, E. Pardede","doi":"10.1109/AINA.2015.177","DOIUrl":"https://doi.org/10.1109/AINA.2015.177","url":null,"abstract":"This paper presents an object-based method for indexing recursive structured XML data and process branched queries efficiently. The proposed method is called Object-based Twig Query processing for Recursive data (OTQℜ). It is an extended approach of our existing work in [1] in order to handle recursion in XML data. Our motivation of extending OTQ to OTQℜ is to support many applications that require recursive data structure to be fully functional. OTQℜ is proposed to utilize semantics of XML data to efficiently process branched queries on recursive XML data. The experiments and evaluation are presented to cover variant evaluating points and the efficiency of our approach.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"99 1","pages":"134-142"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72900280","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}
The ability of an attacker to take over control of a distributed system or to deny the defender the same is a general problem, but of particular significance in cyber-physical systems where even temporary loss of view or loss of control can result in outright failure and severe cascading effects. Moreover, many such cyber-physical systems not only exhibit a safe fail-stop behaviour such that they can be brought to a halt in a safe state, but also have hard real-time requirements such as in the case of electrical power networks and their constituent elements. We study the Power Dominating Set (PDS) problem originally by Haynes to study the structure of electric power networks and their efficient control, known to be equivalent to the maximum matching problem. However, PDS is generally known to be NP-complete with poor approximability with recent work focusing on studying properties of restricted graph classes. In this paper we describe the problems of controllability and structural controllability as represented by the PDS problem and investigate different attacks affecting control networks. We therefore review existing work on graph classes for which PDS has been studied before identifying possible embeddings of such structures in ErdHös-Rènyi graphs of different density as well as the approximation characteristics which can be achieved in order to adapt them for solving the partition elements of directed PDS problem. This allows the rapid identification of feasible alternative control structures where attackers have damaged or compromised the original control network, and to recover partial controllability if a control network has been partitioned.
{"title":"Structural Controllability Analysis Via Embedding Power Dominating Set Approximation in ErdHos-Rènyi Graphs","authors":"B. Alwasel, S. Wolthusen","doi":"10.1109/WAINA.2015.77","DOIUrl":"https://doi.org/10.1109/WAINA.2015.77","url":null,"abstract":"The ability of an attacker to take over control of a distributed system or to deny the defender the same is a general problem, but of particular significance in cyber-physical systems where even temporary loss of view or loss of control can result in outright failure and severe cascading effects. Moreover, many such cyber-physical systems not only exhibit a safe fail-stop behaviour such that they can be brought to a halt in a safe state, but also have hard real-time requirements such as in the case of electrical power networks and their constituent elements. We study the Power Dominating Set (PDS) problem originally by Haynes to study the structure of electric power networks and their efficient control, known to be equivalent to the maximum matching problem. However, PDS is generally known to be NP-complete with poor approximability with recent work focusing on studying properties of restricted graph classes. In this paper we describe the problems of controllability and structural controllability as represented by the PDS problem and investigate different attacks affecting control networks. We therefore review existing work on graph classes for which PDS has been studied before identifying possible embeddings of such structures in ErdHös-Rènyi graphs of different density as well as the approximation characteristics which can be achieved in order to adapt them for solving the partition elements of directed PDS problem. This allows the rapid identification of feasible alternative control structures where attackers have damaged or compromised the original control network, and to recover partial controllability if a control network has been partitioned.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"45 1","pages":"418-423"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73528881","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}
Link reliability and power consumption are a prime concern in the design of wireless sensor networks. The data exchanged between nodes are vulnerable to corruption by errors induced by random noise, signal fading and other factors. Error control codes (ECC) is an efficient technique for increasing reliability of links and minimizing power transmitted. In this context, the choice of energy efficient ECC with a suitable modulation scheme is a vital task at the physical layer of wireless sensor networks to improve their lifetime. A performance analysis of energy consumption referring to MSK modulation with suitable error control codes approach is presented in this paper. The particularly analysis is evaluated in terms of energy consumption and probability of Bit Error Rate (BER) for various error control codes combined with optimal modulation scheme through a Gaussian channel (AWGN). Based on simulations results, we observe that the benefit of error correcting approach varies with the transmission distance. The combination MSK modulation and Reed Solomon code yields a significant improvement power consumption.
{"title":"Extensive Simulation Performance Evaluation of MSK Scheme with Error Correcting Codes in Wireless Sensor Networks","authors":"Rajoua Anane, R. Bouallègue, K. Raoof","doi":"10.1109/AINA.2015.213","DOIUrl":"https://doi.org/10.1109/AINA.2015.213","url":null,"abstract":"Link reliability and power consumption are a prime concern in the design of wireless sensor networks. The data exchanged between nodes are vulnerable to corruption by errors induced by random noise, signal fading and other factors. Error control codes (ECC) is an efficient technique for increasing reliability of links and minimizing power transmitted. In this context, the choice of energy efficient ECC with a suitable modulation scheme is a vital task at the physical layer of wireless sensor networks to improve their lifetime. A performance analysis of energy consumption referring to MSK modulation with suitable error control codes approach is presented in this paper. The particularly analysis is evaluated in terms of energy consumption and probability of Bit Error Rate (BER) for various error control codes combined with optimal modulation scheme through a Gaussian channel (AWGN). Based on simulations results, we observe that the benefit of error correcting approach varies with the transmission distance. The combination MSK modulation and Reed Solomon code yields a significant improvement power consumption.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"24 1","pages":"400-405"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84701078","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}
Shinji Sakamoto, Tetsuya Oda, L. Barolli, Makoto Ikeda, F. Xhafa, K. Uchida
One of the key advantages of Wireless Mesh Networks (WMNs) is their importance for providing cost efficient broad band connectivity. In WMNs, there are issues for achieving the network connectivity and user coverage, which are related with the node placement problem. In this work, we consider the router node placement problem in WMNs. We want to find the optimal distribution of router nodes in order to provide the best network connectivity (the maximal number of connected routers) and coverage (maximal number of covered clients). We apply our proposed WMN-SA simulation system in a realistic scenario of the distribution of mesh clients considering It oshima City, Fukuoka Prefecture, Japan. From simulation results, we found many insights that can be very important for real deployment of WMNs.
{"title":"Application of WMN-SA Simulation System for WMN Node Placement in a Realistic Scenario","authors":"Shinji Sakamoto, Tetsuya Oda, L. Barolli, Makoto Ikeda, F. Xhafa, K. Uchida","doi":"10.1109/AINA.2015.164","DOIUrl":"https://doi.org/10.1109/AINA.2015.164","url":null,"abstract":"One of the key advantages of Wireless Mesh Networks (WMNs) is their importance for providing cost efficient broad band connectivity. In WMNs, there are issues for achieving the network connectivity and user coverage, which are related with the node placement problem. In this work, we consider the router node placement problem in WMNs. We want to find the optimal distribution of router nodes in order to provide the best network connectivity (the maximal number of connected routers) and coverage (maximal number of covered clients). We apply our proposed WMN-SA simulation system in a realistic scenario of the distribution of mesh clients considering It oshima City, Fukuoka Prefecture, Japan. From simulation results, we found many insights that can be very important for real deployment of WMNs.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"49 1","pages":"43-47"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84863429","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}
The paper takes the multi-modal data massive minority area as the research object, and uses emotion computing, voice recognition, geographic information representation, video content recognition, intelligent technology and robot, 3D display, wireless communication, the minority language and semantic information retrieval advanced information processing technology, in-depth analyzes the methods for massive multi-modal data analysis and processing of national minority area (for example: minority voice stream data, image data, EEG data, national costume of 3D data, GIS data, characteristics of ethnic minorities village minority language news data), the effective realization of multimodal data application services integrating multiple information fusion technology.
{"title":"e-MinZu: A Software Service Architecture Based on Saas for Massive Data Source","authors":"Weng Yu","doi":"10.1109/WAINA.2015.129","DOIUrl":"https://doi.org/10.1109/WAINA.2015.129","url":null,"abstract":"The paper takes the multi-modal data massive minority area as the research object, and uses emotion computing, voice recognition, geographic information representation, video content recognition, intelligent technology and robot, 3D display, wireless communication, the minority language and semantic information retrieval advanced information processing technology, in-depth analyzes the methods for massive multi-modal data analysis and processing of national minority area (for example: minority voice stream data, image data, EEG data, national costume of 3D data, GIS data, characteristics of ethnic minorities village minority language news data), the effective realization of multimodal data application services integrating multiple information fusion technology.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"69 1","pages":"246-249"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84912298","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}
As data leakage accidents occur every year, the security of confidential information is becoming increasingly important. Remote Access Trojans (RAT), a kind of spyware, are used to invade the PC of a victim through targeted attacks. After the intrusion, the attacker can monitor and control the victim's PC remotely, to wait for an opportunity to steal the confidential information. Since it is hard to prevent the intrusion of RATs completely, preventing confidential information being leaked back to the attacker is the main issue. Various existing approaches introduce different network behaviors of RAT to construct detection systems. Unfortunately, two challenges remain: one is to detect RAT sessions as early as possible, the other is to remain a high accuracy to detect RAT sessions, while there exist normal applications whose traffic behave similarly to RATs. In this paper, we propose a novel approach to detect RAT sessions in the early stage of communication. To differentiate network behaviors between normal applications and RAT, we extract the features from the traffic of a short period of time at the beginning. Afterward, we use machine learning techniques to train the detection model, then evaluate it by K-Fold cross-validation. The results show that our approach is able to detect RAT sessions with a high accuracy. In particular, our approach achieves over 96% accuracy together with the FNR of 10% by Random Forest algorithm, which means that our approach is valid to detect RAT sessions in the early stage of communication.
{"title":"An Approach to Detect Remote Access Trojan in the Early Stage of Communication","authors":"Dan Jiang, Kazumasa Omote","doi":"10.1109/AINA.2015.257","DOIUrl":"https://doi.org/10.1109/AINA.2015.257","url":null,"abstract":"As data leakage accidents occur every year, the security of confidential information is becoming increasingly important. Remote Access Trojans (RAT), a kind of spyware, are used to invade the PC of a victim through targeted attacks. After the intrusion, the attacker can monitor and control the victim's PC remotely, to wait for an opportunity to steal the confidential information. Since it is hard to prevent the intrusion of RATs completely, preventing confidential information being leaked back to the attacker is the main issue. Various existing approaches introduce different network behaviors of RAT to construct detection systems. Unfortunately, two challenges remain: one is to detect RAT sessions as early as possible, the other is to remain a high accuracy to detect RAT sessions, while there exist normal applications whose traffic behave similarly to RATs. In this paper, we propose a novel approach to detect RAT sessions in the early stage of communication. To differentiate network behaviors between normal applications and RAT, we extract the features from the traffic of a short period of time at the beginning. Afterward, we use machine learning techniques to train the detection model, then evaluate it by K-Fold cross-validation. The results show that our approach is able to detect RAT sessions with a high accuracy. In particular, our approach achieves over 96% accuracy together with the FNR of 10% by Random Forest algorithm, which means that our approach is valid to detect RAT sessions in the early stage of communication.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"706-713"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82850244","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}
Agile providing Internet connectivity to the victims right after a disaster occurs is essential to mitigate loss and save people. It is hard, however, to quickly recover communication infrastructures due to many difficulties such as reach ability to the destroyed areas, heavy and wide-area damages requiring a huge amount of resources and human power to recover, and so forth. WiFi based multihop access network establishment leveraging on-site commodity mobile devices has the potential to disaster recovery. This approach does not require additional hardware such as network interface cards (NICs) or pre-installed multihop routing protocols on mobile devices as in conventional ad-hoc networks. Instead, it leverages the available WiFi NIC on the mobile device to share its Internet connectivity to the nearby nodes. As a result, Internet connectivity can be quickly brought to further victims. However, we still lack an understanding of its true potential in real environments. This paper provides a comprehensive field experiment using our proof-of-concept prototype. The results reveal the feasibility and the effectiveness of the proposed network as it can easily extend to 20 hops and cover a large area, around one kilometer in diameter.
{"title":"Feasibility Validation of WiFi Based Multihop Access Network for Disaster Recovery","authors":"Q. Minh, S. Yamada","doi":"10.1109/WAINA.2015.40","DOIUrl":"https://doi.org/10.1109/WAINA.2015.40","url":null,"abstract":"Agile providing Internet connectivity to the victims right after a disaster occurs is essential to mitigate loss and save people. It is hard, however, to quickly recover communication infrastructures due to many difficulties such as reach ability to the destroyed areas, heavy and wide-area damages requiring a huge amount of resources and human power to recover, and so forth. WiFi based multihop access network establishment leveraging on-site commodity mobile devices has the potential to disaster recovery. This approach does not require additional hardware such as network interface cards (NICs) or pre-installed multihop routing protocols on mobile devices as in conventional ad-hoc networks. Instead, it leverages the available WiFi NIC on the mobile device to share its Internet connectivity to the nearby nodes. As a result, Internet connectivity can be quickly brought to further victims. However, we still lack an understanding of its true potential in real environments. This paper provides a comprehensive field experiment using our proof-of-concept prototype. The results reveal the feasibility and the effectiveness of the proposed network as it can easily extend to 20 hops and cover a large area, around one kilometer in diameter.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"180 1","pages":"473-477"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83010618","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}
In this paper an improvement over our previous work is proposed to handle short-medium range surveillance videos. The features of histogram of oriented social force (HOSF) are the primitive building blocks to capture the interactions among people. To reduce the correlation among data, whitening procedure is applied on features. We use Bag-of-Feature (BoF) to pool HOSF in a given frame. Since our goal is to classify whether a given frame is normal and BoF, a histogram of visual words in a frame, can better represent patterns in term of frame. In the phase of building the dictionary, training BoFs are clustered and the center means are so called code words corresponding to "normal" patterns observed during the training process. A Gaussian model is constructed for distances between data and the codeword in each cluster. To decide whether a given frame is normal, the BoF feature is evaluated and the Z-score which measuring the deviation to the closest codeword is calculated. If such BoF is an outlier (i.e. High Z-score) comparing to the closest codeword, then the frame is classified "abnormal". The method is testified by the subway dataset with promising results.
{"title":"An Anomaly Detection by Whitening HOSF","authors":"Chun-Hui Wang, Yue Pan, Shwu-Huey Yen","doi":"10.1109/WAINA.2015.56","DOIUrl":"https://doi.org/10.1109/WAINA.2015.56","url":null,"abstract":"In this paper an improvement over our previous work is proposed to handle short-medium range surveillance videos. The features of histogram of oriented social force (HOSF) are the primitive building blocks to capture the interactions among people. To reduce the correlation among data, whitening procedure is applied on features. We use Bag-of-Feature (BoF) to pool HOSF in a given frame. Since our goal is to classify whether a given frame is normal and BoF, a histogram of visual words in a frame, can better represent patterns in term of frame. In the phase of building the dictionary, training BoFs are clustered and the center means are so called code words corresponding to \"normal\" patterns observed during the training process. A Gaussian model is constructed for distances between data and the codeword in each cluster. To decide whether a given frame is normal, the BoF feature is evaluated and the Z-score which measuring the deviation to the closest codeword is calculated. If such BoF is an outlier (i.e. High Z-score) comparing to the closest codeword, then the frame is classified \"abnormal\". The method is testified by the subway dataset with promising results.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"143 3 1","pages":"706-710"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91115005","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}
When a large-scale disaster occurs, it is crucial to secure means of communication. However, as the damage to the communication networks might be aggravated as the magnitude of the disaster becomes larger, it would likely cause a state where all communications are disrupted. In addition, as the amount of damage to the power plant and transmission line becomes more significant, it could disrupt the supply of electricity over an extended period of time. The purpose of this research is to develop an autonomous anti-disaster base station that houses a power supply system, which uses both solar panels and batteries as the source of power, and has satellite Internet and wireless LAN environment so as to contribute to the securing of Internet communication immediately following a great earthquake. We developed a prototype system of the autonomous anti-disaster base station that features two types of satellite Internet connection equipment. The prototype system was put through a demonstration experiment during an anti-disaster drill held at a university. During the anti-disaster drill, the students of the university that evacuated to a sports field used their own smart devices to connect to the wireless LAN access point of the prototype system and registered their safety information into the safety confirmation system of the university through the satellite Internet. The access log of the safety confirmation system allowed us to verify that access was successfully made to the safety confirmation system through the prototype system. In addition, we conducted a questionnaire survey of the university students following the drill and were able to verify the usefulness of the system.
{"title":"Development of Autonomous Anti-Disaster Base Station by Combination of Satellite and Wireless Networks","authors":"Hiroaki Yuze, S. Nabeta, Yuji Ito","doi":"10.1109/WAINA.2015.134","DOIUrl":"https://doi.org/10.1109/WAINA.2015.134","url":null,"abstract":"When a large-scale disaster occurs, it is crucial to secure means of communication. However, as the damage to the communication networks might be aggravated as the magnitude of the disaster becomes larger, it would likely cause a state where all communications are disrupted. In addition, as the amount of damage to the power plant and transmission line becomes more significant, it could disrupt the supply of electricity over an extended period of time. The purpose of this research is to develop an autonomous anti-disaster base station that houses a power supply system, which uses both solar panels and batteries as the source of power, and has satellite Internet and wireless LAN environment so as to contribute to the securing of Internet communication immediately following a great earthquake. We developed a prototype system of the autonomous anti-disaster base station that features two types of satellite Internet connection equipment. The prototype system was put through a demonstration experiment during an anti-disaster drill held at a university. During the anti-disaster drill, the students of the university that evacuated to a sports field used their own smart devices to connect to the wireless LAN access point of the prototype system and registered their safety information into the safety confirmation system of the university through the satellite Internet. The access log of the safety confirmation system allowed us to verify that access was successfully made to the safety confirmation system through the prototype system. In addition, we conducted a questionnaire survey of the university students following the drill and were able to verify the usefulness of the system.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"31 1","pages":"524-528"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87085015","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：