The Loongson project is the first attempt to design high performance general purpose microprocessors in China. It implements a four-issue general purpose RISC microprocessor based on 64-bit MIPS instruction set. Loongson-2E is the latest version of the project. High performance is an important design criterion for Cryptographic symmetric primitives (include block ciphers and hash functions). This is the first paper which discusses how to optimize AES-128, SHA-256, SHA-512 and Whirlpool algorithms on Loongson-2E. Our programs are, to our best knowledge, the fastest implementations on Loongson-2E. This paper also proposed several new instructions for speedup symmetric primitives and a parallel hash function mode.
{"title":"How to Optimize the Cryptographic Symmetric Primitives on Loongson-2E Microprocessor","authors":"Yong Liu, Zhong Chen, Yu Chen","doi":"10.1109/WAINA.2008.278","DOIUrl":"https://doi.org/10.1109/WAINA.2008.278","url":null,"abstract":"The Loongson project is the first attempt to design high performance general purpose microprocessors in China. It implements a four-issue general purpose RISC microprocessor based on 64-bit MIPS instruction set. Loongson-2E is the latest version of the project. High performance is an important design criterion for Cryptographic symmetric primitives (include block ciphers and hash functions). This is the first paper which discusses how to optimize AES-128, SHA-256, SHA-512 and Whirlpool algorithms on Loongson-2E. Our programs are, to our best knowledge, the fastest implementations on Loongson-2E. This paper also proposed several new instructions for speedup symmetric primitives and a parallel hash function mode.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128694742","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}
Taehong Kim, Youngguk Ha, Jihoon Kang, Daeyoung Kim, Pohkit Chong, J. Sohn
Ubiquitous robot is a network robot which can communicate with any devices at any time in the surrounding physical space to obtain more diverse view points of the environment. We call ubiquitous computing environment, which the network devices provide the environmental information to the robot in, ubiquitous robotic space (URS). In this paper, a sensor network platform is proposed to build the ubiquitous robotic space and provide lots of types of environment information such as indoor environment condition, fire detection, and intrusion detection. Differently from the existing sensor network applications that assume the static sensor nodes and the base station, the proposed sensor network platform is designed to support seamless environmental monitoring on the mobile robot system. We then applied our sensor network platform toe the real robot system and evaluated the functionalities of the proposed system.
{"title":"Experiments on Building Ubiquitous Robotic Space for Mobile Robot Using Wireless Sensor Networks","authors":"Taehong Kim, Youngguk Ha, Jihoon Kang, Daeyoung Kim, Pohkit Chong, J. Sohn","doi":"10.1109/WAINA.2008.188","DOIUrl":"https://doi.org/10.1109/WAINA.2008.188","url":null,"abstract":"Ubiquitous robot is a network robot which can communicate with any devices at any time in the surrounding physical space to obtain more diverse view points of the environment. We call ubiquitous computing environment, which the network devices provide the environmental information to the robot in, ubiquitous robotic space (URS). In this paper, a sensor network platform is proposed to build the ubiquitous robotic space and provide lots of types of environment information such as indoor environment condition, fire detection, and intrusion detection. Differently from the existing sensor network applications that assume the static sensor nodes and the base station, the proposed sensor network platform is designed to support seamless environmental monitoring on the mobile robot system. We then applied our sensor network platform toe the real robot system and evaluated the functionalities of the proposed system.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130564438","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}
Parity prediction schemes have been widely studied in the past. Recently, it has been demonstrated that this prediction scheme can achieve fault-secureness in arithmetic circuits for stuck-at and stuck-open faults. For most cryptographic applications, encryption/decryption algorithms rely on computations in very large finite fields. The hardware implementation may require millions of logic gates and this may lead to the generation of erroneous outputs by the multiplier. In this paper, a concurrent error detection (CED) technique is used in the digit-serial basis multiplier over finite fields of characteristic two. It is shown that all types of normal basis multipliers possess the same parity prediction function.
{"title":"Concurrent Error Detection in Digit-Serial Normal Basis Multiplication over GF(2m)","authors":"Chiou-Yng Lee","doi":"10.1109/WAINA.2008.40","DOIUrl":"https://doi.org/10.1109/WAINA.2008.40","url":null,"abstract":"Parity prediction schemes have been widely studied in the past. Recently, it has been demonstrated that this prediction scheme can achieve fault-secureness in arithmetic circuits for stuck-at and stuck-open faults. For most cryptographic applications, encryption/decryption algorithms rely on computations in very large finite fields. The hardware implementation may require millions of logic gates and this may lead to the generation of erroneous outputs by the multiplier. In this paper, a concurrent error detection (CED) technique is used in the digit-serial basis multiplier over finite fields of characteristic two. It is shown that all types of normal basis multipliers possess the same parity prediction function.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125291522","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 tool allowing the design of service orchestration at a high level of abstraction. This tool also allows specifying security properties, also in an abstract way, as annotations on the services orchestration. Our purpose is to generate code, including security code, from this specification. This is especially important in the context of complex execution platforms like enterprise service buses. Our tool is used in the context of industrial plants using more and more services like DPWS to implement applications.
{"title":"Transparently Adding Security Properties to Service Orchestration","authors":"Stéphanie Chollet, P. Lalanda, A. Bottaro","doi":"10.1109/WAINA.2008.70","DOIUrl":"https://doi.org/10.1109/WAINA.2008.70","url":null,"abstract":"In this paper, we present a tool allowing the design of service orchestration at a high level of abstraction. This tool also allows specifying security properties, also in an abstract way, as annotations on the services orchestration. Our purpose is to generate code, including security code, from this specification. This is especially important in the context of complex execution platforms like enterprise service buses. Our tool is used in the context of industrial plants using more and more services like DPWS to implement applications.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126058228","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 concept of Churn is the continuous process of node arrival and departure in distributed peer-to-peer network. There exists two eprotocol Selecting News and Eldersxtreme cases. The first one is that enormous nodes joining the system concurrently, which results in a flash crowd scenario for special nodes in the system. The other is that enormous nodes crashed or the connections between nodes are failed in a moment, which comes out a shrink search later. In this paper, we present a novel protocol Selecting News and Elders (SNE) with positive communication policy among peers and conservative neighbor maintenance scheme under churn, to keep desirable properties such as a low network diameter and clustering. The protocol is resilient against different churn and fit for P2P information dissemination and file sharing systems especially.
{"title":"Selecting News and Elders in Unstructured Peer-to-Peer Network under Churn","authors":"Yanxiang He, Haowen Liu, N. Xiong, L. Yang","doi":"10.1109/WAINA.2008.67","DOIUrl":"https://doi.org/10.1109/WAINA.2008.67","url":null,"abstract":"The concept of Churn is the continuous process of node arrival and departure in distributed peer-to-peer network. There exists two eprotocol Selecting News and Eldersxtreme cases. The first one is that enormous nodes joining the system concurrently, which results in a flash crowd scenario for special nodes in the system. The other is that enormous nodes crashed or the connections between nodes are failed in a moment, which comes out a shrink search later. In this paper, we present a novel protocol Selecting News and Elders (SNE) with positive communication policy among peers and conservative neighbor maintenance scheme under churn, to keep desirable properties such as a low network diameter and clustering. The protocol is resilient against different churn and fit for P2P information dissemination and file sharing systems especially.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127079102","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}
M. Hasanlou, Ebrahim Fazli, A. Movaghar, H. Mohammadi
A mobile ad hoc network (MANET) is a network without any predefined infrastructure in which every node not only enjoys the services from the network, but serves the network as a relaying router. Because of nodes mobility, these kinds of networks are highly dynamic. Therefore, link failure is so frequent. In this paper we propose a novel mobility management method which is independent of underlying routing protocol. Based on this mechanism, a node tries to keep an alternate node for its next hop and when a link breakage occurs, simply node uses its alternate node as next hop. Simulation results show that this mechanism can reduce average number of hop counts, number of selected routes and number of broken links, and provide longer network lifetime.
{"title":"3MOKAN: A Novel Mobility Management Mechanism Based on Keeping Alternative Nodes","authors":"M. Hasanlou, Ebrahim Fazli, A. Movaghar, H. Mohammadi","doi":"10.1109/WAINA.2008.179","DOIUrl":"https://doi.org/10.1109/WAINA.2008.179","url":null,"abstract":"A mobile ad hoc network (MANET) is a network without any predefined infrastructure in which every node not only enjoys the services from the network, but serves the network as a relaying router. Because of nodes mobility, these kinds of networks are highly dynamic. Therefore, link failure is so frequent. In this paper we propose a novel mobility management method which is independent of underlying routing protocol. Based on this mechanism, a node tries to keep an alternate node for its next hop and when a link breakage occurs, simply node uses its alternate node as next hop. Simulation results show that this mechanism can reduce average number of hop counts, number of selected routes and number of broken links, and provide longer network lifetime.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125974999","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 recent video standards like MPEG-4 are generally vulnerable to the packet loss because they achieve high compression ratios by complex calculation of preceding and succeeding frames. But, in the wireless channel, errors tend to occur in burst due to the intrinsic wireless link characteristics. Therefore, an efficient error control mechanism for multimedia streaming is necessary. In this paper, we propose a novel CC-FEC (Cross-correlated Forwarding Error Correction) scheme robust against burst error and suitable for multimedia streaming over the WLAN. The proposed scheme takes advantage of the interleaving and the multi-dimensional FEC schemes. We verify our scheme's superior performance than other FEC schemes through simulation.
{"title":"Cross-Correlated FEC Scheme for Multimedia Streaming over Wireless LAN","authors":"Eunyong Park, Sunyoung Han, Heemin Kim, K. Son","doi":"10.1109/WAINA.2008.183","DOIUrl":"https://doi.org/10.1109/WAINA.2008.183","url":null,"abstract":"The recent video standards like MPEG-4 are generally vulnerable to the packet loss because they achieve high compression ratios by complex calculation of preceding and succeeding frames. But, in the wireless channel, errors tend to occur in burst due to the intrinsic wireless link characteristics. Therefore, an efficient error control mechanism for multimedia streaming is necessary. In this paper, we propose a novel CC-FEC (Cross-correlated Forwarding Error Correction) scheme robust against burst error and suitable for multimedia streaming over the WLAN. The proposed scheme takes advantage of the interleaving and the multi-dimensional FEC schemes. We verify our scheme's superior performance than other FEC schemes through simulation.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127386202","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}
Storage consolidation as a perspective paradigm inevitably leads to the extensive installations of shared storage servers in product environments. However, owing to the dynamics of both workloads and storage systems, it is pragmatic only if each workload accessing common storage servers can surely possess a specified minimum share of system resources even when competing with other workloads and consequently obtain predictable quality of service (QoS). This paper presents an I/O scheduling framework for shared storage servers. The eMuse algorithm in the framework employs a dynamic assignment mechanism that not only accommodates a weighted bandwidth share for every active workload, but also fulfills their latency requirements through a fair queuing policy. Experimental results demonstrate that our scheduling framework can accomplish performance isolation among multiple competing workloads as well as the effective utilization of system resources.
{"title":"eMuse: QoS Guarantees for Shared Storage Servers","authors":"D. Feng, Chengtao Lu, F. Wang","doi":"10.1109/WAINA.2008.172","DOIUrl":"https://doi.org/10.1109/WAINA.2008.172","url":null,"abstract":"Storage consolidation as a perspective paradigm inevitably leads to the extensive installations of shared storage servers in product environments. However, owing to the dynamics of both workloads and storage systems, it is pragmatic only if each workload accessing common storage servers can surely possess a specified minimum share of system resources even when competing with other workloads and consequently obtain predictable quality of service (QoS). This paper presents an I/O scheduling framework for shared storage servers. The eMuse algorithm in the framework employs a dynamic assignment mechanism that not only accommodates a weighted bandwidth share for every active workload, but also fulfills their latency requirements through a fair queuing policy. Experimental results demonstrate that our scheduling framework can accomplish performance isolation among multiple competing workloads as well as the effective utilization of system resources.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127711288","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}
k-Neigh is a basic neighbor-based topology control protocol based on the construction of k-neighbor graph as logical communication graph. Although k-neigh is based on a connectivity theory, several topological aspects of the constructed topology are not yet analytically investigated. In this paper, several topological properties of the constructed topology after execution of the protocol, including probability density function of the distance between each node to its ith neighbor, probability of unidirectional links after execution of the first phase of the protocol, average logical degree, and average final transmission range, are investigated analytically. Moreover, an extensive simulation study is performed to validate the analytical results.
{"title":"Analysis of k-Neigh Topology Control Protocol for Wireless Networks","authors":"A. Nayebi, H. Sarbazi-Azad, K. Alishahi","doi":"10.1109/WAINA.2008.42","DOIUrl":"https://doi.org/10.1109/WAINA.2008.42","url":null,"abstract":"k-Neigh is a basic neighbor-based topology control protocol based on the construction of k-neighbor graph as logical communication graph. Although k-neigh is based on a connectivity theory, several topological aspects of the constructed topology are not yet analytically investigated. In this paper, several topological properties of the constructed topology after execution of the protocol, including probability density function of the distance between each node to its ith neighbor, probability of unidirectional links after execution of the first phase of the protocol, average logical degree, and average final transmission range, are investigated analytically. Moreover, an extensive simulation study is performed to validate the analytical results.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125998162","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 wireless mobile sensor network is a collection of wireless mobile hosts forming nodes that are arbitrarily and randomly changing their locations and communicating without the aid of any centralized administration or standard support services. Nodes are classified as sensor nodes and router. Some nodes act both as sensors and routers. In this paper, we propose a novel cluster-based infrastructure creation protocol, namely: the neighbor-aware clusterhead (NAC). NAC establishes a dynamic wireless mobile infrastructure. We study the characteristics and performance of the NAC protocol by means of simulation. In NAC protocol nodes are synchronized with their clusterheads and are allowed to go sleep mode in order to conserve their energy without degrading the performance of the network. The network is divided into clusters managed by a clusterhead. The simulation results show that NAC protocol has a good potential to be a good candidate protocol for SNET.
{"title":"Neighbor-Aware Clusterhead for SNET","authors":"T. Sheltami","doi":"10.1109/WAINA.2008.219","DOIUrl":"https://doi.org/10.1109/WAINA.2008.219","url":null,"abstract":"A wireless mobile sensor network is a collection of wireless mobile hosts forming nodes that are arbitrarily and randomly changing their locations and communicating without the aid of any centralized administration or standard support services. Nodes are classified as sensor nodes and router. Some nodes act both as sensors and routers. In this paper, we propose a novel cluster-based infrastructure creation protocol, namely: the neighbor-aware clusterhead (NAC). NAC establishes a dynamic wireless mobile infrastructure. We study the characteristics and performance of the NAC protocol by means of simulation. In NAC protocol nodes are synchronized with their clusterheads and are allowed to go sleep mode in order to conserve their energy without degrading the performance of the network. The network is divided into clusters managed by a clusterhead. The simulation results show that NAC protocol has a good potential to be a good candidate protocol for SNET.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122942404","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
扫码关注我们
求助内容：
应助结果提醒方式：