Pub Date : 2004-03-29DOI: 10.1109/AINA.2004.1283775
T. Katoh, K. Hoshi, N. Shiratori
In multiagent system, it is important for agents to assess the situation prevailing in the system, especially to anticipate other agents' intentions. We argue in favor of cooperation among agents and propose a new method to utilize potential field as a tool for estimation of the environment. In our method, potential of environment gives agents some criteria to assess environmental situations from their own perspective. The potential of each object represents its influence on the environment and the environmental potential, i.e., summation of each object's potential, represents global situation of the environment. Agents' decision of their behavior will be done by refining the policy obtained from potential. We use a trash collecting problem as an example to show the effectiveness of our method. Furthermore, we show the efficiency of our method by some sets of experiments of the trash collecting problem. We also discuss the applicability of our method to hybrid systems, environments where available information has a margin of error, or environments where agents' range of vision are limited.
{"title":"On agents' cooperative behavior based on potential field","authors":"T. Katoh, K. Hoshi, N. Shiratori","doi":"10.1109/AINA.2004.1283775","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283775","url":null,"abstract":"In multiagent system, it is important for agents to assess the situation prevailing in the system, especially to anticipate other agents' intentions. We argue in favor of cooperation among agents and propose a new method to utilize potential field as a tool for estimation of the environment. In our method, potential of environment gives agents some criteria to assess environmental situations from their own perspective. The potential of each object represents its influence on the environment and the environmental potential, i.e., summation of each object's potential, represents global situation of the environment. Agents' decision of their behavior will be done by refining the policy obtained from potential. We use a trash collecting problem as an example to show the effectiveness of our method. Furthermore, we show the efficiency of our method by some sets of experiments of the trash collecting problem. We also discuss the applicability of our method to hybrid systems, environments where available information has a margin of error, or environments where agents' range of vision are limited.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"20 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":"115289469","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.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.1283850
Minoru Udagawa, N. Sato, M. Uehara, Y. Sakai
Crawling and indexing have been considered regarding existing search engines, but whereas high speed crawling has been studied widely, improvements in the speed of indexing have seldom been discussed. Building a fresh information search engine should, however, unify these arguments concerning crawling and indexing. In this report, an index updating process based on a pipeline that unifies crawling and indexing was proposed. The techniques of a distributed index updating process are discussed with regards to a distributed cooperative search engine.
{"title":"Distributed pipelining processing for index updating method","authors":"Minoru Udagawa, N. Sato, M. Uehara, Y. Sakai","doi":"10.1109/AINA.2004.1283850","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283850","url":null,"abstract":"Crawling and indexing have been considered regarding existing search engines, but whereas high speed crawling has been studied widely, improvements in the speed of indexing have seldom been discussed. Building a fresh information search engine should, however, unify these arguments concerning crawling and indexing. In this report, an index updating process based on a pipeline that unifies crawling and indexing was proposed. The techniques of a distributed index updating process are discussed with regards to a distributed cooperative search engine.","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":"130879300","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.1283818
Changle Li, Jiandong Li, Xuelian Cai
This paper studies the performance of the IEEE 802.11 standard MAC protocol for integrated data and voice transmission with the DCF (distributed coordination function) and the PCF (point coordination function). By simulation, we evaluate the network performance for various protocol parameters, especially, the delay jitter for voice traffic. The main factor to influence delay jitter is given. Numerical results show that it is important to choose appropriate parameters and compromise the number of voice stations and the data traffic throughput to get the enhanced performance of IEEE 802.11. The performance of protocol in theory is derived and is verified by the simulation results.
{"title":"Performance analysis of IEEE 802.11 WLAN to support voice services","authors":"Changle Li, Jiandong Li, Xuelian Cai","doi":"10.1109/AINA.2004.1283818","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283818","url":null,"abstract":"This paper studies the performance of the IEEE 802.11 standard MAC protocol for integrated data and voice transmission with the DCF (distributed coordination function) and the PCF (point coordination function). By simulation, we evaluate the network performance for various protocol parameters, especially, the delay jitter for voice traffic. The main factor to influence delay jitter is given. Numerical results show that it is important to choose appropriate parameters and compromise the number of voice stations and the data traffic throughput to get the enhanced performance of IEEE 802.11. The performance of protocol in theory is derived and is verified by the simulation results.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 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":"129831762","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, 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.1283755
Y. Kato, Dongmei Jiang, K. Hakozaki
We propose a streaming video system, which can be used in various system environments. This system has three features for providing real-time video delivery services in the Internet. The first is to use QoS (quality of service) control rules adapting to the system environments. The second is to improve estimation accuracy of the network conditions while a user is watching a stream. The third is to notify QoS degradation factors to the user actively. These features make it possible to provide streaming services with a high level of user satisfaction. We show an experimental system in our laboratory as an implementation example.
{"title":"A proposal of a streaming video system in best-effort networks using adaptive QoS control rules","authors":"Y. Kato, Dongmei Jiang, K. Hakozaki","doi":"10.1109/AINA.2004.1283755","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283755","url":null,"abstract":"We propose a streaming video system, which can be used in various system environments. This system has three features for providing real-time video delivery services in the Internet. The first is to use QoS (quality of service) control rules adapting to the system environments. The second is to improve estimation accuracy of the network conditions while a user is watching a stream. The third is to notify QoS degradation factors to the user actively. These features make it possible to provide streaming services with a high level of user satisfaction. We show an experimental system in our laboratory as an implementation example.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"81 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":"126257907","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：