{"title":"Carrier-frequency offsets estimation based on ML and ESPRIT method for OFDMA uplink","authors":"Linjing Zhao, Jiandong Li, Zhuo Lu, Jiyong Pang","doi":"10.1109/AINA.2006.122","DOIUrl":"https://doi.org/10.1109/AINA.2006.122","url":null,"abstract":"Carrier frequency offsets (CFOs) in orthogonal frequency division multiplexing access (OFDMA) system will introduce intercarrier interference (ICI) and consequently degrade the system performance. A new frequency offsets estimation algorithm based on the combination of ESPRIT (estimation of signal parameters by rotational invariance techniques) and the maximum likelihood (ML) estimation methods for OFDMA system is proposed. The subset of the frequency offsets is first estimated by ESPRIT then the frequency offset of each user is identified in the subset by ML estimation method. The complexity of the combination algorithm is significantly decreased compared with the ML estimator. The algorithm efficiently solves the problem of multi-frequency offsets estimation.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115453491","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}
{"title":"Remote trust with aspect-oriented programming","authors":"P. Falcarin, R. Scandariato, M. Baldi","doi":"10.1109/AINA.2006.286","DOIUrl":"https://doi.org/10.1109/AINA.2006.286","url":null,"abstract":"Given a client/server application, how can the server entrust the integrity of the remote client, albeit the latter is running on an un-trusted machine? To address this research problem, we propose a novel approach based on the client-side generation of an execution signature, which is remotely checked by the server, wherein signature generation is locked to the entrusted software by means of code integrity checking. Our approach exploits the features of dynamic aspect-oriented programming (AOP) to extend the power of code integrity checkers in several ways. This paper both presents our approach and describes a prototype implementation for a messaging application.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123359244","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. Kawasaki, A. Shimizu, K. Monden, Hiroki Satoh, M. Hayashi, S. Matsui
{"title":"Wireless Ad-hoc Network-Based Tourist Information Delivery System","authors":"K. Kawasaki, A. Shimizu, K. Monden, Hiroki Satoh, M. Hayashi, S. Matsui","doi":"10.1109/AINA.2006.352","DOIUrl":"https://doi.org/10.1109/AINA.2006.352","url":null,"abstract":"Wireless ad-hoc network technology is an important technology for achieving pervasive computing. Very few studies up until now have focused on applying and evaluating ad-hoc network technology for an actual system. Therefore, we constructed a tourist information delivery system in an actual tourist area by using this ad-hoc network technology and conducted a field trial. Our system can automatically deliver tourist guide information when someone who has a FDA approaches a specific location. We measured ad-hoc network performance in the real field environment. We also handed out a simple questionnaire, and about 90% of the respondents had a positive impression of our tourist information delivery system. However, many respondents were concerned about the network quality and security. To put the ad-hoc network technology to practical use, we need to further study from the viewpoint of users' needs as well as technical aspects","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122107081","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}
{"title":"Designing a quality-aware discovery mechanism for acquiring context information","authors":"M. Chantzara, M. Anagnostou, E. Sykas","doi":"10.1109/AINA.2006.142","DOIUrl":"https://doi.org/10.1109/AINA.2006.142","url":null,"abstract":"The alignment of the context information with the service objectives facilitates the successful provisioning of context-aware services. Moreover, the fact that context may come from transient and/or unreliable sources needs consideration. False or stale context can dramatically affect the decisions and the actions taken by context-aware services. This paper presents an approach for evaluating and selecting the information to be used by context-aware services that takes into account the quality of information, and automatically adapts to any source changes and failures. The proposed quality-aware discovery of context information sources allows services to be ported easily to environments with different sets of sources.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114965634","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}
{"title":"A user-based approach for the choice of the IP services in the multi domains DiffServ Internet","authors":"C. Chassot, A. Lozes, F. Racaru, G. Auriol","doi":"10.1109/AINA.2006.63","DOIUrl":"https://doi.org/10.1109/AINA.2006.63","url":null,"abstract":"This paper deals with the design of a distributed architecture and of mechanisms that are able to guarantee quality of service (QoS) in a set of DiffServ domains. The design includes the proposal of a signaling protocol to accept or reject the transmission of flows in a set of adequately controlled domains. More particularly, it provides a proposal for (1) selecting the end-to-end QoS paths resulting from concatenations of the IP services provided by the domains involved in the data path and (2) ensuring that the chosen concatenations fulfil the requested user QoS requirements. With respect to other work, this paper first tries to minimise the use of network resources by discovering the real performance of each domain. Second, the signaling protocol is designed to bring as less constraints as possible on the architecture. It defines the end-to-end concatenations only as a set of transfer bridges, or inter-domain links, and leaves all internal domain paths fully open to any implementation by the domain providers. The architecture, based on the use of bandwidth brokers, provides an answer to the two main problems related to such approaches, i.e. how to identify and build the sequence of the needed bandwidth brokers and how to select the ingress and egress routers of each of these domains to construct the end-to-end paths.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122718363","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}
{"title":"Clustering protocol for sensor networks","authors":"A. Durresi, V. Paruchuri, M. Durresi, L. Barolli","doi":"10.1142/S0219265906001788","DOIUrl":"https://doi.org/10.1142/S0219265906001788","url":null,"abstract":"In this paper we present clustering protocol (CP) for sensor networks. Clustering techniques are used by different protocols and applications to increase scalability and reduce delays in sensor networks. Examples include routing protocols, and applications requiring efficient data aggregation. Our approach which is based on the covering problem that aims at covering an area with minimum possible circular disks assuming ideal conditions. CP is a lightweight protocol that does not require any neighborhood information and imposes lesser communication overhead. We present simulation results to show the efficiency of CP in both ideal cases and randomly distributed networks. Moreover, CP is scalable with respect to density and network size t.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131385090","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}
{"title":"A Scalable Anonymous Server Overlay Network","authors":"Henry Tsai, A. Harwood","doi":"10.1109/AINA.2006.55","DOIUrl":"https://doi.org/10.1109/AINA.2006.55","url":null,"abstract":"Large scale malicious activities continue to take place on the Internet. Safeguarding vulnerable computers and servers is therefore important. Recently, systems have been proposed to protect network addresses of computers from malicious adversaries on the Internet. Some of these systems focus specifically on providing client-side anonymity. However, as the Internet bandwidth for average users continues to increase, individuals are increasingly capable of carrying out complicated tasks as servers. It is in the interest of the individuals to gain server anonymity in which the network address of the machine remains protected from malicious activities. In this paper, we present a scalable anonymous server overlay network (SASON) that aims at protecting network addresses of all participating servers. SASON also provides reliable server discovery and routing through the use of server pseudonyms and distributed hash-tables","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131486782","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}
{"title":"Practical group signatures from RSA","authors":"Shi Cui, C. Chan, Xiangguo Cheng","doi":"10.1109/AINA.2006.274","DOIUrl":"https://doi.org/10.1109/AINA.2006.274","url":null,"abstract":"A group signature scheme allows a member of a given group to anonymously sign a message on behalf of the group. In the case of a later dispute, a designated group manager can open the signature, revoke the anonymity and identify the original signer. This paper presents a new and practical approach to group signatures. A trusted on-line third party is introduced in our scheme to help to realize (1) the \"join\" of group members, (2) the \"opening\" of group signatures, and (3) the \"revocation\" of group membership. Based on classical RSA, a practical group signature scheme is constructed. It is shown that our scheme satisfies all the security requirements of a secure group signature scheme, and the introduction of this third party makes our scheme much more simple and practical than the previous schemes of this kind.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122018332","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}
S. Ueda, S. Kaneko, N. Kawaguchi, H. Shigeno, Ken-ichi Okada
{"title":"Authenticating Video Streams","authors":"S. Ueda, S. Kaneko, N. Kawaguchi, H. Shigeno, Ken-ichi Okada","doi":"10.1109/AINA.2006.107","DOIUrl":"https://doi.org/10.1109/AINA.2006.107","url":null,"abstract":"In this paper, we propose SAVe, a real-time stream authentication scheme for video streams. Each packet in the stream is authenticated to correspond to packet loss seen in UDP-based streaming. Since temporal and spatial compression techniques are adopted for video stream encoding, there are differences in the importance and dependencies between frames. Therefore, to take the characteristics special to video into consideration, in SAVe the amount of redundancy distributed to each frame is adjusted according to the importance of each frame. Simulation results show that SAVe improves the playing rate 50% compared to previously proposed schemes","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122179218","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}
{"title":"Property-based taming of lying mobile nodes","authors":"M. Manulis, A. Sadeghi","doi":"10.1109/AINA.2006.276","DOIUrl":"https://doi.org/10.1109/AINA.2006.276","url":null,"abstract":"Intelligent security protocols can verify whether the involved principals have properties that are defined based on certain functional and security policies. The property we focus on is the performance of mobile devices participating in a security protocol. In this context, the protocol should distribute the computation, communication and storage costs fairly among all devices. However, the protocol should foresee against cheating participants who may lie about their properties to gain advantage.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115937024","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}