{"title":"Cluster-based hierarchical time synchronization for multi-hop wireless sensor networks","authors":"Hyunhak Kim, Daeyoung Kim, Seong-eun Yoo","doi":"10.1109/AINA.2006.125","DOIUrl":"https://doi.org/10.1109/AINA.2006.125","url":null,"abstract":"In this paper, we propose the cluster-based hierarchical time synchronization protocol (CHTS) for wireless sensor networks (WSN). To couple the network with real world tightly, we provide a network-wide time synchronization through the introduction of abstractions for cluster and hierarchy. Generally the error of time synchronization has the tendency of being accumulated as the hop count along the synchronization path increases in multi-hop wireless sensor network. Thus we cluster the randomly deployed nodes to decrease the hop count along the synchronization path. We then apply different optimal synchronization mechanisms to the cluster heads and cluster members for the sake of power efficiency through an explicit broadcast manner. We prove the performance enhancements with simulation comparisons.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130364804","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":"Sharing checkpoints to improve turnaround time in desktop grid computing","authors":"Patrício Domingues, J. G. Silva, L. Silva","doi":"10.1109/AINA.2006.309","DOIUrl":"https://doi.org/10.1109/AINA.2006.309","url":null,"abstract":"In this paper, we present a checkpoint sharing methodology to improve turnaround time of applications run over desktop grid environments. In fact, volatility of desktop grid nodes reduces the efficiency of such environments when a fast turnaround time is sought, since a task might get stalled if its assigned machine remains unavailable for a somewhat long period of time (long at the scale of the computation). The rationale behind our approach is to permit checkpoint reuse, so that when a computation is forced to move from one node to another, it can be restarted from an intermediary point provided by the last saved checkpoint. We study the effects of sharing checkpoints in application turnaround time simulating three scheduling algorithms based on first come first served: FCFS, FCFS-AT and FCFS-TR. The targeted environment consists of institutional desktop grids. Our results show that sharing checkpoints is particularly effective in volatile environments, yielding performance improvement up to three times relatively to schemes based on private checkpoints. Furthermore, for non-volatile environments, a simple timeout strategy produces good results.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114800602","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":"Scaling multicast communications by tracking feedback senders","authors":"A. Thamrin, H. Kusumoto, J. Murai","doi":"10.1109/AINA.2006.294","DOIUrl":"https://doi.org/10.1109/AINA.2006.294","url":null,"abstract":"This paper looks at the message implosion problem that may happen on large-scale reliable multicast communications. We propose that receivers track the senders of recent feedback messages and store them in a list to determine the back-off interval to send a feedback message. We call our proposal tracked sender list (TSL). The issues regarding this proposal are how many receivers to be stored in a receiver's list, back-off timer intervals, p.d.f selection, and how a receiver stores itself in its list. We analyzed and simulated our proposal using various parameters values in both networks with equal delay and with heterogeneous delays to show the message suppression performance. The results demonstrate that TSL gives a low number of messages over a wide range of receivers even with a short back-off interval and it is not susceptible to packet losses. Our results also show that TSL performs better than other p.d.fs that is used in message suppression.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114617370","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":"ARM: Anonymous Routing Protocol for Mobile Ad hoc Networks","authors":"Stefaan Seys, B. Preneel","doi":"10.1504/IJWMC.2009.028896","DOIUrl":"https://doi.org/10.1504/IJWMC.2009.028896","url":null,"abstract":"Due to the nature of radio transmissions, communications in wireless networks are easy to capture and analyze. Next to this, privacy enhancing techniques (PETs) proposed for wired networks such as the Internet often cannot be applied to mobile ad hoc networks (MANETs). In this paper we present a novel anonymous on demand routing scheme for MANETs. We identify a number of problems of previously proposed works and propose an efficient solution that provides anonymity in a stronger adversary model","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117144848","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 Integrated Middleware Architecture For Digital Data Broadcasting","authors":"H. Song, Hyun-Cheol Hwang","doi":"10.1109/AINA.2006.92","DOIUrl":"https://doi.org/10.1109/AINA.2006.92","url":null,"abstract":"Data broadcasting is an emerging technology, which provides diverse services by exploiting underlying digital transmission technology. As the data broadcasting service is the essential part of the digital broadcasting, various middleware standards for data broadcasting have been established. However, multiple incompatible middleware result in unnecessary cost. In order to cope with these problems, this paper proposes an integrated data broadcasting middleware architecture based on the component-based approach. Through the precise comparison and analysis of middleware standards, we identify and integrate the core component of data broadcasting middleware. We expect that the preceding problems can be solved by proposed architecture","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117305895","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}
Hui-Huang Hsu, C. Yang, Cheng-Wei Hsieh, Chien-Chung Cheng
{"title":"An integrated information system for protein identification","authors":"Hui-Huang Hsu, C. Yang, Cheng-Wei Hsieh, Chien-Chung Cheng","doi":"10.1109/AINA.2006.91","DOIUrl":"https://doi.org/10.1109/AINA.2006.91","url":null,"abstract":"To separate and identify proteins within one cell, the bio-researcher needs to go through a process with three phrases: 2D gel electrophoresis, mass spectrometer analysis, and online matching. Various tools are used during each phase and resulted data are recorded. However, the data generated by different tools are put in files of different formats. It is hard for the researcher to manage the data from different experiments. It is also difficult for the data to be shared and further analyzed. In this paper, an integrated information system developed for such a protein identification process is introduced. The system integrates all the data, including 2D gel electrophoresis images, XML data about the protein spots on the images, peak data of protein fragments, and online matching settings and results. With this online database management system, researchers can easily record and share their experimental results through the Internet. This will facilitate the proteomics research.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115811927","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 Architecture for Adaptive Mobile Learning","authors":"Hyosook Jung, Seongbin Park, K. Chung","doi":"10.1109/AINA.2006.82","DOIUrl":"https://doi.org/10.1109/AINA.2006.82","url":null,"abstract":"In this paper, we present an adaptive mobile learning system that helps users study learning materials anytime anywhere with handheld computers such as PDAs. The theme of this research is to demonstrate the synergetic effects of mobility and adaptivity that are contextualized in a learning environment. Our system considers the information about the cognitive load that a learner is experiencing and learning contents are adaptively presented based on the cognitive and competency attributes of learners. We experimented our system against elementary school students and the results indicated that not only mobility made it possible for learners to study learning materials conveniently, but adaptively providing contents to users based on their cognitive traits enhanced the learning process greatly","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116069772","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":"Multi-hop Mesh Networking for UWB-based 802.15.3 Coverage Extension","authors":"Z. Fan","doi":"10.1109/AINA.2006.235","DOIUrl":"https://doi.org/10.1109/AINA.2006.235","url":null,"abstract":"Because of the short-range characteristics of UWB or 802.15.3 networks (around 10 m), it is highly desirable to have a range extension technology for future wireless personal area networks (WPANs). In the 802.15.3 standard, coverage extension is achieved by creating child or neighbor piconets from a parent piconet. One of the main disadvantages of this approach is that it does not make use of the multi-channel capability provided by the underlying physical layer (e.g. multi-band OFDM) as both the dependent and parent piconets operate on the same channel. As a result the capacity of the wireless medium is not fully utilized and the service quality of high rate A/V applications will suffer. This paper first describes a device association scheme to avoid unreachable communication pairs in network initialization. It then proposes a mesh network architecture and a simple, low-cost method for establishing communications across multiple piconets via multi-hop connections. It can be used to extend network coverage through connecting piconets on multiple channels","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116091956","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":"On bridge residence times in master-slave connected 802.15.4 clusters","authors":"J. Misic, Carol J. Fung, V. Mišić","doi":"10.1109/AINA.2006.243","DOIUrl":"https://doi.org/10.1109/AINA.2006.243","url":null,"abstract":"Individual 802.15.4 beacon enabled clusters can be interconnected in a master-slave manner where the bridging function is performed by the cluster coordinator of one of the clusters. The bridge can deliver its data to the sink by using the CSMA-CA access just like an ordinary node, or through dedicated GTS access. We compare the performance of the two mechanisms and investigate the impact of bridge residence time on performance. Distinct regions can be identified in which either of the access mechanisms performs better, but in either case, best performance is obtained when the bridge residence time in the sink cluster is as short as possible.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116272363","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":"ABF-TDMA: an adaptive beamforming TDMA protocol for mobile ad hoc networks","authors":"Guanghui Zhang, Jiandong Li, Changle Li, Z. Lei","doi":"10.1109/AINA.2006.65","DOIUrl":"https://doi.org/10.1109/AINA.2006.65","url":null,"abstract":"A novel MAC protocol called adaptive beamforming time division multiple access (ABF-TDMA) for mobile ad hoc networks with smart antennas is proposed and analyzed ABF-TDMA is based on TDMA and smart antenna and takes the advantage of collision-free reservation. After successful reservation and training, data packet can be transmitted from source node to destination node with adaptive beamform. We analyze the throughput and delay in ABF-TDMA for the case of a fully connected network with variable-length packets and different number of nodes. The simulation results show that ABF-TDMA can achieve high throughput and keep low delay in the traffic-load ranges of interest, especially when the average packet length and the number of nodes are large.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114986462","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}