{"title":"Increasing the Ease of Deployment in Ubiquitous Environments","authors":"Kazutaka Matsuzaki, S. Honiden","doi":"10.1109/PERCOMW.2007.57","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.57","url":null,"abstract":"In the near future, applications with location-aware capabilities could be major development targets in the software industry. The current development frameworks rarely pay attention to developing applications for multiple ubiquitous environments. From the perspective of porting or updating applications, there are two dependencies: spatial and localized. These are dependencies on a single environment in which an application is deployed. We propose a new framework that uses a spatio-temporal scope (STS) model to ease deployment of location-aware applications by lessening these dependencies. We describe our model and explain the roles of the STS in the development stages of an application","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132439436","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 Webcasting to Mobile Devices: Reusing Web & Video Content for Pervasive E-Learning","authors":"C. Turró, L. Morcillo, M. Ferrando, J. Busquets","doi":"10.1109/PERCOMW.2007.89","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.89","url":null,"abstract":"One of the biggest concerns in e-learning is the development of suitable content. To reuse standard Webcast content for mobile phones and smartphones we have designed and tested a content adaptation system that enables the presentation & reuse of Webcast multimedia content for resource limited mobile terminals. In particular, our system approach the limitations related to small screen displays. The presented system has been integrated and tested in real terminals using diverse bitrates and resolutions, and we have carried out a subjective evaluation of its capabilities through a group of students","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"21 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131051125","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":"Static Path Planning for Mobile Beacons to Localize Sensor Networks","authors":"Rui Huang, G. Záruba","doi":"10.1109/PERCOMW.2007.109","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.109","url":null,"abstract":"In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be uniformly deployed to a predefined deployment area. We then deploy a robot to serve as a mobile beacon to enable the localization of the sensor nodes. The robot follows a pre-determined static path while periodically broadcasting its current location coordinates to the nearby sensors. The static path planning problem looks for good paths that result in better localization accuracy and coverage of the sensor network while keeping the path length bounded. We propose two new path types, CIRCLES and S-CURVES, that are specifically designed to reduce the collinearity during localization. We compare our solution with existing ones using the Cramer Rao bound (CRB) as the evaluation tool, which gives an unbiased evaluation regardless of localization algorithm used. The evaluation shows that our solutions cope with collinearity in a more effective manner than previous solutions. Our solutions provide significantly better localization accuracy and coverage in the cases where collinearity is the greatest problem","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115126361","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":"A DSR Extension for Connection Stability Assessment in Mobile Ad-Hoc Networks","authors":"S. Penz","doi":"10.1109/PERCOMW.2007.6","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.6","url":null,"abstract":"The efficient assessment of connection stability in pervasive wireless environments is a crucial yet insufficiently explored problem. Existing stability assessment approaches for mobile networks focus rather on link stability and are based on unrealistic assumptions. In this paper, we propose an extension for the prevalent DSR routing protocol that allows for simple and efficient yet fairly accurate connection stability assessment based solely on routing information","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"50 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115552540","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":"SOS: Secure Overlay Sensornets","authors":"Leonardo B. Oliveira, A. Loureiro, R. Dahab","doi":"10.1109/PERCOMW.2007.107","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.107","url":null,"abstract":"Overlay networks (ONs) are logical networks built on top of a physical network with the aim of moving part of the routing complexity to the application layer. At the same time, sensornets are ad hoc networks comprised mainly of small sensor nodes with extremely limited resources which can be used to monitor areas of interest. In this paper, we present secure overlay sensornets (SOS). SOS builds an ON over a sensornet, and it establishes and monitors alternative overlay routes. By doing so, SOS is able to find out routes more secure than routes provided by the default routing protocol. Our results indicate that SOS improves the delivery ratio in scenarios under DoS attacks and that it is efficient in terms of energy consumption. To our knowledge, SOS is the first security mechanism based on ONs for sensornets","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125128742","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":"Challenges in the Tracking and Prediction of Scheduled-Vehicle Journeys","authors":"Dalia Tiesyte, Christian S. Jensen","doi":"10.1109/PERCOMW.2007.27","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.27","url":null,"abstract":"A number of applications in areas such as logistics, cargo delivery, and collective transport involve the management of fleets of vehicles that are expected to travel along known routes according to fixed schedules. Due to road construction, accidents, and other unanticipated conditions, the vehicles deviate from their schedules. At the same time, there is a need for the infrastructure surrounding the vehicles to continually know the actual status of the vehicles. For example, anticipated arrival times of buses may have to be displayed at bus stops. It is a fundamental challenge to maintain this type of knowledge with minimal cost. This paper characterizes the problem of real-time vehicle tracking using wireless communication, and of predicting the future status of the vehicles when their movements are restricted to given routes and when they follow schedules with the best effort. The paper discusses challenges related to tracking, to the prediction of future travel times, and to historical data analysis. It also suggests approaches to addressing the challenges","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125255822","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":"Lightweight Asymmetric Privacy-Preserving Authentication Protocols Secure against Active Attack","authors":"Yang Cui, K. Kobara, Kanta Matsuura, H. Imai","doi":"10.1109/PERCOMW.2007.60","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.60","url":null,"abstract":"As pervasive computing technologies develop fast, the privacy protection becomes a crucial issue and needs to be coped with very carefully. Typically, it is difficult to efficiently identify and manage plenty of the low-cost pervasive devices like radio frequency identification devices (RFID), without leaking any privacy information. In particular, the adversary may not only eavesdrop the communication in a passive way, but also mount an active attack to ask queries adaptively, which is obviously more dangerous. Towards settling this problem, in this paper, we propose lightweight authentication protocols which are privacy-preserving against active attack. The protocols are based on a fast asymmetric encryption with novel simplification, which consequently can assign an easy work to pervasive devices. Besides, unlike the usual management of the identities, our approach does not require any synchronization nor exhaustive search in the database, which enjoys great convenience in case of a large-scale system","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131296325","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":"Routing in Intermittently Connected Networks: Age Rumors in Connected Components","authors":"P. Jacquet, B. Mans","doi":"10.1109/PERCOMW.2007.101","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.101","url":null,"abstract":"Mbile ad hoc network (MANET) protocols are efficient in routing data dynamically between mobile nodes that belong to the same connected component and thus assume that the network is always fully connected. However, even if the network is continuously partitioned, a \"communication path\" may be available through time and mobility using intermediate mobile nodes (temporally within reach of each other). We consider the problem of routing with the sole assumption that the speed of the node mobility is less than the speed of transmitting a packet to a neighbor. We introduce new routing algorithms that vary depending on the buffering capability of the nodes while always minimizing the impact on the capacity (i.e., only one copy of a packet can be sent while a copy may be kept). The novelty is based on link aging rumors across connected components (as opposed to neighbor's aging). We show that various pattern of mobility and network clustering can be described by a single parameter such as the information speed propagation. We establish several analytical properties independent of mobility models using an analogy with the sound propagation in liquid where molecules creates temporary connected component in which sound travels fast","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128962102","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":"Energy Efficient Routing in Nomadic Networks","authors":"M. D. Kristensen, N. Bouvin","doi":"10.1109/PERCOMW.2007.43","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.43","url":null,"abstract":"We present an evaluation of a novel energy-efficient routing protocol for mobile ad-hoc networks. We combine two techniques for optimizing energy levels with a well-known routing protocol. We examine the behavior of this combination in a nomadic network setting, where some nodes are stationary and have a steady power supply. Protocol optimizations for the nomadic scenario are presented and validated through simulations","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123012721","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":"Privacy Protection in Dynamic Systems Based on RFID Tags","authors":"J. Cichon, M. Klonowski, Mirosław Kutyłowski","doi":"10.1109/PERCOMW.2007.96","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.96","url":null,"abstract":"We propose a solution for privacy problems regarding use of electronic identification tags such as RFID's. In our scheme the ID tag changes at random driven by its internal circuitry during each activation. The changes are small enough so that the legitimate system can recognize the tag and register the modified ID for the next activation. On the other hand, after a certain number of activations the new ID cannot be linked with the original one. We provide a rigid mathematical analysis of security of this unlinkability property","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128000588","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}