Pub Date : 2003-03-27DOI: 10.1109/AINA.2004.1283763
Masakazu Ono, C. Kato, Sayaka Harada, H. Higaki
Recently, mobile computers have become able to communicate with each other by using a wireless LAN protocol, e.g. IEEE 802.11 and HIPERLAN, for supporting various Internet services. In the case when a mobile computer changes location with high speed, less messages are exchanged between the mobile computer and the Internet. This paper proposes a novel routing protocol CB-WSCP for mobile clustered networks in which mobile computers with almost the same velocity and communication with each other by multi-hop transmission form a cluster. Here, communication between a cluster and a base station is available only if a mobile computer in the cluster is within transmission range of the base station. Hence, it is required to support sporadic communication. For achieving wider bandwidth even though the cluster moves with high speed, the proposed protocol achieves switching of gateways and updating of routing tables.
{"title":"Wireless sporadic communication protocol for supporting cluster-to-base station communication","authors":"Masakazu Ono, C. Kato, Sayaka Harada, H. Higaki","doi":"10.1109/AINA.2004.1283763","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283763","url":null,"abstract":"Recently, mobile computers have become able to communicate with each other by using a wireless LAN protocol, e.g. IEEE 802.11 and HIPERLAN, for supporting various Internet services. In the case when a mobile computer changes location with high speed, less messages are exchanged between the mobile computer and the Internet. This paper proposes a novel routing protocol CB-WSCP for mobile clustered networks in which mobile computers with almost the same velocity and communication with each other by multi-hop transmission form a cluster. Here, communication between a cluster and a base station is available only if a mobile computer in the cluster is within transmission range of the base station. Hence, it is required to support sporadic communication. For achieving wider bandwidth even though the cluster moves with high speed, the proposed protocol achieves switching of gateways and updating of routing tables.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"128 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":"128107843","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.1192926
Maosong Luo, Wu Ye, Shengye Huang, Suili Feng, Zhaonan Li
This article presents an efficient optimal algorithm for virtual path (VP) bandwidth allocation in telecommunication networks. Given the network topology, link capacity, routes of VP offered traffic and the condition that only one shortest VP could be chosen for each source-destination pair (single-VP), the algorithm is able to optimize the allocation of the bandwidth of VP in order to minimize the highest call blocking probability (CBP) of all the source-destination pairs. Based on the results obtained from the test-bed networks, we compare the performance of the algorithm with that of another classical optimal algorithm - "bisection algorithm" - and conclude that the former is more efficient under the condition of single-VP.
{"title":"An efficient optimal algorithm for virtual path bandwidth allocation","authors":"Maosong Luo, Wu Ye, Shengye Huang, Suili Feng, Zhaonan Li","doi":"10.1109/AINA.2003.1192926","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192926","url":null,"abstract":"This article presents an efficient optimal algorithm for virtual path (VP) bandwidth allocation in telecommunication networks. Given the network topology, link capacity, routes of VP offered traffic and the condition that only one shortest VP could be chosen for each source-destination pair (single-VP), the algorithm is able to optimize the allocation of the bandwidth of VP in order to minimize the highest call blocking probability (CBP) of all the source-destination pairs. Based on the results obtained from the test-bed networks, we compare the performance of the algorithm with that of another classical optimal algorithm - \"bisection algorithm\" - and conclude that the former is more efficient under the condition of single-VP.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"35 37","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941497","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.1192859
Junhui Zhao, Xiang Xie, Jingming Kuang
Distributed speech recognition (DSR) based on client-server mode means that the recognizer front-end is located in the terminal and is connected over a data network to a remote back-end recognition server. In this paper, we evaluate the distributed speech system in the client-server framework based on the ETSI AURORA platform for Chinese digit recognition and compare the performance of client-server mode with the server-only mode where speech is transmitted by using the GSM AMR encoder and all recognition processing is done at the server side. The recognition result shows that without consideration of channel error the DSR system based on client-server mode can achieve satisfactory recognition accuracy and the lowest hit rate in comparison with sever-only mode.
{"title":"The performance evaluation of distributed speech recognition for Chinese digits","authors":"Junhui Zhao, Xiang Xie, Jingming Kuang","doi":"10.1109/AINA.2003.1192859","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192859","url":null,"abstract":"Distributed speech recognition (DSR) based on client-server mode means that the recognizer front-end is located in the terminal and is connected over a data network to a remote back-end recognition server. In this paper, we evaluate the distributed speech system in the client-server framework based on the ETSI AURORA platform for Chinese digit recognition and compare the performance of client-server mode with the server-only mode where speech is transmitted by using the GSM AMR encoder and all recognition processing is done at the server side. The recognition result shows that without consideration of channel error the DSR system based on client-server mode can achieve satisfactory recognition accuracy and the lowest hit rate in comparison with sever-only mode.","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":"127666504","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.1192933
Min Sheng, Yan Shi, Jiandong Li
The wireless ad-hoc network is self-organizing. rapidly deployable and without fixed infrastructure. The hosts in ad-hoc networks communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing scheme so that any mobile host can transmit/receive data from any other host in the network. As we know, in terms of the way in which nodes obtain information, routing protocols for ad-hoc networks have been classified as table-driven and on-demand. In table-driven routing protocols, the interactive mode of the control message has a great effect on network performance. In this paper, a novel concept of "different interactive mode for different scale of network" is presented. The network performance is optimized by using appropriate periodical or nonperiodical interactive mode based on the scale of the network. A different interactive mode is given for different scales of the network by theoretical analysis and algorithm simulation. The simulation result is of great practicability.
{"title":"An analysis of the optimum interactive mode of control message for ad hoc mobile networks","authors":"Min Sheng, Yan Shi, Jiandong Li","doi":"10.1109/AINA.2003.1192933","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192933","url":null,"abstract":"The wireless ad-hoc network is self-organizing. rapidly deployable and without fixed infrastructure. The hosts in ad-hoc networks communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing scheme so that any mobile host can transmit/receive data from any other host in the network. As we know, in terms of the way in which nodes obtain information, routing protocols for ad-hoc networks have been classified as table-driven and on-demand. In table-driven routing protocols, the interactive mode of the control message has a great effect on network performance. In this paper, a novel concept of \"different interactive mode for different scale of network\" is presented. The network performance is optimized by using appropriate periodical or nonperiodical interactive mode based on the scale of the network. A different interactive mode is given for different scales of the network by theoretical analysis and algorithm simulation. The simulation result is of great practicability.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"40 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":"121452185","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.1192936
Jau-Ji Shen, Ming-Tsung Chen
The technologies of internetworking and databases have expedited the distributed database systems being implemented in the global information systems. But we cannot avoid the occurrence of random missing values in the process of gathering data. The research on association rules can effectively establish the relationship of attributes in databases containing missing values. While this technique is used to resolve the issues on replacing the missing values, the integrity of the methodology and the measurability of the quality can already be verified in related essays. However, the accuracy of replaced missing values in the database can only be satisfactory with specific criteria and a higher completion rate cannot yet be achieved. In other words, a given accuracy cannot be reached at the same time as resolving the database validity issues. Therefore, we propose a rule recycle technique, which reuses and composes the rules in order to retrieve more complete attribute value association rules. This will not only enable the database recovered to improve the accuracy and completion rate but also increase the validity of missing value completion.
{"title":"A recycle technique of association rule for missing value completion","authors":"Jau-Ji Shen, Ming-Tsung Chen","doi":"10.1109/AINA.2003.1192936","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192936","url":null,"abstract":"The technologies of internetworking and databases have expedited the distributed database systems being implemented in the global information systems. But we cannot avoid the occurrence of random missing values in the process of gathering data. The research on association rules can effectively establish the relationship of attributes in databases containing missing values. While this technique is used to resolve the issues on replacing the missing values, the integrity of the methodology and the measurability of the quality can already be verified in related essays. However, the accuracy of replaced missing values in the database can only be satisfactory with specific criteria and a higher completion rate cannot yet be achieved. In other words, a given accuracy cannot be reached at the same time as resolving the database validity issues. Therefore, we propose a rule recycle technique, which reuses and composes the rules in order to retrieve more complete attribute value association rules. This will not only enable the database recovered to improve the accuracy and completion rate but also increase the validity of missing value completion.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"53 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":"128546850","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.1192871
Ren-Junn Hwang, Sheng-Hua Shiau, Chih-Hua Lai
This paper proposes an efficient authentication key exchange protocol. The authentication key exchange is an important issue in information security and network security. It assures two parties to generate shared keys secretly. Many information security and network security techniques provide security based on this shared secret key. The proposed scheme generates multiple shared keys for two parties at a time. It does not only withstand general attacks, also provides perfect forward secrecy. By making comparisons with other method, it takes less computation time.
{"title":"An enhanced authentication key exchange protocol","authors":"Ren-Junn Hwang, Sheng-Hua Shiau, Chih-Hua Lai","doi":"10.1109/AINA.2003.1192871","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192871","url":null,"abstract":"This paper proposes an efficient authentication key exchange protocol. The authentication key exchange is an important issue in information security and network security. It assures two parties to generate shared keys secretly. Many information security and network security techniques provide security based on this shared secret key. The proposed scheme generates multiple shared keys for two parties at a time. It does not only withstand general attacks, also provides perfect forward secrecy. By making comparisons with other method, it takes less computation time.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"8 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":"128684545","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.1192897
T. Lai, Dong Zhou
The IEEE 802.11 standards support the peer-to-peer mode independent basic service set (IBSS), which is an ad hoc network with all its stations within each other's transmission range. In an IBSS, it is important that all stations are synchronized to a common clock. Synchronization is needed for frequency hopping and power saving. The synchronization mechanism specified in the IEEE 802.11 standards has a severe scalability problem. The probability that stations may get out of synchronization is pretty high in large IBSS. A new synchronization algorithm has been proposed for large-scale ad hoc networks. We propose a more efficient algorithm in this paper that synchronizes the clock more accurately. We are able to synchronize the clock within 100 /spl mu/s when the number of stations is more than 300. This is a big improvement over the current best algorithm and the 802.11 specified protocol. To our best knowledge, the current best algorithm can synchronize the clock within 550 /spl mu/s for a 300-station network. The 802.11 standard protocol can have clock drift over 5000 /spl mu/s for the same network.
{"title":"Efficient,and scalable IEEE 802.11 ad-hoc-mode timing synchronization function","authors":"T. Lai, Dong Zhou","doi":"10.1109/AINA.2003.1192897","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192897","url":null,"abstract":"The IEEE 802.11 standards support the peer-to-peer mode independent basic service set (IBSS), which is an ad hoc network with all its stations within each other's transmission range. In an IBSS, it is important that all stations are synchronized to a common clock. Synchronization is needed for frequency hopping and power saving. The synchronization mechanism specified in the IEEE 802.11 standards has a severe scalability problem. The probability that stations may get out of synchronization is pretty high in large IBSS. A new synchronization algorithm has been proposed for large-scale ad hoc networks. We propose a more efficient algorithm in this paper that synchronizes the clock more accurately. We are able to synchronize the clock within 100 /spl mu/s when the number of stations is more than 300. This is a big improvement over the current best algorithm and the 802.11 specified protocol. To our best knowledge, the current best algorithm can synchronize the clock within 550 /spl mu/s for a 300-station network. The 802.11 standard protocol can have clock drift over 5000 /spl mu/s for the same network.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"18 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":"116764095","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.1192862
Mingshu Wang, Jianhua Lu, Zucheng Zhou
In variable spreading length access code division multiple access (VSL-CDMA) systems, the performance of the group successive interference cancellation (GSIC) detector degrades significantly in fading channels, and the decorrelator is too complex to be used in practical systems. In this paper, we propose an improved hybrid interference cancellation scheme with adaptive group allocation (AHIC) for dual-rate VSL-CDMA systems. The proposed AHIC detector adaptively groups users based on their received power level. In this way, the high-rate users, especially the weak ones, would not be penalized by MAI from strong low-rate users. Simulation results have shown that the proposed AHIC scheme can achieve the best bit error rate (BER) performance with relatively low computational complexity.
{"title":"A novel interference cancellation receiver in VSL-CDMA systems","authors":"Mingshu Wang, Jianhua Lu, Zucheng Zhou","doi":"10.1109/AINA.2003.1192862","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192862","url":null,"abstract":"In variable spreading length access code division multiple access (VSL-CDMA) systems, the performance of the group successive interference cancellation (GSIC) detector degrades significantly in fading channels, and the decorrelator is too complex to be used in practical systems. In this paper, we propose an improved hybrid interference cancellation scheme with adaptive group allocation (AHIC) for dual-rate VSL-CDMA systems. The proposed AHIC detector adaptively groups users based on their received power level. In this way, the high-rate users, especially the weak ones, would not be penalized by MAI from strong low-rate users. Simulation results have shown that the proposed AHIC scheme can achieve the best bit error rate (BER) performance with relatively low computational complexity.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"6 3 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":"115730663","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.1192866
J. C. Hung, Chun-Chia Wang, Kuan-Cheng Lin, T. Shih, Hsuan-Pu Chang
With the rapid growth of the Internet and communication technologies, many real-world activities were applied on the Internet, including Education, Entertainment, Academic activities, and Commerce, etc. We proposed the nomadic media server (mobile media server) to achieve the maximum use of bandwidth. The distributed load of central server will be retrenched appropriately. At the same time, the security protection degree will be strengthened via the changeable server Actually, we use the mobile server/storage pre-broadcasting technique, as well as a communication network optimization algorithm, which is based on a graph compute mechanism. The mobile server will play an important role in the future virtual society, both on narrowband and broadband environment. Chain store over the Internet is a rare management model in electronic commerce. We construct many chain stores via using nomadic media server.
{"title":"Nomadic media server technology for supporting a new business model in e-commerce - chain store","authors":"J. C. Hung, Chun-Chia Wang, Kuan-Cheng Lin, T. Shih, Hsuan-Pu Chang","doi":"10.1109/AINA.2003.1192866","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192866","url":null,"abstract":"With the rapid growth of the Internet and communication technologies, many real-world activities were applied on the Internet, including Education, Entertainment, Academic activities, and Commerce, etc. We proposed the nomadic media server (mobile media server) to achieve the maximum use of bandwidth. The distributed load of central server will be retrenched appropriately. At the same time, the security protection degree will be strengthened via the changeable server Actually, we use the mobile server/storage pre-broadcasting technique, as well as a communication network optimization algorithm, which is based on a graph compute mechanism. The mobile server will play an important role in the future virtual society, both on narrowband and broadband environment. Chain store over the Internet is a rare management model in electronic commerce. We construct many chain stores via using nomadic media server.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"19 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":"127161491","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.1192861
Kaoru Sugita, A. Miyakawa, Y. Shibata
In Japan, there are traditional Japanese craftings such as fittings, furniture, textiles, etc., which are closely related to Japanese culture and life. The design of Japanese houses and their rooms is a very important problem to attract people. However, this design is not easy because people have different feelings. In order to deal with this problem, we have developed a Digital Traditional Japanese Crafting System (DTJCS) which provides a presentation space for traditional Japanese crafting. In this paper, we analyze the effect of room change of fittings to people's feelings using the presentation system.
{"title":"Relation between Kansei words and the room space in digital traditional Japanese crafting system","authors":"Kaoru Sugita, A. Miyakawa, Y. Shibata","doi":"10.1109/AINA.2003.1192861","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192861","url":null,"abstract":"In Japan, there are traditional Japanese craftings such as fittings, furniture, textiles, etc., which are closely related to Japanese culture and life. The design of Japanese houses and their rooms is a very important problem to attract people. However, this design is not easy because people have different feelings. In order to deal with this problem, we have developed a Digital Traditional Japanese Crafting System (DTJCS) which provides a presentation space for traditional Japanese crafting. In this paper, we analyze the effect of room change of fittings to people's feelings using the presentation system.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"25 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":"127228240","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
扫码关注我们
求助内容：
应助结果提醒方式：