In this paper, the mobility-dependent predictive resource reservation (MDPRR) scheme is proposed to provide flexible usage of limited resource in mobile multimedia wireless networks. An admission control scheme is also considered to further guarantee the QoS of real-time traffic. The area of a cell is divided into non-handoff, pre-handoff, and handoff zones so that bandwidth is reserved in the target/sub-target cell as mobile stations move into the pre-handoff zone and leave the serving base station. The amount of bandwidth to be reserved is dynamically adjusted according to the location, the instantaneous variation of velocity and direction of mobile stations. Two scenarios of the MDPRR scheme are compared by considering the velocity threshold in the calculation of the weight of direction. The results show that employing the velocity threshold in the MDPRR scheme can indeed reduce connection dropping probability, and make better usage of the reserved bandwidth.
{"title":"The study of handoff prediction schemes for resource reservation in mobile multimedia wireless networks","authors":"Li-Liann Lu, Jean-Lien C. Wu, Wei-Yeh Chen","doi":"10.1002/dac.667","DOIUrl":"https://doi.org/10.1002/dac.667","url":null,"abstract":"In this paper, the mobility-dependent predictive resource reservation (MDPRR) scheme is proposed to provide flexible usage of limited resource in mobile multimedia wireless networks. An admission control scheme is also considered to further guarantee the QoS of real-time traffic. The area of a cell is divided into non-handoff, pre-handoff, and handoff zones so that bandwidth is reserved in the target/sub-target cell as mobile stations move into the pre-handoff zone and leave the serving base station. The amount of bandwidth to be reserved is dynamically adjusted according to the location, the instantaneous variation of velocity and direction of mobile stations. Two scenarios of the MDPRR scheme are compared by considering the velocity threshold in the calculation of the weight of direction. The results show that employing the velocity threshold in the MDPRR scheme can indeed reduce connection dropping probability, and make better usage of the reserved bandwidth.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125643861","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283898
K. Wan, C. Loeser
Generic file sharing P2P applications have gained high popularity in the past few years. In particular P2P streaming architectures have attracted attention. Some of them consider many-to-one streaming or high level multicast techniques. In contrast to these models we propose techniques and algorithms for point-to-point streaming in autonomous systems as it might occur in large companies, a campus or even in large hotels. Therefore we introduce the architecture of an overlay network. Each subnetwork contains local active rendezvous server (LARS) which do not just act as directory server but also control availability of movie content in their subnetwork. Due to this we consider data placement strategies depending on restrictions of network bandwidth and peer capabilities as well as the movies's access frequency.
{"title":"An overlay network architecture for data placement strategies in a P2P streaming network","authors":"K. Wan, C. Loeser","doi":"10.1109/AINA.2004.1283898","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283898","url":null,"abstract":"Generic file sharing P2P applications have gained high popularity in the past few years. In particular P2P streaming architectures have attracted attention. Some of them consider many-to-one streaming or high level multicast techniques. In contrast to these models we propose techniques and algorithms for point-to-point streaming in autonomous systems as it might occur in large companies, a campus or even in large hotels. Therefore we introduce the architecture of an overlay network. Each subnetwork contains local active rendezvous server (LARS) which do not just act as directory server but also control availability of movie content in their subnetwork. Due to this we consider data placement strategies depending on restrictions of network bandwidth and peer capabilities as well as the movies's access frequency.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121228884","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283937
T. Nakao, M. Tsukamoto, T. Ogawa, S. Nishio
Virtual space, which models the real world, brings lots of benefits when it covers a considerably wide area and can be used in a mobile computing environment. However, there are some difficulties in implementing virtual space on the mobile computing environment, mainly due to hardware limitations such as computation power, communication capability, and memory size. In this paper, we ease the difficulties of using large-scale virtual space based on the real world (LVBR) in the mobile environment. We have established a scalable and efficient method of constructing and managing LVBR on cellular phones, and have implemented a system named KEITAI-Space. KEITAI-Space is designed to provide the scalable photo-based virtual space to cellular phones that takes into account the hardware limitations. The virtual space is made of a collection of photos and can be edited and expanded by people with cellular phones on hand.
{"title":"KEITAI-Space: photo-based shared virtual space on cellular phones","authors":"T. Nakao, M. Tsukamoto, T. Ogawa, S. Nishio","doi":"10.1109/AINA.2004.1283937","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283937","url":null,"abstract":"Virtual space, which models the real world, brings lots of benefits when it covers a considerably wide area and can be used in a mobile computing environment. However, there are some difficulties in implementing virtual space on the mobile computing environment, mainly due to hardware limitations such as computation power, communication capability, and memory size. In this paper, we ease the difficulties of using large-scale virtual space based on the real world (LVBR) in the mobile environment. We have established a scalable and efficient method of constructing and managing LVBR on cellular phones, and have implemented a system named KEITAI-Space. KEITAI-Space is designed to provide the scalable photo-based virtual space to cellular phones that takes into account the hardware limitations. The virtual space is made of a collection of photos and can be edited and expanded by people with cellular phones on hand.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127087643","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283928
E. Shakshuki, Zhonghai Luo, Jing Gong, Qian Chen
This paper presents a multi-agent security service system architecture. This system consists of four types of agents: interface, authentication, authorization, and service provider agents. The interface agents interact with the users to fulfill their interests. The authentication agents investigate the validity of using keystroke dynamics to strengthen security. The authorization agents decide who can access which resources and for what purposes. The service provider agents offer different encryption services to different users. A prototype of the system is implemented using the Java agent development framework (JADE).
{"title":"Multi-agent system for security service","authors":"E. Shakshuki, Zhonghai Luo, Jing Gong, Qian Chen","doi":"10.1109/AINA.2004.1283928","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283928","url":null,"abstract":"This paper presents a multi-agent security service system architecture. This system consists of four types of agents: interface, authentication, authorization, and service provider agents. The interface agents interact with the users to fulfill their interests. The authentication agents investigate the validity of using keystroke dynamics to strengthen security. The authorization agents decide who can access which resources and for what purposes. The service provider agents offer different encryption services to different users. A prototype of the system is implemented using the Java agent development framework (JADE).","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"51 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126358614","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283861
K. Fan, W. Kou
To solve the problems due to the restriction of the handheld devices and the improperness of traditional steganography schemes in m-commerce applications, a secure steganography scheme based on (N,t) threshold is proposed and its security is analyzed. This scheme can significantly reduce the computing complexity and the requirements for the communication devices. It also improves the security. This scheme enables clients to securely conduct m-commerce transactions and carry out steganographic communication using their handheld devices. The proposed scheme can resist various attack methods.
{"title":"A secure steganography scheme based on (N,t) threshold","authors":"K. Fan, W. Kou","doi":"10.1109/AINA.2004.1283861","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283861","url":null,"abstract":"To solve the problems due to the restriction of the handheld devices and the improperness of traditional steganography schemes in m-commerce applications, a secure steganography scheme based on (N,t) threshold is proposed and its security is analyzed. This scheme can significantly reduce the computing complexity and the requirements for the communication devices. It also improves the security. This scheme enables clients to securely conduct m-commerce transactions and carry out steganographic communication using their handheld devices. The proposed scheme can resist various attack methods.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130673694","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283752
Hong-Sain Ooi
We propose a new stream cipher suitable for high-speed network applications, called HSSC (high-speed stream cipher). HSSC uses simple structure to allow detailed analysis and high software performance. The software implementation using C is about 2.07 cycles per byte on a Pentium II 450MHz platform. HSSC uses twelve 32-bit variables as internal states, four predefined constants, four key-derived constants and a set of rules to combine the internal states into 128-bit output per round.
本文提出了一种适用于高速网络应用的新型流密码，称为HSSC(高速流密码)。HSSC采用简单的结构，允许详细的分析和高的软件性能。使用C的软件实现在Pentium II 450MHz平台上每字节约2.07个周期。HSSC使用12个32位变量作为内部状态，4个预定义常量，4个密钥派生常量和一组规则将内部状态组合为每轮128位输出。
{"title":"High-speed stream cipher","authors":"Hong-Sain Ooi","doi":"10.1109/AINA.2004.1283752","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283752","url":null,"abstract":"We propose a new stream cipher suitable for high-speed network applications, called HSSC (high-speed stream cipher). HSSC uses simple structure to allow detailed analysis and high software performance. The software implementation using C is about 2.07 cycles per byte on a Pentium II 450MHz platform. HSSC uses twelve 32-bit variables as internal states, four predefined constants, four key-derived constants and a set of rules to combine the internal states into 128-bit output per round.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116773329","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283834
R. Samarasinghe, Y. Yasutake, Takeshi Kato, Takaichi Yoshida
New applications are being introduced for different areas such as commercial, education, and medical etc. A significant effort has been made in developing some of these applications considering the adaptability to the dynamically changing network and hosts' environments. In client-server applications, this adaptability is very important to enhance the reliability of the system and maintain the consistency of the objects. We describe a framework that can detect the changes in performance of the execution environment, and provide strategies in order to adapt such changes. Using these access strategies the client objects can access the server objects efficiently in a dynamically changing environment. We do not only consider the dynamic changes of the network characteristics but also consider the end-hosts performances before changing to the optimal strategy. Therefore the client objects can achieve the maximum usefulness of the environment. Here, we introduce three access strategies, namely client migration, direct access, and lazy access to impart an adaptive behavior to the client objects in the distributed environment. Advancing from the conventional static access models we propose algorithms to select the best-suited access strategy for the dynamic environment. Moreover the proposed model is to be implemented to the "juice" distributed object-oriented environment.
{"title":"Adaptable access strategies provide a high usefulness of the objects in an open distributed environment","authors":"R. Samarasinghe, Y. Yasutake, Takeshi Kato, Takaichi Yoshida","doi":"10.1109/AINA.2004.1283834","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283834","url":null,"abstract":"New applications are being introduced for different areas such as commercial, education, and medical etc. A significant effort has been made in developing some of these applications considering the adaptability to the dynamically changing network and hosts' environments. In client-server applications, this adaptability is very important to enhance the reliability of the system and maintain the consistency of the objects. We describe a framework that can detect the changes in performance of the execution environment, and provide strategies in order to adapt such changes. Using these access strategies the client objects can access the server objects efficiently in a dynamically changing environment. We do not only consider the dynamic changes of the network characteristics but also consider the end-hosts performances before changing to the optimal strategy. Therefore the client objects can achieve the maximum usefulness of the environment. Here, we introduce three access strategies, namely client migration, direct access, and lazy access to impart an adaptive behavior to the client objects in the distributed environment. Advancing from the conventional static access models we propose algorithms to select the best-suited access strategy for the dynamic environment. Moreover the proposed model is to be implemented to the \"juice\" distributed object-oriented environment.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116909279","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283949
Hiroyasu Mitsui, H. Sugihara, H. Koizumi
Web-based distance education has attracted attention as what can replace partially, even extensively, conventional methods in university education. When distance education in engineering includes remote experiments, it can provide opportunities to study engineering anywhere and at any time. Scheduling the remote classes that feature remote experiments should solve students' preferences for taking classes, contentions such as experiment equipment and teaching staff resources, and prerequisite conditions of various subjects and lessons. This paper describes a scheduling method of distance learning classes including remote experiment, which can coordinate those conditions mentioned above.
{"title":"A scheduling method of distance learning classes including remote experiments","authors":"Hiroyasu Mitsui, H. Sugihara, H. Koizumi","doi":"10.1109/AINA.2004.1283949","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283949","url":null,"abstract":"Web-based distance education has attracted attention as what can replace partially, even extensively, conventional methods in university education. When distance education in engineering includes remote experiments, it can provide opportunities to study engineering anywhere and at any time. Scheduling the remote classes that feature remote experiments should solve students' preferences for taking classes, contentions such as experiment equipment and teaching staff resources, and prerequisite conditions of various subjects and lessons. This paper describes a scheduling method of distance learning classes including remote experiment, which can coordinate those conditions mentioned above.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116991818","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283882
A. Koyama, L. Barolli, Kazunori Matsumoto, B. Apduhan
The routing algorithms for multimedia communication should use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting systems require better QoS. However, the problem of QoS routing is difficult and to find a feasible route with two independent path constraints is NP-complete. Also, QoS routing algorithms for broadband networks must be adaptive, flexible, and intelligent for efficient network management. In this paper, we propose a multipurpose optimization method for QoS routing based on genetic algorithm (GA). The simulation results show that proposed method has a good performance and is a promising method for QoS routing.
{"title":"A GA-based multi-purpose optimization algorithm for QoS routing","authors":"A. Koyama, L. Barolli, Kazunori Matsumoto, B. Apduhan","doi":"10.1109/AINA.2004.1283882","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283882","url":null,"abstract":"The routing algorithms for multimedia communication should use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting systems require better QoS. However, the problem of QoS routing is difficult and to find a feasible route with two independent path constraints is NP-complete. Also, QoS routing algorithms for broadband networks must be adaptive, flexible, and intelligent for efficient network management. In this paper, we propose a multipurpose optimization method for QoS routing based on genetic algorithm (GA). The simulation results show that proposed method has a good performance and is a promising method for QoS routing.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131229684","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283969
Junqi Zhang, V. Varadharajan, Y. Mu
XML has been becoming popular for data store, document representation and exchange over the Web. Security mechanisms for the protection of XML document sources and their distribution are essential. Author-X is a Java based system specifically conceived for the protection of XML documents. It supports a range of protection granularity levels and subject credentials, but also supports push distribution for documents broadcast. However, the proposed system has certain disadvantages in terms of both security and dynamic key management. For example, a sender has to distribute the secret keys to all correspondent users for different XML documents. Also, if one of the users leave or a credential is changed, then the sender has to re-encrypt all related documents and redistribute the secret keys to all correspondent users. In this paper, we present a scheme for securing XML documents and their distribution. Our scheme has several advantages over Author-X such as: (a) one user needs only one private key; (b) even when the user leaves or a credential is changed, all the other users will be unaffected; (c) there is no need to establish a secure channel for key distribution; and (d) there is no need for checking the XML documents for access control policies applied. These make the security model more efficient and robust as well as simplifying the programming and the generation of the encrypted document base.
{"title":"Securing XML document sources and their distribution","authors":"Junqi Zhang, V. Varadharajan, Y. Mu","doi":"10.1109/AINA.2004.1283969","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283969","url":null,"abstract":"XML has been becoming popular for data store, document representation and exchange over the Web. Security mechanisms for the protection of XML document sources and their distribution are essential. Author-X is a Java based system specifically conceived for the protection of XML documents. It supports a range of protection granularity levels and subject credentials, but also supports push distribution for documents broadcast. However, the proposed system has certain disadvantages in terms of both security and dynamic key management. For example, a sender has to distribute the secret keys to all correspondent users for different XML documents. Also, if one of the users leave or a credential is changed, then the sender has to re-encrypt all related documents and redistribute the secret keys to all correspondent users. In this paper, we present a scheme for securing XML documents and their distribution. Our scheme has several advantages over Author-X such as: (a) one user needs only one private key; (b) even when the user leaves or a credential is changed, all the other users will be unaffected; (c) there is no need to establish a secure channel for key distribution; and (d) there is no need for checking the XML documents for access control policies applied. These make the security model more efficient and robust as well as simplifying the programming and the generation of the encrypted document base.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131257563","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
扫码关注我们
求助内容：
应助结果提醒方式：