Nowadays large collections of documents of various types of information are available on the Internet, and finding relevant information on the World Wide Web is becoming a critical issue. Available search engines mostly rely on information retrieval techniques in finding information. They lack the desired power in query formulation which is beyond the keywords search. We introduce a method for querying the Web data that integrates both search engine and database techniques to support more complex search requests and get more precise results.
{"title":"An ontology-based method for querying the Web data","authors":"Zhiqiang Zhang, Chunxiao Xing, Lizhu Zhou, Jianhua Feng","doi":"10.1109/AINA.2003.1192959","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192959","url":null,"abstract":"Nowadays large collections of documents of various types of information are available on the Internet, and finding relevant information on the World Wide Web is becoming a critical issue. Available search engines mostly rely on information retrieval techniques in finding information. They lack the desired power in query formulation which is beyond the keywords search. We introduce a method for querying the Web data that integrates both search engine and database techniques to support more complex search requests and get more precise results.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"107 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":"127327928","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.1192940
Hongxin Zhao, Hua Zhang, W. Hong
In this paper we present a low-cost direct-sequence spread-spectrum scheme for data communication over the 2.4 GHz ISM band. A prototype peer to peer system has been developed for evaluation, which includes complete short range microwave transceivers. Data rate up to 1 Mbit/s has been achieved. The RF front end is developed with commercially available MMIC chip set. The data-link MAC controller is realized with a commercial DSP chip, which highly improves the system versatility in various applications. The prototype system has the potential to support point-to-multi-point connections, it can be easily expanded to a compact low cost data exchange network without any modification in system hardware.
{"title":"A low cost microwave data link utilizing spread spectrum and DSP techniques","authors":"Hongxin Zhao, Hua Zhang, W. Hong","doi":"10.1109/AINA.2003.1192940","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192940","url":null,"abstract":"In this paper we present a low-cost direct-sequence spread-spectrum scheme for data communication over the 2.4 GHz ISM band. A prototype peer to peer system has been developed for evaluation, which includes complete short range microwave transceivers. Data rate up to 1 Mbit/s has been achieved. The RF front end is developed with commercially available MMIC chip set. The data-link MAC controller is realized with a commercial DSP chip, which highly improves the system versatility in various applications. The prototype system has the potential to support point-to-multi-point connections, it can be easily expanded to a compact low cost data exchange network without any modification in system hardware.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"34 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":"133937269","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.1193006
J. C. Hung, Kuan-Cheng Lin, A. Y. Chang, Nigel H. Lin, Louis H. Lin
We propose a behavior-based intrusion detection and response system for Internet worms called Lambent Anti-Worm System (LAWS). LAWS can detect the intruded services and influenced range automatically. Besides, it also can analyze the key information of the intrusion. We can prevent worm distribution and intrusion in advance via the information provided. In addition, to detecting and preventing the distribution of a well-known malicious worm, LAWS can also defend for future, unknown, or new malicious worms. Mobile agents will help LAWS to form a defense system for other LAW'S users over the Internet. The contribution of our system is to decrease the response time of attack and reduce the damaged range. At the same time, it also diminishes the damage and decreases the fixed cost.
我们提出了一种基于行为的网络蠕虫入侵检测和响应系统，称为Lambent Anti-Worm system (LAWS)。LAWS可以自动检测被入侵的业务和影响范围。此外，它还可以分析入侵的关键信息。我们可以通过提供的信息提前阻止蠕虫的传播和入侵。此外，除了检测和阻止已知恶意蠕虫的传播外，法律还可以防御未来、未知或新的恶意蠕虫。移动代理将帮助法律在互联网上为其他法律用户形成防御体系。该系统的贡献在于缩短了攻击的响应时间，减小了被破坏的范围。同时也减少了伤害，降低了固定成本。
{"title":"A behavior-based anti-worm system","authors":"J. C. Hung, Kuan-Cheng Lin, A. Y. Chang, Nigel H. Lin, Louis H. Lin","doi":"10.1109/AINA.2003.1193006","DOIUrl":"https://doi.org/10.1109/AINA.2003.1193006","url":null,"abstract":"We propose a behavior-based intrusion detection and response system for Internet worms called Lambent Anti-Worm System (LAWS). LAWS can detect the intruded services and influenced range automatically. Besides, it also can analyze the key information of the intrusion. We can prevent worm distribution and intrusion in advance via the information provided. In addition, to detecting and preventing the distribution of a well-known malicious worm, LAWS can also defend for future, unknown, or new malicious worms. Mobile agents will help LAWS to form a defense system for other LAW'S users over the Internet. The contribution of our system is to decrease the response time of attack and reduce the damaged range. At the same time, it also diminishes the damage and decreases the fixed cost.","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":"130975369","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.1192857
T. Ikenaga, K. Kawahara, T. Takine, Y. Oie
This paper proposes an analytical model for a delayed reservation scheme, which can be exactly analyzed. By applying it to a server-based QoS management network, we can obtain the related blocking probability and the waiting time distribution of requests, and discuss its performance by means of numerical results. The numerical results show that the delayed scheme can improve the blocking probability by about two orders of magnitude compared with the conventional reservation scheme even with a small acceptable waiting time (e.g. 20% of average flow duration). We can conclude that the delayed reservation scheme can lead to significant improvement in a server-based QoS management network performance.
{"title":"Analysis of delayed reservation scheme in server-based QoS management network","authors":"T. Ikenaga, K. Kawahara, T. Takine, Y. Oie","doi":"10.1109/AINA.2003.1192857","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192857","url":null,"abstract":"This paper proposes an analytical model for a delayed reservation scheme, which can be exactly analyzed. By applying it to a server-based QoS management network, we can obtain the related blocking probability and the waiting time distribution of requests, and discuss its performance by means of numerical results. The numerical results show that the delayed scheme can improve the blocking probability by about two orders of magnitude compared with the conventional reservation scheme even with a small acceptable waiting time (e.g. 20% of average flow duration). We can conclude that the delayed reservation scheme can lead to significant improvement in a server-based QoS management network performance.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"84 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":"115648799","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.1193005
Chinchen Chang, Y. Kuo, Chu-Hsing Lin
The multiplications of common multiplicands and exponentiations of large integers with large modulus are the primary computation operations in several well-known public key cryptosystems. The Hamming weight of the multiplier or the exponent plays an important role for computation efficiency. By performing complements, the Hamming weight of an integer can be reduced. Based on this concept, we propose efficient algorithms for common-multiplicand multiplications (CMM) and exponentiations. In the average case, it takes k/2+2/spl times/log(k)+5 k-bit additions to compute the CMM. For exponentiation, the proposed method takes 5k/4+2 multiplications on average, but the pre-computation for a modular multiplicative inverse is required. Combining the original CMM, the number of multiplications can further be reduced to 9k/8+2.
{"title":"Fast algorithms for common-multiplicand multiplication and exponentiation by performing complements","authors":"Chinchen Chang, Y. Kuo, Chu-Hsing Lin","doi":"10.1109/AINA.2003.1193005","DOIUrl":"https://doi.org/10.1109/AINA.2003.1193005","url":null,"abstract":"The multiplications of common multiplicands and exponentiations of large integers with large modulus are the primary computation operations in several well-known public key cryptosystems. The Hamming weight of the multiplier or the exponent plays an important role for computation efficiency. By performing complements, the Hamming weight of an integer can be reduced. Based on this concept, we propose efficient algorithms for common-multiplicand multiplications (CMM) and exponentiations. In the average case, it takes k/2+2/spl times/log(k)+5 k-bit additions to compute the CMM. For exponentiation, the proposed method takes 5k/4+2 multiplications on average, but the pre-computation for a modular multiplicative inverse is required. Combining the original CMM, the number of multiplications can further be reduced to 9k/8+2.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"177 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":"116040280","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}
The IEEE 802.11 standard and enhanced amendments have defined fourteen transmission rates (1/2/5.5/6/9/11/12/18/22/24/33/36/48/54 Mbit/s) for mobile stations to transmit and receive data frames. With the characteristic of modulation schemes, a higher level modulation scheme requires a higher signal-to-noise ratio (SNR) and, consequently, the data rate is inversely proportional with the transmission distance. Using a higher level modulation scheme, a higher network throughput can be expected; however, the frame error probability will also become higher. Doubtlessly, it is an open issue of selecting a proper modulation scheme for a pair of mobile stations in a time-varying indoor environment. This paper proposes a safe multiple access-rates transmission (SMART) scheme for enhancing the reliability of data transmission in the IEEE 802.11 multi-rate infrastructure wireless networks. The SMART scheme provides reliable transmission by reserving a retransmission period, which immediately follows the transmitted frame and is estimated from a lower transmission rate, for each transmitted frame. If any error occurs on the transmitted frame, the sender will retransmit it right away by using a lower transmission rate to make sure of successful retransmission. Otherwise, the reserved period will be taken by the access point (AP), which often has the longest waiting queue and is the bottleneck in infrastructure wireless networks. The efficiency of the proposed SMART scheme is evaluated by simulation. Simulation results show that the derived performance of the SMART scheme is significantly better than standard under the real environment with asymmetric traffic load.
{"title":"A safe multiple access-rates transmission (SMART) scheme for IEEE 802.11 wireless networks","authors":"Shiann-Tsong Sheu, Jenhui Chen, Hsueh-Wen Tseng, Hsien-Ta Chiang","doi":"10.1109/AINA.2003.1192864","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192864","url":null,"abstract":"The IEEE 802.11 standard and enhanced amendments have defined fourteen transmission rates (1/2/5.5/6/9/11/12/18/22/24/33/36/48/54 Mbit/s) for mobile stations to transmit and receive data frames. With the characteristic of modulation schemes, a higher level modulation scheme requires a higher signal-to-noise ratio (SNR) and, consequently, the data rate is inversely proportional with the transmission distance. Using a higher level modulation scheme, a higher network throughput can be expected; however, the frame error probability will also become higher. Doubtlessly, it is an open issue of selecting a proper modulation scheme for a pair of mobile stations in a time-varying indoor environment. This paper proposes a safe multiple access-rates transmission (SMART) scheme for enhancing the reliability of data transmission in the IEEE 802.11 multi-rate infrastructure wireless networks. The SMART scheme provides reliable transmission by reserving a retransmission period, which immediately follows the transmitted frame and is estimated from a lower transmission rate, for each transmitted frame. If any error occurs on the transmitted frame, the sender will retransmit it right away by using a lower transmission rate to make sure of successful retransmission. Otherwise, the reserved period will be taken by the access point (AP), which often has the longest waiting queue and is the bottleneck in infrastructure wireless networks. The efficiency of the proposed SMART scheme is evaluated by simulation. Simulation results show that the derived performance of the SMART scheme is significantly better than standard under the real environment with asymmetric traffic load.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"56 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":"122762952","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.1192887
Baoning Li, Toru Abe, K. Sugawara, Tetsuo Kinoshita
To reduce the burden for users that utilize information from distributed information resources, the deployment of distributed active information resource (AIR) is proposed. An AIR is a information resource that is enhanced with the knowledge of the content and the functionality for actively and flexibly supporting use/reuse of the content. Multiple AIRs could cooperate actively and automatically to target the proper information resources, carry out complex information processing and then provide composite result. In this paper the concept and main use of AIR are discussed. Also, the construction and information processing of AIR, as well as an experimental implementation of agent-based AIR system, are introduced.
{"title":"Active information resource: design concept and example","authors":"Baoning Li, Toru Abe, K. Sugawara, Tetsuo Kinoshita","doi":"10.1109/AINA.2003.1192887","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192887","url":null,"abstract":"To reduce the burden for users that utilize information from distributed information resources, the deployment of distributed active information resource (AIR) is proposed. An AIR is a information resource that is enhanced with the knowledge of the content and the functionality for actively and flexibly supporting use/reuse of the content. Multiple AIRs could cooperate actively and automatically to target the proper information resources, carry out complex information processing and then provide composite result. In this paper the concept and main use of AIR are discussed. Also, the construction and information processing of AIR, as well as an experimental implementation of agent-based AIR system, are introduced.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"109 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":"122933873","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.1193010
Huey-Ing Liu, Yiyung Li
An ad hoc system with high topology changing rate makes routing extremely unstable. However stability is an important issue, especially for designing a routing with QoS provision. Recently, the availability of small, inexpensive, and low-power GPS receivers realizes location based routing for ad hoc networks. With the help of location information, the routing stability is significantly improved. The paper investigates the QoS routing problem in ad hoc networks. We propose a location based routing protocol with QoS provision. The proposed scheme, named QoS-GRID, considers a two-tier-grid system configuration to reduce each mobile transmission power so as to enhance the bandwidth utilization. Simulation results show that QoS-GRID establishes a stable QoS guaranteed route and meanwhile saves bandwidth.
{"title":"A location based QoS routing protocol for ad hoc networks","authors":"Huey-Ing Liu, Yiyung Li","doi":"10.1109/AINA.2003.1193010","DOIUrl":"https://doi.org/10.1109/AINA.2003.1193010","url":null,"abstract":"An ad hoc system with high topology changing rate makes routing extremely unstable. However stability is an important issue, especially for designing a routing with QoS provision. Recently, the availability of small, inexpensive, and low-power GPS receivers realizes location based routing for ad hoc networks. With the help of location information, the routing stability is significantly improved. The paper investigates the QoS routing problem in ad hoc networks. We propose a location based routing protocol with QoS provision. The proposed scheme, named QoS-GRID, considers a two-tier-grid system configuration to reduce each mobile transmission power so as to enhance the bandwidth utilization. Simulation results show that QoS-GRID establishes a stable QoS guaranteed route and meanwhile saves bandwidth.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"254 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":"121072312","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.1192841
Jung-Shyr Wu, Peir-Yuan Wang
The paper presents the performance modeling, analysis, and simulation of SIP-T (Session Initiation Protocol for Telephones) signaling system in carrier class VoIP (Voice over IP) network. The SIP-T signaling system defined in IETF (Internet Engineering Task Force) draft is a mechanism that uses SIP (Session Initiation Protocol) to facilitate the interconnection of PSTN with carrier class VoIP network. Based on IETF, the SIP-T signaling system not only promises scalability, flexibility, and interoperability with PSTN but also provides call control function of MGC (media gateway controller) to set up, tear down, and manage VoIP calls in carrier class VoIP network. In this paper, we analyze the queueing size (i.e. buffer size), the mean of queueing delay, and the variance of queueing delay of SIP-T signaling system that are the major performance evaluation parameters for improving QoS (quality of service) and system performance of MGC in carrier class VoIP network focused on toll by-pass or tandem by-pass of PSTN. First, we assume a mathematical model of the M/G/1 queue with non-preemptive priority assignment to represent SIP-T signaling system. Second, we present the formulas of queueing size, queueing delay, and delay variation for the nonpreemptive priority queue by queueing theory respectively. Besides, some numerical examples of queueing size, queueing delay, and delay variation are presented as well. Finally, the theoretical estimates are shown to be in excellent consistency with simulation results.
{"title":"The performance analysis of SIP-T signaling system in carrier class VoIP network","authors":"Jung-Shyr Wu, Peir-Yuan Wang","doi":"10.1109/AINA.2003.1192841","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192841","url":null,"abstract":"The paper presents the performance modeling, analysis, and simulation of SIP-T (Session Initiation Protocol for Telephones) signaling system in carrier class VoIP (Voice over IP) network. The SIP-T signaling system defined in IETF (Internet Engineering Task Force) draft is a mechanism that uses SIP (Session Initiation Protocol) to facilitate the interconnection of PSTN with carrier class VoIP network. Based on IETF, the SIP-T signaling system not only promises scalability, flexibility, and interoperability with PSTN but also provides call control function of MGC (media gateway controller) to set up, tear down, and manage VoIP calls in carrier class VoIP network. In this paper, we analyze the queueing size (i.e. buffer size), the mean of queueing delay, and the variance of queueing delay of SIP-T signaling system that are the major performance evaluation parameters for improving QoS (quality of service) and system performance of MGC in carrier class VoIP network focused on toll by-pass or tandem by-pass of PSTN. First, we assume a mathematical model of the M/G/1 queue with non-preemptive priority assignment to represent SIP-T signaling system. Second, we present the formulas of queueing size, queueing delay, and delay variation for the nonpreemptive priority queue by queueing theory respectively. Besides, some numerical examples of queueing size, queueing delay, and delay variation are presented as well. Finally, the theoretical estimates are shown to be in excellent consistency with simulation results.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"23 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":"125175366","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.1192895
Marie Thilliez, T. Delot, S. Lecomte, N. Bennani
The recent emergence of handheld devices and wireless networks has implied an exponential increase of terminals users. So, today, service providers have to propose new applications adapted to mobile environments. In this paper, we propose and describe a new class of distributed applications called the proximity applications. In such applications, two or more handheld devices, physically close to each other, can communicate and exchange data in a secure way. Proximity applications rely on the use of both different mobile devices and heterogeneous wireless networks. Thus, these applications need a high degree of flexibility, for an easy and rapid application development. In this context, our purpose is to study the interest of the Hybrid Peer-To-Peer (P2P) architecture model use specially for the extensibility, the fault-tolerance management and the scalability of proximity applications. Moreover, thanks to this model, proximity applications can easily face to the heterogeneity of devices and networks.
{"title":"Hybrid peer-to-peer model in proximity applications","authors":"Marie Thilliez, T. Delot, S. Lecomte, N. Bennani","doi":"10.1109/AINA.2003.1192895","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192895","url":null,"abstract":"The recent emergence of handheld devices and wireless networks has implied an exponential increase of terminals users. So, today, service providers have to propose new applications adapted to mobile environments. In this paper, we propose and describe a new class of distributed applications called the proximity applications. In such applications, two or more handheld devices, physically close to each other, can communicate and exchange data in a secure way. Proximity applications rely on the use of both different mobile devices and heterogeneous wireless networks. Thus, these applications need a high degree of flexibility, for an easy and rapid application development. In this context, our purpose is to study the interest of the Hybrid Peer-To-Peer (P2P) architecture model use specially for the extensibility, the fault-tolerance management and the scalability of proximity applications. Moreover, thanks to this model, proximity applications can easily face to the heterogeneity of devices and networks.","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":"127435077","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
扫码关注我们
求助内容：
应助结果提醒方式：