In our previous work, we proposed a method of Enhanced Message Suppression Controller (EMSC) considering Vehicle-to-Vehicle (V2V) communication. In this paper, we improve EMSC by considering delayed acknowledgment for Vehicular-Delay/Disruption Tolerant Networking (V-DTN). The simulations for a scenario is conducted considering persist timer to control the delayed acknowledgment, where EMSC embedded in Vehicles (EMSCVs) are present. From the simulation results, we observed that our proposed method can increase efficiency by sending fewer packets than the conventional EMSC.
{"title":"An Improved Message Suppression Controller Considering Delayed Acknowledgment for VANETs","authors":"Daichi Koga, Makoto Ikeda, L. Barolli","doi":"10.1109/NBiS.2016.50","DOIUrl":"https://doi.org/10.1109/NBiS.2016.50","url":null,"abstract":"In our previous work, we proposed a method of Enhanced Message Suppression Controller (EMSC) considering Vehicle-to-Vehicle (V2V) communication. In this paper, we improve EMSC by considering delayed acknowledgment for Vehicular-Delay/Disruption Tolerant Networking (V-DTN). The simulations for a scenario is conducted considering persist timer to control the delayed acknowledgment, where EMSC embedded in Vehicles (EMSCVs) are present. From the simulation results, we observed that our proposed method can increase efficiency by sending fewer packets than the conventional EMSC.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132506038","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}
A. Doi, Kenji Oshida, Y. Takashima, Kenji Sakakibara, Tomoya Itoh
In this paper, we propose our approach to speed up the reconstruction of city, village, and town at Sanriku coast areas, which had unprecedented damages in the Great East Japan Earthquake that occurred on March 11, 2011. There are two policies in our approach. One is to build 3D models of the reconstruction plans in order to visualize reconstruction plans, and the other is to develop human resources that can build 3D models of reconstruction plans by setting up training courses. They can teach the modeling method to another people, and assist the reconstruction and accelerate the whole of recovery. The professional education (teaching) contents involve both 3D CAD (Computer Aided Design) and 3D CG (Computer Graphics). Since the constructed 3D models involve CAD topographic map, aerial photographs, geography and attribute information of the road, river, rail way and so on, it is easy for residents to understand the whole reconstruction plans. In fact, these 3D models are definitely effective for residents briefing and confirmation of urban planning.
{"title":"3D Modeling of Reconstruction Plan at Sanriku Coast for Great East Japan Earthquake: Visualization of the Reconstruction Plan for Effective Information Sharing","authors":"A. Doi, Kenji Oshida, Y. Takashima, Kenji Sakakibara, Tomoya Itoh","doi":"10.1109/NBiS.2016.61","DOIUrl":"https://doi.org/10.1109/NBiS.2016.61","url":null,"abstract":"In this paper, we propose our approach to speed up the reconstruction of city, village, and town at Sanriku coast areas, which had unprecedented damages in the Great East Japan Earthquake that occurred on March 11, 2011. There are two policies in our approach. One is to build 3D models of the reconstruction plans in order to visualize reconstruction plans, and the other is to develop human resources that can build 3D models of reconstruction plans by setting up training courses. They can teach the modeling method to another people, and assist the reconstruction and accelerate the whole of recovery. The professional education (teaching) contents involve both 3D CAD (Computer Aided Design) and 3D CG (Computer Graphics). Since the constructed 3D models involve CAD topographic map, aerial photographs, geography and attribute information of the road, river, rail way and so on, it is easy for residents to understand the whole reconstruction plans. In fact, these 3D models are definitely effective for residents briefing and confirmation of urban planning.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":" 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113948142","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}
Although there are several privacy approaches, which are designed for incremental data publishing, these privacy approaches can cope with only similarity and difference attacks. In this paper, we propose a new pattern of privacy attack for incremental data publishing, so called joint attack. We first illustrate the joint attack by example. Then, the investigation on the characteristics of the joint attack is made. Finally, we propose a simple yet effective algorithm to resolve such joint attack as well as the two well-known attacks, i.e. similarity and difference attacks. From the experimental results, we can conclude that our approach is effective.
{"title":"Joint Attack: A New Privacy Attack for Incremental Data Publishing","authors":"Torsak Soontornphand, J. Natwichai","doi":"10.1109/NBiS.2016.90","DOIUrl":"https://doi.org/10.1109/NBiS.2016.90","url":null,"abstract":"Although there are several privacy approaches, which are designed for incremental data publishing, these privacy approaches can cope with only similarity and difference attacks. In this paper, we propose a new pattern of privacy attack for incremental data publishing, so called joint attack. We first illustrate the joint attack by example. Then, the investigation on the characteristics of the joint attack is made. Finally, we propose a simple yet effective algorithm to resolve such joint attack as well as the two well-known attacks, i.e. similarity and difference attacks. From the experimental results, we can conclude that our approach is effective.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114782021","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}
A. Sher, N. Javaid, G. Ahmed, Saif ul Islam, U. Qasim, Z. Khan
Deployment of sensor nodes in underwater wireless sensor networks with a goal of maximum network field coverage is very difficult. Moreover, to access the information from sensor nodes efficiently in aquatic environment is very unpredictable. In our scheme sensor nodes are randomly deployed in the network filed. We have cover the maximum network field through constant mobility of two sinks. Due to consistent movement of mobile sinks every time maximum number of sensor nodes transmit their data packets to the respective mobile sink in their transmission range. Mobility of sinks increases the throughput with balanced energy consumption. Simulation results show that, MC protocol perform better in terms of network lifetime, throughput and energy consumption.
{"title":"MC: Maximum Coverage Routing Protocol for Underwater Wireless Sensor Networks","authors":"A. Sher, N. Javaid, G. Ahmed, Saif ul Islam, U. Qasim, Z. Khan","doi":"10.1109/NBiS.2016.77","DOIUrl":"https://doi.org/10.1109/NBiS.2016.77","url":null,"abstract":"Deployment of sensor nodes in underwater wireless sensor networks with a goal of maximum network field coverage is very difficult. Moreover, to access the information from sensor nodes efficiently in aquatic environment is very unpredictable. In our scheme sensor nodes are randomly deployed in the network filed. We have cover the maximum network field through constant mobility of two sinks. Due to consistent movement of mobile sinks every time maximum number of sensor nodes transmit their data packets to the respective mobile sink in their transmission range. Mobility of sinks increases the throughput with balanced energy consumption. Simulation results show that, MC protocol perform better in terms of network lifetime, throughput and energy consumption.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124740307","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 describes a C++ library to build web applications. The idea is borrowed from Node.js and Express.js which are a rapid web development framework for JavaScript. Our library consists of a few header files so that it can be available by including them into a source code. The API uses some C++14 features, especially 'auto' type, and the program which uses this library becomes concise and clear. In this paper, the design policy, several sample programs and its implementation are presented.
{"title":"A C++ Header Library for Web Applications","authors":"S. Okamoto, Masaki Kohana","doi":"10.1109/NBiS.2016.41","DOIUrl":"https://doi.org/10.1109/NBiS.2016.41","url":null,"abstract":"This paper describes a C++ library to build web applications. The idea is borrowed from Node.js and Express.js which are a rapid web development framework for JavaScript. Our library consists of a few header files so that it can be available by including them into a source code. The API uses some C++14 features, especially 'auto' type, and the program which uses this library becomes concise and clear. In this paper, the design policy, several sample programs and its implementation are presented.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125023474","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}
Ryoichiro Obukata, Tetsuya Oda, Donald Elmazi, Makoto Ikeda, Keita Matsuo, L. Barolli
Ambient intelligence (AmI) deals with a new world of ubiquitous computing devices, where physical environments interact intelligently and unobtrusively with people. AmI environments can be diverse, such as homes, offices, meeting rooms, schools, hospitals, control centers, vehicles, tourist attractions, stores, sports facilities, and music devices. In this paper, we present the design and implementation of a testbed for AmI using Raspberry Pi mounted on Raspbian OS. We analyze the performance of mean shift clustering algorithm considering sensing data. For evaluation we considered respiratory rate and heart rate metrics. The simulation results show that the mean shift clustering algorithm has a good performance.
{"title":"Performance Evaluation of an Ambient Intelligence Testbed for Improving Quality of Life: Evaluation Using Mean Shift Clustering Algorithm","authors":"Ryoichiro Obukata, Tetsuya Oda, Donald Elmazi, Makoto Ikeda, Keita Matsuo, L. Barolli","doi":"10.1109/NBiS.2016.21","DOIUrl":"https://doi.org/10.1109/NBiS.2016.21","url":null,"abstract":"Ambient intelligence (AmI) deals with a new world of ubiquitous computing devices, where physical environments interact intelligently and unobtrusively with people. AmI environments can be diverse, such as homes, offices, meeting rooms, schools, hospitals, control centers, vehicles, tourist attractions, stores, sports facilities, and music devices. In this paper, we present the design and implementation of a testbed for AmI using Raspberry Pi mounted on Raspbian OS. We analyze the performance of mean shift clustering algorithm considering sensing data. For evaluation we considered respiratory rate and heart rate metrics. The simulation results show that the mean shift clustering algorithm has a good performance.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129024025","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}
Keita Matsuo, Tetsuya Oda, Admir Barolli, Makoto Ikeda, L. Barolli, F. Xhafa
In this paper, we evaluate the performance of two WMN architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3. We compare the performance for two architectures considering transmission rate and OLSR protocol. The simulation results show that for transmission rate 600 and 1200 [kbps], the throughput of Hybrid WMN is higher than I/B WMN. For transmission rate 600 and 1200 [kbps], the delay and jitter of Hybrid WMN is lower than I/B WMN. For transmission rate 600 and 1200 [kbps], the fairness index of I/B WMN is higher than Hybrid WMN.
{"title":"A GA-based Simulation System for WMNs: Performance Analysis for Different WMN Architectures Considering Transmission Rate and OLSR Protocol","authors":"Keita Matsuo, Tetsuya Oda, Admir Barolli, Makoto Ikeda, L. Barolli, F. Xhafa","doi":"10.1109/NBiS.2016.19","DOIUrl":"https://doi.org/10.1109/NBiS.2016.19","url":null,"abstract":"In this paper, we evaluate the performance of two WMN architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3. We compare the performance for two architectures considering transmission rate and OLSR protocol. The simulation results show that for transmission rate 600 and 1200 [kbps], the throughput of Hybrid WMN is higher than I/B WMN. For transmission rate 600 and 1200 [kbps], the delay and jitter of Hybrid WMN is lower than I/B WMN. For transmission rate 600 and 1200 [kbps], the fairness index of I/B WMN is higher than Hybrid WMN.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130134304","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}
A. Sawada, Hiroki Kataoka, Dilawaer Duolikun, T. Enokido, M. Takizawa
It is now critical to reduce electric energy consumed by servers in a cluster, especially scalable systems like cloud computing systems. In a cluster of servers, most application processes like Web applications use not only CPU but also storages like HDD. In our previous studies, the power consumption MLPCS model and computation MLCMS model are proposed. Ways to energy-efficiently perform processes which use either CPU or storages are discussed in a cluster of servers. In this paper, we consider a more general type of process which does both the computation and accesses to storages. By using the MLPCMS and MLCMS models, we propose LEAS and GEAS algorithms to select servers to perform processes in a cluster so that the total electric energy consumption of the servers can be reduced. We evaluate the algorithms in terms of total electric energy consumption of the servers and average execution time of the processes. We show the electric energy consumed by servers can be reduced in the LEAS and GEAS algorithms.
{"title":"Selection Algorithms to Select Energy-Efficient Servers for Storage and Computation Processes","authors":"A. Sawada, Hiroki Kataoka, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/NBiS.2016.87","DOIUrl":"https://doi.org/10.1109/NBiS.2016.87","url":null,"abstract":"It is now critical to reduce electric energy consumed by servers in a cluster, especially scalable systems like cloud computing systems. In a cluster of servers, most application processes like Web applications use not only CPU but also storages like HDD. In our previous studies, the power consumption MLPCS model and computation MLCMS model are proposed. Ways to energy-efficiently perform processes which use either CPU or storages are discussed in a cluster of servers. In this paper, we consider a more general type of process which does both the computation and accesses to storages. By using the MLPCMS and MLCMS models, we propose LEAS and GEAS algorithms to select servers to perform processes in a cluster so that the total electric energy consumption of the servers can be reduced. We evaluate the algorithms in terms of total electric energy consumption of the servers and average execution time of the processes. We show the electric energy consumed by servers can be reduced in the LEAS and GEAS algorithms.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129177776","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. Yamada, Tetsuya Oda, Yi Liu, Keita Matsuo, Makoto Ikeda, L. Barolli
Due to the opportunities provided by the Internet, people are taking advantage of e-learning courses and enormous research efforts have been dedicated to the development of e-learning systems. So far, many e-learning systems are proposed and used practically. However, in these systems the e-learning completion rate is low. One of the reasons is the low study desire and motivation. In this work, we design and implement an IoT-Based E-Learning testbed using Raspberry Pi mounted on Raspbian. We analyze the performance of Optimized Link State Routing (OLSR) protocol in an room environment scenario. For evaluation we considered throughput, PDR, hop count, delay and jitter metrics. The experimental results show that the nodes in the testbed were communicating smoothly.
{"title":"Performance Evaluation of an IoT-based e-Learning Testbed Considering OLSR Protocol in a NLoS Environment","authors":"M. Yamada, Tetsuya Oda, Yi Liu, Keita Matsuo, Makoto Ikeda, L. Barolli","doi":"10.1109/NBiS.2016.22","DOIUrl":"https://doi.org/10.1109/NBiS.2016.22","url":null,"abstract":"Due to the opportunities provided by the Internet, people are taking advantage of e-learning courses and enormous research efforts have been dedicated to the development of e-learning systems. So far, many e-learning systems are proposed and used practically. However, in these systems the e-learning completion rate is low. One of the reasons is the low study desire and motivation. In this work, we design and implement an IoT-Based E-Learning testbed using Raspberry Pi mounted on Raspbian. We analyze the performance of Optimized Link State Routing (OLSR) protocol in an room environment scenario. For evaluation we considered throughput, PDR, hop count, delay and jitter metrics. The experimental results show that the nodes in the testbed were communicating smoothly.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128298769","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}
Due to the recent popularization of the Internet, continuous media data broadcasting such as audio or video have attracted great attention. Although continuous media data broadcasting can reduce the more necessary bandwidth than conventional on-demand delivery, waiting time from requesting data to playing it increases. In division-based broadcasting, many researches have proposed scheduling methods to reduce the waiting time. Although a division-based broadcasting system has also been proposed to evaluate these methods, this system does not consider the case of wireless LAN environment. In wireless LAN environment, we have to consider such problems as a communication protocol and a packet loss. In this paper, we propose a division-based broadcasting system to solve the problem in the conventional system. In our proposed system, we can evaluate the effectiveness for reducing the waiting time using the scheduling method.
{"title":"Proposition of Division-Based Broadcasting System over Wireless LAN","authors":"Y. Gotoh, Y. Takagi","doi":"10.1109/NBiS.2016.42","DOIUrl":"https://doi.org/10.1109/NBiS.2016.42","url":null,"abstract":"Due to the recent popularization of the Internet, continuous media data broadcasting such as audio or video have attracted great attention. Although continuous media data broadcasting can reduce the more necessary bandwidth than conventional on-demand delivery, waiting time from requesting data to playing it increases. In division-based broadcasting, many researches have proposed scheduling methods to reduce the waiting time. Although a division-based broadcasting system has also been proposed to evaluate these methods, this system does not consider the case of wireless LAN environment. In wireless LAN environment, we have to consider such problems as a communication protocol and a packet loss. In this paper, we propose a division-based broadcasting system to solve the problem in the conventional system. In our proposed system, we can evaluate the effectiveness for reducing the waiting time using the scheduling method.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121307579","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
扫码关注我们
求助内容：
应助结果提醒方式：