In this paper an approach for using Web services to facilitate non-proprietary digital rights management for mobile devices is described. The approach is based on the open mobile alliance's (OMA) DRM specification which is an interoperable industry quasi-standard in the mobile world. To be able to use the OMA-specific license delivery protocol in a more flexible and portable manner, employing Web services seems to be the best solution. This article describes a possible design for such a system and a prototypical implementation that has been developed as proof- of-concept. Along the way the challenges to be solved to obtain the designed system are explained and solved.
{"title":"Implementing OMA DRM Using Web Services: An Approach to Integrate OMA DRM and Web Services on Mobile Units","authors":"Lukas Grittner, Carsten Kleiner, Daniel Kadenbach","doi":"10.1109/MDM.2007.84","DOIUrl":"https://doi.org/10.1109/MDM.2007.84","url":null,"abstract":"In this paper an approach for using Web services to facilitate non-proprietary digital rights management for mobile devices is described. The approach is based on the open mobile alliance's (OMA) DRM specification which is an interoperable industry quasi-standard in the mobile world. To be able to use the OMA-specific license delivery protocol in a more flexible and portable manner, employing Web services seems to be the best solution. This article describes a possible design for such a system and a prototypical implementation that has been developed as proof- of-concept. Along the way the challenges to be solved to obtain the designed system are explained and solved.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130251218","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}
There are many studies in the literature addressing various issues concerning network services of wireless sensor networks. However, these existing studies were mostly targeted at general network services in wireless sensor networks and thus failed to explore their spatial properties. The spatial properties of data, queries, and network dynamics open up new research issues. This seminar introduces research issues and the state-of-the-art solutions in location-aware wireless sensor networks. We pay special attention to the aspects on data management and spatial network services. Geographical routing (Geo-routing) protocols make routing decision based on the location information of sensor nodes, relay nodes and routing destination.
{"title":"Location-Aware Wireless Sensor Networks","authors":"Wang-Chien Lee, Yingqi Xu","doi":"10.1109/MDM.2007.44","DOIUrl":"https://doi.org/10.1109/MDM.2007.44","url":null,"abstract":"There are many studies in the literature addressing various issues concerning network services of wireless sensor networks. However, these existing studies were mostly targeted at general network services in wireless sensor networks and thus failed to explore their spatial properties. The spatial properties of data, queries, and network dynamics open up new research issues. This seminar introduces research issues and the state-of-the-art solutions in location-aware wireless sensor networks. We pay special attention to the aspects on data management and spatial network services. Geographical routing (Geo-routing) protocols make routing decision based on the location information of sensor nodes, relay nodes and routing destination.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133778566","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}
Oranat Sangratanachaikul, Leping Huang, S. Konomi, K. Sezaki
In this paper, we analyze security and privacy issues in RFID-based reference point systems, which seamlessly provide high resolution location information so as to enable innovative mobile applications. Our preliminary analysis revealed the significance of the labor cost in deploying RFID reference points; therefore, we carefully analyze several system architecture candidates in terms of deployment cost and security/privacy threats. Based on the analysis, we select a scalable architecture to avoid the bottleneck in deployment cost even though it can be less secure. Finally, we briefly discuss potential solutions for critical security and privacy issues in the selected architecture.
{"title":"Analysis of Security and Privacy Issues in RFID-Based Reference Point Systems","authors":"Oranat Sangratanachaikul, Leping Huang, S. Konomi, K. Sezaki","doi":"10.1109/MDM.2007.57","DOIUrl":"https://doi.org/10.1109/MDM.2007.57","url":null,"abstract":"In this paper, we analyze security and privacy issues in RFID-based reference point systems, which seamlessly provide high resolution location information so as to enable innovative mobile applications. Our preliminary analysis revealed the significance of the labor cost in deploying RFID reference points; therefore, we carefully analyze several system architecture candidates in terms of deployment cost and security/privacy threats. Based on the analysis, we select a scalable architecture to avoid the bottleneck in deployment cost even though it can be less secure. Finally, we briefly discuss potential solutions for critical security and privacy issues in the selected architecture.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116214872","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}
T. Abe, T. Takada, H. Kawamura, T. Yasuno, N. Sonehara
As the availability and distribution of content through the medium of networks is increasing, the need for information-search technology keyed to content for the purposes of marketing, searching, and managing it is also constantly increasing. This paper proposes methods of extracting image features that can be used as content ID information, and of identifying identical images as keys to these features. As a result of experiments done on images, to which noise and lighting effects had been added, results were obtained that demonstrated better identification using our methods than that with existing ones. Further, the possibility of timely, efficient ID was also demonstrated in low-resource environments using mobile phones equipped with a camera.
{"title":"Image-Identification Methods for Camera-Equipped Mobile Phones","authors":"T. Abe, T. Takada, H. Kawamura, T. Yasuno, N. Sonehara","doi":"10.1109/MDM.2007.79","DOIUrl":"https://doi.org/10.1109/MDM.2007.79","url":null,"abstract":"As the availability and distribution of content through the medium of networks is increasing, the need for information-search technology keyed to content for the purposes of marketing, searching, and managing it is also constantly increasing. This paper proposes methods of extracting image features that can be used as content ID information, and of identifying identical images as keys to these features. As a result of experiments done on images, to which noise and lighting effects had been added, results were obtained that demonstrated better identification using our methods than that with existing ones. Further, the possibility of timely, efficient ID was also demonstrated in low-resource environments using mobile phones equipped with a camera.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130601364","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}
Mobile collaborative environments, being naturally loosely-coupled, call for optimistic replication solutions in order to attain the requirement of decentralized highly available access to data. However, such connectivity assumptions are also a decisive hindrance to the ability of optimistic replication protocols to rapidly guarantee consistency among the set of loosely-coupled replicas. This paper proposes the extension of conventional optimistic replication protocols to exploit the presence of extraneous nodes surrounding the group of replica nodes in an increasingly ubiquitous computational universe. In particular, we show that using such extra nodes as temporary carriers of lightweight consistency meta-data may significantly improve the efficiency of a replicated system; notably, it reduces commitment delay and conflicts, and allows more network-efficient propagation of updates. We support such a statement with experimental results obtained from a simulated environment.
{"title":"Exploiting Our Computational Surroundings for Better Mobile Collaboration","authors":"J. Barreto, P. Ferreira, M. Shapiro","doi":"10.1109/MDM.2007.24","DOIUrl":"https://doi.org/10.1109/MDM.2007.24","url":null,"abstract":"Mobile collaborative environments, being naturally loosely-coupled, call for optimistic replication solutions in order to attain the requirement of decentralized highly available access to data. However, such connectivity assumptions are also a decisive hindrance to the ability of optimistic replication protocols to rapidly guarantee consistency among the set of loosely-coupled replicas. This paper proposes the extension of conventional optimistic replication protocols to exploit the presence of extraneous nodes surrounding the group of replica nodes in an increasingly ubiquitous computational universe. In particular, we show that using such extra nodes as temporary carriers of lightweight consistency meta-data may significantly improve the efficiency of a replicated system; notably, it reduces commitment delay and conflicts, and allows more network-efficient propagation of updates. We support such a statement with experimental results obtained from a simulated environment.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957780","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}
Iacopo Carreras, D. Tacconi, D. Miorandi, I. Chlamtac
In this work, we present a multi-resolution data management scheme for efficiently storing and diffusing information, which is originating from sensors and augmenting mobile applications. The proposed mechanism exploits the discrete wavelet transform properties for providing a location-dependent data management scheme, which alleviates the constraints on the storage resources needed for running context-aware mobile applications. The data management scheme has been implemented and evaluated by means of numerical simulations.
{"title":"Multi-Resolution Data Management for Opportunistic Networking","authors":"Iacopo Carreras, D. Tacconi, D. Miorandi, I. Chlamtac","doi":"10.1109/MDM.2007.23","DOIUrl":"https://doi.org/10.1109/MDM.2007.23","url":null,"abstract":"In this work, we present a multi-resolution data management scheme for efficiently storing and diffusing information, which is originating from sensors and augmenting mobile applications. The proposed mechanism exploits the discrete wavelet transform properties for providing a location-dependent data management scheme, which alleviates the constraints on the storage resources needed for running context-aware mobile applications. The data management scheme has been implemented and evaluated by means of numerical simulations.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125248339","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}
Smart environments and wearables will make the storage and subsequent sharing of digitized multimedia diaries and meeting protocols - whom we meet, or what we say or do - cheap and easy. However, controlling access to this data will become cumbersome if traditional forms of access control are to be used: overly restrictive rules might deny the potential of data sharing, while a lack of control could easily lead to Orwellian surveillance scenarios. This paper presents FragDB, a storage concept based on localized access control, where data storage and retrieval are bound to a specific place, rather than the knowledge of a particular password or certificate. FragDB uses tiny RFID tags embedded in the environment to compute a local key that is used to encrypt and decrypt data in a global storage system. We describe the design and implementation of an initial prototype.
{"title":"FragDB - Secure Localized Storage Based on Super-Distributed RFID-Tag Infrastructures","authors":"Marc Langheinrich","doi":"10.1109/MDM.2007.49","DOIUrl":"https://doi.org/10.1109/MDM.2007.49","url":null,"abstract":"Smart environments and wearables will make the storage and subsequent sharing of digitized multimedia diaries and meeting protocols - whom we meet, or what we say or do - cheap and easy. However, controlling access to this data will become cumbersome if traditional forms of access control are to be used: overly restrictive rules might deny the potential of data sharing, while a lack of control could easily lead to Orwellian surveillance scenarios. This paper presents FragDB, a storage concept based on localized access control, where data storage and retrieval are bound to a specific place, rather than the knowledge of a particular password or certificate. FragDB uses tiny RFID tags embedded in the environment to compute a local key that is used to encrypt and decrypt data in a global storage system. We describe the design and implementation of an initial prototype.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132280582","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}
Dummy-based anonymization techniques for protecting location privacy of mobile users have been proposed in the literature. By generating dummies that move in humanlike trajectories, shows that location privacy of mobile users can be preserved. However, by monitoring long-term movement patterns of users, the trajectories of mobile users can still be exposed. We argue that, once the trajectory of a user is identified, locations of the user is exposed. Thus, it's critical to protect the moving trajectories of mobile users in order to preserve user location privacy. We propose two schemes that generate consistent movement patterns in a long run. Guided by three parameters in user specified privacy profile, namely, short- term disclosure, long-term disclosure and distance deviation, the proposed schemes derive movement trajectories for dummies. A preliminary performance study shows that our approach is more effective than existing work in protecting moving trajectories of mobile users and their location privacy.
{"title":"Protecting Moving Trajectories with Dummies","authors":"Tun-Hao You, Wen-Chih Peng, Wang-Chien Lee","doi":"10.1109/MDM.2007.58","DOIUrl":"https://doi.org/10.1109/MDM.2007.58","url":null,"abstract":"Dummy-based anonymization techniques for protecting location privacy of mobile users have been proposed in the literature. By generating dummies that move in humanlike trajectories, shows that location privacy of mobile users can be preserved. However, by monitoring long-term movement patterns of users, the trajectories of mobile users can still be exposed. We argue that, once the trajectory of a user is identified, locations of the user is exposed. Thus, it's critical to protect the moving trajectories of mobile users in order to preserve user location privacy. We propose two schemes that generate consistent movement patterns in a long run. Guided by three parameters in user specified privacy profile, namely, short- term disclosure, long-term disclosure and distance deviation, the proposed schemes derive movement trajectories for dummies. A preliminary performance study shows that our approach is more effective than existing work in protecting moving trajectories of mobile users and their location privacy.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132940206","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}
This paper studies the issues of energy-efficient query optimization for wireless sensor networks. Different from existing query optimization techniques that consider only query plans for extracting data from sensors at individual nodes, our approach takes into account both of the sensing and communication cost in query plans. Central to our study is a cost-based analysis, based on which the energy cost of candidate plans for a given query are estimated to determine a query plan that is likely to consume the least energy for execution. Simulation results show that the query plan chosen in our approach consumes significantly less energy than an approach that optimizes on sensing cost only.
{"title":"Optimizing Energy-Efficient Query Processing in Wireless Sensor Networks","authors":"R. Rosemark, Wang-Chien Lee, B. Urgaonkar","doi":"10.1109/MDM.2007.13","DOIUrl":"https://doi.org/10.1109/MDM.2007.13","url":null,"abstract":"This paper studies the issues of energy-efficient query optimization for wireless sensor networks. Different from existing query optimization techniques that consider only query plans for extracting data from sensors at individual nodes, our approach takes into account both of the sensing and communication cost in query plans. Central to our study is a cost-based analysis, based on which the energy cost of candidate plans for a given query are estimated to determine a query plan that is likely to consume the least energy for execution. Simulation results show that the query plan chosen in our approach consumes significantly less energy than an approach that optimizes on sensing cost only.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134258552","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}
The engineering community has recently begun to adopt wireless sensing technologies for use in many sensing applications. These low-cost sensors provide an optimal setting for dense sensing networks, and can make large amounts of sensor data available. Also, the computational power embedded within each sensing node allows a wireless network to interrogate data within the network and in real-time. In a monitoring situation, these capabilities can be leveraged to detect and locate changes in system properties that could be an early indication of malfunction within a complex physical system. In this paper, a distributed model updating technique is embedded within the computational core of a wireless sensing network. Using a novel distributed implementation of the simulated annealing method, an ad-hoc network of wireless sensing units can determine updated system properties by iteratively matching data derived from an analytical model of the system with collected sensor data. By comparing updated system properties with those obtained in a baseline state, a wireless sensing network can detect and locate changes in the system. Experimental verification of this technique is provided on a network of wireless sensor prototypes using simulated results from a Navy ship-board chilled water system monitored with a wireless sensor network.
{"title":"Parallelized Simulated Annealing for Model Updating in Ad-Hoc Wireless Sensing Networks","authors":"A. Zimmerman, J. Lynch","doi":"10.1109/MDM.2007.72","DOIUrl":"https://doi.org/10.1109/MDM.2007.72","url":null,"abstract":"The engineering community has recently begun to adopt wireless sensing technologies for use in many sensing applications. These low-cost sensors provide an optimal setting for dense sensing networks, and can make large amounts of sensor data available. Also, the computational power embedded within each sensing node allows a wireless network to interrogate data within the network and in real-time. In a monitoring situation, these capabilities can be leveraged to detect and locate changes in system properties that could be an early indication of malfunction within a complex physical system. In this paper, a distributed model updating technique is embedded within the computational core of a wireless sensing network. Using a novel distributed implementation of the simulated annealing method, an ad-hoc network of wireless sensing units can determine updated system properties by iteratively matching data derived from an analytical model of the system with collected sensor data. By comparing updated system properties with those obtained in a baseline state, a wireless sensing network can detect and locate changes in the system. Experimental verification of this technique is provided on a network of wireless sensor prototypes using simulated results from a Navy ship-board chilled water system monitored with a wireless sensor network.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128072371","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
扫码关注我们
求助内容：
应助结果提醒方式：