We introduce a model for information management in a world where information from the physical environment is gathered through a ubiquitous wireless infrastructure. Thus the Internet information space and the physical environment become increasingly entangled in what we call a smart Earth. We illustrate technical challenges and applications from the work of the Swiss national competence centre of research in mobile information and communication systems (NCCR-MICS). We identify the three layers of data access networks, semantic overlay networks and social networks as essential building blocks and observe that each of these network layers will be largely self-organized. Finally we argue that understanding the interplay among these self-organizing network layers will be an important research challenge for the future.
{"title":"Smart Earth: From Pervasive Observation to Trusted Information","authors":"K. Aberer","doi":"10.1109/MDM.2007.10","DOIUrl":"https://doi.org/10.1109/MDM.2007.10","url":null,"abstract":"We introduce a model for information management in a world where information from the physical environment is gathered through a ubiquitous wireless infrastructure. Thus the Internet information space and the physical environment become increasingly entangled in what we call a smart Earth. We illustrate technical challenges and applications from the work of the Swiss national competence centre of research in mobile information and communication systems (NCCR-MICS). We identify the three layers of data access networks, semantic overlay networks and social networks as essential building blocks and observe that each of these network layers will be largely self-organized. Finally we argue that understanding the interplay among these self-organizing network layers will be an important research challenge for the future.","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":"117137231","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}
Finding generic ways of representing location in context aware systems is an interesting problem with many pitfalls. In this work we examine how a folksonomy approach with collaborative location tagging can be used to allow for end users to communicate their whereabouts to others in a way that makes sense within a specific community. The Spots system allows for users to define places based on patterns of WiFi signal strength profiles. The places are tagged with labels describing the place. Different tags can be provided within different communities. A usage study shows a great diversity in how users chose to name places.
{"title":"Using a Folksonomy Approach for Location Tagging in Community Based Presence Systems","authors":"Martin Jonsson","doi":"10.1109/MDM.2007.64","DOIUrl":"https://doi.org/10.1109/MDM.2007.64","url":null,"abstract":"Finding generic ways of representing location in context aware systems is an interesting problem with many pitfalls. In this work we examine how a folksonomy approach with collaborative location tagging can be used to allow for end users to communicate their whereabouts to others in a way that makes sense within a specific community. The Spots system allows for users to define places based on patterns of WiFi signal strength profiles. The places are tagged with labels describing the place. Different tags can be provided within different communities. A usage study shows a great diversity in how users chose to name places.","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":"122800449","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}
Thomas King, T. Butter, M. Brantner, S. Kopf, T. Haenselmann, Alexander Biskop, Andreas Farber, W. Effelsberg
While indoor positioning systems based on 802.11 and fingerprinting work pretty well, it is unknown how to distribute large amounts of fingerprint data to mobile devices. Even worse, many mobile devices are restricted in terms of memory capabilites. We identified three classes of mobile devices representing different levels of storage capabilities. For each of these classes, we present a distribution approach for fingerprint data: the Union of Access Points (UAP), the Strongest Access Point (SAP), and the Intersection of Access Points (IAP) algorithm. These approaches utilize the 802.11 network to download only a subset of the fingerprint data to a mobile device. The subset covers the area close to the actual position of the mobile device in such a way that position estimates can be computed. The size of the subset is different for each of the three algorithms.
{"title":"Distribution of Fingerprints for 802.11-Based Positioning Systems","authors":"Thomas King, T. Butter, M. Brantner, S. Kopf, T. Haenselmann, Alexander Biskop, Andreas Farber, W. Effelsberg","doi":"10.1109/MDM.2007.43","DOIUrl":"https://doi.org/10.1109/MDM.2007.43","url":null,"abstract":"While indoor positioning systems based on 802.11 and fingerprinting work pretty well, it is unknown how to distribute large amounts of fingerprint data to mobile devices. Even worse, many mobile devices are restricted in terms of memory capabilites. We identified three classes of mobile devices representing different levels of storage capabilities. For each of these classes, we present a distribution approach for fingerprint data: the Union of Access Points (UAP), the Strongest Access Point (SAP), and the Intersection of Access Points (IAP) algorithm. These approaches utilize the 802.11 network to download only a subset of the fingerprint data to a mobile device. The subset covers the area close to the actual position of the mobile device in such a way that position estimates can be computed. The size of the subset is different for each of the three algorithms.","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":"124731895","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 phones are being increasingly equipped with sensors that ease retrieval of context information about a user. Context data can be aggregated with information centrally available to mobile operators and service providers, to infer higher-level information such as user "situations", easier to integrate with services. We have been conducting an internal trial monitoring the context of different users in their business life and designing rules to infer high level situations: logical location, activity and social state. In this paper we present the infrastructure and the rule-based reasoning process used for this experiment.
{"title":"Situation Inference for Mobile Users: A Rule Based Approach","authors":"L. Goix, M. Valla, Laura Cerami, P. Falcarin","doi":"10.1109/MDM.2007.63","DOIUrl":"https://doi.org/10.1109/MDM.2007.63","url":null,"abstract":"Mobile phones are being increasingly equipped with sensors that ease retrieval of context information about a user. Context data can be aggregated with information centrally available to mobile operators and service providers, to infer higher-level information such as user \"situations\", easier to integrate with services. We have been conducting an internal trial monitoring the context of different users in their business life and designing rules to infer high level situations: logical location, activity and social state. In this paper we present the infrastructure and the rule-based reasoning process used for this experiment.","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":"128642019","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}
Data broadcast is a technique to realize energy saving and bandwidth utilization in a mobile computing environment. However, traditional schemes schedule data items without considering channel bandwidth. Therefore, the above drawback leads to the unfair broadcasting rate of each item of the different access frequency. In this paper, we address the problem of generating a broadcast program to disseminate data via multiple channels with variant bandwidth. In view of the characteristics of variant bandwidth, we propose an algorithm using adaptive partition on bandwidth to generate broadcast program to avoid the above drawback so as to minimize the average waiting time. The empirical results show that our approach is able to produce broadcast programs of high quality and is very efficient in a data broadcasting environment with variant bandwidth.
{"title":"Variant Bandwidth Channel Allocation in the Data Broadcasting Environment","authors":"Chung-Hua Chu, Hao-Ping Hung, Ming-Syan Chen","doi":"10.1109/MDM.2007.22","DOIUrl":"https://doi.org/10.1109/MDM.2007.22","url":null,"abstract":"Data broadcast is a technique to realize energy saving and bandwidth utilization in a mobile computing environment. However, traditional schemes schedule data items without considering channel bandwidth. Therefore, the above drawback leads to the unfair broadcasting rate of each item of the different access frequency. In this paper, we address the problem of generating a broadcast program to disseminate data via multiple channels with variant bandwidth. In view of the characteristics of variant bandwidth, we propose an algorithm using adaptive partition on bandwidth to generate broadcast program to avoid the above drawback so as to minimize the average waiting time. The empirical results show that our approach is able to produce broadcast programs of high quality and is very efficient in a data broadcasting environment with variant bandwidth.","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":"127477141","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}
Goce Trajcevski, Hui Ding, P. Scheuermann, I. Cruz
This work tackles the problem of answer-aggregation for continuous spatio-temporal range queries in distributed settings. We assume a grid-like coverage of the spatial universe of discourse, in which each cell is governed by a Base Station (BS) that communicates with the mobile users in its zone, and is also equipped with a server that has Moving Objects Database (MOD) capabilities. The MOD server stores the data for the moving objects in a given cell, processes the continuous queries pertaining to that cell, and is connected to the MOD servers in the neighboring cells. We demonstrate that, when a range query that spans over more than one cell needs to have its answer computed for a user located in a particular cell, by intelligently combining the transmission and the aggregation of the partial results, substantial improvements can be achieved at the global level. Towards this end, we present the BORA (Bresenham-based Overlay for Routing and Aggregation) tree, which is used to combine the transmission and local data aggregation along the routes to the destination of the query's answer.
{"title":"BORA: Routing and Aggregation for Distributed Processing of Spatio-Temporal Range Queries","authors":"Goce Trajcevski, Hui Ding, P. Scheuermann, I. Cruz","doi":"10.1109/MDM.2007.15","DOIUrl":"https://doi.org/10.1109/MDM.2007.15","url":null,"abstract":"This work tackles the problem of answer-aggregation for continuous spatio-temporal range queries in distributed settings. We assume a grid-like coverage of the spatial universe of discourse, in which each cell is governed by a Base Station (BS) that communicates with the mobile users in its zone, and is also equipped with a server that has Moving Objects Database (MOD) capabilities. The MOD server stores the data for the moving objects in a given cell, processes the continuous queries pertaining to that cell, and is connected to the MOD servers in the neighboring cells. We demonstrate that, when a range query that spans over more than one cell needs to have its answer computed for a user located in a particular cell, by intelligently combining the transmission and the aggregation of the partial results, substantial improvements can be achieved at the global level. Towards this end, we present the BORA (Bresenham-based Overlay for Routing and Aggregation) tree, which is used to combine the transmission and local data aggregation along the routes to the destination of the query's answer.","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":"132101702","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}
We envision that in some wireless sensor network applications, such as environmental monitoring, assisted living, and industrial control, handheld devices will be used from time to time to query the sensor networks. However, there is no full-fledged query processor for this purpose. Therefore, we propose WinyDB, a relational query processing system on Windows-CE based PDAs (Personal Digital Assistants) for sensor networks. One of the main features of WinyDB is that multiple PDAs running WinyDB can answer queries collaboratively. This feature is useful in that it improves both the energy efficiency and the data quality. Our WinyDB prototype package is available online at http://www.cse.ust.hk/winydb and our simulation experiments have shown promising results on collaborative query processing.
{"title":"Collaboratively Querying Sensor Networks through Handheld Devices","authors":"T. Chiu, Qiong Luo","doi":"10.1109/MDM.2007.14","DOIUrl":"https://doi.org/10.1109/MDM.2007.14","url":null,"abstract":"We envision that in some wireless sensor network applications, such as environmental monitoring, assisted living, and industrial control, handheld devices will be used from time to time to query the sensor networks. However, there is no full-fledged query processor for this purpose. Therefore, we propose WinyDB, a relational query processing system on Windows-CE based PDAs (Personal Digital Assistants) for sensor networks. One of the main features of WinyDB is that multiple PDAs running WinyDB can answer queries collaboratively. This feature is useful in that it improves both the energy efficiency and the data quality. Our WinyDB prototype package is available online at http://www.cse.ust.hk/winydb and our simulation experiments have shown promising results on collaborative query processing.","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":"133556349","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 number of mobile subscribers in the world is soon reaching the three billion mark. According to the newest estimates, majority of the subscribers are already in the developing countries, whereas the number of subscribers in the industrialized countries is about to stagnate around one billion. Because especially in the developing countries the only access to Internet are mobile devices, developing high quality services based on them grows in importance. Ontologies are an important ingredient towards more complicated mobile services. In this paper we refine the taxonomy for mobile ontologies and discuss their creation, business models, maintenance and intellectual property rights (IPR).
{"title":"Developing Mobile Ontologies; Who, Why, Where, and How?","authors":"J. Veijalainen","doi":"10.1109/MDM.2007.85","DOIUrl":"https://doi.org/10.1109/MDM.2007.85","url":null,"abstract":"The number of mobile subscribers in the world is soon reaching the three billion mark. According to the newest estimates, majority of the subscribers are already in the developing countries, whereas the number of subscribers in the industrialized countries is about to stagnate around one billion. Because especially in the developing countries the only access to Internet are mobile devices, developing high quality services based on them grows in importance. Ontologies are an important ingredient towards more complicated mobile services. In this paper we refine the taxonomy for mobile ontologies and discuss their creation, business models, maintenance and intellectual property rights (IPR).","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":"121894678","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}
In traditional fixed-wired networks, standard protocols like 2-Phase-Commit are used to guarantee atomicity for distributed transactions. However, within mobile networks, a higher probability of failures including node failures, message loss, and even network partitioning makes the use of these standard protocols difficult or even impossible. To use traditional database applications within a mobile scenario, we need an atomic commit protocol that reduces the chance of infinite blocking. In this paper, we present an atomic commit protocol called multi coordinator protocol (MCP) that uses a combination of the traditional 2-Phase-Commit, 3-Phase-Commit, and consensus protocols for mobile environments. Simulation experiments comparing MCP with 2PC show how MCP enhances stability for the coordination process by involving multiple coordinators, and that the additional time needed for the coordination among multiple coordinators is still reasonable.
{"title":"A Failure Tolerating Atomic Commit Protocol for Mobile Environments","authors":"S. Böttcher, L. Gruenwald, S. Obermeier","doi":"10.1109/MDM.2007.31","DOIUrl":"https://doi.org/10.1109/MDM.2007.31","url":null,"abstract":"In traditional fixed-wired networks, standard protocols like 2-Phase-Commit are used to guarantee atomicity for distributed transactions. However, within mobile networks, a higher probability of failures including node failures, message loss, and even network partitioning makes the use of these standard protocols difficult or even impossible. To use traditional database applications within a mobile scenario, we need an atomic commit protocol that reduces the chance of infinite blocking. In this paper, we present an atomic commit protocol called multi coordinator protocol (MCP) that uses a combination of the traditional 2-Phase-Commit, 3-Phase-Commit, and consensus protocols for mobile environments. Simulation experiments comparing MCP with 2PC show how MCP enhances stability for the coordination process by involving multiple coordinators, and that the additional time needed for the coordination among multiple coordinators is still reasonable.","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":"114133964","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}
In many existing location-based services, a service provider becomes aware of the location of its customers and can, maybe inadvertently, leak this information to unauthorized entities. To avoid this information leak, the provider should be able to offer its services such that the provider does not learn any information about its customers' location. We present an architecture that provides this property and show that the architecture is powerful enough to support existing location- based services. Our architecture exploits trusted computing and private information retrieval. With the help of trusted computing, we ensure that a location-based service operates as expected by a customer and that information about the customer's location becomes inaccessible to a location-based service upon a compromise of the service. With the help of private information retrieval, we avoid that a service provider learns a customer's location by observing which of its location-specific information is being accessed.
{"title":"Hiding Location Information from Location-Based Services","authors":"U. Hengartner","doi":"10.1109/MDM.2007.56","DOIUrl":"https://doi.org/10.1109/MDM.2007.56","url":null,"abstract":"In many existing location-based services, a service provider becomes aware of the location of its customers and can, maybe inadvertently, leak this information to unauthorized entities. To avoid this information leak, the provider should be able to offer its services such that the provider does not learn any information about its customers' location. We present an architecture that provides this property and show that the architecture is powerful enough to support existing location- based services. Our architecture exploits trusted computing and private information retrieval. With the help of trusted computing, we ensure that a location-based service operates as expected by a customer and that information about the customer's location becomes inaccessible to a location-based service upon a compromise of the service. With the help of private information retrieval, we avoid that a service provider learns a customer's location by observing which of its location-specific information is being accessed.","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":"128086131","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
扫码关注我们
求助内容：
应助结果提醒方式：