In this paper, we propose an efficient power saving protocol for multi-hop mobile ad hoc networks, called p-MANET. Our design is expected as a new foundation MAC layer power saving protocol. The main goals of p-MANET protocol are to reduce significant power consumption and transmission latency, and to achieve efficient power saving. Each mobile node in p-MANET only needs to become active during one beacon interval for every n interval where n is the size of a super frame. Thus, efficient power saving is expected. p-MANET also yields low transmission latency because that every mobile node is aware of the active beacon intervals of its neighbors such that it can easily choose a neighbor in active mode or with the least remaining time to wake up to forward packets. Simulations are also conducted to show the efficiency of the proposed p-MANET
{"title":"p-MANET: Efficient Power Saving Protocol for Multi-Hop Mobile Ad Hoc Networks","authors":"Chiung-Ying Wang, Chi-Jen Wu, Guan-Nan Chen, Ren-Hung Hwang","doi":"10.1109/ICITA.2005.204","DOIUrl":"https://doi.org/10.1109/ICITA.2005.204","url":null,"abstract":"In this paper, we propose an efficient power saving protocol for multi-hop mobile ad hoc networks, called p-MANET. Our design is expected as a new foundation MAC layer power saving protocol. The main goals of p-MANET protocol are to reduce significant power consumption and transmission latency, and to achieve efficient power saving. Each mobile node in p-MANET only needs to become active during one beacon interval for every n interval where n is the size of a super frame. Thus, efficient power saving is expected. p-MANET also yields low transmission latency because that every mobile node is aware of the active beacon intervals of its neighbors such that it can easily choose a neighbor in active mode or with the least remaining time to wake up to forward packets. Simulations are also conducted to show the efficiency of the proposed p-MANET","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132249470","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}
T. Kitasuka, K. Hisazumi, Tsuneo Nakanishi, Akira Fukuda
For increasing needs of positioning technology, easy and simple indoor positioning system is desired. Wireless LAN based positioning system is a major candidate of indoor positioning technology. Conventional WLAN based systems require high installation cost or long site calibration before use. In this paper, we describe the implementation of simple WLAN based indoor positioning system WiPS. WiPS uses RSSI between terminals to avoid site calibration. We perform an experiment called a flag game, in which the person raises and lowers the PDA held in each hand. WiPS determines each hand is up or down. As results of the experiment, WiPS detects the movement of PDA in 4.8 sec. on an average
{"title":"WiPS: Location and Motion Sensing Technique of IEEE 802.11 Devices","authors":"T. Kitasuka, K. Hisazumi, Tsuneo Nakanishi, Akira Fukuda","doi":"10.1109/ICITA.2005.312","DOIUrl":"https://doi.org/10.1109/ICITA.2005.312","url":null,"abstract":"For increasing needs of positioning technology, easy and simple indoor positioning system is desired. Wireless LAN based positioning system is a major candidate of indoor positioning technology. Conventional WLAN based systems require high installation cost or long site calibration before use. In this paper, we describe the implementation of simple WLAN based indoor positioning system WiPS. WiPS uses RSSI between terminals to avoid site calibration. We perform an experiment called a flag game, in which the person raises and lowers the PDA held in each hand. WiPS determines each hand is up or down. As results of the experiment, WiPS detects the movement of PDA in 4.8 sec. on an average","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133622451","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 cerebellar model articulation controller (CMAC) is a popular auto-associate memory feed forward neural network model. Since it was proposed, many researchers have introduced fuzzy logic to CMAC and called FCMAC. In FCMAC, the input data is fuzzificated into fuzzy sets before fed into CMAC. This paper proposes self-organizing fuzzification (SOF) technique to form fuzzy sets in the fuzzification phase. The proposed SOF technique uses raw numerical values of a training data set with no preprocessing and obtains dynamic partition-base clusters without prior knowledge of number of clusters. It also provides CMAC a consistent fuzzy rule base. Truth value restriction inference scheme (TVR) is employed in the defuzzification phase. Our experiments are conducted on some benchmark datasets, and the results show that our method outperforms the existing model with higher ability to handle uncertainty in the inference process
{"title":"Self-Organizing Gaussian Fuzzy CMAC with Truth Value Restriction","authors":"M. N. Nguyen, D. Shi, Hiok Chai Quek","doi":"10.1109/ICITA.2005.250","DOIUrl":"https://doi.org/10.1109/ICITA.2005.250","url":null,"abstract":"The cerebellar model articulation controller (CMAC) is a popular auto-associate memory feed forward neural network model. Since it was proposed, many researchers have introduced fuzzy logic to CMAC and called FCMAC. In FCMAC, the input data is fuzzificated into fuzzy sets before fed into CMAC. This paper proposes self-organizing fuzzification (SOF) technique to form fuzzy sets in the fuzzification phase. The proposed SOF technique uses raw numerical values of a training data set with no preprocessing and obtains dynamic partition-base clusters without prior knowledge of number of clusters. It also provides CMAC a consistent fuzzy rule base. Truth value restriction inference scheme (TVR) is employed in the defuzzification phase. Our experiments are conducted on some benchmark datasets, and the results show that our method outperforms the existing model with higher ability to handle uncertainty in the inference process","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132856348","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 complexity of the ubiquitous constant modulus algorithm (CMA) can be reduced by applying a sign operation to the CMA error function, while a sign operator generally can be seen as a 1-bit (two-level) mid-riser quantization. However, in order to preserve the information lost as a result of quantization processes, dithering is commonly used. In this paper, we evaluate the performance of dithered signed-error CMA utilizing a dithering signal that has sinusoidal probability density function. The algorithm has also been applied for equalization in wireless communication channel, which is distorted by multi-path propagation. Simulation results show that dithering using sinusoidal distribution outperforms the dithering using uniform distribution in terms of convergence speed.
{"title":"Performance of sinusoidally-distributed dithering for signed-error constant modulus algorithm","authors":"J. Jusak, Z. M. Hussain","doi":"10.1109/ICITA.2005.214","DOIUrl":"https://doi.org/10.1109/ICITA.2005.214","url":null,"abstract":"The complexity of the ubiquitous constant modulus algorithm (CMA) can be reduced by applying a sign operation to the CMA error function, while a sign operator generally can be seen as a 1-bit (two-level) mid-riser quantization. However, in order to preserve the information lost as a result of quantization processes, dithering is commonly used. In this paper, we evaluate the performance of dithered signed-error CMA utilizing a dithering signal that has sinusoidal probability density function. The algorithm has also been applied for equalization in wireless communication channel, which is distorted by multi-path propagation. Simulation results show that dithering using sinusoidal distribution outperforms the dithering using uniform distribution in terms of convergence speed.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117296897","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 novel RTPD/MACSC model proposed in this paper tunes the cache size adoptively on the fly. It combines the extant MACSC (model for adaptive cache size control) and the novel RTPD (real-time traffic pattern detection) capability. Similar to its MACSC predecessor, the new RTPD/MACSC tuner maintains the given cache hit ratio consistently and persistently. It, however, differs from its predecessor because it adapts itself to compensate for the ill effects on the cache hit ratio by the Internet traffic, which embeds various patterns over time. The automatic adaptation (self-tuning) capability in response to traffic pattern changes detected by the RTPD is called self-reconfiguration in the RTPD/MACSC context
{"title":"Using Real-Time Traffic Pattern Detection for Dynamic Cache Size Tuning in Information Retrieval","authors":"Richard S. L. Wu, Allan K. Y. Wong, T. Dillon","doi":"10.1109/ICITA.2005.301","DOIUrl":"https://doi.org/10.1109/ICITA.2005.301","url":null,"abstract":"The novel RTPD/MACSC model proposed in this paper tunes the cache size adoptively on the fly. It combines the extant MACSC (model for adaptive cache size control) and the novel RTPD (real-time traffic pattern detection) capability. Similar to its MACSC predecessor, the new RTPD/MACSC tuner maintains the given cache hit ratio consistently and persistently. It, however, differs from its predecessor because it adapts itself to compensate for the ill effects on the cache hit ratio by the Internet traffic, which embeds various patterns over time. The automatic adaptation (self-tuning) capability in response to traffic pattern changes detected by the RTPD is called self-reconfiguration in the RTPD/MACSC context","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116970170","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 a mobile agent based environment personal data can be stolen, leaked or sent out to unauthorized persons by malicious mobile agents. In this paper we describe a new architecture and mechanism for user privacy protection in mobile agent based service domain. Agents meet at a protected and encapsulated agent computing environment from where they are not allowed to communicate with the outside world and also are not allowed to leave the platform. All the agents are killed at the host and the computation result is sent to respective parties by the trusted agent meeting and executing platform
{"title":"Privacy Protection in Mobile Agent Based Service Domain","authors":"M. N. Huda, S. Yamada, E. Kamioka","doi":"10.1109/ICITA.2005.218","DOIUrl":"https://doi.org/10.1109/ICITA.2005.218","url":null,"abstract":"In a mobile agent based environment personal data can be stolen, leaked or sent out to unauthorized persons by malicious mobile agents. In this paper we describe a new architecture and mechanism for user privacy protection in mobile agent based service domain. Agents meet at a protected and encapsulated agent computing environment from where they are not allowed to communicate with the outside world and also are not allowed to leave the platform. All the agents are killed at the host and the computation result is sent to respective parties by the trusted agent meeting and executing platform","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115124326","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 investigation we discuss powerful yet efficient retrieval mechanism for news stream. Difficulty comes from the fact how to manage incremental information while keeping efficiency. Recently random projection has been paid much attention on dynamic dimensionality reduction. We show this novel technique is really useful for querying news stream in terms of cost and accuracy. We examine some experimental results and excellent efficiency in computation and memory usage.
{"title":"Querying on news stream by using random projection","authors":"H. Oh'uchi, T. Miura, I. Shioya","doi":"10.1109/ICITA.2005.229","DOIUrl":"https://doi.org/10.1109/ICITA.2005.229","url":null,"abstract":"In this investigation we discuss powerful yet efficient retrieval mechanism for news stream. Difficulty comes from the fact how to manage incremental information while keeping efficiency. Recently random projection has been paid much attention on dynamic dimensionality reduction. We show this novel technique is really useful for querying news stream in terms of cost and accuracy. We examine some experimental results and excellent efficiency in computation and memory usage.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"401 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114930602","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}
With the increasing popularity of mobile computing platforms such as personal digital assistants (PDAs) and smart mobile phones, applications originally designed for higher-performance devices are moving onto these resource-constrained mobile devices. Given that these devices have severely restricted processing power, memory, and user interface capabilities, applications intended for these devices have to be carefully designed and implemented to achieve acceptable performance. In this paper we report on our experience with the development of the MacauMap application, a mobile digital map application that runs on PDAs and smart mobile phones. Memory requirements were kept low through a special data format. The main challenge of satisfactory map drawing speed was addressed through a variety of techniques developed for this application. We present the MacauMap application, introduce its design, and conclude with lessons learned from its development
{"title":"Performance Tuning in the MacauMap Mobile Map Application","authors":"R. Biuk-Aghai","doi":"10.1109/ICITA.2005.216","DOIUrl":"https://doi.org/10.1109/ICITA.2005.216","url":null,"abstract":"With the increasing popularity of mobile computing platforms such as personal digital assistants (PDAs) and smart mobile phones, applications originally designed for higher-performance devices are moving onto these resource-constrained mobile devices. Given that these devices have severely restricted processing power, memory, and user interface capabilities, applications intended for these devices have to be carefully designed and implemented to achieve acceptable performance. In this paper we report on our experience with the development of the MacauMap application, a mobile digital map application that runs on PDAs and smart mobile phones. Memory requirements were kept low through a special data format. The main challenge of satisfactory map drawing speed was addressed through a variety of techniques developed for this application. We present the MacauMap application, introduce its design, and conclude with lessons learned from its development","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115657165","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}
Software agent technology is currently based on fixed ontologies and languages, hand-crafted for a particular application. The advent of massively distributed systems however calls for not only a common language between all agents involved but also the ability to autonomously adapt and form concepts about novel experiences and events. We propose a method by which agents can autonomously form new concepts grounded in their own experience. This is an improvement on previous approaches because it can tackle a much wider range of conceptual types and provides an efficient, accurate representation which can be used in a rule based system or conceptual framework.
{"title":"Autonomous concept formation in software agents for extending ontologies","authors":"Elise Langham, S. Bullock","doi":"10.1109/ICITA.2005.85","DOIUrl":"https://doi.org/10.1109/ICITA.2005.85","url":null,"abstract":"Software agent technology is currently based on fixed ontologies and languages, hand-crafted for a particular application. The advent of massively distributed systems however calls for not only a common language between all agents involved but also the ability to autonomously adapt and form concepts about novel experiences and events. We propose a method by which agents can autonomously form new concepts grounded in their own experience. This is an improvement on previous approaches because it can tackle a much wider range of conceptual types and provides an efficient, accurate representation which can be used in a rule based system or conceptual framework.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115710939","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}
Dynamic environments such as that of any public and private infrastructure, workplace and even home consist of multiple entities that continuously interact with each other. Integrating an intelligent security system in such an environment necessitates the need for a soft systems approach that gives perspective to such interactions through identifying associated holons. The holonic analysis allows characterisation of ill-defined and often problematic situations that are resultant of the human activity system. This paper discusses some techniques that can be adopted to resolve scenarios that are plagued with uncertainty in reasoning and the continuously varying nature of interrelationship between native entities. The technical aspect of this system encompasses the mode of query processing and surveillance through a structured sensor network set up with the aid of distributed services and network protocols
{"title":"SAFE Model Approach to Construction of Intelligent Security Systems","authors":"Z. Chaczko, S. Sinha","doi":"10.1109/ICITA.2005.243","DOIUrl":"https://doi.org/10.1109/ICITA.2005.243","url":null,"abstract":"Dynamic environments such as that of any public and private infrastructure, workplace and even home consist of multiple entities that continuously interact with each other. Integrating an intelligent security system in such an environment necessitates the need for a soft systems approach that gives perspective to such interactions through identifying associated holons. The holonic analysis allows characterisation of ill-defined and often problematic situations that are resultant of the human activity system. This paper discusses some techniques that can be adopted to resolve scenarios that are plagued with uncertainty in reasoning and the continuously varying nature of interrelationship between native entities. The technical aspect of this system encompasses the mode of query processing and surveillance through a structured sensor network set up with the aid of distributed services and network protocols","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123272382","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
扫码关注我们
求助内容：
应助结果提醒方式：