发布求助
文献互助 智能选刊 最新文献

21st International Conference on Advanced Information Networking and Applications (AINA '07)最新文献

筛选
英文 中文
Data Stream Based Algorithms For Wireless Sensor Network Applications 基于数据流的无线传感器网络应用算法
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.49
Andre L. L. Aquino, C. M. Figueiredo, E. Nakamura, L. Buriol, A. Loureiro, A. O. Fernandes, C. Coelho
{"title":"Data Stream Based Algorithms For Wireless Sensor Network Applications","authors":"Andre L. L. Aquino, C. M. Figueiredo, E. Nakamura, L. Buriol, A. Loureiro, A. O. Fernandes, C. Coelho","doi":"10.1109/AINA.2007.49","DOIUrl":"https://doi.org/10.1109/AINA.2007.49","url":null,"abstract":"A wireless sensor network (WSN) is energy constrained, and the extension of its lifetime is one of the most important issues in its design. Usually, a WSN collects a large amount of data from the environment. In contrast to the conventional remote sensing - based on satellites that collect large images, sound files, or specific scientific data - sensor networks tend to generate a large amount of sequential small and tuple- oriented data from several nodes, which constitutes data streams. In this work, we propose and evaluate two algorithms based on data stream, which use sampling and sketch techniques, to reduce data traffic in a WSN and, consequently, decrease the delay and energy consumption. Specifically, the sampling solution, provides a sample of only log n items to represent the original data of n elements. Despite of the reduction, the sampling solution keeps a good data quality. Simulation results reveal the efficiency of the proposed methods by extending the network lifetime and reducing the delay without loosing data representativeness. Such a technique can be very useful to design energy-efficient and time-constrained sensor networks if the application is not so dependent on the data precision or the network operates in an exception situation (e.g., there are few resources remaining or there is an urgent situation).","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"1 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":"126172948","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}
引用次数: 27
Trusted Gossip:A Rumor Resistant Dissemination Mechanism for Peer-to-Peer Information Sharing 可信八卦:一种点对点信息共享的抗谣言传播机制
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.140
Arindam Mitra, Muthucumaru Maheswaran
{"title":"Trusted Gossip:A Rumor Resistant Dissemination Mechanism for Peer-to-Peer Information Sharing","authors":"Arindam Mitra, Muthucumaru Maheswaran","doi":"10.1109/AINA.2007.140","DOIUrl":"https://doi.org/10.1109/AINA.2007.140","url":null,"abstract":"Epidemic protocols such as gossip have proven to have many desirable properties for information sharing. However, trust is one of the issues that is yet to be examined with respect to these protocols. In this paper, we present a trusted gossip protocol that uses trust estimates to impede spreading of rumors with reasonable message and processing overheads. We use traces collected from known social networks to estimate the performance of trusted gossip.","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":"116022198","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}
引用次数: 6
Spatial-Temporal Method for Image Restoration in Aged Motion Pictures 年老运动图像的时空恢复方法
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.129
Rong-Chi Chang, T. Shih
{"title":"Spatial-Temporal Method for Image Restoration in Aged Motion Pictures","authors":"Rong-Chi Chang, T. Shih","doi":"10.1109/AINA.2007.129","DOIUrl":"https://doi.org/10.1109/AINA.2007.129","url":null,"abstract":"This paper proposes a series of defect detection algorithms for video in painting. The proposed algorithms are developed based on adjustable thresholds and the primary focus of these algorithms is to provide a better way to repair different kinds of aged films. Two major defect detection techniques that have been created in this study are automatic spike and dirt detection mechanism. Several important findings have been released in the study. First, the findings indicate that if the user is able to choose appropriate threshold, most damages in an aged video clip can be detected. Second, the findings exhibit that spatial information can be used to repair certain damages, which can not be fixed by temporal information due to fast motion. Finally, the results of this study are visually pleasant with most defects removed.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"188 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":"123324446","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}
引用次数: 1
A Data Fusion Approach to Mobile Location Estimation based on Ellipse Propagation Model within a Cellular Radio Network 基于椭圆传播模型的蜂窝无线网络移动位置估计数据融合方法
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.10
Junyang Zhou, J. Ng
{"title":"A Data Fusion Approach to Mobile Location Estimation based on Ellipse Propagation Model within a Cellular Radio Network","authors":"Junyang Zhou, J. Ng","doi":"10.1109/AINA.2007.10","DOIUrl":"https://doi.org/10.1109/AINA.2007.10","url":null,"abstract":"Mobile location estimation is drawing considerable attention in the field of wireless communications. In this paper, we present a new estimator which considers all the information to reduce the effect of signal fluctuation and fading-the statistical estimation. The Statistical Estimation is derived from the information of the received signal strengths (RSSs) and the locations of their corresponding base stations (BSs) and then estimates the location of the mobile station (MS). The statistical estimation uses all the information to provide the estimation of the location of the MS, which can provide an accurate estimation and reduce the effect of signal fluctuation and fading. It is a data fusion method to handle the signal fluctuation and fading problem. We test our approach with real data collected from Hong Kong. Experimental results show that our approach outperforms other existing location estimation algorithms among different kinds of terrains. The improvements based on the geometric algorithm with EPM and the iterative algorithm with EPM are 18.87% and 4.46%, respectively.","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":"114201148","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}
引用次数: 5
Experimental analysis of peer-to-peer streaming in cellular networks 蜂窝网络中点对点流的实验分析
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.67
A. Díaz, P. Merino, L. Panizo, Álvaro M. Recio-Pérez
{"title":"Experimental analysis of peer-to-peer streaming in cellular networks","authors":"A. Díaz, P. Merino, L. Panizo, Álvaro M. Recio-Pérez","doi":"10.1109/AINA.2007.67","DOIUrl":"https://doi.org/10.1109/AINA.2007.67","url":null,"abstract":"In this paper, we study the adequacy of applying peer-to- peer techniques to mobile networks by conducting a series of experiments using smart phones as peers. We measure important parameters, such as jitter and packet losses, in static and dynamic scenarios, focusing on a video streaming service. Finally, based on the results obtained, we discuss the feasibility of these applications.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"15 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":"114238735","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}
引用次数: 16
Analytical Modelling of Hybrid PQ-GPS Scheduling Systems under Long-Range Dependent Traffic 远距离依赖交通下PQ-GPS混合调度系统的分析建模
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.37
X. Jin, G. Min
{"title":"Analytical Modelling of Hybrid PQ-GPS Scheduling Systems under Long-Range Dependent Traffic","authors":"X. Jin, G. Min","doi":"10.1109/AINA.2007.37","DOIUrl":"https://doi.org/10.1109/AINA.2007.37","url":null,"abstract":"The hybrid scheduling mechanism that integrates the well-known priority queueing (PQ) and generalized processor sharing (GPS) has been suggested as a highly- promising scheme for the provisioning and implementation of differentiated quality-of-service. Analytical modelling and performance evaluation of the fundamental PQ and GPS have drawn tremendous interests and received significant research efforts. However, to the best of our knowledge, there is not any analytical model reported for the hybrid mechanism. To fill this gap, this paper develops a novel analytical performance model for the hybrid PQ and GPS scheduling system subject to long-range dependent (LRD) traffic. The validity of the analytical model is demonstrated by comparing analytical results to those obtained through extensive simulation experiments.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"40 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":"124062256","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}
引用次数: 2
Mapping a group of jobs in the error recovery of the Grid-based workflow within SLA context 在SLA上下文中映射基于网格的工作流的错误恢复中的一组作业
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.87
D. Quan, J. Altmann
{"title":"Mapping a group of jobs in the error recovery of the Grid-based workflow within SLA context","authors":"D. Quan, J. Altmann","doi":"10.1109/AINA.2007.87","DOIUrl":"https://doi.org/10.1109/AINA.2007.87","url":null,"abstract":"The error recovery mechanism receives an important position in the system supporting service level agreements (SLAs) for the grid-based workflow. If one sub-job of the workflow is late, a group of directly affected sub-jobs should be re-mapped in a way that does not affect the start time of other sub-jobs in the workflow and is as inexpensive as possible. With the distinguished workload and resource characteristics as well as the goal of the problem, this problem needs new method to be solved. This paper presents a mapping algorithm, which can cope with the problem. Performance measurements deliver good evaluation results on the quality and efficiency of the method.","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":"129995164","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}
引用次数: 7
Selective Querying in Sensor Networks: Parameters and Strategies 传感器网络中的选择性查询:参数和策略
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.126
J. Meyer, F. Mili, I. Elhajj
{"title":"Selective Querying in Sensor Networks: Parameters and Strategies","authors":"J. Meyer, F. Mili, I. Elhajj","doi":"10.1109/AINA.2007.126","DOIUrl":"https://doi.org/10.1109/AINA.2007.126","url":null,"abstract":"Extending the life of a sensor network while maintaining an acceptable level of accuracy continues to be a critical challenge in long-lived applications requiring months and years of continuous operation. In this paper, we present an approach to address this challenge, namely selective querying based on the transinformation value of nodes relative to the query being executed. The approach is distributed whereby decisions are made by individual nodes and cluster heads based on information locally available. Simulation results establish the feasibility of this approach and show significant gains in the lifetime of the network.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"44 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":"131254160","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}
引用次数: 3
An Improved Analysis on the Loss Performance of Optical Bursts 一种改进的光突发损耗性能分析方法
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.34
M. Jin, O. Yang
{"title":"An Improved Analysis on the Loss Performance of Optical Bursts","authors":"M. Jin, O. Yang","doi":"10.1109/AINA.2007.34","DOIUrl":"https://doi.org/10.1109/AINA.2007.34","url":null,"abstract":"In optical burst switching (OBS) networks, many packets are aggregated into larger bursts, which exhibit different traffic characteristics in the bufferless optical core networks compared to the packet-level traffic in the conventional electronic switching systems. However, many OBS studies often neglect this issue by assuming the inputs to be bursts when analyzing the system-level performance. This paper demonstrates that the loss performances of optical bursts are dramatically different when considering burst assembly process at the edge nodes and the connectivity of the core nodes. We develop some analytical models for the JET and JETseg networks, which can model the loss performance more accurately than the traditional methods. Our performance evaluation reveals that the connectivity and burst assembly process affect the loss performance significantly, particularly for a WDM network with a small node-degree and a large number of wavelength channels. Our model provides an in-depth understanding on the OBS scheme.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"26 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":"128860702","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}
引用次数: 2
Relaxed Failure Recovery Process for Reliable Quality-of-Service using Unreserved Backup Paths 使用无保留备份路径实现可靠服务质量的放松故障恢复过程
21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.120
I. Chen, M. Ito
{"title":"Relaxed Failure Recovery Process for Reliable Quality-of-Service using Unreserved Backup Paths","authors":"I. Chen, M. Ito","doi":"10.1109/AINA.2007.120","DOIUrl":"https://doi.org/10.1109/AINA.2007.120","url":null,"abstract":"Guaranteed, high-quality service in the computer network often requires a single reserved path. However, a single path can easily suffer from single point failures. This paper provides a solution to handle flows when their reserved primary paths fail. The solution pairs a reserved primary path with an unreserved backup path. When a failure occurs and a primary path fails, the initial service guarantee is relaxed slightly, and the flow with the failed primary path is re-routed on the least congested alternate path. This approach allows all flows to continue despite a failure in the network. In addition, even though the service quality is relaxed to accommodate flows with failed primary paths, by carefully planning the least congested alternate paths as backups, very high levels of service quality can still be retained after failure.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"35 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":"114806174","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}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信