2008 IEEE International Symposium on Parallel and Distributed Processing with Applications最新文献_第4页

A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs 图b染色的全动态分布算法

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.47

Shuang Liu, Brice Effantin, H. Kheddouci

引用次数: 3

Adaptive Neighbor Caching for Fast BSS Transition Using IEEE 802.11k Neighbor Report 基于IEEE 802.11k邻居报告的自适应邻居缓存快速BSS转换

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.78

Ching-Hwa Yu, Michael Pan, Sheng-de Wang

{"title":"Adaptive Neighbor Caching for Fast BSS Transition Using IEEE 802.11k Neighbor Report","authors":"Ching-Hwa Yu, Michael Pan, Sheng-de Wang","doi":"10.1109/ISPA.2008.78","DOIUrl":"https://doi.org/10.1109/ISPA.2008.78","url":null,"abstract":"Handoff latency is a severe bottleneck impacting the service continuity for voice and multimedia applications in WLAN. IEEE 802.11k neighbor report defines the neighbor APs which are potential transition candidates for the roaming target. But the selection method for the roaming target AP is left undefined. Several schemes have been proposed for fast handoff with neighbor APpsilas information. However, these schemes result in huge redundant transition messages overheads in the WLAN and require high computing power for the AAA (Authentication, Authorization, and Access control) server. In this paper, we propose an adaptive neighbor caching (ANC) method to achieve higher handoff prediction accuracy for selecting proper candidate APs in the Neighbor Report. An adaptive predictability index is introduced for selecting those potential roaming APs, which can mitigate the scanning latency and the pre-authentication key distribution message overhead in the WLAN as well as computing loading for the AAA server. Simulation results present up to 83.5% of transition messages are reduced in comparison to the Proactive Neighbor Caching (PNC), 56.4% of candidate AP selection accuracy is improved and 37.5% of transition messages are reduced in comparison to the Selective Neighbor Caching (SNC).","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122904375","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

A Task Parallel Algorithm for Computing the Costs of All-Pairs Shortest Paths on the CUDA-Compatible GPU 在cuda兼容GPU上计算全对最短路径代价的任务并行算法

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.40

T. Okuyama, Fumihiko Ino, K. Hagihara

引用次数: 24

Analyzing QoS Approach for Parallel Soft Real-Time 并行软实时的QoS方法分析

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.85

P. Furtado

引用次数: 0

A Formal Specification Model of Survivability for Pervasive Systems 普适系统生存能力的形式化规范模型

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.62

A. Ayara, F. Najjar

{"title":"A Formal Specification Model of Survivability for Pervasive Systems","authors":"A. Ayara, F. Najjar","doi":"10.1109/ISPA.2008.62","DOIUrl":"https://doi.org/10.1109/ISPA.2008.62","url":null,"abstract":"The emergence of pervasive computing in our everyday life supposes that the data necessary to the operation of the majority of our essential services in various fields of life will be managed by these systems. Thus, their dependability became a major concern. But, dependability issues have not been well explored so far in pervasive computing research. Pervasive environments are highly complex, heterogeneous and geographically dispersed. As a result, current means and facets of dependability do not address the needs of these systems. A solution to achieve this goal should be to adopt a dependability approach based on survivability in pervasive environments. But, the survivability suffers from a remarkable lack of suitable and mature methods for using it in practice. In this paper, we focus on achieving survivability in pervasive environments. First, we introduce a formal survivability model based on a rigorous definition of the concept of acceptable service and a method for calculating the degree of survivability of the system. Then, we present the basis for a new approach to adapt the system in adverse operation environment to comply with its survivability specification. To fix ideas, a case study in pervasive healthcare is presented.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134346343","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}

引用次数: 11

Experiments in Adaptive Power Control for Truly Wearable Biomedical Sensor Devices 真正可穿戴生物医学传感器设备的自适应功率控制实验

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.96

Ashay Dhamdhere, V. Sivaraman, A. Burdett

引用次数: 8

Evaluating Interpolation-Based Power Management 评估基于插值的电源管理

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.71

R. Tynan, G. O’hare

{"title":"Evaluating Interpolation-Based Power Management","authors":"R. Tynan, G. O’hare","doi":"10.1109/ISPA.2008.71","DOIUrl":"https://doi.org/10.1109/ISPA.2008.71","url":null,"abstract":"Power management for WSNs can take many forms, from adaptively tuning the power consumption of some of the components of a node to hibernating it completely. In the later case, the competence of the WSN must not be compromised. In general, the competence of a WSN is its ability to perform its function in an accurate and timely fashion. These two, related, Quality of Service (QoS) metrics are primarily affected by the density and latency of data from the environment, respectively. Without adequate density, interesting events may not be adequately observed or missed completely by the application, while stale data could result in event detection occurring too late. In opposition to this is the fact that the energy consumed by the network is related to the number of active nodes in the deployment. Therefore, given that the nodes have finite power resources, a trade-off exists between the longevity and QoS provided by the network and it is crucial that both aspects are considered when evaluating a power management protocol. In this paper, we present an evaluation of a novel node hibernation technique based on interpolated sensor readings according to these four metrics: energy consumption, density, message latency and the accuracy of an application utilising the data from the WSN. A comparison with a standard WSN that does not engage in power management is also presented, in order to show the overhead in the protocols operation.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133497733","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}

引用次数: 0

GRPLib: A Web Service Based Framework Supporting Sustainable Execution of Large-Scale and Long-Time Grid Applications GRPLib:一个基于Web服务的框架，支持大规模和长时间网格应用程序的可持续执行

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.13

Yingwen Song, H. Takemiya, Yoshio Tanaka, H. Nakada, S. Sekiguchi

{"title":"GRPLib: A Web Service Based Framework Supporting Sustainable Execution of Large-Scale and Long-Time Grid Applications","authors":"Yingwen Song, H. Takemiya, Yoshio Tanaka, H. Nakada, S. Sekiguchi","doi":"10.1109/ISPA.2008.13","DOIUrl":"https://doi.org/10.1109/ISPA.2008.13","url":null,"abstract":"To ensure large-scale and long-time (LSLT) applications to run smoothly in a dynamic and heterogeneous grid environment, we have designed and implemented a WSRF-based framework with which users can reserve resources and request on-demand computing resources. The framework can be architecturely divided into three tiers: the tier providing client-side reservation and allocation APIs, the tier for reservation brokerage and resource allocation, and the tier for backend services. The reservation API is implemented for making and releasing a reservation, as well as for showing available reservations. The allocation API is implemented to request, to check, and to release a resource in a convenient way. The middle tier is designed to hide the complexity of the underlying grid infrastructure, and implemented to provide several allocation algorithms. One of the main backend services is Maui-based reservation service at present. A portal to facilitate the resource management is also available. In this paper, we present the API specification, the architecture, and the implementation of this framework. We also show a detailed experimental example.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129889287","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}

引用次数: 0

Feature Calibration in Sensor Networks 传感器网络中的特征校准

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.52

H. Cao, A. Arora, Emre Ertin, Kenneth W. Parker

{"title":"Feature Calibration in Sensor Networks","authors":"H. Cao, A. Arora, Emre Ertin, Kenneth W. Parker","doi":"10.1109/ISPA.2008.52","DOIUrl":"https://doi.org/10.1109/ISPA.2008.52","url":null,"abstract":"Despite recent theory development, methods of calibration that accurately recover signals from biased sensor readings remain limited in their applicability. Acoustic sensors, for instance, which have been popular in low power wireless sensor networks, are difficult to calibrate in this manner, given their significant hardware variability, large dynamic range, sensitivity to battery power level, and complex spatial/temporal environmental variations. In this paper, we submit that the applicability of calibration is broadened by lifting the calibration problem from the level of sensors to that of sensing applications. We show feasibility of adaptive, easy, and accurate calibration at the level of application-specific features, via an example of recovering the feature of acoustic signal-to-noise ratio (SNR) that is useful in event-detection applications. By easy, we mean there is an efficient, purely local, and stimulus-free procedure for recovering SNR (that compares measured variances for multiple randomly chosen sensitivities, effected via acoustic sensor hardware support); unlike extant calibration methods, the procedure does not need to rely on any synchronization among nodes, long-term correlation between their respective environments, or assumptions about training events. And by accurate, we mean the procedure yields low error in SNR estimation. We provide experimental validation of the difficulty of directly calibrating acoustic signals and the accuracy of our SNR calibration procedure.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130857524","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}

引用次数: 0

Link Lifetime-Based Segment-by-Segment Routing Protocol in MANETs manet中基于链路生存期的分段路由协议

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.39

Yujie Chen, Guojun Wang, Sancheng Peng

引用次数: 5