Based on ternary method, we proposed a new scalar multiplication with high performance and security. Fast computation formulae of 3P ±Q is developed for ternary method, balanced ternary coding is used to improve the efficiency of scalar multiplication, signed ternary with lowest hamming weight is used to further improve the efficiency. For the elliptic curves in GF(3m), compared with Binary Scalar Multiplication, the efficiency of the new scalar multiplication is improved with the increase of the ratio of inversion and multiplication without pre-computations and other registers.
{"title":"Ternary Method in Elliptic Curve Scalar Multiplication","authors":"Ning Zhang, Xiaotong Fu","doi":"10.1109/INCoS.2013.93","DOIUrl":"https://doi.org/10.1109/INCoS.2013.93","url":null,"abstract":"Based on ternary method, we proposed a new scalar multiplication with high performance and security. Fast computation formulae of 3P ±Q is developed for ternary method, balanced ternary coding is used to improve the efficiency of scalar multiplication, signed ternary with lowest hamming weight is used to further improve the efficiency. For the elliptic curves in GF(3m), compared with Binary Scalar Multiplication, the efficiency of the new scalar multiplication is improved with the increase of the ratio of inversion and multiplication without pre-computations and other registers.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116250578","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}
Vehicular ad hoc networks (VANET) are characterized by the frequent changes and constrained by pre-existing roads in network topology compared with mobile ad hoc network (MANET). Therefore, the method of geocasting routing can not be widely applied to VANET. This paper proposes a geocasting routing based target region for VANET (GRTR) to make match road topology in VANET. That is setting a target region in the intersections from source node to destination region and using the method of VD-GREEDY (Voronoi diagram-greedy) builds forward zones to transmit information between the target regions. The method of VD-GREEDY expands forward zone to ensure the existence of next-hop nodes and limits the numbers of next Chop nodes to lower overhead. At the same time, to lower overload, we use the way of opportunistic routing in the target region where we choose the best node to go on transmitting for next target region. The proposed method matches the road conditions and lowers the overload in VANET.
{"title":"GRTR: A Geocasting Routing Based Target Region for VANET","authors":"Xiaoqing Li, Wei-dong Sun, Xuejun Li, Jicheng Liu","doi":"10.1109/INCoS.2013.92","DOIUrl":"https://doi.org/10.1109/INCoS.2013.92","url":null,"abstract":"Vehicular ad hoc networks (VANET) are characterized by the frequent changes and constrained by pre-existing roads in network topology compared with mobile ad hoc network (MANET). Therefore, the method of geocasting routing can not be widely applied to VANET. This paper proposes a geocasting routing based target region for VANET (GRTR) to make match road topology in VANET. That is setting a target region in the intersections from source node to destination region and using the method of VD-GREEDY (Voronoi diagram-greedy) builds forward zones to transmit information between the target regions. The method of VD-GREEDY expands forward zone to ensure the existence of next-hop nodes and limits the numbers of next Chop nodes to lower overhead. At the same time, to lower overload, we use the way of opportunistic routing in the target region where we choose the best node to go on transmitting for next target region. The proposed method matches the road conditions and lowers the overload in VANET.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"408 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116227448","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}
Nowadays, Navigation systems have become very popular and necessary for travelers from all around the world. Navigation systems give travelers all the information they need and guide them quickly and comfortably to get to the destination. Pre-trip planning regarding road and traffic conditions can enhance driver's knowledge of the situation in road networks and can assist in drivers' decisions concerning routes and departure times. Many factors such as the route density, traffic volume, departure time, destination, workday, working time, holiday period, tournaments and events are important to find the best route under the criterion. In this paper presented two new models with the purpose of recommending travelers the best route to destination. These two models are the multivariate class exploration and route guidance models. The multivariate class exploration model analyzes the network-flow patterns in order to investigate some important factors such as demand conditions, compliance with information, speed and variance of travel-time and calculate a travel-time reduction. A route guidance model was used to find efficient routes (minimizing travel time) for traveling. This paper conducted experiments on a real-world dataset collected from the OpenStreetMap. The accuracy of the proposed model's predictions was determined. The results show that the predictions given by the models are accurate and can be used in real-life situations.
{"title":"Simulation of the Adaptive Multivariate Exploration for Routes Guidance","authors":"W. Romsaiyud","doi":"10.1109/INCoS.2013.19","DOIUrl":"https://doi.org/10.1109/INCoS.2013.19","url":null,"abstract":"Nowadays, Navigation systems have become very popular and necessary for travelers from all around the world. Navigation systems give travelers all the information they need and guide them quickly and comfortably to get to the destination. Pre-trip planning regarding road and traffic conditions can enhance driver's knowledge of the situation in road networks and can assist in drivers' decisions concerning routes and departure times. Many factors such as the route density, traffic volume, departure time, destination, workday, working time, holiday period, tournaments and events are important to find the best route under the criterion. In this paper presented two new models with the purpose of recommending travelers the best route to destination. These two models are the multivariate class exploration and route guidance models. The multivariate class exploration model analyzes the network-flow patterns in order to investigate some important factors such as demand conditions, compliance with information, speed and variance of travel-time and calculate a travel-time reduction. A route guidance model was used to find efficient routes (minimizing travel time) for traveling. This paper conducted experiments on a real-world dataset collected from the OpenStreetMap. The accuracy of the proposed model's predictions was determined. The results show that the predictions given by the models are accurate and can be used in real-life situations.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117242277","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}
Faced with a huge user base, cloud computing need to be addressed with the amount of tasks and data. The resource scheduling scheme for cloud computing environment, that provides QoS(Quality of Service) guarantees, is presented in this paper based on improved Electromagnetism-like Mechanism algorithm(EM). To update force equation and the introduction of tabu search ideas, so as to control the global and local search as far as possible to avoid falling into local optimum. The experimental results in CloudSim platform show that the algorithm is efficient.
面对庞大的用户群，云计算需要处理大量的任务和数据。提出了一种基于改进的类电磁机制算法(EM)的云计算环境下提供QoS(Quality of Service)保证的资源调度方案。更新力方程，引入禁忌搜索思想，尽可能控制全局和局部搜索，避免陷入局部最优。在CloudSim平台上的实验结果表明，该算法是有效的。
{"title":"Guaranteed QoS Resource Scheduling Scheme Based on Improved Electromagnetism-Like Mechanism Algorithm in Cloud Environment","authors":"S. Yun","doi":"10.1109/INCoS.2013.66","DOIUrl":"https://doi.org/10.1109/INCoS.2013.66","url":null,"abstract":"Faced with a huge user base, cloud computing need to be addressed with the amount of tasks and data. The resource scheduling scheme for cloud computing environment, that provides QoS(Quality of Service) guarantees, is presented in this paper based on improved Electromagnetism-like Mechanism algorithm(EM). To update force equation and the introduction of tabu search ideas, so as to control the global and local search as far as possible to avoid falling into local optimum. The experimental results in CloudSim platform show that the algorithm is efficient.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"39 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126215595","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 proposes the provision of software infrastructure to support new types of pedagogically augmented collaborative learning resources by means of an innovative software platform called Virtualized Collaborative Sessions (VCS). The VCS approach helps meet challenging pedagogical requirements in online collaborative learning, such as increasing student's engagement and learning performance during the collaboration. In turn, the systematic application of the VCS platform enriched with semantic technologies enables e-learning developers to embed successful collaborative learning experiences from external learning tools in a software reuse fashion. The platform is prototyped and successfully tested in real environments, thus showing the software reuse capability and the pedagogical benefits of the VCS approach.
{"title":"Towards Software Infrastructure for the Systematic Virtualization of Collaborative Learning Sessions","authors":"D. Gañán, S. Caballé, J. Conesa","doi":"10.1109/INCOS.2013.79","DOIUrl":"https://doi.org/10.1109/INCOS.2013.79","url":null,"abstract":"This paper proposes the provision of software infrastructure to support new types of pedagogically augmented collaborative learning resources by means of an innovative software platform called Virtualized Collaborative Sessions (VCS). The VCS approach helps meet challenging pedagogical requirements in online collaborative learning, such as increasing student's engagement and learning performance during the collaboration. In turn, the systematic application of the VCS platform enriched with semantic technologies enables e-learning developers to embed successful collaborative learning experiences from external learning tools in a software reuse fashion. The platform is prototyped and successfully tested in real environments, thus showing the software reuse capability and the pedagogical benefits of the VCS approach.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125880171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present a new solution, BaitAlarm, to detect phishing attack using features that are hard to evade. The intuition of our approach is that phishing pages need to preserve the visual appearance the target pages. We present an algorithm to quantify the suspicious ratings of web pages based on similarity of visual appearance between the web pages. Since CSS is the standard technique to specify page layout, our solution uses the CSS as the basis for detecting visual similarities among web pages. We prototyped our approach as a Google Chrome extension and used it to rate the suspiciousness of web pages. The prototype shows the correctness and accuracy of our approach with a relatively low performance overhead.
{"title":"BaitAlarm: Detecting Phishing Sites Using Similarity in Fundamental Visual Features","authors":"Jian Mao, Pei Li, Kun Li, Tao Wei, Zhenkai Liang","doi":"10.1109/INCoS.2013.151","DOIUrl":"https://doi.org/10.1109/INCoS.2013.151","url":null,"abstract":"In this paper, we present a new solution, BaitAlarm, to detect phishing attack using features that are hard to evade. The intuition of our approach is that phishing pages need to preserve the visual appearance the target pages. We present an algorithm to quantify the suspicious ratings of web pages based on similarity of visual appearance between the web pages. Since CSS is the standard technique to specify page layout, our solution uses the CSS as the basis for detecting visual similarities among web pages. We prototyped our approach as a Google Chrome extension and used it to rate the suspiciousness of web pages. The prototype shows the correctness and accuracy of our approach with a relatively low performance overhead.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126221177","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 penetration of cloud computing has resulted in increasingly large file transfers among distributed data centers, leading to increased transmission delays. We propose a multipath multicast (MPMC) file transfer scheme to reduce transmission delays of one-to-many file transfers. The proposed scheme aims to (i) fully utilize the possible network bandwidth by transmitting segments (chunks) of a file simultaneously on multiple paths and (ii) reduce the bandwidth required to deliver a file to multiple receivers by multicasting the segments. On the basis of the maxflow problem, the scheme performs file segmentation, construction of multiple multicast trees, and segment transfer scheduling using multiple multicasts. To demonstrate the feasibility of MPMC file transfer, we develop a prototype system of our proposal for MPMC file transfers on OpenFlow networks.
{"title":"Delivering a File by Multipath-Multicast on OpenFlow Networks","authors":"Akira Nagata, Yoshiaki Tsukiji, M. Tsuru","doi":"10.1109/INCoS.2013.160","DOIUrl":"https://doi.org/10.1109/INCoS.2013.160","url":null,"abstract":"Rapid penetration of cloud computing has resulted in increasingly large file transfers among distributed data centers, leading to increased transmission delays. We propose a multipath multicast (MPMC) file transfer scheme to reduce transmission delays of one-to-many file transfers. The proposed scheme aims to (i) fully utilize the possible network bandwidth by transmitting segments (chunks) of a file simultaneously on multiple paths and (ii) reduce the bandwidth required to deliver a file to multiple receivers by multicasting the segments. On the basis of the maxflow problem, the scheme performs file segmentation, construction of multiple multicast trees, and segment transfer scheduling using multiple multicasts. To demonstrate the feasibility of MPMC file transfer, we develop a prototype system of our proposal for MPMC file transfers on OpenFlow networks.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121403898","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 multi-bit somewhat homomorphic encryption scheme based on Learning With Errors over Rings (RLWE) assumption is provided, which use canonical embedding to transform elements over a ring into vectors, thus the operation of polynomial multiplication can be performed within O(nlog n) scalar operations, and cipher text size is reduced as well. CPA security of this scheme can be reduced into RLWE assumption. Moreover, an efficient private information retrieval protocol that employs this scheme is presented.
{"title":"RLWE-Based Homomorphic Encryption and Private Information Retrieval","authors":"Wei Zhang, Shuguang Liu, Xiaoyuan Yang","doi":"10.1109/INCoS.2013.100","DOIUrl":"https://doi.org/10.1109/INCoS.2013.100","url":null,"abstract":"A multi-bit somewhat homomorphic encryption scheme based on Learning With Errors over Rings (RLWE) assumption is provided, which use canonical embedding to transform elements over a ring into vectors, thus the operation of polynomial multiplication can be performed within O(nlog n) scalar operations, and cipher text size is reduced as well. CPA security of this scheme can be reduced into RLWE assumption. Moreover, an efficient private information retrieval protocol that employs this scheme is presented.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114275323","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 network has significantly affected human life. MAC protocols which already existed mostly transmit data without priority so that emergency event data cannot be sent quickly to destination nodes. In this paper, a new protocol called priority-and-activity-based QoS MAC (PAQMAC) protocol is proposed, in which not only the priority of data in transmission is considered, but also the active time is dynamical adjusted by recording the activity degree in a duty cycle. With the priority classified, it provides enough time to deal with emergency event, thus the security and management of network are also improved. Simulation results show that PAQMAC protocol can reduce transmission delay and decrease energy consumption of network.
无线网络已经极大地影响了人类的生活。现有的MAC协议在传输数据时大多没有优先级，导致紧急事件数据无法快速发送到目的节点。本文提出了一种新的基于优先级和活动的QoS MAC (PAQMAC)协议，该协议不仅考虑传输数据的优先级，而且通过记录一个占空比内的活动程度来动态调整活动时间。通过对优先级进行分类，为应急事件的处理提供了充足的时间，从而提高了网络的安全性和管理性。仿真结果表明，PAQMAC协议可以减少传输延迟，降低网络能耗。
{"title":"Improved Efficient Priority-and-Activity-Based QoS MAC Protocol","authors":"Xiaoyu Li, Nan Chen, Changhua Zhu, Changxing Pei","doi":"10.1109/INCoS.2013.56","DOIUrl":"https://doi.org/10.1109/INCoS.2013.56","url":null,"abstract":"Wireless network has significantly affected human life. MAC protocols which already existed mostly transmit data without priority so that emergency event data cannot be sent quickly to destination nodes. In this paper, a new protocol called priority-and-activity-based QoS MAC (PAQMAC) protocol is proposed, in which not only the priority of data in transmission is considered, but also the active time is dynamical adjusted by recording the activity degree in a duty cycle. With the priority classified, it provides enough time to deal with emergency event, thus the security and management of network are also improved. Simulation results show that PAQMAC protocol can reduce transmission delay and decrease energy consumption of network.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"37 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114006484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As one of the most popular cloud storage distributed file systems, Hadoop Distributed File System (HDFS) has the characteristics of open source, low-cost, high fault tolerance and high scalability. Thus, HDFS plays a critical role in cloud storage. However, there are some important issues in HDFS which should be resolved urgently, such as the insufficient load balancing. In order to improve the shortages of insufficient load balancing in storage server, we propose a new adaptive feedback load balancing algorithm in HDFS (AFLBA) in this paper, which is mainly achieved by the establishment of the disk utilization rate model and the service blocking rate model. The disk utilization rate model describes the disk utilization of each Data node precisely, and the service blocking rate model quantifies the service busy degree to qualitatively describe the service performance of each Data node using an integrated parameter. Analysis and simulation demonstrate the AFLBA has improved the load balancing greatly in HDFS compared with the random static load balancing method used in exiting HDFS system.
{"title":"An Adaptive Feedback Load Balancing Algorithm in HDFS","authors":"K. Fan, Dayang Zhang, Hui Li, Yintang Yang","doi":"10.1109/INCoS.2013.14","DOIUrl":"https://doi.org/10.1109/INCoS.2013.14","url":null,"abstract":"As one of the most popular cloud storage distributed file systems, Hadoop Distributed File System (HDFS) has the characteristics of open source, low-cost, high fault tolerance and high scalability. Thus, HDFS plays a critical role in cloud storage. However, there are some important issues in HDFS which should be resolved urgently, such as the insufficient load balancing. In order to improve the shortages of insufficient load balancing in storage server, we propose a new adaptive feedback load balancing algorithm in HDFS (AFLBA) in this paper, which is mainly achieved by the establishment of the disk utilization rate model and the service blocking rate model. The disk utilization rate model describes the disk utilization of each Data node precisely, and the service blocking rate model quantifies the service busy degree to qualitatively describe the service performance of each Data node using an integrated parameter. Analysis and simulation demonstrate the AFLBA has improved the load balancing greatly in HDFS compared with the random static load balancing method used in exiting HDFS system.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130546570","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
扫码关注我们
求助内容：
应助结果提醒方式：