Pub Date : 2015-08-01DOI: 10.2991/ijndc.2015.3.3.2
Hao Qian, Daniel Andresen
The need for increased performance of mobile device directly conflicts with the desire for longer battery life. Offloading computation to multiple devices is an effective method to reduce energy consumption and enhance performance for mobile applications. Android provides mechanisms for creating mobile applications but lacks a native scheduling system for determining where code should be executed. This paper presents Jade, a system that adds sophisticated energy-aware computation offloading capabilities to Android apps. Jade monitors device and application status and automatically decides where code should be executed. Jade dynamically adjusts offloading strategy by adapting to workload variation, communication costs, and energy status in a distributed network of Android and non-Android devices. Jade minimizes the burden on developers to build applications with computation offloading ability by providing easy-to-use Jade API. Evaluation shows that Jade can effectively reduce up to 39% of average power consumption for mobile application while improving application performance.
{"title":"Jade: Reducing Energy Consumption of Android App","authors":"Hao Qian, Daniel Andresen","doi":"10.2991/ijndc.2015.3.3.2","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.3.2","url":null,"abstract":"The need for increased performance of mobile device directly conflicts with the desire for longer battery life. Offloading computation to multiple devices is an effective method to reduce energy consumption and enhance performance for mobile applications. Android provides mechanisms for creating mobile applications but lacks a native scheduling system for determining where code should be executed. This paper presents Jade, a system that adds sophisticated energy-aware computation offloading capabilities to Android apps. Jade monitors device and application status and automatically decides where code should be executed. Jade dynamically adjusts offloading strategy by adapting to workload variation, communication costs, and energy status in a distributed network of Android and non-Android devices. Jade minimizes the burden on developers to build applications with computation offloading ability by providing easy-to-use Jade API. Evaluation shows that Jade can effectively reduce up to 39% of average power consumption for mobile application while improving application performance.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114016351","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}
Pub Date : 2015-08-01DOI: 10.2991/ijndc.2015.3.3.3
M. Yoshikawa, K. Sugioka, Y. Nozaki, K. Asahi
Recently, driving support technologies have been practically used. However, a problem has been pointed out that when a vehicle is connected with an external network, the safety of the vehicle is threatened. Ensuring the security of in-vehicle systems becomes an important priority. The present study proposes a CAN communications method that uses a lightweight block cipher to realize secure in-vehicle systems. Experiments using both FPGA and a radiocontrolled car verify the proposed method.
{"title":"Secure in-vehicle Systems using Authentication","authors":"M. Yoshikawa, K. Sugioka, Y. Nozaki, K. Asahi","doi":"10.2991/ijndc.2015.3.3.3","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.3.3","url":null,"abstract":"Recently, driving support technologies have been practically used. However, a problem has been pointed out that when a vehicle is connected with an external network, the safety of the vehicle is threatened. Ensuring the security of in-vehicle systems becomes an important priority. The present study proposes a CAN communications method that uses a lightweight block cipher to realize secure in-vehicle systems. Experiments using both FPGA and a radiocontrolled car verify the proposed method.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134111904","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}
Pub Date : 2015-08-01DOI: 10.2991/ijndc.2015.3.3.5
S. Fujita
This paper studies the load balancing problem in distributed systems designed for massively multiplayer online role-playing games (MMORPGs). More concretely, we consider a distributed system of masterworker type in which each worker is associated with a particular region in the game field, and propose a scheme to balance the load of workers as much as possible. The basic idea of the proposed scheme is to dynamically adjust the number of workers associated with each region according to the number of players in the region. The performance of the scheme is evaluated by simulation. The simulation results indicate that it reduces the response time of a previous scheme proposed by Yu et al. by about 50%, which varies depending on the mobility pattern of the players.
{"title":"Load Balancing of Peer-to-Peer MMORPG Systems with Hierarchical Area-of-Interest Management","authors":"S. Fujita","doi":"10.2991/ijndc.2015.3.3.5","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.3.5","url":null,"abstract":"This paper studies the load balancing problem in distributed systems designed for massively multiplayer online role-playing games (MMORPGs). More concretely, we consider a distributed system of masterworker type in which each worker is associated with a particular region in the game field, and propose a scheme to balance the load of workers as much as possible. The basic idea of the proposed scheme is to dynamically adjust the number of workers associated with each region according to the number of players in the region. The performance of the scheme is evaluated by simulation. The simulation results indicate that it reduces the response time of a previous scheme proposed by Yu et al. by about 50%, which varies depending on the mobility pattern of the players.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114192983","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}
Pub Date : 2015-08-01DOI: 10.2991/ijndc.2015.3.3.4
N. Park, B. Lee, K. Kim, H. Youn
Recently, the research of Hybrid ReRAM/MLC NAND SSD is rapidly expanding into the storage areas. Most existing researches of Hybrid SSD are based on a single storage, while the management of multiple nodes like HDFS is still immature. In this paper a new efficient cold data eviction scheme is proposed which is based on node congestion probability. Computer simulation reveals that the proposed scheme significantly reduces replication and recovery time in comparison to the existing replication schemes.
{"title":"Effective Management of ReRAM-based Hybrid SSD for Multiple Node HDFS","authors":"N. Park, B. Lee, K. Kim, H. Youn","doi":"10.2991/ijndc.2015.3.3.4","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.3.4","url":null,"abstract":"Recently, the research of Hybrid ReRAM/MLC NAND SSD is rapidly expanding into the storage areas. Most existing researches of Hybrid SSD are based on a single storage, while the management of multiple nodes like HDFS is still immature. In this paper a new efficient cold data eviction scheme is proposed which is based on node congestion probability. Computer simulation reveals that the proposed scheme significantly reduces replication and recovery time in comparison to the existing replication schemes.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130377647","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}
Pub Date : 2015-08-01DOI: 10.2991/ijndc.2015.3.3.6
Takahiro Hayashi, Tatsuya Ooi, Motoki Sasaki
Object extraction has a crucial role in various visual semantic scenarios. In this paper, we propose a system for object extraction which can deal with an object partly occluded by other objects. In order to estimate the hidden part of the occluded object, the system combines different types of contour completion methods such as curve completion and symmetry completion. The system is composed of two modules: contour discrimination and contour completion. The contour discrimination module separates the contour of the occluded object from the contours of the occluding objects. To the contour of the occluded object, the contour completion module applies different types of contour completion algorithms to generate various completion patterns. Based on the perceptual model of figural goodness, the system computes the figural goodness scores of the generated patterns, where the simplicity and symmetricity are evaluated. Finally, the system outputs the pattern having the highest score as a result of the object extraction. From the experimental results, we have confirmed that the figural goodness model works effectively for extracting partly occluded objects.
{"title":"Contour Completion of Partly Occluded Objects Based on Figural Goodness","authors":"Takahiro Hayashi, Tatsuya Ooi, Motoki Sasaki","doi":"10.2991/ijndc.2015.3.3.6","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.3.6","url":null,"abstract":"Object extraction has a crucial role in various visual semantic scenarios. In this paper, we propose a system for object extraction which can deal with an object partly occluded by other objects. In order to estimate the hidden part of the occluded object, the system combines different types of contour completion methods such as curve completion and symmetry completion. The system is composed of two modules: contour discrimination and contour completion. The contour discrimination module separates the contour of the occluded object from the contours of the occluding objects. To the contour of the occluded object, the contour completion module applies different types of contour completion algorithms to generate various completion patterns. Based on the perceptual model of figural goodness, the system computes the figural goodness scores of the generated patterns, where the simplicity and symmetricity are evaluated. Finally, the system outputs the pattern having the highest score as a result of the object extraction. From the experimental results, we have confirmed that the figural goodness model works effectively for extracting partly occluded objects.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130112627","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}
Pub Date : 2015-06-01DOI: 10.1007/978-3-319-23509-7_2
G. Kalantzis, T. Leventouri, H. Tachibana, C. Shang
{"title":"A GPU-Based Pencil Beam Algorithm for Dose Calculations in Proton Radiation Therapy","authors":"G. Kalantzis, T. Leventouri, H. Tachibana, C. Shang","doi":"10.1007/978-3-319-23509-7_2","DOIUrl":"https://doi.org/10.1007/978-3-319-23509-7_2","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125461371","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}
Pub Date : 2015-04-01DOI: 10.2991/ijndc.2015.3.2.7
Ghaith Khalil, B. Ray, M. Chowdhury
In RFID system a tag is attached to an object which might own by a number of owners during its life time. This requires the RFID system to transfer ownership of the tag to its new owner. The ownership transfer has to protect privacy of current and new owner. Many ownership tag ownership transfer exists in the literature, however, most of them are impractical or insecure to implement on current passive RFID tags. We are proposing a timer based ownership transfer protocol for closed loop RFID systems. The proposal in this paper includes two implement scenario to cover diverse tags type. The protocol will ensure security and privacy of involved parties in the idle circumstances. Our comparison shows that the proposed protocol is more secure and practical than existing similar ones.
{"title":"Scenarios for An RFID Tag Ownership Transfer Protocol for A Closed Loop System","authors":"Ghaith Khalil, B. Ray, M. Chowdhury","doi":"10.2991/ijndc.2015.3.2.7","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.2.7","url":null,"abstract":"In RFID system a tag is attached to an object which might own by a number of owners during its life time. This requires the RFID system to transfer ownership of the tag to its new owner. The ownership transfer has to protect privacy of current and new owner. Many ownership tag ownership transfer exists in the literature, however, most of them are impractical or insecure to implement on current passive RFID tags. We are proposing a timer based ownership transfer protocol for closed loop RFID systems. The proposal in this paper includes two implement scenario to cover diverse tags type. The protocol will ensure security and privacy of involved parties in the idle circumstances. Our comparison shows that the proposed protocol is more secure and practical than existing similar ones.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122529605","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}
Pub Date : 2015-04-01DOI: 10.2991/ijndc.2015.3.2.2
Toshiichiro Iwashita, T. Hochin, Hiroki Nomiya
This paper proposes a method of determining the optimal number of clusters dividing the multiple transformations for the purpose of the efficient processing of query against the results of applying the transformations to time series. In this paper, the moving average is used as a transformation for simplicity. The model of query time to the number of clusters is constructed for determining the optimal number of clusters. As the query time could be represented with the concave function of the number of clusters, it is shown that the optimal number of clusters for the best query time can be obtained. The verification experiment confirms the validity of the model constructed. It is revealed that the optimal number of clusters could be determined by the times obtained from a single query execution.
{"title":"Optimal Number of Clusters for Fast Similarity Search Considering Transformations of Time Varying Data","authors":"Toshiichiro Iwashita, T. Hochin, Hiroki Nomiya","doi":"10.2991/ijndc.2015.3.2.2","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.2.2","url":null,"abstract":"This paper proposes a method of determining the optimal number of clusters dividing the multiple transformations for the purpose of the efficient processing of query against the results of applying the transformations to time series. In this paper, the moving average is used as a transformation for simplicity. The model of query time to the number of clusters is constructed for determining the optimal number of clusters. As the query time could be represented with the concave function of the number of clusters, it is shown that the optimal number of clusters for the best query time can be obtained. The verification experiment confirms the validity of the model constructed. It is revealed that the optimal number of clusters could be determined by the times obtained from a single query execution.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128334901","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}
Pub Date : 2014-11-01DOI: 10.2991/ijndc.2014.2.4.3
M. A. Awan, Guangbin Zheng, Cheong-Ghil Kim, Shin-Dug Kim
Human activity recognition is an emerging field of ubiquitous and pervasive computing. Although recent smartphones have powerful resources, the execution of machine learning algorithms on a large amount of data is still a burden on smartphones. Three major factors including; classification algorithm, data feature, and smartphone position influence the recognition accuracy and time. In this paper, we present a comparative study of six classification algorithms, six data features, and four different positions that are most commonly used in the recognition process using smartphone accelerometer. This analysis can be used to select any specific classification algorithm, data feature, and smartphone position for human activity recognition in terms of accuracy and response time. The methodology we used is composed of two major components; a data collector, and a classifier. A set of eleven activities of daily living, four different positions for data collection and ten volunteers contributed to make it a worth-full comparative study. Results show that K-Nearest Neighbor and J48 algorithms performed well both in terms of time and accuracy irrespective of data features whereas the performance of other algorithms is dependent on the selected data features. Similarly, mean and mode features gave good results in terms of accuracy irrespective of the classification algorithm. A short version of the paper has already been presented at ICIS 2014.
{"title":"Human Activity Recognition in WSN: A Comparative Study","authors":"M. A. Awan, Guangbin Zheng, Cheong-Ghil Kim, Shin-Dug Kim","doi":"10.2991/ijndc.2014.2.4.3","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.4.3","url":null,"abstract":"Human activity recognition is an emerging field of ubiquitous and pervasive computing. Although recent smartphones have powerful resources, the execution of machine learning algorithms on a large amount of data is still a burden on smartphones. Three major factors including; classification algorithm, data feature, and smartphone position influence the recognition accuracy and time. In this paper, we present a comparative study of six classification algorithms, six data features, and four different positions that are most commonly used in the recognition process using smartphone accelerometer. This analysis can be used to select any specific classification algorithm, data feature, and smartphone position for human activity recognition in terms of accuracy and response time. The methodology we used is composed of two major components; a data collector, and a classifier. A set of eleven activities of daily living, four different positions for data collection and ten volunteers contributed to make it a worth-full comparative study. Results show that K-Nearest Neighbor and J48 algorithms performed well both in terms of time and accuracy irrespective of data features whereas the performance of other algorithms is dependent on the selected data features. Similarly, mean and mode features gave good results in terms of accuracy irrespective of the classification algorithm. A short version of the paper has already been presented at ICIS 2014.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124357941","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}
Pub Date : 2014-11-01DOI: 10.2991/ijndc.2014.2.4.1
C. Hung, Shih-Wei Guo
In recent years, with the rapid development of the network hardware and software, the network speed is enhanced to multi-gigabit. Network packet filtering is an important strategy of network security to avoid malicious attacks, and it is a computation-consuming application. Therefore, we develop two efficient GPGPU-based parallel packet classification approaches to filter packets by leveraging thousands of threads. The experiment results demonstrate that the computational efficiency of filtering packet can be significantly enhanced by using GPGPU.
{"title":"Fast Parallel Network Packet Filter System based on CUDA","authors":"C. Hung, Shih-Wei Guo","doi":"10.2991/ijndc.2014.2.4.1","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.4.1","url":null,"abstract":"In recent years, with the rapid development of the network hardware and software, the network speed is enhanced to multi-gigabit. Network packet filtering is an important strategy of network security to avoid malicious attacks, and it is a computation-consuming application. Therefore, we develop two efficient GPGPU-based parallel packet classification approaches to filter packets by leveraging thousands of threads. The experiment results demonstrate that the computational efficiency of filtering packet can be significantly enhanced by using GPGPU.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130222611","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
扫码关注我们
求助内容：
应助结果提醒方式：