In recent years, Multi-Hop Wireless Network (MHWN) has been widely researched and deployed since it is a feasible architecture to realize pervasive network connection in complex network environment. As one of the hot research topics in MHWN, jamming attack has attracted much attention due to the fact that it is a simple but effective attack method to reduce the throughput of MHWN. The current jamming attack methods are mostly proposed from the perspective of time or frequency domain. In contrast, as a non-negligible problem, jammers' spatial deployment has drawn much little attention. In order to bridge this gap, this paper firstly formulates the problem of jammer deployment. Secondly, a jammer deployment method based on network degree distribution theory is put forward. Finally, the performance of the proposed method is validated through a series of simulation experiments.
{"title":"A Jammer Deployment Method for Multi-hop Wireless Network Based on Degree Distribution","authors":"Xianglin Wei, Yongyang Hu, Jianhua Fan, B. Kan","doi":"10.1109/BWCCA.2014.73","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.73","url":null,"abstract":"In recent years, Multi-Hop Wireless Network (MHWN) has been widely researched and deployed since it is a feasible architecture to realize pervasive network connection in complex network environment. As one of the hot research topics in MHWN, jamming attack has attracted much attention due to the fact that it is a simple but effective attack method to reduce the throughput of MHWN. The current jamming attack methods are mostly proposed from the perspective of time or frequency domain. In contrast, as a non-negligible problem, jammers' spatial deployment has drawn much little attention. In order to bridge this gap, this paper firstly formulates the problem of jammer deployment. Secondly, a jammer deployment method based on network degree distribution theory is put forward. Finally, the performance of the proposed method is validated through a series of simulation experiments.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133893907","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}
Donghyun Lee, Minkyu Lim, M. Koo, Jungyun Seo, Gil-Jin Jang, Ji-Hwan Kim, Jeong-Sik Park
The work in this paper concerns a small footprint Acoustic Model (AM) and its use in the implementation of a Large Vocabulary Isolated Speech Recognition (LVISR) system for commanding a robot in the Korean language, which requires about 500KB of memory. Tree-based state clustering was applied to reduce the number of total unique states, while preserving its original performance. A decision tree induction method was developed for the tree-based state clustering. For this method, a binary question set, measurement function and stopping criterion were devised. A phoneme set consisting of 38 phonemes was defined for the implementation of small footprint Korean LVISR. Further reduction in memory requirement was achieved through integer arithmetic operation. The best multiplication factor was determined for this operation. As a result, we successfully developed a small footprint Korean LVISR that requires memory space about 500KB.
{"title":"Development of Small Footprint Korean Large Vocabulary Speech Recognition for Commanding a Standalone Robot","authors":"Donghyun Lee, Minkyu Lim, M. Koo, Jungyun Seo, Gil-Jin Jang, Ji-Hwan Kim, Jeong-Sik Park","doi":"10.1109/BWCCA.2014.112","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.112","url":null,"abstract":"The work in this paper concerns a small footprint Acoustic Model (AM) and its use in the implementation of a Large Vocabulary Isolated Speech Recognition (LVISR) system for commanding a robot in the Korean language, which requires about 500KB of memory. Tree-based state clustering was applied to reduce the number of total unique states, while preserving its original performance. A decision tree induction method was developed for the tree-based state clustering. For this method, a binary question set, measurement function and stopping criterion were devised. A phoneme set consisting of 38 phonemes was defined for the implementation of small footprint Korean LVISR. Further reduction in memory requirement was achieved through integer arithmetic operation. The best multiplication factor was determined for this operation. As a result, we successfully developed a small footprint Korean LVISR that requires memory space about 500KB.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133602788","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 trust value between two nodes is important for their interactions in social network . In this paper we propose an ACO-based trust inference algorithm. First, we use the Ant Colony Optimization algorithm to find two trust trains with high trust value between any two nodes, since the most accurate information comes from the node with the highest trust value. We optimized the corresponding parameters of the ACO algorithm to make it adaptive to our problem. Indirect trust value between two nodes is calculated according to direct trust value and trust chains got by ACO. The statistical analysis indicates that our algorithm gains more accuracy of trust value computing compared with a classical trust algorithm.
{"title":"An ACO-Based Trust Inference Algorithm","authors":"Leyi Shi, Yao Wang, Xin Liu","doi":"10.1109/BWCCA.2014.70","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.70","url":null,"abstract":"The trust value between two nodes is important for their interactions in social network . In this paper we propose an ACO-based trust inference algorithm. First, we use the Ant Colony Optimization algorithm to find two trust trains with high trust value between any two nodes, since the most accurate information comes from the node with the highest trust value. We optimized the corresponding parameters of the ACO algorithm to make it adaptive to our problem. Indirect trust value between two nodes is calculated according to direct trust value and trust chains got by ACO. The statistical analysis indicates that our algorithm gains more accuracy of trust value computing compared with a classical trust algorithm.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131418194","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}
Yousra Moeen, N. Javaid, Fahad Saleem, A. Umar, M. Akbar, Z. Khan, U. Qasim
Energy Hole is the major problem in the efficiency of Wireless Sensor Networks (WSNs). A routing protocol MASEHA: Multi-hop communication using Active and Sleep nodes for Energy Hole Avoidance is proposed in this research paper to overcome the energy hole problem. Taking the concept of Active and sleep mode of nodes, we propose that the network is divided into active and sleep nodes. Half of the sleep nodes are turned on when the first node dies and remaining sleep nodes are activated after the death of tenth node. We have achieved balanced stability, increased sensing period of nodes and balanced energy consumption. Further, MASEHA uses dynamic clustering, divides the network into small sub-areas and uses uniform number of CHs throughout the network. Selection of CHs is done on the basis of maximum energy and minimum distance multi-hop communication is utilized in our paper. Simulation results show that these aspects help in out performing our proposed protocol with the existing protocols.
{"title":"MASEHA: Multi-hop Communication Using Active and Sleep Nodes for Energy Hole Avoidance in Wireless Sensor Networks","authors":"Yousra Moeen, N. Javaid, Fahad Saleem, A. Umar, M. Akbar, Z. Khan, U. Qasim","doi":"10.1109/BWCCA.2014.102","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.102","url":null,"abstract":"Energy Hole is the major problem in the efficiency of Wireless Sensor Networks (WSNs). A routing protocol MASEHA: Multi-hop communication using Active and Sleep nodes for Energy Hole Avoidance is proposed in this research paper to overcome the energy hole problem. Taking the concept of Active and sleep mode of nodes, we propose that the network is divided into active and sleep nodes. Half of the sleep nodes are turned on when the first node dies and remaining sleep nodes are activated after the death of tenth node. We have achieved balanced stability, increased sensing period of nodes and balanced energy consumption. Further, MASEHA uses dynamic clustering, divides the network into small sub-areas and uses uniform number of CHs throughout the network. Selection of CHs is done on the basis of maximum energy and minimum distance multi-hop communication is utilized in our paper. Simulation results show that these aspects help in out performing our proposed protocol with the existing protocols.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124277675","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 proposed an approach to predict the availability of volunteer sensor networks (VSN) node. It is based on the Stronger Intelligent selection (SIS). First, the availability of VSN node is analyzed and predicted based on its location. The stronger model is defined and Studied on the Optimization Rules and Solution Tactics of availability. A simple and efficient stronger searching mechanism is presented in the constructed of candidates. The mechanism can estimate the VSN's capacity of attributes. The optimized matching node is selected. And these nodes will enable us to make quicker and better decisions of resource scheduling and control. In addition, we use the modified Minimum Mean Squared Error algorithm for the located ranges of the estimate we are making in this paper. The ranges are Numerical simulations show that the algorithm has higher accuracy and rapid convergence. The selected range is as the initial Iteration value. Research on the Prediction Problem is abstracted into an Unconstrained Optimization Problems. The Stronger Intelligent Selection method is an efficient method for solving unconstrained optimization problems. The simulations show that the SIS has higher Positioning accuracy and computational complexity than Particle Swarm Optimization (PSO) or Genetic algorithm (GA).
{"title":"Volunteer Sensor Networks Node Availability Prediction via Stronger Intelligent Selection Optimization Algorithm","authors":"Yu Wang, Wenbin Zhou, Fanfan Zhou","doi":"10.1109/BWCCA.2014.47","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.47","url":null,"abstract":"We proposed an approach to predict the availability of volunteer sensor networks (VSN) node. It is based on the Stronger Intelligent selection (SIS). First, the availability of VSN node is analyzed and predicted based on its location. The stronger model is defined and Studied on the Optimization Rules and Solution Tactics of availability. A simple and efficient stronger searching mechanism is presented in the constructed of candidates. The mechanism can estimate the VSN's capacity of attributes. The optimized matching node is selected. And these nodes will enable us to make quicker and better decisions of resource scheduling and control. In addition, we use the modified Minimum Mean Squared Error algorithm for the located ranges of the estimate we are making in this paper. The ranges are Numerical simulations show that the algorithm has higher accuracy and rapid convergence. The selected range is as the initial Iteration value. Research on the Prediction Problem is abstracted into an Unconstrained Optimization Problems. The Stronger Intelligent Selection method is an efficient method for solving unconstrained optimization problems. The simulations show that the SIS has higher Positioning accuracy and computational complexity than Particle Swarm Optimization (PSO) or Genetic algorithm (GA).","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114942890","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}
Rapid progress of 3D depth sensing and printing technologies makes digital fabrication an affordable technology for general public. Inexperienced users can readily acquire 3D object data by capturing their surrounding environments with consumer depth sensors and produce physical prototypes by using desktop 3D printers. Although 3D modeling is a key technology to bridge a gap between the 3D acquisition and the 3D printing, it is a deep valley preventing the users from really practicing the digital fabrication. We designed and developed a system enabling even novice users to edit the acquired 3D models with a set of simple operations for producing original models. The system supports all phases, the acquisition, modeling, and printing, through an integrated GUI. We describe the basic concept and implementation method of the system and some preliminary experiments conducted for verifying the effectiveness of the system.
{"title":"A Digital Fabrication Assistant for 3D Arts and Crafts","authors":"Jiaqing Lin, Hiroaki Nishino, Tsuneo Kagawa","doi":"10.1109/BWCCA.2014.95","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.95","url":null,"abstract":"Rapid progress of 3D depth sensing and printing technologies makes digital fabrication an affordable technology for general public. Inexperienced users can readily acquire 3D object data by capturing their surrounding environments with consumer depth sensors and produce physical prototypes by using desktop 3D printers. Although 3D modeling is a key technology to bridge a gap between the 3D acquisition and the 3D printing, it is a deep valley preventing the users from really practicing the digital fabrication. We designed and developed a system enabling even novice users to edit the acquired 3D models with a set of simple operations for producing original models. The system supports all phases, the acquisition, modeling, and printing, through an integrated GUI. We describe the basic concept and implementation method of the system and some preliminary experiments conducted for verifying the effectiveness of the system.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116904442","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}
T. Tokuyasu, Wakou Okamura, T. Kusano, M. Inomata, N. Shiraishi, S. Kitanou
Endoscopic surgery is one of minimally invasive medical treatments, which reduces both physical and mental burdens of a patient than conventional abdominal operations. At present, a variety of training environments for endoscopic surgery, such as a dry box, a virtual reality (VR) simulator, and an animal experiment have been prepared to cultivate certifying physicians of endoscopic surgery. Even now, more effective training environments have been requested from the surgeons. Thus, this study proposes an application of augmented reality to establish a novel training environment of endoscopic surgery. We focused on one of Japanese learning styles in writing, in which children repeatedly trace the letters written on a sheet in order to learn how to use a pencil to write neatly without concerning the meanings of the letters. This study applies this learning style to our training system by using a dry box and augmented reality (AR). In our training system, AR Toolkit is utilized to describe a target trajectory which is displayed on a monitor and is refereed by a trainee. And we originally develops the devices which detect the motions of endoscopic forceps while training. This paper introduces the basic constitution of our training system and discusses about the training effects obtained from the experimental results with beginner subjects.
{"title":"Training System for Endoscopic Surgery by Using Augmented Reality and Forceps Control Devices","authors":"T. Tokuyasu, Wakou Okamura, T. Kusano, M. Inomata, N. Shiraishi, S. Kitanou","doi":"10.1109/BWCCA.2014.113","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.113","url":null,"abstract":"Endoscopic surgery is one of minimally invasive medical treatments, which reduces both physical and mental burdens of a patient than conventional abdominal operations. At present, a variety of training environments for endoscopic surgery, such as a dry box, a virtual reality (VR) simulator, and an animal experiment have been prepared to cultivate certifying physicians of endoscopic surgery. Even now, more effective training environments have been requested from the surgeons. Thus, this study proposes an application of augmented reality to establish a novel training environment of endoscopic surgery. We focused on one of Japanese learning styles in writing, in which children repeatedly trace the letters written on a sheet in order to learn how to use a pencil to write neatly without concerning the meanings of the letters. This study applies this learning style to our training system by using a dry box and augmented reality (AR). In our training system, AR Toolkit is utilized to describe a target trajectory which is displayed on a monitor and is refereed by a trainee. And we originally develops the devices which detect the motions of endoscopic forceps while training. This paper introduces the basic constitution of our training system and discusses about the training effects obtained from the experimental results with beginner subjects.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116812718","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}
Advances in motion detection, tracking, and classification have made available many applications in telerehabilition. Monitoring of the elderlies and physically impaired, sports medicine, and physical therapy, are some of the active research areas in telerehabilition. In order to gain acceptance by the general public, a telerehabilition system should have high accuracy in tracking movements and be low in cost. This work investigates the suitability of Leap Motion, a computer input device, for telerehabilition purpose. Its accuracy and tracking reliability are compared to that of Nintendo's Wii Remote Controller (Wiimote) that was studies in our prior work. Wiimote can be used as a handheld device for patients to perform repetitive motions in physical therapy sessions in an autonomous remote setting. The Leap Motion, on the other hand, seems to fit physiotherapy sessions that require free motion without any props. Patients can use such an instructional system at home without the effort and time incurred with visiting a medical office. At the same time, the public health care system also benefits from such devices due to reduced cost and broader delivery of programs.
{"title":"Impact of Sensor Sensitivity in Assistive Environment","authors":"K. F. Li, A. Sevcenco, Lei Cheng","doi":"10.1109/BWCCA.2014.61","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.61","url":null,"abstract":"Advances in motion detection, tracking, and classification have made available many applications in telerehabilition. Monitoring of the elderlies and physically impaired, sports medicine, and physical therapy, are some of the active research areas in telerehabilition. In order to gain acceptance by the general public, a telerehabilition system should have high accuracy in tracking movements and be low in cost. This work investigates the suitability of Leap Motion, a computer input device, for telerehabilition purpose. Its accuracy and tracking reliability are compared to that of Nintendo's Wii Remote Controller (Wiimote) that was studies in our prior work. Wiimote can be used as a handheld device for patients to perform repetitive motions in physical therapy sessions in an autonomous remote setting. The Leap Motion, on the other hand, seems to fit physiotherapy sessions that require free motion without any props. Patients can use such an instructional system at home without the effort and time incurred with visiting a medical office. At the same time, the public health care system also benefits from such devices due to reduced cost and broader delivery of programs.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125793990","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}
Youngmin Park, Yeong-Jae Choi, H. Yang, Yongho Seo
Face recognition is an important technique for Natural User Interface (NUI) and Human Robot Interaction (HRI) and many of the current state-of-the-art face recognition techniques are based on the local features which are extracted from a face alignment method like Constrained Local Model (CLM). But, in a real world environment, face alignment methods often fail to correctly localize the features because of extreme variations in pose and illumination. In this paper, we propose a learning-based misalinment detection and correction method. From the experiment, it is shown that the accuracy of the existing face alignment methods can be improved using the proposed method which re-aligns a misaligned result with a corrected parameter.
{"title":"Response Surface Learning for Face Misalignment Correction","authors":"Youngmin Park, Yeong-Jae Choi, H. Yang, Yongho Seo","doi":"10.1109/BWCCA.2014.115","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.115","url":null,"abstract":"Face recognition is an important technique for Natural User Interface (NUI) and Human Robot Interaction (HRI) and many of the current state-of-the-art face recognition techniques are based on the local features which are extracted from a face alignment method like Constrained Local Model (CLM). But, in a real world environment, face alignment methods often fail to correctly localize the features because of extreme variations in pose and illumination. In this paper, we propose a learning-based misalinment detection and correction method. From the experiment, it is shown that the accuracy of the existing face alignment methods can be improved using the proposed method which re-aligns a misaligned result with a corrected parameter.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129860151","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}
Server cluster systems are widely used to realize high performance and fault-tolerant information systems. In order to make a server cluster fault-tolerant, multiple replicas of each application process are performed on multiple servers. However, the larger electric energy is consumed in a server cluster due to redundant execution of multiple replicas. The redundant power consumption laxity-based (RPCLB) algorithm is discussed to select multiple servers for energy-efficiently performing replicas of each application process so that the total energy consumption of a server cluster can be reduced. Here, a load balancer has to collect a state of every current replica to estimate the energy consumption of each server. It is difficult to precisely estimate the energy consumption of each server in the real environment since the state of each replica on a server is changed during the estimation. In this paper, we propose a novel redundant delay time based (RDTB) algorithm to select multiple servers for redundantly performing each application process so that the total energy consumption of a server cluster can be reduced. Here, it is not necessary to collect a state of every replica to estimate the energy consumption of each server. Hence, the overhead of a load balancer can be reduced in the RDTB algorithm than the RPCLB algorithm. We evaluate the RDTB algorithm compared with the basic round-robin and RPCLB algorithms. In the evaluation, we show the average total energy consumption of a server cluster in the RDTB algorithm is the same as the RPCLB algorithm and can be maximally reduced to 36% of the RR algorithm. We show the average response time of each process in the RPCLB, RDTB, and RR algorithms is the same. In addition, we show the total number of messages exchanged between a load balancer and servers in the RDTB algorithm is the same as the RR algorithm and can be more reduce than the RPCLB algorithm.
{"title":"The Redundant Delay Time-Based (RDTB) Algorithm for Fault Tolerant Server Clusters","authors":"T. Enokido, M. Takizawa","doi":"10.1109/BWCCA.2014.126","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.126","url":null,"abstract":"Server cluster systems are widely used to realize high performance and fault-tolerant information systems. In order to make a server cluster fault-tolerant, multiple replicas of each application process are performed on multiple servers. However, the larger electric energy is consumed in a server cluster due to redundant execution of multiple replicas. The redundant power consumption laxity-based (RPCLB) algorithm is discussed to select multiple servers for energy-efficiently performing replicas of each application process so that the total energy consumption of a server cluster can be reduced. Here, a load balancer has to collect a state of every current replica to estimate the energy consumption of each server. It is difficult to precisely estimate the energy consumption of each server in the real environment since the state of each replica on a server is changed during the estimation. In this paper, we propose a novel redundant delay time based (RDTB) algorithm to select multiple servers for redundantly performing each application process so that the total energy consumption of a server cluster can be reduced. Here, it is not necessary to collect a state of every replica to estimate the energy consumption of each server. Hence, the overhead of a load balancer can be reduced in the RDTB algorithm than the RPCLB algorithm. We evaluate the RDTB algorithm compared with the basic round-robin and RPCLB algorithms. In the evaluation, we show the average total energy consumption of a server cluster in the RDTB algorithm is the same as the RPCLB algorithm and can be maximally reduced to 36% of the RR algorithm. We show the average response time of each process in the RPCLB, RDTB, and RR algorithms is the same. In addition, we show the total number of messages exchanged between a load balancer and servers in the RDTB algorithm is the same as the RR algorithm and can be more reduce than the RPCLB algorithm.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128947981","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
扫码关注我们
求助内容：
应助结果提醒方式：