Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466971
Hua-Yan Wang, V. Zheng, Junhui Zhao, Qiang Yang
In pervasive computing, localizing a user in wireless indoor environments is an important yet challenging task. Among the state-of-art localization methods, fingerprinting is shown to be quite successful by statistically learning the signal to location relations. However, a major drawback for fingerprinting is that, it usually requires a lot of labeled data to train an accurate localization model. To establish a fingerprinting-based localization model in a building with many floors, we have to collect sufficient labeled data on each floor. This effort can be very burdensome. In this paper, we study how to reduce this calibration effort by only collecting the labeled data on one floor, while collecting unlabeled data on other floors. Our idea is inspired by the observation that, although the wireless signals can be quite different, the floor-plans in a building are similar. Therefore, if we co-embed these different floors' data in some common low-dimensional manifold, we are able to align the unlabeled data with the labeled data well so that we can then propagate the labels to the unlabeled data. We conduct empirical evaluations on real-world multi-floor data sets to validate our proposed method.
{"title":"Indoor localization in multi-floor environments with reduced effort","authors":"Hua-Yan Wang, V. Zheng, Junhui Zhao, Qiang Yang","doi":"10.1109/PERCOM.2010.5466971","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466971","url":null,"abstract":"In pervasive computing, localizing a user in wireless indoor environments is an important yet challenging task. Among the state-of-art localization methods, fingerprinting is shown to be quite successful by statistically learning the signal to location relations. However, a major drawback for fingerprinting is that, it usually requires a lot of labeled data to train an accurate localization model. To establish a fingerprinting-based localization model in a building with many floors, we have to collect sufficient labeled data on each floor. This effort can be very burdensome. In this paper, we study how to reduce this calibration effort by only collecting the labeled data on one floor, while collecting unlabeled data on other floors. Our idea is inspired by the observation that, although the wireless signals can be quite different, the floor-plans in a building are similar. Therefore, if we co-embed these different floors' data in some common low-dimensional manifold, we are able to align the unlabeled data with the labeled data well so that we can then propagate the labels to the unlabeled data. We conduct empirical evaluations on real-world multi-floor data sets to validate our proposed method.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117012261","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}
Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466978
Ulrich Steinhoff, B. Schiele
Modern mobile phones enable absolute positioning based on GPS or WiFi. However, incremental positioning based on dead reckoning is an interesting source of complementary information, e.g., for indoor positioning or for filling in reception gaps. In the literature however, reasonable dead reckoning accuracies have been reported for fixed and typically a priori known device placements only, e.g., on the hip. Therefore, this paper contributes an experimental study of several published as well as novel approaches for dead reckoning in a scenario with unconstrained placement of a device in the user's trouser pockets. Utilizing the movement of a sensor in a trouser pocket due to body motion, we estimate the user's walking direction and steps robustly for arbitrary placements in the pocket and without additional body-worn sensors. We evaluate these methods on a large dataset of 23 traces of 8 different persons, and compare different approaches.
{"title":"Dead reckoning from the pocket - An experimental study","authors":"Ulrich Steinhoff, B. Schiele","doi":"10.1109/PERCOM.2010.5466978","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466978","url":null,"abstract":"Modern mobile phones enable absolute positioning based on GPS or WiFi. However, incremental positioning based on dead reckoning is an interesting source of complementary information, e.g., for indoor positioning or for filling in reception gaps. In the literature however, reasonable dead reckoning accuracies have been reported for fixed and typically a priori known device placements only, e.g., on the hip. Therefore, this paper contributes an experimental study of several published as well as novel approaches for dead reckoning in a scenario with unconstrained placement of a device in the user's trouser pockets. Utilizing the movement of a sensor in a trouser pocket due to body motion, we estimate the user's walking direction and steps robustly for arbitrary placements in the pocket and without additional body-worn sensors. We evaluate these methods on a large dataset of 23 traces of 8 different persons, and compare different approaches.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130563997","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}
Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466983
Bo Ding, Huaimin Wang, Dian-xi Shi, Jiannong Cao
In many cases, we would like to enhance the predefined adaptability of a running application, for example, to enable it to cope with a strange environment. To make such kind of runtime modifications is a challenging task. In existing engineering practices, the online policy upgrade approach just focuses on the modification of adaptation decision logic and lacks system-level means to assess the validity of an upgrade. This paper proposes a framework for adaptive software that supports the online reconfiguration of each concern in the “sensing-decision-execution” adaptation loop. To achieve this goal, our framework supports an architecture style which encapsulates adaptation concerns as software architecture elements. And then, it maintains a runtime architecture model to enable the dynamic reconfiguration of those elements as well as help to ensure the validity of a change. A third party can selectively add, remove or replace part of this model to enhance the running application's adaptability. We validated this framework by two cases extracted from real life.
{"title":"Taming software adaptability with architecture-centric framework","authors":"Bo Ding, Huaimin Wang, Dian-xi Shi, Jiannong Cao","doi":"10.1109/PERCOM.2010.5466983","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466983","url":null,"abstract":"In many cases, we would like to enhance the predefined adaptability of a running application, for example, to enable it to cope with a strange environment. To make such kind of runtime modifications is a challenging task. In existing engineering practices, the online policy upgrade approach just focuses on the modification of adaptation decision logic and lacks system-level means to assess the validity of an upgrade. This paper proposes a framework for adaptive software that supports the online reconfiguration of each concern in the “sensing-decision-execution” adaptation loop. To achieve this goal, our framework supports an architecture style which encapsulates adaptation concerns as software architecture elements. And then, it maintains a runtime architecture model to enable the dynamic reconfiguration of those elements as well as help to ensure the validity of a change. A third party can selectively add, remove or replace part of this model to enhance the running application's adaptability. We validated this framework by two cases extracted from real life.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"567 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125431705","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}
Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466994
P. Medagliani, Jérémie Leguay, Vincent Gay, Mario Lopez-Ramos, G. Ferrari
This paper addresses the problem of engineering energy-efficient target detection applications using unattended Wireless Sensor Networks (WSNs) for long-lasting surveillance of areas of interest. As battery energy depletion is an issue in this context, an approach consists of switching on and off sensing and communication modules of wireless sensors according to duty cycles. Making these modules work in an intermittent fashion impacts (i) the latency of notification transmission (depending on the communication duty cycle) and (ii) the probability of missed target detection (depending on the number of deployed nodes and the sensing duty cycle). In order to optimize the system parameters according to performance objectives, we first derive an analytical engineering toolkit which evaluates the probability of missed detection (Pmd), the notification transmission latency (D), and the network lifetime (¿) under the assumption of random node deployment. Then, we show how this toolbox can be used to optimally configure system parameters under realistic performance constraints.
{"title":"Engineering energy-efficient target detection applications in Wireless Sensor Networks","authors":"P. Medagliani, Jérémie Leguay, Vincent Gay, Mario Lopez-Ramos, G. Ferrari","doi":"10.1109/PERCOM.2010.5466994","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466994","url":null,"abstract":"This paper addresses the problem of engineering energy-efficient target detection applications using unattended Wireless Sensor Networks (WSNs) for long-lasting surveillance of areas of interest. As battery energy depletion is an issue in this context, an approach consists of switching on and off sensing and communication modules of wireless sensors according to duty cycles. Making these modules work in an intermittent fashion impacts (i) the latency of notification transmission (depending on the communication duty cycle) and (ii) the probability of missed target detection (depending on the number of deployed nodes and the sensing duty cycle). In order to optimize the system parameters according to performance objectives, we first derive an analytical engineering toolkit which evaluates the probability of missed detection (Pmd), the notification transmission latency (D), and the network lifetime (¿) under the assumption of random node deployment. Then, we show how this toolbox can be used to optimally configure system parameters under realistic performance constraints.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134176078","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}
Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466972
M. D. Kristensen
Cyber foraging is a pervasive computing technique where small mobile devices offload resource intensive tasks to stronger computing machinery in the vicinity. This paper presents Scavenger-a new cyber foraging system supporting easy development of mobile cyber foraging applications, while still delivering efficient, mobile use of remote computing resources through the use of a custom built mobile code execution environment and a new dual-profiling scheduler. One of the main difficulties within cyber foraging is that it is very challenging for application programmers to develop cyber foraging enabled applications. An application using cyber foraging is working with mobile, distributed and, possibly, parallel computing; fields within computer science known to be hard for programmers to grasp. In this paper it is shown by example, how a highly distributed, parallel, cyber foraging enabled application can be developed using Scavenger. Benchmarks of the example application are presented showing that Scavenger imposes only minimal overhead when no surrogates are available, while greatly improving performance as surrogates become available.
{"title":"Scavenger: Transparent development of efficient cyber foraging applications","authors":"M. D. Kristensen","doi":"10.1109/PERCOM.2010.5466972","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466972","url":null,"abstract":"Cyber foraging is a pervasive computing technique where small mobile devices offload resource intensive tasks to stronger computing machinery in the vicinity. This paper presents Scavenger-a new cyber foraging system supporting easy development of mobile cyber foraging applications, while still delivering efficient, mobile use of remote computing resources through the use of a custom built mobile code execution environment and a new dual-profiling scheduler. One of the main difficulties within cyber foraging is that it is very challenging for application programmers to develop cyber foraging enabled applications. An application using cyber foraging is working with mobile, distributed and, possibly, parallel computing; fields within computer science known to be hard for programmers to grasp. In this paper it is shown by example, how a highly distributed, parallel, cyber foraging enabled application can be developed using Scavenger. Benchmarks of the example application are presented showing that Scavenger imposes only minimal overhead when no surrogates are available, while greatly improving performance as surrogates become available.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134217941","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}
Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466993
Juong-Sik Lee, Baik Hoh
This paper studies economic models of user participation incentive in participatory sensing applications. User participation is the most important element in participatory sensing applications for providing adequate level of service quality. However, incentive mechanism and its economic model for user participation have never been addressed so far in this research domain. In order to stimulate user participation, we design and evaluate a novel Reverse Auction based Dynamic Price (RADP) incentive mechanism, where users can sell their sensing data to a service provider with users' claimed bid prices. The proposed incentive mechanism focuses on minimizing and stabilizing incentive cost while maintaining adequate number of participants by preventing users from dropping out of participatory sensing applications. Compared with a Random Selection with Fixed Price (RSFP) incentive mechanism, the proposed mechanism not only reduces the incentive cost for retaining same number of participants by more than 60% but also improves the fairness of incentive distribution and social welfare. More importantly, RADP can remove burden of accurate pricing for user sensing data, the most difficult step in RSFP.
{"title":"Sell your experiences: a market mechanism based incentive for participatory sensing","authors":"Juong-Sik Lee, Baik Hoh","doi":"10.1109/PERCOM.2010.5466993","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466993","url":null,"abstract":"This paper studies economic models of user participation incentive in participatory sensing applications. User participation is the most important element in participatory sensing applications for providing adequate level of service quality. However, incentive mechanism and its economic model for user participation have never been addressed so far in this research domain. In order to stimulate user participation, we design and evaluate a novel Reverse Auction based Dynamic Price (RADP) incentive mechanism, where users can sell their sensing data to a service provider with users' claimed bid prices. The proposed incentive mechanism focuses on minimizing and stabilizing incentive cost while maintaining adequate number of participants by preventing users from dropping out of participatory sensing applications. Compared with a Random Selection with Fixed Price (RSFP) incentive mechanism, the proposed mechanism not only reduces the incentive cost for retaining same number of participants by more than 60% but also improves the fairness of incentive distribution and social welfare. More importantly, RADP can remove burden of accurate pricing for user sensing data, the most difficult step in RSFP.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114778907","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}
Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466968
Thadpong Pongthawornkamol, Shameem Ahmed, K. Nahrstedt, A. Uchiyama
WiFi localization and tracking of indoor moving objects is an important problem in many contexts of ubiquitous buildings, first responder environments, and others. Previous approaches in WiFi-based indoor localization and tracking either assume prior knowledge of indoor environment or assume many data samples from location-fixed WiFi sources (i.e. anchor points). However, such assumptions are not always true, especially in emergency scenarios. This paper explores the possibility of real-time indoor localization and tracking without any knowledge of indoor environment and with real-time data samples from only few anchor points outside the building. By using a small set of synchronized directional antennas as outdoor anchor points to actively scan in various directions, a moving device inside the building can be localized and tracked from the received signal in real-time manner. The paper proposes an angle-of-arrival estimator for accurate localization and adaptive per-antenna angular scheduling for real-time indoor tracking. The validation results from real experiment and simulation yield effectiveness and accuracy of the proposed schemes.
{"title":"Zero-knowledge real-time indoor tracking via outdoor wireless directional antennas","authors":"Thadpong Pongthawornkamol, Shameem Ahmed, K. Nahrstedt, A. Uchiyama","doi":"10.1109/PERCOM.2010.5466968","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466968","url":null,"abstract":"WiFi localization and tracking of indoor moving objects is an important problem in many contexts of ubiquitous buildings, first responder environments, and others. Previous approaches in WiFi-based indoor localization and tracking either assume prior knowledge of indoor environment or assume many data samples from location-fixed WiFi sources (i.e. anchor points). However, such assumptions are not always true, especially in emergency scenarios. This paper explores the possibility of real-time indoor localization and tracking without any knowledge of indoor environment and with real-time data samples from only few anchor points outside the building. By using a small set of synchronized directional antennas as outdoor anchor points to actively scan in various directions, a moving device inside the building can be localized and tracked from the received signal in real-time manner. The paper proposes an angle-of-arrival estimator for accurate localization and adaptive per-antenna angular scheduling for real-time indoor tracking. The validation results from real experiment and simulation yield effectiveness and accuracy of the proposed schemes.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957701","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}
Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466992
Tahiry Razafindralambo, N. Mitton, A. C. Viana, M. Amorim, K. Obraczka
Some current and future pervasive data driven applications must operate in “extreme” environments where end-to-end connectivity cannot be guaranteed at all times. In fact, it is likely that in these environments partitions are, rather than exceptions, part of the normal network operation. In this paper, we introduce Cover, a suite of adaptive strategies to control the trajectory of “infrastructure” nodes, which are deployed to bridge network partitions and thus play a critical role in data delivery. In particular, we focus on applications where end (or target) nodes are mobile and their mobility is unknown. Our goal is then to deploy and manage infrastructure nodes so that application-level requirements such as reliable data delivery and latency are met while still limiting deployment cost and balancing the load among infrastructure nodes. Cover achieves these goals using a localized and adaptive approach to infrastructure management based on the observed mobility of target nodes. To this end, Cover takes advantage of contact opportunities between infrastructure nodes to exchange information about their covered zones, and thus, help monitor targets in a more efficient fashion. Through extensive simulations, we show how Cover's adaptive features yield a fair distribution of targets per infrastructure node based only on limited network knowledge.
{"title":"Adaptive deployment for pervasive data gathering in connectivity-challenged environments","authors":"Tahiry Razafindralambo, N. Mitton, A. C. Viana, M. Amorim, K. Obraczka","doi":"10.1109/PERCOM.2010.5466992","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466992","url":null,"abstract":"Some current and future pervasive data driven applications must operate in “extreme” environments where end-to-end connectivity cannot be guaranteed at all times. In fact, it is likely that in these environments partitions are, rather than exceptions, part of the normal network operation. In this paper, we introduce Cover, a suite of adaptive strategies to control the trajectory of “infrastructure” nodes, which are deployed to bridge network partitions and thus play a critical role in data delivery. In particular, we focus on applications where end (or target) nodes are mobile and their mobility is unknown. Our goal is then to deploy and manage infrastructure nodes so that application-level requirements such as reliable data delivery and latency are met while still limiting deployment cost and balancing the load among infrastructure nodes. Cover achieves these goals using a localized and adaptive approach to infrastructure management based on the observed mobility of target nodes. To this end, Cover takes advantage of contact opportunities between infrastructure nodes to exchange information about their covered zones, and thus, help monitor targets in a more efficient fashion. Through extensive simulations, we show how Cover's adaptive features yield a fair distribution of targets per infrastructure node based only on limited network knowledge.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121203762","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}
Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466999
Shinichi Minamimoto, S. Fujii, H. Yamaguchi, T. Higashino
In this paper, we propose an algorithm to estimate 2D shapes and positions of obstacles such as buildings using GPS and wireless communication history of mobile nodes. Our algorithm enables quick recognition of geography, which is required in broader types of activities such as rescue activities in emergency situations. Nevertheless, detailed building maps might not be immediately available in private regions such as large factories, warehouses and universities, or prepared maps might not be effective due to collapse of buildings or roads in disaster situations. Some methodologies adopt range measurement sensors like infra-red and laser sensors or cameras. However, they require dedicated hardware and actions for the measurement. Meanwhile, the proposed method can create a rough 2D view of buildings and roads using only wireless communication history between mobile nodes and position history from GPS receivers. The results from the experiment conducted in 150m×190m region on our university campus assuming rescue and treatment actions by 15 members have shown that our method could generate a local map with 85% accuracy within 350 seconds. We have also validated the performance of our algorithm by simulations with various settings.
{"title":"Local map generation using position and communication history of mobile nodes","authors":"Shinichi Minamimoto, S. Fujii, H. Yamaguchi, T. Higashino","doi":"10.1109/PERCOM.2010.5466999","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466999","url":null,"abstract":"In this paper, we propose an algorithm to estimate 2D shapes and positions of obstacles such as buildings using GPS and wireless communication history of mobile nodes. Our algorithm enables quick recognition of geography, which is required in broader types of activities such as rescue activities in emergency situations. Nevertheless, detailed building maps might not be immediately available in private regions such as large factories, warehouses and universities, or prepared maps might not be effective due to collapse of buildings or roads in disaster situations. Some methodologies adopt range measurement sensors like infra-red and laser sensors or cameras. However, they require dedicated hardware and actions for the measurement. Meanwhile, the proposed method can create a rough 2D view of buildings and roads using only wireless communication history between mobile nodes and position history from GPS receivers. The results from the experiment conducted in 150m×190m region on our university campus assuming rescue and treatment actions by 15 members have shown that our method could generate a local map with 85% accuracy within 350 seconds. We have also validated the performance of our algorithm by simulations with various settings.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128936961","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}
Pub Date : 2010-05-20DOI: 10.1109/PERCOM.2010.5466982
Seungwoo Kang, Youngki Lee, Chulhong Min, Younghyun Ju, Taiwoo Park, Jinwon Lee, Yunseok Rhee, Junehwa Song
In this paper, we present Orchestrator, an active resource orchestration framework for mobile context monitoring. Emerging pervasive environments will introduce a PAN-scale sensor-rich mobile platform consisting of a mobile device and many wearable and space-embedded sensors. In such environments, it is challenging to enable multiple context-aware applications requiring continuous context monitoring to simultaneously run and share highly scarce and dynamic resources. Orchestrator enables multiple applications to effectively share the resources while exploiting the full capacity of overall system resources and providing high-quality service to users. For effective orchestration, we propose an active resource use orchestration approach that actively finds appropriate resource uses for applications and flexibly utilizes them depending on dynamic system conditions. Orchestrator is built upon a prototype platform that consists of off-the-shelf mobile devices and sensor motes. We present the detailed design, implementation, and evaluation of Orchestrator. The evaluation results show that Orchestrator enables applications in a resource-efficient way.
{"title":"Orchestrator: An active resource orchestration framework for mobile context monitoring in sensor-rich mobile environments","authors":"Seungwoo Kang, Youngki Lee, Chulhong Min, Younghyun Ju, Taiwoo Park, Jinwon Lee, Yunseok Rhee, Junehwa Song","doi":"10.1109/PERCOM.2010.5466982","DOIUrl":"https://doi.org/10.1109/PERCOM.2010.5466982","url":null,"abstract":"In this paper, we present Orchestrator, an active resource orchestration framework for mobile context monitoring. Emerging pervasive environments will introduce a PAN-scale sensor-rich mobile platform consisting of a mobile device and many wearable and space-embedded sensors. In such environments, it is challenging to enable multiple context-aware applications requiring continuous context monitoring to simultaneously run and share highly scarce and dynamic resources. Orchestrator enables multiple applications to effectively share the resources while exploiting the full capacity of overall system resources and providing high-quality service to users. For effective orchestration, we propose an active resource use orchestration approach that actively finds appropriate resource uses for applications and flexibly utilizes them depending on dynamic system conditions. Orchestrator is built upon a prototype platform that consists of off-the-shelf mobile devices and sensor motes. We present the detailed design, implementation, and evaluation of Orchestrator. The evaluation results show that Orchestrator enables applications in a resource-efficient way.","PeriodicalId":207774,"journal":{"name":"2010 IEEE International Conference on Pervasive Computing and Communications (PerCom)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129451590","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：