Hironori Ando, Qi Wang, L. Barolli, Elis Kulla, A. Durresi, F. Xhafa
Cluster formation and cluster head selection are important problems in sensor network applications and can drastically affect the network's communication energy dissipation. However, selecting of the cluster head is not easy in different environments which may have different characteristics. In order to deal with this problem, we propose a power reduction algorithm for sensor networks based on fuzzy logic and node movement. The proposed system uses 3 input linguistic parameters: remaining battery power of sensor, degree of number of neighbor nodes and sensor speed for cluster-head decision. By considering the moving speed of the sensor node, we are able to find the nodes which leave the cluster. We evaluate the proposed system by simulations and show that the proposed system has a good cluster-head selection.
{"title":"A Fuzzy-Based Cluster-Head Selection System for WSNs Considering Sensor Node Movement","authors":"Hironori Ando, Qi Wang, L. Barolli, Elis Kulla, A. Durresi, F. Xhafa","doi":"10.1109/INCOS.2011.20","DOIUrl":"https://doi.org/10.1109/INCOS.2011.20","url":null,"abstract":"Cluster formation and cluster head selection are important problems in sensor network applications and can drastically affect the network's communication energy dissipation. However, selecting of the cluster head is not easy in different environments which may have different characteristics. In order to deal with this problem, we propose a power reduction algorithm for sensor networks based on fuzzy logic and node movement. The proposed system uses 3 input linguistic parameters: remaining battery power of sensor, degree of number of neighbor nodes and sensor speed for cluster-head decision. By considering the moving speed of the sensor node, we are able to find the nodes which leave the cluster. We evaluate the proposed system by simulations and show that the proposed system has a good cluster-head selection.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116349662","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 green ICT is becoming extremely important for energy saving. The power consumption of network devices i.e., switches and routers, can be reduced by changing the transmission rate on their interfaces according to the amount of traffic. Energy-efficient routing based on the power reduction of devices may be attractive way for effectively saving energy over networks. Some schemes for energy-efficient routing have been studied in which traffic from some sources is aggregated on the particular link/node for power saving of others when the amount of traffic on network becomes low. Effectiveness of these schemes were shown by computer simulations and experiments in their own network environments. Therefore in this paper, we first implement some schemes on our test-bed network to compare both power consumption and transmission performance of them. We also investigate the applicability and scalability of these schemes on large scale networks and finally discuss important issues for more general and effective schemes.
{"title":"Study on Energy-Efficient Routing Protocol Based on Experimental Evaluation","authors":"Satoru Akimoto, H. Tamura, K. Kawahara, Y. Hori","doi":"10.1109/INCoS.2011.152","DOIUrl":"https://doi.org/10.1109/INCoS.2011.152","url":null,"abstract":"The green ICT is becoming extremely important for energy saving. The power consumption of network devices i.e., switches and routers, can be reduced by changing the transmission rate on their interfaces according to the amount of traffic. Energy-efficient routing based on the power reduction of devices may be attractive way for effectively saving energy over networks. Some schemes for energy-efficient routing have been studied in which traffic from some sources is aggregated on the particular link/node for power saving of others when the amount of traffic on network becomes low. Effectiveness of these schemes were shown by computer simulations and experiments in their own network environments. Therefore in this paper, we first implement some schemes on our test-bed network to compare both power consumption and transmission performance of them. We also investigate the applicability and scalability of these schemes on large scale networks and finally discuss important issues for more general and effective schemes.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116513924","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 order to provide a low-cost and simple user attestation method, in our previous work, we proposed a method with strong authentication by using digital camera of cellular phone. But, this method used 2D color code, thus there are some process costs such as create and decode 2D color code. In this paper, we present an improved attestation system using a cellular phone and 2D color code. We compare the performance of the encryption methods and the efficiency of the proposed attestation method is confirmed by an experimental prototype system.
{"title":"Comparison Evaluation of Encryption Methods for a User Attestation System Using a Cellular Phone","authors":"Noriyasu Yamamoto, T. Wakahara","doi":"10.1109/INCoS.2011.67","DOIUrl":"https://doi.org/10.1109/INCoS.2011.67","url":null,"abstract":"In order to provide a low-cost and simple user attestation method, in our previous work, we proposed a method with strong authentication by using digital camera of cellular phone. But, this method used 2D color code, thus there are some process costs such as create and decode 2D color code. In this paper, we present an improved attestation system using a cellular phone and 2D color code. We compare the performance of the encryption methods and the efficiency of the proposed attestation method is confirmed by an experimental prototype system.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129992577","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}
With the widespread of the Internet, the high security of the information system is required. In order to guarantee the safety use of the system operation, it is necessary for users to use a strong password. In this paper, we propose a new authentication scheme using cellular phones with Sony's FeliCa smart card chip. Authenticate by reading the information is written to the FeliCa. To verify that the proposed scheme is the relatively secure authentication done without knowing the password and user ID.
{"title":"A New One-time Authentication System Using a Cellular Phone with FeliCa Chip","authors":"Yusuke Kowakame, T. Wakahara","doi":"10.1109/INCoS.2011.28","DOIUrl":"https://doi.org/10.1109/INCoS.2011.28","url":null,"abstract":"With the widespread of the Internet, the high security of the information system is required. In order to guarantee the safety use of the system operation, it is necessary for users to use a strong password. In this paper, we propose a new authentication scheme using cellular phones with Sony's FeliCa smart card chip. Authenticate by reading the information is written to the FeliCa. To verify that the proposed scheme is the relatively secure authentication done without knowing the password and user ID.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133586943","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 discuss countermeasure against insider threats in network security aspect. In the context of countermeasure against insider threats, there is no perimeter for access control in a network. A traditional access control process by using a firewall on a perimeter is not suitable. We show a mechanism of countermeasure against insider threats in network security for countermeasure technically and legally.
{"title":"Towards Countermeasure of Insider Threat in Network Security","authors":"Y. Hori, T. Nishide, K. Sakurai","doi":"10.1109/INCoS.2011.156","DOIUrl":"https://doi.org/10.1109/INCoS.2011.156","url":null,"abstract":"We discuss countermeasure against insider threats in network security aspect. In the context of countermeasure against insider threats, there is no perimeter for access control in a network. A traditional access control process by using a firewall on a perimeter is not suitable. We show a mechanism of countermeasure against insider threats in network security for countermeasure technically and legally.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133341620","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}
Recently, Internet use has increased rapidly especially in Asia, and the stock of IPv4 address has been exhausted. Fundamental solution for IPv4 address depletion is to migrate IPv6. However, since IPv6 is not compatible with IPv4 (such as address length, header structure), they can't communicate with each other directly. High Performance Packet Processing Engine (HPPPE) is a network processing software running on Linux developed by FUJITSU. In this research, we developed IPv6/IPv4 Translator using HPPPE. IPv6/IPv4 Translator enables IPv6 host to communicate with IPv4 host.
{"title":"Development of IPv6/IPv4 Translator Using High Performance Packet Processing Engine","authors":"Ryo Sasaki, M. Otani, Kenzi Watanabe","doi":"10.1109/INCoS.2011.74","DOIUrl":"https://doi.org/10.1109/INCoS.2011.74","url":null,"abstract":"Recently, Internet use has increased rapidly especially in Asia, and the stock of IPv4 address has been exhausted. Fundamental solution for IPv4 address depletion is to migrate IPv6. However, since IPv6 is not compatible with IPv4 (such as address length, header structure), they can't communicate with each other directly. High Performance Packet Processing Engine (HPPPE) is a network processing software running on Linux developed by FUJITSU. In this research, we developed IPv6/IPv4 Translator using HPPPE. IPv6/IPv4 Translator enables IPv6 host to communicate with IPv4 host.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133642003","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}
F. Xhafa, Bernat Duran, J. Kolodziej, L. Barolli, M. Takizawa
Finding an optimal solution is computationally hard for most combinatorial optimization problems. Therefore the use of heuristics methods aims at finding, if not optimal, near optimal solutions in reasonable amount of computation time. Due to lack of knowledge about the landscape of fitness function, searching the solution space by heuristic methods becomes very challenging. One can search the solution space through a path of feasible solutions, in which the search method manages one solution at each iteration. This is known as exploitation of the search space, as it enables going deep into some close area of a solution. One the other hand, one can use heuristic methods that manage many feasible solutions at an iteration, the population-based heuristics. This is known as exploration of solution space as it enables a wide search in the solution space. The question is then, for a given combinatorial optimization problem, which of the two search methods is more effective. In this work we present a study on the effectiveness of using exploitation vs exploration search for the problem of Independent Batch Scheduling in Computational Grids. We also consider the combination of both search processes, which showed to effectively solve the problem.
{"title":"On Exploitation vs Exploration of Solution Space for Grid Scheduling","authors":"F. Xhafa, Bernat Duran, J. Kolodziej, L. Barolli, M. Takizawa","doi":"10.1109/INCOS.2011.128","DOIUrl":"https://doi.org/10.1109/INCOS.2011.128","url":null,"abstract":"Finding an optimal solution is computationally hard for most combinatorial optimization problems. Therefore the use of heuristics methods aims at finding, if not optimal, near optimal solutions in reasonable amount of computation time. Due to lack of knowledge about the landscape of fitness function, searching the solution space by heuristic methods becomes very challenging. One can search the solution space through a path of feasible solutions, in which the search method manages one solution at each iteration. This is known as exploitation of the search space, as it enables going deep into some close area of a solution. One the other hand, one can use heuristic methods that manage many feasible solutions at an iteration, the population-based heuristics. This is known as exploration of solution space as it enables a wide search in the solution space. The question is then, for a given combinatorial optimization problem, which of the two search methods is more effective. In this work we present a study on the effectiveness of using exploitation vs exploration search for the problem of Independent Batch Scheduling in Computational Grids. We also consider the combination of both search processes, which showed to effectively solve the problem.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127897006","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}
With the growth of the Internet in recent years, two-dimensional codes, such as a QR code has been widely used in the world. However, as this QR code is just a collective symbol of black and white dots, it does not have a good visual display. To improve this problem, an image or picture is superimposed to this two-dimensional code. This code can still be read without error, but this image is considered to be noisy, which reduces the reading ability. In order to avoid the reduction of the ability for reading the two-dimensional arrangement of code data, the location characteristics of the superimposed image should be studied. In this paper, taking into account the parameters of the error correction, the reading characteristics for different positions of the superimposed image are measured and the best position for it has been studied.
{"title":"Measurement of Reading Characteristics of Multiplexed Image in QR Code","authors":"Damri Samretwit, T. Wakahara","doi":"10.1109/INCoS.2011.117","DOIUrl":"https://doi.org/10.1109/INCoS.2011.117","url":null,"abstract":"With the growth of the Internet in recent years, two-dimensional codes, such as a QR code has been widely used in the world. However, as this QR code is just a collective symbol of black and white dots, it does not have a good visual display. To improve this problem, an image or picture is superimposed to this two-dimensional code. This code can still be read without error, but this image is considered to be noisy, which reduces the reading ability. In order to avoid the reduction of the ability for reading the two-dimensional arrangement of code data, the location characteristics of the superimposed image should be studied. In this paper, taking into account the parameters of the error correction, the reading characteristics for different positions of the superimposed image are measured and the best position for it has been studied.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129360341","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}
There is no forward security in any proxy blind signature schemes today. The lack of forward security will impact the system security tremendously if the key is stolen. To avoid such a security problem this paper proposes a forward secure proxy blind signature scheme which employs the key evolution mechanism in a newly proposed proxy blind signature scheme. The security of proxy blind signature and the forward security are both analyzed in the proposed scheme. Even if the current signature key is compromised, the attacker cannot forge signatures as if they had been generated before the key leakage. That is to say, signatures signed before the leakage are still valid.
{"title":"Forward Secure Proxy Blind Signature Scheme","authors":"K. Fan, Yue Wang, Hui Li","doi":"10.1109/INCoS.2011.95","DOIUrl":"https://doi.org/10.1109/INCoS.2011.95","url":null,"abstract":"There is no forward security in any proxy blind signature schemes today. The lack of forward security will impact the system security tremendously if the key is stolen. To avoid such a security problem this paper proposes a forward secure proxy blind signature scheme which employs the key evolution mechanism in a newly proposed proxy blind signature scheme. The security of proxy blind signature and the forward security are both analyzed in the proposed scheme. Even if the current signature key is compromised, the attacker cannot forge signatures as if they had been generated before the key leakage. That is to say, signatures signed before the leakage are still valid.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127339662","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 strong multiple designated verifiers signature (SMDVS) enables a signer to convince a set of verifiers by generating one signature, of which the verification needs the private key of a verifier. After a brief survey of the current SMDVS schemes, we find no schemes suitable to the broadcast propagation, where the simulation needs only one verifier's private key. Motivated by this discovery, we propose a broadcast SMDVS scheme. The new scheme is proven secure in the random oracle model.
{"title":"A New Strong Multiple Designated Verifiers Signature for Broadcast Propagation","authors":"Haibo Tian","doi":"10.1109/INCoS.2011.31","DOIUrl":"https://doi.org/10.1109/INCoS.2011.31","url":null,"abstract":"A strong multiple designated verifiers signature (SMDVS) enables a signer to convince a set of verifiers by generating one signature, of which the verification needs the private key of a verifier. After a brief survey of the current SMDVS schemes, we find no schemes suitable to the broadcast propagation, where the simulation needs only one verifier's private key. Motivated by this discovery, we propose a broadcast SMDVS scheme. The new scheme is proven secure in the random oracle model.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130788801","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
扫码关注我们
求助内容：
应助结果提醒方式：