2008 Ninth International Conference on Mobile Data Management Workshops, MDMW最新文献

筛选
英文 中文
Information Dissemination of Location Dependent Data in Consideration of Connectivity and Network Partition in Mobile Ad Hoc Sensor Networks 移动Ad Hoc传感器网络中考虑连通性和网络划分的位置依赖数据信息传播
G. Tsuchida, S. Ishihara
{"title":"Information Dissemination of Location Dependent Data in Consideration of Connectivity and Network Partition in Mobile Ad Hoc Sensor Networks","authors":"G. Tsuchida, S. Ishihara","doi":"10.1109/MDMW.2008.10","DOIUrl":"https://doi.org/10.1109/MDMW.2008.10","url":null,"abstract":"In mobile ad hoc networks, due to the movement of hosts, obstacles, etc, it is difficult for mobile hosts to access the data on other hosts. To solve this problem, replica distribution methods which distribute the replicas of data items to other hosts and maintain them have been proposed. We have proposed LDR (Link-aware and Density-based Rearrangement) method for dynamic rearrangement of replicas of location dependent data. In the LDR method, replicas of the location dependent data items are placed on mobile hosts which are the neighbors of branch points of the ad hoc networks and the density of replicas are controlled according to the degree of the network topology. We evaluated the performance of the LDR method by simulation. The simulation results show that the LDR method achieves higher performance than other methods when the distance between the requesting host and the location where the data item is associated is long and the host moving velocity is high.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127055013","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}
引用次数: 1
The Integration of Data Streams with Probabilities and Relational Database using Bayesian Networks 基于贝叶斯网络的数据流概率与关系数据库集成
R. Sato, H. Kawashima, H. Kitagawa
{"title":"The Integration of Data Streams with Probabilities and Relational Database using Bayesian Networks","authors":"R. Sato, H. Kawashima, H. Kitagawa","doi":"10.1109/MDMW.2008.25","DOIUrl":"https://doi.org/10.1109/MDMW.2008.25","url":null,"abstract":"As sensor devices develop, not only the amount of uncertain sensor data streams is dramatically increasing, but also the streams are processed in a variety of ways. We believe one of important ways is to reason contexts from them, and the integration of dynamic reasoning result and static data in databases. This paper proposes the integration of probabilistic data streams and relational database by using Bayesian networks which is one of the most useful techniques for reasoning uncertain contexts in the physical world. And this paper has three concrete contributions. For the first contribution, we model the Bayesian networks as an abstract data type in the object relational database. Bayesian networks are stored as objects, and we define new operator to integrate Bayesian networks and relational database. Since Bayesian networks has the graphical model, it does not directly fit relational database that is constituted of relations. Our new operators allows to extract a part of data from Bayesian networks in the form of relations. For the second contribution, to allow continuous queries over data streams generated from the Bayesian networks, our proposed method introduces a new concept, lifetime, into the Bayesian networks. Although the Bayesian networks is a famous reasoning method, it is not yet treated in data stream systems. The lifespan allows a Bayesian networks to detect multiple events for each evaluation of a continuous query. For the third contribution, we proposed efficient methods for probability values propagations. The methods omits unnecessary update propagations for continuous queries. The result of experiments clearly showed that our proposed algorithm outperforms usual algorithms.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115337610","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}
引用次数: 1
Mobile Sensor Control Methods for Reducing Power Consumption in Sparse Sensor Network 稀疏传感器网络中降低功耗的移动传感器控制方法
T. Shinjo, S. Kitajima, T. Ogawa, T. Hara, S. Nishio
{"title":"Mobile Sensor Control Methods for Reducing Power Consumption in Sparse Sensor Network","authors":"T. Shinjo, S. Kitajima, T. Ogawa, T. Hara, S. Nishio","doi":"10.1109/MDMW.2008.15","DOIUrl":"https://doi.org/10.1109/MDMW.2008.15","url":null,"abstract":"In mobile sensor networks with a small number of nodes, because nodes' radio communication range does not cover the whole sensing area, every node has to move closer to the data sink to deliver its sensed data. Thus, the power consumption to deliver the sensed data to the data sink becomes large. In this paper, we propose two novel methods that nodes construct a temporal network to deliver the sensed data with low power consumption. We also show the simulation results to evaluate our methods. We confirmed that our methods reduce the power consumption of nodes for moving to the data sink to deliver the sensed data.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115053141","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}
引用次数: 13
On a Mobile Sensor Control Method for Uniform Sensing in Sparse Sensor Networks 稀疏传感器网络中均匀感知的移动传感器控制方法
K. Treeprapin, A. Kanzaki, T. Hara, S. Nishio
{"title":"On a Mobile Sensor Control Method for Uniform Sensing in Sparse Sensor Networks","authors":"K. Treeprapin, A. Kanzaki, T. Hara, S. Nishio","doi":"10.1109/MDMW.2008.18","DOIUrl":"https://doi.org/10.1109/MDMW.2008.18","url":null,"abstract":"Recent advance in robotics technology has led to an increasing interest in mobile sensor networks that are constructed by sensor nodes with a moving facility (mobile sensors). Until now, we have proposed an effective mobile sensor control method, named DATFM (Data Acquisition and Transmission with Fixed and Mobile Node), for sparse sensor networks. DATFM achieves the effective data acquisition in a sparse network by accumulating data on fixed nodes and then transmitting them via a communication route constructed by multiple mobile sensors. In this paper, we propose DATFM/DA (DATFM with area Dividing and node deployment Adjusting) as an extension of DATFM to uniformize the amount of acquired data in the whole area. DATFM/DA divides the target area into several regions and adjusts the number of mobile sensors deployed in each region. Furthermore, we conduct simulation experiments to evaluate the performance of DATFM/DA.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125832650","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}
引用次数: 1
Cost Efficient Data Collection of Sensory Originated Data using Context-Aware Mobile Devices 使用上下文感知移动设备的低成本传感数据收集
P. Jayaraman, A. Zaslavsky, J. Delsing
{"title":"Cost Efficient Data Collection of Sensory Originated Data using Context-Aware Mobile Devices","authors":"P. Jayaraman, A. Zaslavsky, J. Delsing","doi":"10.1109/MDMW.2008.6","DOIUrl":"https://doi.org/10.1109/MDMW.2008.6","url":null,"abstract":"Sensory originated data collection and processing has always been a big challenge in wireless sensor networks (WSN). WSN represent a distributed producer of large amount of valuable data required by varied number of applications. In this paper we propose the use of context aware data mules (CADAMULE) as a solution for smart data collection within sensor networks. We present an extension to Context Spaces modelling theory by incorporating context discovery at runtime. This facilitates our system to discover new context attributes by looking into previous situations and events when pre-defined context is not sufficient for the reasoning process. We use this model as a base to provide contextual information to the mobile data mule whose spare capacity for communication and processing can be used to collect and process sensor data. The focus of the paper is to propose and evaluate a cost-efficient data collection technique which uses a cost formula computed from the context information obtained by the system. We validate our system by a simulation in which we try to reason out and identify the best and also the most cost efficient data mule. The context aware data mule negotiates with the sensor node collecting and delivering the data to the sink.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123662457","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}
引用次数: 6
SPIRAL: A Scalable Private Information Retrieval Approach to Location Privacy 螺旋:一个可扩展的隐私信息检索方法的位置隐私
Ali Khoshgozaran, Houtan Shirani-Mehr, C. Shahabi
{"title":"SPIRAL: A Scalable Private Information Retrieval Approach to Location Privacy","authors":"Ali Khoshgozaran, Houtan Shirani-Mehr, C. Shahabi","doi":"10.1109/MDMW.2008.23","DOIUrl":"https://doi.org/10.1109/MDMW.2008.23","url":null,"abstract":"Protecting users' location information in location-based services, also termed location privacy, has recently garnered significant attention due to its importance in satisfying users' privacy concerns when using location-aware services. Several approaches proposed in the literature blur the user's location in a region by increasing its spatial extent or anonymizing the user among several other users. Such approaches in nature require users to communicate through a trusted anonymizer for all of their queries which can impose unrealistic overall communication/computation overhead between the server and the anonymizer for users with more stringent privacy requirements. We revisit the location privacy problem with the objective of providing significantly more stringent privacy guarantees and propose SPIRAL, a scalable private information retrieval approach to location privacy, which is to the best of our knowledge, the first approach to utilize practical private information retrieval (PIR) as a more fundamental approach to enable blind evaluation of range queries. We perform several experiments on real-world data to evaluate the effectiveness and the feasibility of our approach.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127463919","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}
引用次数: 50
Context Driven Compositional Adaptation of Mobile Agents 上下文驱动的移动代理组合自适应
Kutila Gunasekera, A. Zaslavsky, S. Loke, S. Krishnaswamy
{"title":"Context Driven Compositional Adaptation of Mobile Agents","authors":"Kutila Gunasekera, A. Zaslavsky, S. Loke, S. Krishnaswamy","doi":"10.1109/MDMW.2008.4","DOIUrl":"https://doi.org/10.1109/MDMW.2008.4","url":null,"abstract":"Agent technology is increasingly seen as an attractive approach to develop applications for pervasive environments. However, it is a challenge to develop agent systems for such complex and dynamic environments. We propose a novel approach to develop software for pervasive environments by using context-aware adaptive agents. Our agents have the ability to exchange their capabilities with peers, are self-adaptive and enable software reuse through a component-based infrastructure. The solution also enables reduced network traffic and has the potential to allow agents to execute on heterogeneous agent platforms. We also describe the first implementation of the solution and discuss experiments carried out with it and possible further enhancements.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130904353","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}
引用次数: 4
Maximizing Lifetime of Wireless Sensor Networks with Mobile Sensor Nodes 具有移动传感器节点的无线传感器网络寿命最大化
R. Katsuma, Y. Murata, N. Shibata, K. Yasumoto, M. Ito
{"title":"Maximizing Lifetime of Wireless Sensor Networks with Mobile Sensor Nodes","authors":"R. Katsuma, Y. Murata, N. Shibata, K. Yasumoto, M. Ito","doi":"10.1109/MDMW.2008.14","DOIUrl":"https://doi.org/10.1109/MDMW.2008.14","url":null,"abstract":"In this paper, we propose a new method utilizing mobile sensor nodes to prolong WSN lifetime while maintaining a large sensing area. We formulate this problem as a problem in finding the best positions for mobile sensor nodes to maximize the integral of the sensing area for the remaining lifetime of WSN. This problem implies the Euclidean Steiner Tree Problem, and is thus an NP-hard problem. We developed a GA(genetic algorithm)-based algorithm to find a near-optimal solution. Through simulations, we confirmed that the proposed method achieves better performance than a general local-search based approximation method for 100-node WSNs. We also confirmed that our method can find solutions within 5.1% difference from the optimal solution for 10-node WSNs.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130048087","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
Estimating the Relevance of Information in Inter-Vehicle Ad Hoc Networks 车辆间自组织网络中信息相关性的估计
T. Delot, N. Cenerario, S. Ilarri
{"title":"Estimating the Relevance of Information in Inter-Vehicle Ad Hoc Networks","authors":"T. Delot, N. Cenerario, S. Ilarri","doi":"10.1109/MDMW.2008.7","DOIUrl":"https://doi.org/10.1109/MDMW.2008.7","url":null,"abstract":"This paper focuses on intelligent transportation systems. Specifically, we look at data management issues in inter-vehicle ad hoc networks. Such networks are highly dynamic due to the movements of the vehicles and the short range of the wireless communications. Thus, for example, we can only rely on short interactions between the vehicles. Consequently, new data management techniques adapted to this context are needed. More precisely, we propose a new technique to estimate the relevance of data to the drivers. The originality of our proposal is that we identify and classify the different types of information that may be shared on the roads (e.g., available parking spaces, obstacles in the road, information relative to the coordination of vehicles in emergency situations, etc.). We then propose a unified solution to support all those types of information. Our experimental evaluation shows the feasibility and interest of our approach.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132685940","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}
引用次数: 21
Mobile Situation Spaces 移动态势空间
S. Dietze, A. Gugliotta, J. Domingue
{"title":"Mobile Situation Spaces","authors":"S. Dietze, A. Gugliotta, J. Domingue","doi":"10.1109/MDMW.2008.16","DOIUrl":"https://doi.org/10.1109/MDMW.2008.16","url":null,"abstract":"Context-aware information systems are highly desired, particularly in highly dynamic mobile environments. Semantic Web services (SWS) address context-adaptation by enabling the automatic discovery of distributed Web services based on comprehensive semantic capability descriptions. However, whereas SWS technology supports the allocation of resources, it does not entail the discovery of appropriate SWS representations for a given situational context. Even though the appropriateness of resources in mobile settings is strongly dependent on the current situation, SWS technology does not explicitly encourage the representation of situational contexts. Moreover, describing the complex notion of a specific situation by utilizing symbolic SWS representation facilities is costly, prone to ambiguity issues and may never reach semantic completeness. Moreover, since not any real-world situation completely equals another, a potentially infinite set of situation parameters has to be matched to a finite set of semantically defined SWS resource descriptions to enable context-adaptability. To overcome these issues, we propose mobile situation spaces (MSS) which enable the description of situation characteristics as members in geometrical vector spaces following the idea of conceptual spaces (CS). Semantic similarity between situational contexts is calculated in terms of their Euclidean distance within a MSS. Extending merely symbolic SWS descriptions with context information on a conceptual level through MSS enables similarity-based matchmaking between real-world situation characteristics and predefined resource representations as part of SWS descriptions. To prove the feasibility, we provide a proof-of-concept prototype which applies MSS to support context-adaptation across distinct mobile situations.","PeriodicalId":242324,"journal":{"name":"2008 Ninth International Conference on Mobile Data Management Workshops, MDMW","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132195806","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信