{"title":"Self-Adapting and Agent-based Personalized Courseware Model","authors":"Jiuxin Cao, Bo Mao, Junzhou Luo, Liang Ge","doi":"10.1109/AINA.2007.127","DOIUrl":"https://doi.org/10.1109/AINA.2007.127","url":null,"abstract":"In this paper, a super-media courseware system infrastructure based on the knowledge description is propose which features in separation of knowledge description from knowledge entity. Using agent technology, a personalized learning environment is developed with dynamical, real-time user information matching. The courseware system infrastructure is not only capable of balancing network load, but also proves self-adaptive to the users' circumstances. The simulation tests are run to demonstrate the advantage in performance.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122957567","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}
{"title":"Agent Based Approach to Minimize Energy Consumption for Border Nodes in Wireless Sensor Network","authors":"E. Shakshuki, H. Malik","doi":"10.1109/AINA.2007.28","DOIUrl":"https://doi.org/10.1109/AINA.2007.28","url":null,"abstract":"This paper presents an agent-based system to minimize the energy consumption for border nodes in sensor-MAC (S-MAC), a cluster based contention protocol. The S-MAC protocol is based on unique feature; it conserves battery power at nodes by powering off nodes that are not actively transmitting or receiving packets. In doing so, nodes also turn off their radios. Inspired by the energy conservation mechanism of the S-MAC, we unmitigated our efforts to augment the node life time in sensor network. Border nodes act as shared nodes between virtual clusters. Virtual clusters are formed on the basis of sleep/listen schedule of nodes. Towards this end, we propose a multi-agent system that allows nodes to join cluster where they experience minimum energy drain. This system includes two types of agents: stationary and mobile agents. A prototype implementation and simulation results compared with S-MAC are presented.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132415071","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}
{"title":"Multipath Cellular Network Architecture for Quality Assured Multimedia Delivery","authors":"A. A. Yusuf, M. Murshed","doi":"10.1109/AINA.2007.94","DOIUrl":"https://doi.org/10.1109/AINA.2007.94","url":null,"abstract":"Assuring quality of service (QoS) is an extreme challenge in cellular multimedia delivery especially in single path transmission. One possible way to improve QoS is to provide multipath transmission. In this paper, we introduce a novel multi-path cellular network architecture through placement of additional base stations (BSs), i.e., antennae in the existing cellular architecture. This architecture provides a mobile unit (MU) with more than one communication links from the BSs placed in different locations. The availability of multiple channels allows the implementation of path diversity transmission protocols and improves error resilience capability for multimedia services. The multiple diversified path links reduces outage probability. We show that our proposed architecture provides better reliability and maintains cell capacity for high bandwidth multimedia services while improving signal to interference ratio compared to the existing cellular network model.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130653418","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}
Odysseas Papapetrou, W. Siberski, Wolf-Tilo Balke, W. Nejdl
{"title":"DHTs over Peer Clusters for Distributed Information Retrieval","authors":"Odysseas Papapetrou, W. Siberski, Wolf-Tilo Balke, W. Nejdl","doi":"10.1109/AINA.2007.60","DOIUrl":"https://doi.org/10.1109/AINA.2007.60","url":null,"abstract":"Distributed hash tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building huge term indexes, as required for IR-style keyword search, are impractical with plain DHTs. Due to the large sizes of document term vocabularies, joining peers cause huge amounts of key inserts, and subsequently large numbers of index maintenance messages. Thus, the key to exploiting DHTs for distributed information retrieval is to reduce index maintenance. We show that this can be achieved by combining DHTs with peer clustering. Peers are first clustered into communities, each of the communities having a representative super-peer. Then all occurrences of a term in a community are published to the global DHT in a batch by the representative super-peer. Our evaluation shows that this reduces index maintenance cost by an order of magnitude, while still keeping a complete and correct term index for query processing.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114393688","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}
{"title":"A Grid Services-Oriented Architecture for Efficient Operation of Distributed Data Warehouses on Globus","authors":"P. Wehrle, M. Miquel, A. Tchounikine","doi":"10.1109/AINA.2007.13","DOIUrl":"https://doi.org/10.1109/AINA.2007.13","url":null,"abstract":"Data warehouses store large volumes of data according to a multidimensional model that provides a fast access for online analysis. The constant growth in quantity and complexity of data stored in data warehouses has led to a variety of data warehouse applications on distributed systems. The main benefits of these architectures are parallelized query execution and higher storage capacities. Computing grids in particular are built to combine a large number of heterogeneous distributed resources. Their lack of centralized control however conflicts with the centralized structure of classical data warehouses. Autonomous data management on grid nodes requires efficient communication during query evaluation. The architecture we present supports a global data localization method with the help of a specialized catalog service. Our work is based on a model for unique identification and efficient local indexing of the warehouse data. Local indexes integrate computable aggregates for maximum utilization of locally materialized data in order to facilitate cost-optimized query execution. The grid services implementing these functionalities are deployed on the GGM project's test environment.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114909259","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}
{"title":"T2CP-AR: A system for Transparent TCP Active Replication","authors":"Narjess Ayari, D. Barbaron, L. Lefèvre, P. Primet","doi":"10.1109/AINA.2007.134","DOIUrl":"https://doi.org/10.1109/AINA.2007.134","url":null,"abstract":"Today's Internet models are concerned with both of the quality and the availability of a given service. Current fault tolerant frameworks need to support consistent transport and application level failover mechanisms. Transport protocols relay on an explicit association between a service and its physical location for the wired Internet. Thus, when a host fails, the end-to-end flow terminates. In this paper, we propose an active replication based system which enhances the reliability of the already established TCP flows. The proposed scheme is client transparent. It does not incur any overhead to the end-to- end communication during failsafe periods, and performs well during failures.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123864743","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}
{"title":"QuViE/P : An Effective QoS Control Scheme for 3-D Virtual Environments Based on User's Perception","authors":"T. Kuroda, T. Suganuma, N. Shiratori","doi":"10.1109/AINA.2007.119","DOIUrl":"https://doi.org/10.1109/AINA.2007.119","url":null,"abstract":"A new 3-D virtual environment (3DVE) system named \"QuViE/P\" has been proposed in this paper, which can greatly enhance the quality of service (QoS) that users actually feel as good as possible, when the resources for computers and networks are limited. To do this, therefore, we focus on characteristics of the user's perceptual quality evaluation on 3-D objects. In this paper, we propose an effective QoS control scheme that introduces a relationship between system's internal quality parameters and user's perceptual quality parameters. This scheme can appropriately maintain quality and functions for users and is expected to drastically improve convenience when using 3DVE under the situation that resources are limited. Experimental results obtained from using a prototype of QuViE/P show effectiveness of our scheme as follows: Even when computer resource is reduced to 30% of the required amount, our proposed scheme can preferentially keep quality of important objects. Moreover it continues to provide quality and functions that user requires. Whereas in traditional QoS control scheme, objects of importance disappeared in similar situation.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121621573","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}
{"title":"Evaluating the Feasibility of Traffic-Based Intrusion Detection in an 802.15.4 Sensor Cluster","authors":"V. Mišić, J. Begum","doi":"10.1109/AINA.2007.65","DOIUrl":"https://doi.org/10.1109/AINA.2007.65","url":null,"abstract":"We investigate the feasibility of a simple, traffic volume-based intrusion detection for an IEEE 802.15.4 compliant sensor cluster operating in beacon-enabled, slotted CSMA-CA mode. We have used simple exponential averaging to filter out some of the inherent variability in individual device arrival rate, and introduced a small hysteresis in the decision process in order to avoid false alarms due to dithering. Initial results demonstrate that the intrusion detection implemented in this manner may indeed operate quickly and efficiently.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123180928","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}
{"title":"An Adaptive Localized Algorithm for Multiple Sensor Area Coverage","authors":"A. Gallais, J. Carle","doi":"10.1109/AINA.2007.30","DOIUrl":"https://doi.org/10.1109/AINA.2007.30","url":null,"abstract":"Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of the redundancy induced by the random deployment of nodes. Some nodes are active while others are in sleep mode, thus using less energy. Such a dynamic topology should not impact the monitoring activity. Area coverage protocols aim at turning off redundant sensor nodes while ensuring full coverage of the area by the remaining active nodes. Providing k-area coverage therefore means that every physical point of the monitored field is sensed by at least fc sensor devices. Connectivity of the active nodes subset must also be provided so that monitoring reports can reach the sink stations. Existing solutions hardly address these two issues as a unified one. In this paper, we propose a localized algorithm for multiple sensor area coverage able to build connected active nodes sets. We also show that a simple feature of the protocol, called the coverage evaluation scheme, can be enhanced to handle various k-area coverage problem definitions. Experimental results show that our coverage scheme is resistant to collisions of messages as k-area-coverage of the deployment area and connectivity of the active nodes set can still be ensured.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123181613","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}
{"title":"A Distributed Correlative Power Control Scheme for Mobile Ad hoc Networks using Prediction Filters","authors":"B. Alawieh, C. Assi, W. Ajib","doi":"10.1109/AINA.2007.147","DOIUrl":"https://doi.org/10.1109/AINA.2007.147","url":null,"abstract":"Transmission power control (TPC) in a Mobile Ad hoc network (MANET) environment reduces the total energy consumed in packet delivery and/or enhances network throughput by increasing the channel's spatial reuse. In this paper, a distributed correlative power control scheme using prediction filters (Kalman or extended Kalman) is proposed. The prediction filter is used to estimate the forthcoming interference. Both the transmitter and receiver in MANET environment make use of predicted interference to assign correlative power values to their associated ensued packets to guarantee the success of the IEEE 802.11 four-way handshaking communication (RTS/CTS/DATA/ACK). Simulation results for different topologies are used to demonstrate the significant throughput and energy gains that can be obtained by the proposed power control scheme.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122916257","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}