2009 IEEE International Conference on Pervasive Computing and Communications最新文献_第9页

Concurrent Event Detection for Asynchronous consistency checking of pervasive context 面向普及上下文异步一致性检查的并发事件检测

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912761

Yu Huang, Xiaoxing Ma, Jiannong Cao, Xianping Tao, Jian Lu

{"title":"Concurrent Event Detection for Asynchronous consistency checking of pervasive context","authors":"Yu Huang, Xiaoxing Ma, Jiannong Cao, Xianping Tao, Jian Lu","doi":"10.1109/PERCOM.2009.4912761","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912761","url":null,"abstract":"Contexts, the pieces of information that capture the characteristics of computing environments, are often inconsistent in the dynamic and uncertain pervasive computing environments. Various schemes have been proposed to check context consistency for pervasive applications. However, existing schemes implicitly assume that the contexts being checked belong to the same snapshot of time. This limitation makes existing schemes do not work in pervasive computing environments, which are characterized by the asynchronous coordination among computing devices. The main challenge imposed on context consistency checking by asynchronous environments is how to interpret and detect concurrent events. To this end, we propose in this paper the Concurrent Events Detection for Asynchronous consistency checking (CEDA) algorithm. An analytical model, together with corresponding numerical results, is derived to study the performance of CEDA. We also conduct extensive experimental evaluation to investigate whether CEDA is desirable for context-aware applications. Both theoretical analysis and experimental evaluation show that CEDA accurately detects concurrent events in time in asynchronous pervasive computing environments, even with dynamic changes in message delay, duration of events and error rate of context collection.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122381682","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}

引用次数: 41

Auction-based congestion management for target tracking in wireless sensor networks 基于拍卖的无线传感器网络目标跟踪拥塞管理

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912768

Lei Chen, B. Szymanski, Joel W. Branch

{"title":"Auction-based congestion management for target tracking in wireless sensor networks","authors":"Lei Chen, B. Szymanski, Joel W. Branch","doi":"10.1109/PERCOM.2009.4912768","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912768","url":null,"abstract":"This paper addresses the problem of providing congestion-management for a shared wireless sensor network-based target tracking system. In many large-scale wireless sensor network target tracking scenarios (e.g., a surveillance system for tracking vehicles in urban environments), multiple targets may converge within close proximity of each other. Such scenarios may cause network congestion as nearby sensors attempt to concurrently send updates to a data aggregation point (e.g., base station). We consider the case in which this problem is further complicated by two factors. First, such a large-scale sensor network may very well be deployed to serve multiple target tracking applications with different and dynamic priorities and interests in different (types of) targets. Second, each application will most likely place a different premium on the timeliness of the target information (principally defined by some quality metric) they receive. All the above challenges introduce formidable challenges in providing the expeditious delivery of target information to all prioritized applications. In this paper, we advocate the use of a distributed auction-based approach to locally manage network bandwidth allocation in the described context. We use the Second Price Auction mechanism (to ensure incentive compatibility) in which the congested node acts as the auctioneer and the packets carrying target updates act as bidders. Their bid values are defined by the loss of information utility to the applications associated with the packets. The winning packet receives the current transmission slot of the auctioneer node. We demonstrate through simulation that the resulting auction allocates bandwidth efficiently, maximizing the collective applications' goals, even when the application priorities change dynamically.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125795044","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}

引用次数: 17

A logic-based formalism for pervasive workflow 一种基于逻辑的普适工作流形式

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912816

Sourish Dasgupta

引用次数: 1

Aligning activity sequences for continuous tracking of cellphone users 调整活动序列以持续跟踪手机用户

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912833

Driss Choujaa, Naranker Dulay

引用次数: 2

Reliable ranging technique based on statistical RSSI analyses for an ad-hoc proximity detection system 基于统计RSSI分析的自组织近距离检测系统可靠测距技术

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912870

K. Nakamura, M. Kamio, Tetsushi Watanabe, Shinsuke Kobayashi, N. Koshizuka, K. Sakamura

引用次数: 7

NoShake: Content stabilization for shaking screens of mobile devices NoShake:移动设备晃动屏幕的内容稳定

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912750

Ahmad Rahmati, Clayton W. Shepard, Lin Zhong

引用次数: 21

Practical Rate Adaptation in Mobile environments 移动环境中的实际速率适应

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912769

X. Chen, Prateek Gangwal, D. Qiao

引用次数: 20

Online algorithms for maximizing quality of link transmissions over a jammed wireless channel 在阻塞的无线信道上使链路传输质量最大化的在线算法

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912840

R. Kannan, Shuangqing Wei, C. Busch, A. Vasilakos

{"title":"Online algorithms for maximizing quality of link transmissions over a jammed wireless channel","authors":"R. Kannan, Shuangqing Wei, C. Busch, A. Vasilakos","doi":"10.1109/PERCOM.2009.4912840","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912840","url":null,"abstract":"We consider the problem of a transmitter transmitting to its receiver over a wireless link subject to jamming and develop two online power control algorithms for maximizing wireless link quality (transmission rate). We assume that the transmitter transmits and the jammer interferes over a period of M time slots. The impact of the jammer is to deteriorate the quality of the wireless channel during time slots in which it is present. We assume a powerful random jammer with the ability to arbitrarily decrease the channel quality and affect any (unknown) number of time slots. Since the presence of the jammer is arbitrary, the complete jamming pattern (channel quality) over the given time period is unknown apriori. The current channel quality is revealed to the transmitter at the start of the current time slot while future channel quality remains unknown. The transmitter must then allocate power optimally to maximize the total transmission rate over M slots given only its knowledge of the current channel quality, thus giving rise to an online power control problem. We develop two online power control algorithms for maximizing the wireless link quality (transmission rate). The first algorithm is based on constant power scaling and has O(1) competitive ratio when the average received power quality over M time slots (ĥhgPT/M) is either very small or very large. However when ĥhgPT = O(M), this algorithm has an upper bound on its competitive ratio of O(logM/log logM}. This upper bound is tight. The second online algorithm based on constant rate scaling has a worst case competitive ratio of given equation. By judiciously choosing which algorithm to use based on the offline available parameter of average received power, we can assure an almost constant competitive ratio for maximizing link quality under all cases.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128180856","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

Context inference of users' social relationships and distributed policy management 用户社会关系的情境推理与分布式策略管理

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912890

A. Devlic, R. Reichle, M. Wagner, M. Kirsch-Pinheiro, Yves Vanrompay, Y. Berbers, M. Valla

{"title":"Context inference of users' social relationships and distributed policy management","authors":"A. Devlic, R. Reichle, M. Wagner, M. Kirsch-Pinheiro, Yves Vanrompay, Y. Berbers, M. Valla","doi":"10.1109/PERCOM.2009.4912890","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912890","url":null,"abstract":"Inference of high-level context is becoming crucial in development of context-aware applications. An example is social context inference - i.e., deriving social relations based upon the user's daily communication with other people. The efficiency of this mechanism mainly depends on the method(s) used to draw inferences based on existing evidence and sample information, such as a training data. Our approach uses rule-based data mining, Bayesian network inference, and user feedback to compute the probabilities of another user being in the specific social relationship with a user whose daily communication is logged by a mobile phone. In addition, a privacy mechanism is required to ensure the user's personal integrity and privacy when sharing this user's sensitive context data. Therefore, the derived social relations are used to define a user's policies for context access control, which grant the restricted context information scope depending on the user's current context. Finally, we propose a distributed architecture capable of managing this context information based upon these context access policies.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"74 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123079613","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}

引用次数: 18

Towards shrink-wrapped security: A taxonomy of security-relevant context 走向封装安全性:与安全性相关的上下文的分类法

2009 IEEE International Conference on Pervasive Computing and Communications Pub Date : 2009-03-09 DOI: 10.1109/PERCOM.2009.4912819

Gleneesha Johnson

引用次数: 16