Pub Date : 2003-03-27DOI: 10.1109/AINA.2003.1193001
Ying-Hong Wang, Hui-Min Huang, Chih-Peng Hsu
The developments of wired network technologies are significant rapidly, such as the IP-based network. These technologies can be used to develop wireless network directly. Recently, there are many communication systems brought up in order to offer mobile users with the best services. The combination of wired network and wireless network could be used to access data mutually. In this paper, the multi-tier architecture is based on IP network. Combining all these systems in a multi-tier IP-based wireless network is an important issue. In this paper, we propose a novel handoff algorithm of wireless communication for multi-tier IP-based network; the handoff algorithm is divided into two parts, which are Old-tier priority and New-tier priority algorithm. Making programs by C for simulating, and making sure that the algorithm is workable. The results of simulation show 11.99% of handoff frequency has been decreased and 8% of using rates of resource has been increased.
{"title":"Handoff strategy for multi-tier IP-based wireless network","authors":"Ying-Hong Wang, Hui-Min Huang, Chih-Peng Hsu","doi":"10.1109/AINA.2003.1193001","DOIUrl":"https://doi.org/10.1109/AINA.2003.1193001","url":null,"abstract":"The developments of wired network technologies are significant rapidly, such as the IP-based network. These technologies can be used to develop wireless network directly. Recently, there are many communication systems brought up in order to offer mobile users with the best services. The combination of wired network and wireless network could be used to access data mutually. In this paper, the multi-tier architecture is based on IP network. Combining all these systems in a multi-tier IP-based wireless network is an important issue. In this paper, we propose a novel handoff algorithm of wireless communication for multi-tier IP-based network; the handoff algorithm is divided into two parts, which are Old-tier priority and New-tier priority algorithm. Making programs by C for simulating, and making sure that the algorithm is workable. The results of simulation show 11.99% of handoff frequency has been decreased and 8% of using rates of resource has been increased.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116784614","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192992
Min Sheng, Jiandong Li, Yan Shi
A novel routing protocol for ad hoc networks - DSARP (Delay Sensitive Adaptive Routing Protocol) - is presented in this paper. According to DSARP, the reliable route for delay sensitive traffic can be supplied and the route can be selected based on the constrained condition - "the shortest route and the lowest average delay". Therefore, the "hotspot" on the shortest path can be avoided. Meanwhile, DSARP can provide a QoS guarantee and improve the performance of the network. Simulation results show that DSARP performs better than the DSR routing protocol used in ad hoc wireless networks.
{"title":"Delay Sensitive Adaptive Pouting Protocol for ad hoc network","authors":"Min Sheng, Jiandong Li, Yan Shi","doi":"10.1109/AINA.2003.1192992","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192992","url":null,"abstract":"A novel routing protocol for ad hoc networks - DSARP (Delay Sensitive Adaptive Routing Protocol) - is presented in this paper. According to DSARP, the reliable route for delay sensitive traffic can be supplied and the route can be selected based on the constrained condition - \"the shortest route and the lowest average delay\". Therefore, the \"hotspot\" on the shortest path can be avoided. Meanwhile, DSARP can provide a QoS guarantee and improve the performance of the network. Simulation results show that DSARP performs better than the DSR routing protocol used in ad hoc wireless networks.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124910653","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192845
T. Enokido, M. Takizawa
The group protocol has to support applications with enough quality (QoS) and types of service in change of QoS supported by the underlying network and QoS requirements of applications. A flexible group service is supported for applications by cooperation of multiple autonomous agents. A group protocol to coordinate the cooperation of the agents is composed of a collection of functions like retransmission and receipt confirmation. Each agent dynamically and autonomously takes a class of module for each protocol function in change of QoS supported by networks and required by application.
{"title":"Flexible group communication protocol for distributed systems","authors":"T. Enokido, M. Takizawa","doi":"10.1109/AINA.2003.1192845","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192845","url":null,"abstract":"The group protocol has to support applications with enough quality (QoS) and types of service in change of QoS supported by the underlying network and QoS requirements of applications. A flexible group service is supported for applications by cooperation of multiple autonomous agents. A group protocol to coordinate the cooperation of the agents is composed of a collection of functions like retransmission and receipt confirmation. Each agent dynamically and autonomously takes a class of module for each protocol function in change of QoS supported by networks and required by application.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121877710","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192912
N. Sato, Minoru Udagawa, M. Uehara, Y. Sakai, H. Mori
We have developed a distributed search engine, called Cooperative Search Engine (CSE), in order to retrieve fresh information. In CSE, a local search engine located in each Web server makes an index of local pages. A meta search server integrates these local search engines in order to realize a global search engine. This meta server is a single point of failure in CSE. So, we propose redundancy of meta search servers in order to increase availability of CSE. In this paper, we describe the reliable architecture of CSE and its evaluations.
{"title":"Redundancy of meta search servers in a distributed search engine","authors":"N. Sato, Minoru Udagawa, M. Uehara, Y. Sakai, H. Mori","doi":"10.1109/AINA.2003.1192912","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192912","url":null,"abstract":"We have developed a distributed search engine, called Cooperative Search Engine (CSE), in order to retrieve fresh information. In CSE, a local search engine located in each Web server makes an index of local pages. A meta search server integrates these local search engines in order to realize a global search engine. This meta server is a single point of failure in CSE. So, we propose redundancy of meta search servers in order to increase availability of CSE. In this paper, we describe the reliable architecture of CSE and its evaluations.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121932727","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192900
A. Koyama, L. Barolli, Yasutaka Okada, N. Kamibayashi, N. Shiratori
In most of the research for the wavelength allocation in wavelength division multiplexing (WDM) networks, the connection setting delay time is not considered. However, the entire bandwidth increases because of an increase in the transmission capacity of one wavelength. Therefore, the connection setting delay time should be considered because the data transmission time is shortened relatively. In this paper we propose a new connection setting method considering connection setting delay. The performance evaluation via simulations shows that the proposed method has better performance than the conventional forward and backward reservation methods.
{"title":"A wavelength assignment method for WDM networks using holding strategy","authors":"A. Koyama, L. Barolli, Yasutaka Okada, N. Kamibayashi, N. Shiratori","doi":"10.1109/AINA.2003.1192900","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192900","url":null,"abstract":"In most of the research for the wavelength allocation in wavelength division multiplexing (WDM) networks, the connection setting delay time is not considered. However, the entire bandwidth increases because of an increase in the transmission capacity of one wavelength. Therefore, the connection setting delay time should be considered because the data transmission time is shortened relatively. In this paper we propose a new connection setting method considering connection setting delay. The performance evaluation via simulations shows that the proposed method has better performance than the conventional forward and backward reservation methods.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"713 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127584365","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192911
Masaki Omata, K. Go, A. Imamiya
In this paper we propose "Augmented Reality (AR) Clipboard" with "twist-information presentation method" based on the angle difference between user's head and body. The AR Clipboard is a computer-generated information clipboard that allows a user to keep virtual objects on it on a video see-through head mounted display (HMD). The twist-information presentation method provides a user with wide view of a HMD by presenting a virtual object in the peripheral space of a user's view, which is generated by the angle difference between the user's head and body. Using AR Clipboards, a user can carry virtual objects on them around his/her body and can look at one of them as long as the user turns his/her face toward a clipboard. Moreover, a user can grasp a virtual object and post it on one of the clipboards by performing hand postures.
{"title":"Augmented Reality Clipboard with the twist-information presentation method","authors":"Masaki Omata, K. Go, A. Imamiya","doi":"10.1109/AINA.2003.1192911","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192911","url":null,"abstract":"In this paper we propose \"Augmented Reality (AR) Clipboard\" with \"twist-information presentation method\" based on the angle difference between user's head and body. The AR Clipboard is a computer-generated information clipboard that allows a user to keep virtual objects on it on a video see-through head mounted display (HMD). The twist-information presentation method provides a user with wide view of a HMD by presenting a virtual object in the peripheral space of a user's view, which is generated by the angle difference between the user's head and body. Using AR Clipboards, a user can carry virtual objects on them around his/her body and can look at one of them as long as the user turns his/her face toward a clipboard. Moreover, a user can grasp a virtual object and post it on one of the clipboards by performing hand postures.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133528541","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192847
M. Sampaio, Plácido Marinho Dias, C. Baptista
The use of mobile applications is increasing rapidly. Particularly, mobile applications for decision support systems, such as mobile data warehouses, are very attractive. However, mobile application imposes new requirements such as disconnection from the data sources. These requirements force the use of incremental update algorithms in order to update the mobile hosts. We extend the idea of incremental update algorithms with an optimized hierarchy of views which enables improving performance on mobile data warehouses. Moreover, we prove that other aggregate functions apart from the standard ones, in particular, standard deviation, variance, and ratiotoreport, are suitable for being used in incremental update algorithms.
{"title":"Incremental updates on mobile datawarehousing using optimized hierarchical views and new aggregation operators","authors":"M. Sampaio, Plácido Marinho Dias, C. Baptista","doi":"10.1109/AINA.2003.1192847","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192847","url":null,"abstract":"The use of mobile applications is increasing rapidly. Particularly, mobile applications for decision support systems, such as mobile data warehouses, are very attractive. However, mobile application imposes new requirements such as disconnection from the data sources. These requirements force the use of incremental update algorithms in order to update the mobile hosts. We extend the idea of incremental update algorithms with an optimized hierarchy of views which enables improving performance on mobile data warehouses. Moreover, we prove that other aggregate functions apart from the standard ones, in particular, standard deviation, variance, and ratiotoreport, are suitable for being used in incremental update algorithms.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131419282","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 : 2003-03-27DOI: 10.1109/AINA.2003.1193008
Chinchen Chang, Chi-Shiang Chan, J. Hsiao
We propose a lossless image compression method, in which we compress an image by saving the differences between the encoding pixels and their adjacent pixels. To deal with a pixel, we refer to not only its up pixel but also its left pixel and replace the value of the pixel itself with the value of difference. The experimental results show that the method gives quite an impressive performance. Since the values of most adjacent pixels in an image are closed, we can use this simple, effective way to compress the image.
{"title":"Lossless image compression based on two-way smaller difference","authors":"Chinchen Chang, Chi-Shiang Chan, J. Hsiao","doi":"10.1109/AINA.2003.1193008","DOIUrl":"https://doi.org/10.1109/AINA.2003.1193008","url":null,"abstract":"We propose a lossless image compression method, in which we compress an image by saving the differences between the encoding pixels and their adjacent pixels. To deal with a pixel, we refer to not only its up pixel but also its left pixel and replace the value of the pixel itself with the value of difference. The experimental results show that the method gives quite an impressive performance. Since the values of most adjacent pixels in an image are closed, we can use this simple, effective way to compress the image.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127311377","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192923
Kaidong Wang, B. Tian, K. Yi
Broadband satellite communication systems play a more and more important role in the global information infrastructure, but it still remains a challenging problem for the satellite data link to support ATM services because of its high error rate and the onboard processing limitation. This paper investigates concatenated coding as a means of improving and optimizing the data link performance. Taking the burst error characteristic of satellite links and ATM cell format into account, several coding schemes are evaluated by simulations. A concatenated coding scheme is therefore presented that can not only get fibre-like performance but also has the ability to correct long burst errors. The new scheme concatenates an outer RS code and an inner convolutional code, and can be implemented at a low complexity. Experiments show that it is practical and applicable for onboard applications.
{"title":"A practical scheme of improving the link performance for ATM satellite communication networks","authors":"Kaidong Wang, B. Tian, K. Yi","doi":"10.1109/AINA.2003.1192923","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192923","url":null,"abstract":"Broadband satellite communication systems play a more and more important role in the global information infrastructure, but it still remains a challenging problem for the satellite data link to support ATM services because of its high error rate and the onboard processing limitation. This paper investigates concatenated coding as a means of improving and optimizing the data link performance. Taking the burst error characteristic of satellite links and ATM cell format into account, several coding schemes are evaluated by simulations. A concatenated coding scheme is therefore presented that can not only get fibre-like performance but also has the ability to correct long burst errors. The new scheme concatenates an outer RS code and an inner convolutional code, and can be implemented at a low complexity. Experiments show that it is practical and applicable for onboard applications.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129718064","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192934
Xinjun Du, Y. Wang, Jianhua Ge, Yumin Wang
Since the publication of 2-party Diffie-Hellman (DH) key exchange (1976), various solutions have been proposed to extend Diffie-Hellman key exchange to multiparty key distribution. For the special operational requirement of ad hoc networks, none of these protocols are suitable. This is mainly because they demand the network topology follow a predestined structure. In this paper we utilize the thought of CEDAR (Core-Extraction Distributed Ad hoc Routing) algorithm and integrate the two DH-based protocols, the octopus protocol and the BD protocol, then present a group key establishment system suitable for ad hoc networks.
自1976年2方Diffie-Hellman (DH)密钥交换发表以来，人们提出了各种解决方案，将Diffie-Hellman密钥交换扩展到多方密钥分发。对于ad hoc网络的特殊操作要求，这些协议都不适合。这主要是因为它们要求网络拓扑结构遵循预定的结构。本文利用CEDAR (Core-Extraction Distributed Ad hoc Routing)算法的思想，将章鱼协议和BD协议这两种基于dh的协议进行集成，提出了一种适用于Ad hoc网络的组密钥建立系统。
{"title":"A group key establishment scheme for ad hoc networks","authors":"Xinjun Du, Y. Wang, Jianhua Ge, Yumin Wang","doi":"10.1109/AINA.2003.1192934","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192934","url":null,"abstract":"Since the publication of 2-party Diffie-Hellman (DH) key exchange (1976), various solutions have been proposed to extend Diffie-Hellman key exchange to multiparty key distribution. For the special operational requirement of ad hoc networks, none of these protocols are suitable. This is mainly because they demand the network topology follow a predestined structure. In this paper we utilize the thought of CEDAR (Core-Extraction Distributed Ad hoc Routing) algorithm and integrate the two DH-based protocols, the octopus protocol and the BD protocol, then present a group key establishment system suitable for ad hoc networks.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129318231","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
扫码关注我们
求助内容：
应助结果提醒方式：