Source localization is a challenging issue for multisensor multitarget detection, tracking and estimation problems in wireless distributed sensor networks. In this paper, a novel source localization method, called passive source localization using power spectral analysis and decision fusion in wireless distributed sensor networks is presented. This includes an energy decay model for acoustic signals. The new method is computationally efficient and requires less bandwidth compared with current methods by making localization decisions at individual nodes and performing decision fusion at the manager node. This eliminates the requirement of sophisticated synchronization. A simulation of the proposed method is performed using different numbers of sources and sensor nodes. Simulation results confirmed the improved performance of this method under ideal and noisy conditions.
{"title":"Passive source localization using power spectral analysis and decision fusion in wireless distributed sensor networks","authors":"M. Z. Rahman, G. Karmakar, L. Dooley, G. Karmakar","doi":"10.1109/ITCC.2005.225","DOIUrl":"https://doi.org/10.1109/ITCC.2005.225","url":null,"abstract":"Source localization is a challenging issue for multisensor multitarget detection, tracking and estimation problems in wireless distributed sensor networks. In this paper, a novel source localization method, called passive source localization using power spectral analysis and decision fusion in wireless distributed sensor networks is presented. This includes an energy decay model for acoustic signals. The new method is computationally efficient and requires less bandwidth compared with current methods by making localization decisions at individual nodes and performing decision fusion at the manager node. This eliminates the requirement of sophisticated synchronization. A simulation of the proposed method is performed using different numbers of sources and sensor nodes. Simulation results confirmed the improved performance of this method under ideal and noisy conditions.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133751648","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 idea developed in this paper is the creation of standard information retrieval modules in a distributed manner in order to create testing systems to validate methods and algorithms. An investigator in information retrieval can construct a retrieval test system just by integrating different modules and manipulating the input variables of each module.
{"title":"Web services for information retrieval","authors":"J. Ferreira, A. Silva, J. Delgado","doi":"10.1109/ITCC.2005.297","DOIUrl":"https://doi.org/10.1109/ITCC.2005.297","url":null,"abstract":"The idea developed in this paper is the creation of standard information retrieval modules in a distributed manner in order to create testing systems to validate methods and algorithms. An investigator in information retrieval can construct a retrieval test system just by integrating different modules and manipulating the input variables of each module.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125686322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the paper, we propose a media access framework for supporting integrated service including the real-time service, the controlled load service, and the best effort service in wireless networks. Three medium access mechanisms, the "Multi-classes fair scheduling", the "Single-class fair scheduling + DCF", and the "Single-class fair scheduling + DCF with threshold for controlled load service" are proposed in the paper to manage the traffic within a piconet. Moreover, a measurement based admission control algorithm is proposed to guarantee the QoS requirements for the requests. We compare the performance of the proposed access mechanisms by conducting simulations. The simulation results show that the "Multi-classes fair scheduling " mechanism is the best choice for the networks occupied by the real-time service; the "Single-class fair scheduling + DCF with threshold for controlled service" mechanism is the best for controlled service in general case.
{"title":"Media access mechanisms for integrated services in wireless networks","authors":"Sheng-Tzong Cheng, Ming-Hung Tao, Mingzoo Wu","doi":"10.1109/ITCC.2005.191","DOIUrl":"https://doi.org/10.1109/ITCC.2005.191","url":null,"abstract":"In the paper, we propose a media access framework for supporting integrated service including the real-time service, the controlled load service, and the best effort service in wireless networks. Three medium access mechanisms, the \"Multi-classes fair scheduling\", the \"Single-class fair scheduling + DCF\", and the \"Single-class fair scheduling + DCF with threshold for controlled load service\" are proposed in the paper to manage the traffic within a piconet. Moreover, a measurement based admission control algorithm is proposed to guarantee the QoS requirements for the requests. We compare the performance of the proposed access mechanisms by conducting simulations. The simulation results show that the \"Multi-classes fair scheduling \" mechanism is the best choice for the networks occupied by the real-time service; the \"Single-class fair scheduling + DCF with threshold for controlled service\" mechanism is the best for controlled service in general case.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125217922","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}
We show the design of a network processing system in an IPv6 based media gateway based on abstract state machine (ASM) logic and show how the design features may help in scalability realization for end-to-end QoS issues in next generation networks. The novelty of the approach lies in the formal algorithmic definition of the processing hardware and generation of physical design unit from the data-driven algorithm function computation at compile time. The design in this paper is used to build an implementation prototype of an IPv6 media gateway with a feature of MPEG4 BIFS-MPEG4 LASeR transcoding, standardization activities of which are being currently pursued at the ISO MPEG MDS.
{"title":"Abstract state machine based next generation IPv6 network","authors":"D. Guha, Qonita M. Shahab, J. Choi","doi":"10.1109/ITCC.2005.56","DOIUrl":"https://doi.org/10.1109/ITCC.2005.56","url":null,"abstract":"We show the design of a network processing system in an IPv6 based media gateway based on abstract state machine (ASM) logic and show how the design features may help in scalability realization for end-to-end QoS issues in next generation networks. The novelty of the approach lies in the formal algorithmic definition of the processing hardware and generation of physical design unit from the data-driven algorithm function computation at compile time. The design in this paper is used to build an implementation prototype of an IPv6 media gateway with a feature of MPEG4 BIFS-MPEG4 LASeR transcoding, standardization activities of which are being currently pursued at the ISO MPEG MDS.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125303752","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}
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-add-subtract) is modified so that the processor performs the same operations for every 3 bits of the scalar k independent of the bit pattern of the 3 bits. Therefore, it is not possible to extract the key pattern using a timing attack. The data flow graph of the modified algorithm is derived and the underlying Galois field operators are scheduled so that the point multiplication delay is minimized. The architecture of this processor is based on the Galois field of GF(2n) and the bit-serial field multiplier and squarer are designed. The processor is configurable for any value of n and the delay of point multiplication is [18(n+3) + (n+3)/2 + 1]/spl times/(n/3) clock cycles. For the case of GF(2/sup 163/) the point multiplication delay is 165888 clock cycles.
{"title":"A scalable and high performance elliptic curve processor with resistance to timing attacks","authors":"A. Hodjat, D. Hwang, I. Verbauwhede","doi":"10.1109/ITCC.2005.32","DOIUrl":"https://doi.org/10.1109/ITCC.2005.32","url":null,"abstract":"This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-add-subtract) is modified so that the processor performs the same operations for every 3 bits of the scalar k independent of the bit pattern of the 3 bits. Therefore, it is not possible to extract the key pattern using a timing attack. The data flow graph of the modified algorithm is derived and the underlying Galois field operators are scheduled so that the point multiplication delay is minimized. The architecture of this processor is based on the Galois field of GF(2n) and the bit-serial field multiplier and squarer are designed. The processor is configurable for any value of n and the delay of point multiplication is [18(n+3) + (n+3)/2 + 1]/spl times/(n/3) clock cycles. For the case of GF(2/sup 163/) the point multiplication delay is 165888 clock cycles.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132333320","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}
Pervasive systems are created by introducing wireless communication into distributed multimedia systems. These systems facilitate mobile data access to applications such as health care, tourism and emergency. However new challenges have emerged that has not been adequately addressed in traditional distributed multimedia systems. In pervasive systems, data must be adapted to the user's preferences, device capabilities and network conditions. Several content adaptation techniques have been proposed to fit the data to the usage environment. In this paper we present a distributed content adaptation framework (DCAF) for distributed multimedia systems and its prototype implementation. The architecture takes into consideration client profile, network conditions, content profile (meta-data) and available adaptation services (third party software elements) to construct an optimal dynamic adaptation graph.
{"title":"Distributed content adaptation for pervasive systems","authors":"Girma Berhe, L. Brunie, J. Pierson","doi":"10.1109/ITCC.2005.133","DOIUrl":"https://doi.org/10.1109/ITCC.2005.133","url":null,"abstract":"Pervasive systems are created by introducing wireless communication into distributed multimedia systems. These systems facilitate mobile data access to applications such as health care, tourism and emergency. However new challenges have emerged that has not been adequately addressed in traditional distributed multimedia systems. In pervasive systems, data must be adapted to the user's preferences, device capabilities and network conditions. Several content adaptation techniques have been proposed to fit the data to the usage environment. In this paper we present a distributed content adaptation framework (DCAF) for distributed multimedia systems and its prototype implementation. The architecture takes into consideration client profile, network conditions, content profile (meta-data) and available adaptation services (third party software elements) to construct an optimal dynamic adaptation graph.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134483811","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}
Zhiwen Yu, Xingshe Zhou, Daqing Zhang, A. Lugmayr, Zhiyong Yu
The ubiquitous computing environment and users' demand for multimedia personalization precipitate a need for ubiquitous personalized multimedia services (UPMSs). Delivering UPMSs is very complex because of diverse device capabilities, dynamic network characteristics, etc. This paper proposes a lifecycle management model based on FSM (finite state machines) for ubiquitous personalized multimedia services (UPMSs). By using this model, the management of UPMSs is very clear and easy, and the services are delivered more efficiently, effectively, and robustly.
{"title":"A ubiquitous personalized multimedia service model based on FSM","authors":"Zhiwen Yu, Xingshe Zhou, Daqing Zhang, A. Lugmayr, Zhiyong Yu","doi":"10.1109/ITCC.2005.51","DOIUrl":"https://doi.org/10.1109/ITCC.2005.51","url":null,"abstract":"The ubiquitous computing environment and users' demand for multimedia personalization precipitate a need for ubiquitous personalized multimedia services (UPMSs). Delivering UPMSs is very complex because of diverse device capabilities, dynamic network characteristics, etc. This paper proposes a lifecycle management model based on FSM (finite state machines) for ubiquitous personalized multimedia services (UPMSs). By using this model, the management of UPMSs is very clear and easy, and the services are delivered more efficiently, effectively, and robustly.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134518176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we investigate the selection of an optimal threshold level that takes into account security and quality of service requirements for ad hoc networks. We incorporate intelligence into the selection of an optimal threshold for a distributed threshold cryptography scheme for a distributed trust model in ad hoc networks. We investigate both local and global threshold schemes.
{"title":"QoS-based authentication scheme for ad hoc wireless networks","authors":"P. Muppala, Johnson P. Thomas, A. Abraham","doi":"10.1109/ITCC.2005.235","DOIUrl":"https://doi.org/10.1109/ITCC.2005.235","url":null,"abstract":"In this paper we investigate the selection of an optimal threshold level that takes into account security and quality of service requirements for ad hoc networks. We incorporate intelligence into the selection of an optimal threshold for a distributed threshold cryptography scheme for a distributed trust model in ad hoc networks. We investigate both local and global threshold schemes.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"460 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133847818","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}
This paper focuses on the development of a maintainable information filtering system. The simple and efficient solution to this problem is to block the Web sites by URL, including IP address. However, it is not efficient for unknown Web sites and it is difficult to obtain complete block list. Content based filtering is suggested to overcome this problem as an additional strategy of URL filtering. The manual rule based method is widely applied in current content filtering systems, but they overlook the knowledge acquisition bottleneck problems. To solve this problem, we employed the multiple classification ripple-down rules (MCRDR) knowledge acquisition method, which allows the domain expert to maintain the knowledge base without the help of knowledge engineers. Throughout this study, we prove the MCRDR based information filtering system can easily prevent unknown Web information from being delivered and easily maintain the knowledge base for the filtering system.
{"title":"Dynamic Web content filtering based on user's knowledge","authors":"N. Churcharoenkrung, Yang Sok Kim, B. Kang","doi":"10.1109/ITCC.2005.137","DOIUrl":"https://doi.org/10.1109/ITCC.2005.137","url":null,"abstract":"This paper focuses on the development of a maintainable information filtering system. The simple and efficient solution to this problem is to block the Web sites by URL, including IP address. However, it is not efficient for unknown Web sites and it is difficult to obtain complete block list. Content based filtering is suggested to overcome this problem as an additional strategy of URL filtering. The manual rule based method is widely applied in current content filtering systems, but they overlook the knowledge acquisition bottleneck problems. To solve this problem, we employed the multiple classification ripple-down rules (MCRDR) knowledge acquisition method, which allows the domain expert to maintain the knowledge base without the help of knowledge engineers. Throughout this study, we prove the MCRDR based information filtering system can easily prevent unknown Web information from being delivered and easily maintain the knowledge base for the filtering system.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132914717","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}
Color quantization is wildly exploited for many applications especially in the fields of computer graphics and image processing. After studying the approaches of color clustering, a new approach based on ant colony clustering algorithm applied in color image quantization is proposed in the paper. According to the picking up-dropping theory, a promoted ant algorithm is applied to group colors into certain clusters in RGB space. It finishes color quantization after colors mapping of every pixel. Our experiment shows that the algorithm proposed in this paper has rather good performance with an excellent robustness, a less time consumption, and a simple realization.
{"title":"A new approach of color quantization based on ant colony clustering algorithm","authors":"Xinrong Hu, Tianzhen Wang, Dehua Li","doi":"10.1109/ITCC.2005.18","DOIUrl":"https://doi.org/10.1109/ITCC.2005.18","url":null,"abstract":"Color quantization is wildly exploited for many applications especially in the fields of computer graphics and image processing. After studying the approaches of color clustering, a new approach based on ant colony clustering algorithm applied in color image quantization is proposed in the paper. According to the picking up-dropping theory, a promoted ant algorithm is applied to group colors into certain clusters in RGB space. It finishes color quantization after colors mapping of every pixel. Our experiment shows that the algorithm proposed in this paper has rather good performance with an excellent robustness, a less time consumption, and a simple realization.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133529925","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
扫码关注我们
求助内容：
应助结果提醒方式：