Tetsuya Oda, Xinyue Chang, Shinji Sakamoto, Evjola Spaho, F. Xhafa, L. Barolli
Wireless Mesh Networks (WMNs) are important networking infrastructure for providing cost-efficient broadband wireless connectivity. Mesh router node placement is important to achieve network connectivity and coverage in such networks. In this paper, we compare the performance of Genetic Algorithm (GA) and Hill Climbing (HC) for mesh router node placement in WMNs. We consider Exponential and Weibull distributions of mesh clients and grid size 16x16, 32x32 and 64x64. As evaluation metric we used size of giant component. Simulation results show that GA performs better than HC.
{"title":"A Comparison Study of GA and HC for Mesh Router Node Placement in Wireless Mesh Networks","authors":"Tetsuya Oda, Xinyue Chang, Shinji Sakamoto, Evjola Spaho, F. Xhafa, L. Barolli","doi":"10.1109/NBiS.2013.32","DOIUrl":"https://doi.org/10.1109/NBiS.2013.32","url":null,"abstract":"Wireless Mesh Networks (WMNs) are important networking infrastructure for providing cost-efficient broadband wireless connectivity. Mesh router node placement is important to achieve network connectivity and coverage in such networks. In this paper, we compare the performance of Genetic Algorithm (GA) and Hill Climbing (HC) for mesh router node placement in WMNs. We consider Exponential and Weibull distributions of mesh clients and grid size 16x16, 32x32 and 64x64. As evaluation metric we used size of giant component. Simulation results show that GA performs better than HC.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128791415","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}
Operating systems (OSes) that is based on micro kernel architecture have high adaptability and toughness. In addition, multicore processors have been developed along with the progress of LSI technology. By running a micro kernel OS on a multicore processor and distributing the OS server to multiple cores, it is possible to realize load balancing of the OS processing. In this method, transaction processing, which requires a large amount of OS processing, can be provided effectively in a multicore environment. This paper presents evaluations of distributed OS processing performances for various scenarios for AnT operating system that is based on the micro kernel architecture in a multicore environment. In these evaluations, we describe the differences in performance by distribution forms when referring the data in a block. Moreover, we use the Post Mark and Bonnie benchmark tools to evaluate the effects of load balancing for the distribution forms.
{"title":"Evaluation of Load Balancing in Multicore Processor for AnT","authors":"Takeshi Sakoda, Toshihiro Yamauchi, H. Taniguchi","doi":"10.1109/NBiS.2013.57","DOIUrl":"https://doi.org/10.1109/NBiS.2013.57","url":null,"abstract":"Operating systems (OSes) that is based on micro kernel architecture have high adaptability and toughness. In addition, multicore processors have been developed along with the progress of LSI technology. By running a micro kernel OS on a multicore processor and distributing the OS server to multiple cores, it is possible to realize load balancing of the OS processing. In this method, transaction processing, which requires a large amount of OS processing, can be provided effectively in a multicore environment. This paper presents evaluations of distributed OS processing performances for various scenarios for AnT operating system that is based on the micro kernel architecture in a multicore environment. In these evaluations, we describe the differences in performance by distribution forms when referring the data in a block. Moreover, we use the Post Mark and Bonnie benchmark tools to evaluate the effects of load balancing for the distribution forms.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"20 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116747934","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 discusses an extension of JSINQ, a JavaScript implementation of LINQ, to provide an ability to query MongoDB, a popular document-oriented NoSQL storage. In recent Web systems, it has become popular to use NoSQL storage for data management, and to use JavaScript not only on client-side, but also on server-side due to the popularization of server-side JavaScript environments. Meanwhile, LINQ is being used to facilitate querying or manipulating data in various programming languages, such as C# and JavaScript, using an SQL-like syntax. However, current implementations of LINQ in JavaScript do not support MongoDB. To this problem, we extend JSINQ to provide an ability to query MongoDB. More precisely, we extend JSINQ so that we can specify the MongoDB collection to query. When processing a LINQ query, we extract the query conditions related to MongoDB collections, rewrite them to those in MongoDB API format, and send the rewritten queries to MongoDB. When the results are back, we convert them in a in-memory data structure, and pass them to the JSINQ processor. We conduct some experiments based on TPC-H to show the feasibility and the scalability of the proposed system.
{"title":"Querying MongoDB with LINQ in a Server-Side JavaScript Environment","authors":"K. Nakabasami, T. Amagasa, H. Kitagawa","doi":"10.1109/NBiS.2013.54","DOIUrl":"https://doi.org/10.1109/NBiS.2013.54","url":null,"abstract":"This paper discusses an extension of JSINQ, a JavaScript implementation of LINQ, to provide an ability to query MongoDB, a popular document-oriented NoSQL storage. In recent Web systems, it has become popular to use NoSQL storage for data management, and to use JavaScript not only on client-side, but also on server-side due to the popularization of server-side JavaScript environments. Meanwhile, LINQ is being used to facilitate querying or manipulating data in various programming languages, such as C# and JavaScript, using an SQL-like syntax. However, current implementations of LINQ in JavaScript do not support MongoDB. To this problem, we extend JSINQ to provide an ability to query MongoDB. More precisely, we extend JSINQ so that we can specify the MongoDB collection to query. When processing a LINQ query, we extract the query conditions related to MongoDB collections, rewrite them to those in MongoDB API format, and send the rewritten queries to MongoDB. When the results are back, we convert them in a in-memory data structure, and pass them to the JSINQ processor. We conduct some experiments based on TPC-H to show the feasibility and the scalability of the proposed system.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114774680","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 is concerned with a numerical investigation of magnetic wave, scattered by a conducting cylinder to check the accuracy of numerical results based on the discrete ray tracing method (DRTM). First, the boundary profile of the cylinder is approximated in terms of piecewise-linear plates. Source and image rays are searched for the approximated boundary composed of finite number of plates. Second, numerical computations are carried out for total fields, superposing the scattered fields from each conducting plate, using source and image diffraction coefficients with the Fresnel function. Numerical results of H-wave based on DRTM are compared with rigorous solutions given by use of the Bessel and Hankel functions. Finally, it is demonstrated that the DRTM results of H-wave, are in good agreement with those results obtained by the rigorous solutions and we show an appropriate guideline to discretize the boundary to achieve as small errors as possible.
{"title":"Investigation of Scattered H-Wave Based on DRTM","authors":"M. Takematsu, K. Uchida, J. Honda","doi":"10.1109/NBiS.2013.85","DOIUrl":"https://doi.org/10.1109/NBiS.2013.85","url":null,"abstract":"This paper is concerned with a numerical investigation of magnetic wave, scattered by a conducting cylinder to check the accuracy of numerical results based on the discrete ray tracing method (DRTM). First, the boundary profile of the cylinder is approximated in terms of piecewise-linear plates. Source and image rays are searched for the approximated boundary composed of finite number of plates. Second, numerical computations are carried out for total fields, superposing the scattered fields from each conducting plate, using source and image diffraction coefficients with the Fresnel function. Numerical results of H-wave based on DRTM are compared with rigorous solutions given by use of the Bessel and Hankel functions. Finally, it is demonstrated that the DRTM results of H-wave, are in good agreement with those results obtained by the rigorous solutions and we show an appropriate guideline to discretize the boundary to achieve as small errors as possible.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126722854","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}
We present a novel pairing-based anonymous credential in the random oracle model. To solve the linear complexity of attributes proof, it is to certify each single attribute in an individual credential, and prove any combination of attributes by aggregating the corresponding credentials into a single one. The BLS signature and BGLS aggregate signature schemes are extended to construct anonymous credentials. Through performance analysis of attributes proof of AND relation, our anonymous credential can obtain the constant complexity respect to the number of exponentiations and parings, at the meanwhile, the signature and public parameters are short.
{"title":"Aggregate Signature-Based Efficient Attributes Proof with Pairing-Based Anonymous Credential","authors":"Nan Guo, Jianju Cheng, Bin Zhang, Kangbin Yim","doi":"10.1109/NBiS.2013.42","DOIUrl":"https://doi.org/10.1109/NBiS.2013.42","url":null,"abstract":"We present a novel pairing-based anonymous credential in the random oracle model. To solve the linear complexity of attributes proof, it is to certify each single attribute in an individual credential, and prove any combination of attributes by aggregating the corresponding credentials into a single one. The BLS signature and BGLS aggregate signature schemes are extended to construct anonymous credentials. Through performance analysis of attributes proof of AND relation, our anonymous credential can obtain the constant complexity respect to the number of exponentiations and parings, at the meanwhile, the signature and public parameters are short.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126429590","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}
Learning system has changed in various types, process and materials for a long time. The change has a goal to approach increasing learning result and giving convenience to user. Therefore, the system approach case, LMS, LCMS, SCORM have introduced. The user case, adaptive learning, personalized learning and etc have proposed. In this paper, we propose adaptive learning system based on user characteristics. In order to consider the user characteristics, we provide the function to select learning topic according to user's learning level. We also propose all of learning process for their unit using the service in cloud computing environment.
{"title":"Service Based User Oriented Adaptive Learning System","authors":"Hwa-Young Jeong, J. Park","doi":"10.1109/NBiS.2013.45","DOIUrl":"https://doi.org/10.1109/NBiS.2013.45","url":null,"abstract":"Learning system has changed in various types, process and materials for a long time. The change has a goal to approach increasing learning result and giving convenience to user. Therefore, the system approach case, LMS, LCMS, SCORM have introduced. The user case, adaptive learning, personalized learning and etc have proposed. In this paper, we propose adaptive learning system based on user characteristics. In order to consider the user characteristics, we provide the function to select learning topic according to user's learning level. We also propose all of learning process for their unit using the service in cloud computing environment.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124937203","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}
Wireless sensor network (WSN), which has broad application prospects, consists small nodes with sensing, computation and communications capabilities. Short for IPv6 over low power WPAN, 6LoWPAN is a kind of technology which makes IPv6 stack run on the Low PAN devices. In order to establish seamless connection of two heterogeneous networks, WSN and IPv6 network, this paper proposes an improved Energy Conservation and Interconnection Scheme (ECIS) based the analysis of current schemes. Detailed design of each functional component in the new scheme is proposed, and an expansion of SSCS module in NS2 802.15.4 simulator is examined. Comprehensive experiments on the simulation platform show that this newly proposed scheme is advantageous over existed similar attempts.
无线传感器网络(WSN)由具有感知、计算和通信能力的小节点组成，具有广阔的应用前景。6LoWPAN是IPv6 over low - power WPAN的简称，是一种将IPv6栈运行在low - PAN设备上的技术。为了实现WSN和IPv6两种异构网络的无缝连接，本文在分析现有方案的基础上，提出了一种改进的节能互联方案(ECIS)。提出了新方案中各功能部件的详细设计，并对NS2 802.15.4模拟器中ssc模块的扩展进行了研究。在仿真平台上的综合实验表明，该方案优于已有的同类方案。
{"title":"ECIS, an Energy Conservation and Interconnection Scheme between WSN and Internet Based on the 6LoWPAN","authors":"Quan Yuan, Runtong Zhang, F. Chu, W. Dai","doi":"10.1109/NBiS.2013.94","DOIUrl":"https://doi.org/10.1109/NBiS.2013.94","url":null,"abstract":"Wireless sensor network (WSN), which has broad application prospects, consists small nodes with sensing, computation and communications capabilities. Short for IPv6 over low power WPAN, 6LoWPAN is a kind of technology which makes IPv6 stack run on the Low PAN devices. In order to establish seamless connection of two heterogeneous networks, WSN and IPv6 network, this paper proposes an improved Energy Conservation and Interconnection Scheme (ECIS) based the analysis of current schemes. Detailed design of each functional component in the new scheme is proposed, and an expansion of SSCS module in NS2 802.15.4 simulator is examined. Comprehensive experiments on the simulation platform show that this newly proposed scheme is advantageous over existed similar attempts.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124168403","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}
Mobile ad-hoc networks (MANET) are P2P networks, where mobile nodes communicate with each other using wireless links. As the communication is done by wireless links, and each node has a routing function, it is difficult to grasp the network topology and routing path. It becomes even more difficult when the number of nodes is increased. In previous research, we proposed MANET Viewer II. However, in MANET Viewer II, the problems were that a communication method was inefficient, and time synchronization among nodes was inaccurately. Furthermore, the visualization was only supported to 2 dimension (2D) visualization. In this paper, we propose a 3 dimension (3D) visualization system for MANETs with an efficient communication function, accurate time synchronization function, and 3D visualization function. The proposed system can mainly visualize the network topology, state of nodes, and packet flows in MANET using mobile PCs and wireless LAN cards. The multi-hop communication function needed for visualization of MANET was also implemented on the application layer. For visualization of network topology, we implemented two modes: GPS mode and manual mode. We verified by experiments that a log collection time was reduced, and an accurate time synchronization was realized compare with MANET Viewer II. Furthermore, we showed an efficiency of 3D visualization.
{"title":"MANET Viewer III: 3D Visualization System for Mobile Ad Hoc Networks","authors":"Akihiro Inoue, Yuma Takahashi, A. Koyama","doi":"10.1109/NBiS.2013.29","DOIUrl":"https://doi.org/10.1109/NBiS.2013.29","url":null,"abstract":"Mobile ad-hoc networks (MANET) are P2P networks, where mobile nodes communicate with each other using wireless links. As the communication is done by wireless links, and each node has a routing function, it is difficult to grasp the network topology and routing path. It becomes even more difficult when the number of nodes is increased. In previous research, we proposed MANET Viewer II. However, in MANET Viewer II, the problems were that a communication method was inefficient, and time synchronization among nodes was inaccurately. Furthermore, the visualization was only supported to 2 dimension (2D) visualization. In this paper, we propose a 3 dimension (3D) visualization system for MANETs with an efficient communication function, accurate time synchronization function, and 3D visualization function. The proposed system can mainly visualize the network topology, state of nodes, and packet flows in MANET using mobile PCs and wireless LAN cards. The multi-hop communication function needed for visualization of MANET was also implemented on the application layer. For visualization of network topology, we implemented two modes: GPS mode and manual mode. We verified by experiments that a log collection time was reduced, and an accurate time synchronization was realized compare with MANET Viewer II. Furthermore, we showed an efficiency of 3D visualization.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121895485","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}
If a large scale disaster such as the East Japan Great Earthquake in 2011 occurs, quick network reactivations become one of the important objects for Disaster Information System. DTN (Delay Tolerant Network) is supposed to be one of the effective methods for such inoperable circumstances. However, when DTN is applied for vehicle-to-vehicle communication in local areas, there are some problems such as message delivery rate and latency because there are fewer roads, cars, and pedestrians than in urban areas. In this paper, we introduced DTN with directional antenna control for IEEE802.11a/b/g/n based wireless cars, and the simulation is held by the map of a Japanese coastal town that was severely damaged by the East Japan Great Earthquake. Then, the results are discussed for the future studies of DTN for vehicle-to-vehicle communication based Disaster Information Network System in local areas.
{"title":"Delay Tolerant Network with Directional Antenna Control for Disaster Information System","authors":"Noriki Uchida, N. Kawamura, Y. Shibata","doi":"10.1109/NBiS.2013.33","DOIUrl":"https://doi.org/10.1109/NBiS.2013.33","url":null,"abstract":"If a large scale disaster such as the East Japan Great Earthquake in 2011 occurs, quick network reactivations become one of the important objects for Disaster Information System. DTN (Delay Tolerant Network) is supposed to be one of the effective methods for such inoperable circumstances. However, when DTN is applied for vehicle-to-vehicle communication in local areas, there are some problems such as message delivery rate and latency because there are fewer roads, cars, and pedestrians than in urban areas. In this paper, we introduced DTN with directional antenna control for IEEE802.11a/b/g/n based wireless cars, and the simulation is held by the map of a Japanese coastal town that was severely damaged by the East Japan Great Earthquake. Then, the results are discussed for the future studies of DTN for vehicle-to-vehicle communication based Disaster Information Network System in local areas.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"501 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123416842","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}
Evjola Spaho, Shinji Sakamoto, L. Barolli, F. Xhafa, Valbona Barolli, Jiro Iwashige
The trustworthiness of peers is very important for safe communication in P2P system. In this paper, we propose a fuzzy-based reliability system for P2P Communications in JXTA-Overlay. We use three input parameters: Number of Interactions (NOI), Amount of Data Exchanged (ADE), and Reputation (R) and the output is Peer Reliability (PR). We evaluate the proposed system by computer simulations. The simulation results show that the proposed system have a good behaviour can be used successfully to evaluate the scale of reliability of the new peer connected in JXTA-Overlay.
{"title":"A Fuzzy-Based System for Peer Reliability in JXTA-Overlay P2P Considering Number of Interactions","authors":"Evjola Spaho, Shinji Sakamoto, L. Barolli, F. Xhafa, Valbona Barolli, Jiro Iwashige","doi":"10.1109/NBiS.2013.26","DOIUrl":"https://doi.org/10.1109/NBiS.2013.26","url":null,"abstract":"The trustworthiness of peers is very important for safe communication in P2P system. In this paper, we propose a fuzzy-based reliability system for P2P Communications in JXTA-Overlay. We use three input parameters: Number of Interactions (NOI), Amount of Data Exchanged (ADE), and Reputation (R) and the output is Peer Reliability (PR). We evaluate the proposed system by computer simulations. The simulation results show that the proposed system have a good behaviour can be used successfully to evaluate the scale of reliability of the new peer connected in JXTA-Overlay.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122265483","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
扫码关注我们
求助内容：
应助结果提醒方式：