Pub Date : 2004-03-29DOI: 10.1109/AINA.2004.1283913
A. Waluyo, B. Srinivasan, D. Taniar
Data broadcasting strategy is known as a scalable way to disseminate information to mobile users. However, with a very large set of broadcast items, the query access time of mobile clients raise accordingly, due to high waiting time for mobile clients to find their data of interest. One possible solution is to split the database information into several broadcast channels. In this paper, we introduce taxonomy of index dissemination for multibroadcast channel based on B* tree structure. We consider three indexing schemes namely: (i) nonreplicated indexing scheme (NRI), (ii) partially-replicated indexing scheme (PRI), and (iii) fully-replicated indexing scheme (FRI). Simulation model is developed to find out the access time performance of each scheme.
{"title":"A taxonomy of broadcast indexing schemes for multi channel data dissemination in mobile databases","authors":"A. Waluyo, B. Srinivasan, D. Taniar","doi":"10.1109/AINA.2004.1283913","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283913","url":null,"abstract":"Data broadcasting strategy is known as a scalable way to disseminate information to mobile users. However, with a very large set of broadcast items, the query access time of mobile clients raise accordingly, due to high waiting time for mobile clients to find their data of interest. One possible solution is to split the database information into several broadcast channels. In this paper, we introduce taxonomy of index dissemination for multibroadcast channel based on B* tree structure. We consider three indexing schemes namely: (i) nonreplicated indexing scheme (NRI), (ii) partially-replicated indexing scheme (PRI), and (iii) fully-replicated indexing scheme (FRI). Simulation model is developed to find out the access time performance of each scheme.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"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":"114883342","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.1283952
Frederico Borelli, A. Lopes, Glêdson Elias da Silveira
A middleware for interactive digital television systems should harmonize and abstract discrepancies related to hardware and operating systems issues. In such a context, this paper describes an XML-based model for specifying components of an adaptive middleware for interactive digital television systems, in which component specifications play a fundamental role during negotiation, configuration and management of middleware components and resources.
{"title":"An XML-based component specification model for an adaptive middleware of interactive digital television systems","authors":"Frederico Borelli, A. Lopes, Glêdson Elias da Silveira","doi":"10.1109/AINA.2004.1283952","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283952","url":null,"abstract":"A middleware for interactive digital television systems should harmonize and abstract discrepancies related to hardware and operating systems issues. In such a context, this paper describes an XML-based model for specifying components of an adaptive middleware for interactive digital television systems, in which component specifications play a fundamental role during negotiation, configuration and management of middleware components and resources.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"116 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":"126003779","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.1283891
TheinLai Wong, Tatsuhiro Tsuchiya, T. Kikuno
This paper proposes a self-organizing technique for enhancing the coverage of wireless micro-sensor networks after an initial random placement of sensors. A randomized back-off delay time is introduced to resolve the problem of simultaneous movement of sensors in the neighborhood which leads to unnecessary excessive movement and hence consume more sensors' energy. A sensor node relocates itself when the time calculated through randomized back-off delay computation is reached. The new location of the sensor is determined by a virtual force-directed algorithm where virtual attractive or repulsive forces exerted by other sensors or obstacles are used to guide the sensor to the desired location. The proposed self-organizing algorithm for sensor placement is proved to be effective through simulation.
{"title":"A self-organizing technique for sensor placement in wireless micro-sensor networks","authors":"TheinLai Wong, Tatsuhiro Tsuchiya, T. Kikuno","doi":"10.1109/AINA.2004.1283891","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283891","url":null,"abstract":"This paper proposes a self-organizing technique for enhancing the coverage of wireless micro-sensor networks after an initial random placement of sensors. A randomized back-off delay time is introduced to resolve the problem of simultaneous movement of sensors in the neighborhood which leads to unnecessary excessive movement and hence consume more sensors' energy. A sensor node relocates itself when the time calculated through randomized back-off delay computation is reached. The new location of the sensor is determined by a virtual force-directed algorithm where virtual attractive or repulsive forces exerted by other sensors or obstacles are used to guide the sensor to the desired location. The proposed self-organizing algorithm for sensor placement is proved to be effective through simulation.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"119 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":"126006329","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.1283791
Chen Chen, Jiandong Li, Gang Han, Min Sheng
One of the principal disadvantages of orthogonal frequency division multiplexing (OFDM) is very sensitive to frequency offset. Carrier frequency offset can be divided into two parts: an integer one and a fractional one. The integer frequency offset has no effect on the orthogonality among the subcarriers, however causes a circular shift of the received data symbols, resulting in a BER of 0.5. The maximum likelihood (ML) estimation algorithm of the integer frequency offset is derived under the assumption that the channel impairments only consist of additive noise. Simulation results show that it can perform well even in a time-dispersive channel. Its performance is assessed and compared with the conventional method by computer simulations for the additive white Gaussian noise (AWGN) channel and a multipath fading channel.
{"title":"Maximum likelihood estimation of integer frequency offset for OFDM","authors":"Chen Chen, Jiandong Li, Gang Han, Min Sheng","doi":"10.1109/AINA.2004.1283791","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283791","url":null,"abstract":"One of the principal disadvantages of orthogonal frequency division multiplexing (OFDM) is very sensitive to frequency offset. Carrier frequency offset can be divided into two parts: an integer one and a fractional one. The integer frequency offset has no effect on the orthogonality among the subcarriers, however causes a circular shift of the received data symbols, resulting in a BER of 0.5. The maximum likelihood (ML) estimation algorithm of the integer frequency offset is derived under the assumption that the channel impairments only consist of additive noise. Simulation results show that it can perform well even in a time-dispersive channel. Its performance is assessed and compared with the conventional method by computer simulations for the additive white Gaussian noise (AWGN) channel and a multipath fading channel.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"31 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":"125182035","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.1283829
Jing Liu, Jiandong Li, Yanhui Chen, Xiaoyan Sun
A multiple access control (MAC) protocol - user adaptive scheduling multiple access (UASMA) protocol is proposed in this paper, which can perfectly schedule the packet transmission according to the exact number of active mobile terminals (MTs) determined by self-organizing algorithm, and adjust the number of packets sending by one node in one frame properly. UASMA protocol employs an especial frame structure, which makes it possible to allocate channel resource to uplink and downlink traffic according o their respective service requirements. And the concept of referenced-frame-length is proposed, which can ensure the frame length various in a certain range, and consequently increase the utilization of the channel greatly. Meanwhile, UASMA protocol uses an efficient collision resolution algorithm to guarantee that active MTs can access the channel rapidly. Finally, the performance of UASMA protocol is evaluated by simulation and compared with UPMA protocol, the simulation results show that the former has better performance than the latter.
{"title":"A user adaptive scheduling multiple access protocol","authors":"Jing Liu, Jiandong Li, Yanhui Chen, Xiaoyan Sun","doi":"10.1109/AINA.2004.1283829","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283829","url":null,"abstract":"A multiple access control (MAC) protocol - user adaptive scheduling multiple access (UASMA) protocol is proposed in this paper, which can perfectly schedule the packet transmission according to the exact number of active mobile terminals (MTs) determined by self-organizing algorithm, and adjust the number of packets sending by one node in one frame properly. UASMA protocol employs an especial frame structure, which makes it possible to allocate channel resource to uplink and downlink traffic according o their respective service requirements. And the concept of referenced-frame-length is proposed, which can ensure the frame length various in a certain range, and consequently increase the utilization of the channel greatly. Meanwhile, UASMA protocol uses an efficient collision resolution algorithm to guarantee that active MTs can access the channel rapidly. Finally, the performance of UASMA protocol is evaluated by simulation and compared with UPMA protocol, the simulation results show that the former has better performance than the latter.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"11 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":"122196659","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.1283979
Xin Xiang, Yuanchun Shi, Ling Guo
With the development of networking technologies and the advent of the peer-to-peer computing paradigm, distributed file-sharing systems like Gnutella are becoming prevalent over time. JXTA, an interoperable and platform independent peer-to-peer computing infrastructure, has been adopted in an increasing number of network applications providing file-sharing and cooperative service. In this paper, we propose the metadata search layer which serves as an enhancement to the CMS (content manager service), a JXTA-based file-sharing service. Through the metadata search layer, more precise search of resources could be conducted as opposed to the inflexible keyword-based search mechanism employed in most of current file-sharing applications in use. A compact general-purpose query language is proposed to facilitate the use of standard metadata schema and bridge the gap between users and metadata descriptions of resources. We exemplify the advantage of the metadata-based search mechanism over the traditional keyword search with a proof-of-concept application.
{"title":"Rich metadata searches using the JXTA content manager service","authors":"Xin Xiang, Yuanchun Shi, Ling Guo","doi":"10.1109/AINA.2004.1283979","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283979","url":null,"abstract":"With the development of networking technologies and the advent of the peer-to-peer computing paradigm, distributed file-sharing systems like Gnutella are becoming prevalent over time. JXTA, an interoperable and platform independent peer-to-peer computing infrastructure, has been adopted in an increasing number of network applications providing file-sharing and cooperative service. In this paper, we propose the metadata search layer which serves as an enhancement to the CMS (content manager service), a JXTA-based file-sharing service. Through the metadata search layer, more precise search of resources could be conducted as opposed to the inflexible keyword-based search mechanism employed in most of current file-sharing applications in use. A compact general-purpose query language is proposed to facilitate the use of standard metadata schema and bridge the gap between users and metadata descriptions of resources. We exemplify the advantage of the metadata-based search mechanism over the traditional keyword search with a proof-of-concept application.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"24 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":"123554926","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.1283824
Weidang Zhang, Cong Yuan, M. Lee, Rong Sun, Xinmei Wang
The sensitivities of the bits of low weight codewords in turbo codes to noises are discussed firstly and the result is that the lower weight the higher sensitivity. Theoretical analysis shows that through the protections on such key-bits which have high sensitivities; the minimal weight of the codes can be improved apparently. The simulations also give out the supported results: The BER could be highly improved at high Eb/N0 for code rates both 1/3 and 1/2.
{"title":"The key-bits in turbo codes and their protections","authors":"Weidang Zhang, Cong Yuan, M. Lee, Rong Sun, Xinmei Wang","doi":"10.1109/AINA.2004.1283824","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283824","url":null,"abstract":"The sensitivities of the bits of low weight codewords in turbo codes to noises are discussed firstly and the result is that the lower weight the higher sensitivity. Theoretical analysis shows that through the protections on such key-bits which have high sensitivities; the minimal weight of the codes can be improved apparently. The simulations also give out the supported results: The BER could be highly improved at high Eb/N0 for code rates both 1/3 and 1/2.","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":"124646946","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.1283963
Hui-Huang Hsu, T. Shih, Louis H. Lin, Rong-Chi Chang, Huei-Fa Li
Progressive image transmission (PIT) transmits the most significant portion of a picture, followed by less important parts. The mechanism can be used in Web-based applications, while users are browsing images. Most PIT methods use the same pixel interpolation scheme for the entire picture, without considering the differences in different portions. We test several strategic decomposition mechanisms. Our contribution results in an adaptive image transmission mechanism, which takes the differences of pictures and picture portions into consideration. We tested 1500 pictures in different categories and parameters. The overall bit rates can be reduced significantly, with good PSNR values. An error recovery procedure is also implemented to guarantee the transmitted pictures that can be fully recovered.
{"title":"Adaptive image transmission by strategic decomposition","authors":"Hui-Huang Hsu, T. Shih, Louis H. Lin, Rong-Chi Chang, Huei-Fa Li","doi":"10.1109/AINA.2004.1283963","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283963","url":null,"abstract":"Progressive image transmission (PIT) transmits the most significant portion of a picture, followed by less important parts. The mechanism can be used in Web-based applications, while users are browsing images. Most PIT methods use the same pixel interpolation scheme for the entire picture, without considering the differences in different portions. We test several strategic decomposition mechanisms. Our contribution results in an adaptive image transmission mechanism, which takes the differences of pictures and picture portions into consideration. We tested 1500 pictures in different categories and parameters. The overall bit rates can be reduced significantly, with good PSNR values. An error recovery procedure is also implemented to guarantee the transmitted pictures that can be fully recovered.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"30 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":"124715001","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.1283917
Ying Weng, C. Hou
Controlled sharing of the wireless link by different packet streams is critical in transporting multimedia traffic across wireless networks. Consequently, it has been treated as providing support for quality of service (QoS) in medium access control (MAC) protocols. This paper proposes a distributed class-based access scheme whose allocation policy adopts token passing packet scheduling, designed to handle efficiently different service classes of traffic in heavy load wireless networks. The traffic is divided into three classes by QoS specifications and packet characteristics, and served with asymmetric exhaustive discipline. The probability generating function based on embedded Markov chain for this discrete-time system is derived. We employ basic queuing analysis methodologies, calculate the average buffer size of each class queue at polling instants and then apply Little's law to find the average delay. Experiments are conducted to validate the new strategy, and the performance is analyzed and evaluated. Finally, we visualize and compare how the relative variable parameters effect on system characteristics.
{"title":"Multimedia wireless link controlled sharing with class-based packet scheduling","authors":"Ying Weng, C. Hou","doi":"10.1109/AINA.2004.1283917","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283917","url":null,"abstract":"Controlled sharing of the wireless link by different packet streams is critical in transporting multimedia traffic across wireless networks. Consequently, it has been treated as providing support for quality of service (QoS) in medium access control (MAC) protocols. This paper proposes a distributed class-based access scheme whose allocation policy adopts token passing packet scheduling, designed to handle efficiently different service classes of traffic in heavy load wireless networks. The traffic is divided into three classes by QoS specifications and packet characteristics, and served with asymmetric exhaustive discipline. The probability generating function based on embedded Markov chain for this discrete-time system is derived. We employ basic queuing analysis methodologies, calculate the average buffer size of each class queue at polling instants and then apply Little's law to find the average delay. Experiments are conducted to validate the new strategy, and the performance is analyzed and evaluated. Finally, we visualize and compare how the relative variable parameters effect on system characteristics.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"72 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":"114957879","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.1283916
K. Chu, Karl R. P. H. Leung, J. Ng, Chun-hung Li
Recently, mobile location estimation is drawing considerable attention in the field of wireless communications. Among different mobile location estimation methods, the one which estimates the location of mobile stations with reference to the wave propagation model is drawing much attention. This approach, in principle, makes use of the most primitive property of wave propagation - signal strength, to perform location estimation. Hence this approach should be able to apply to different kinds of cellular network. We found out that in estimating mobile location with reference to signal strength, the azimuth gain of directional antenna and environmental factors can help to improve the accuracy. In this paper, we report our study of a directional propagation model (DPM) which enhanced the traditional propagation model with these factors. We experimented our model with 3,703 sets of real life data collected from a major mobile phone operator of Hong Kong. Results show that the DPM models have significant improvement over other existing location methods in terms of accuracy and stability.
{"title":"Locating mobile stations with statistical directional propagation model","authors":"K. Chu, Karl R. P. H. Leung, J. Ng, Chun-hung Li","doi":"10.1109/AINA.2004.1283916","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283916","url":null,"abstract":"Recently, mobile location estimation is drawing considerable attention in the field of wireless communications. Among different mobile location estimation methods, the one which estimates the location of mobile stations with reference to the wave propagation model is drawing much attention. This approach, in principle, makes use of the most primitive property of wave propagation - signal strength, to perform location estimation. Hence this approach should be able to apply to different kinds of cellular network. We found out that in estimating mobile location with reference to signal strength, the azimuth gain of directional antenna and environmental factors can help to improve the accuracy. In this paper, we report our study of a directional propagation model (DPM) which enhanced the traditional propagation model with these factors. We experimented our model with 3,703 sets of real life data collected from a major mobile phone operator of Hong Kong. Results show that the DPM models have significant improvement over other existing location methods in terms of accuracy and stability.","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":"131228864","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
扫码关注我们
求助内容：
应助结果提醒方式：