The appropriate framework to capture and share location information with mobile applications enable the development of interfaces and interface techniques that empower users to obtain and share information on the go. As such, the work in this thesis makes two major contributions. First is the SeeVT framework, a locative backbone that uses currently-available data and equipment in the Virginia Tech and Blacksburg VA environments (e.g., wireless signal triangulation, GPS signals) to make available to applications the location of the device in use. Applications built on this framework have available knowledge of the region in which the user's device is located. Second is a set of four applications built on the SeeVT framework: SeeVT – Alumni Edition (a guide for alumni returning to campus, often after lengthy absences), the Newman Project (a library information system for finding books and other library resources), VTAssist (a information sharing system for disabled users), and SeeVT-Art (a guide for users in our local inn and conference center to learn about the art on display). Key in this contribution is our identification and discussion of three interface techniques that emerged from our development efforts: an images-first presentation of information, a lightweight mobile augmented reality style of interaction, and locative content affordances that provide ways to quickly input focused types of information in mobile situations. / Master of Science

During the dot com era the word 'personalisation' was a hot buzzword. With the fall of the dot com companies the topic has lost momentum. As the killer application for UMTS or the mobile internet has yet to be identified, the concept of Multi-Dimensional-Personalisation (MDP) could be a candidate. Using this approach, a recommendation of mobile advertisement or marketing (i.e., recommendations or notifications), online content, as well as offline events, can be offered to the user based on their known interests and current location. Instead of having to request or pull this information, the new service concept would proactively provide the information and services – with the consequence that the right information or service could therefore be offered at the right place, at the right time. The growing availability of "Location-based Services“ for mobile phones is a new target for the use of personalisation. "Location-based Services“ are information, for example, about restaurants, hotels or shopping malls with offers which are in close range/short distance to the user. The lack of acceptance for such services in the past is based on the fact that early implementations required the user to pull the information from the service provider. A more promising approach is to actively push information to the user. This information must be from interest to the user and has to reach the user at the right time and at the right place. This raises new requirements on personalisation which will go far beyond present requirements. It will reach out from personalisation based only on the interest of the user. Besides the interest, the enhanced personalisation has to cover the location and movement patterns, the usage and the past, present and future schedule of the user. This new personalisation paradigm has to protect the user's privacy so that an approach supporting anonymous recommendations through an extended 'Chinese Wall' will be described.

Nowadays the widespread availability of wireless networks has created an interest in using them for other purposes, such as localization of mobile devices in indoor environments because of the lack of GPS signal reception indoors. Indoor localization has received great interest recently for the many context-aware applications it could make possible. We designed and implemented an indoor localization platform for Wi-Fi nodes (such as smartphones and laptops) that identifies the building name, floor number, and room number where the user is located based on a Wi-Fi access point signal fingerprint pattern matching. We designed and evaluated a new machine learning algorithm, KRedpin, and developed a new web-services architecture for indoor localization based on J2EE technology with the Apache Tomcat web server for managing Wi-Fi signal data from the FAU WLAN. The prototype localization client application runs on Android cellphones and operates in the East Engineering building at FAU. More sophisticated classifiers have also been used to improve the localization accuracy using the Weka data mining tool. / Includes bibliography. / Thesis (M.S.)--Florida Atlantic University, 2013.

This thesis looks at the problem of discovering nearby friends and nearby places of interest in a privacy-preserving way using location-based services on mobile devices (e.g., smartphones). First, we propose a privacy-preserving protocol for the discovery of nearby friends. In this scenario, Alice wants to verify whether any of her friends are close to her or not. This should be done without disclosing any information about Alice to her friends and also any of the other parties’ information to Alice. We also demonstrate that our approach can be efficiently applied to other similar problems; in particular, we use it to provide a solution to the socialist millionaires' problem. Second, we propose a privacy-preserving protocol for discovering nearby places of interest. In this scenario, the proposed protocol allows Alice to learn whether there is any place that she is looking for near her. However, the location-based service (LBS) that tries to help Alice to find nearby places does not learn Alice’s location. Alice can send a request to the LBS database to retrieve nearby places of interest (POIs) without the database learning what Alice fetched by using private information retrieval (PIR). Our approach reduces the client side computational overhead by applying the grid square system and the POI types ideas to block-based PIR schemes to make it suitable for LBS smartphone applications. We also show our second approach is flexible and can support all types of block-based PIR schemes. As an item of independent interest, we also propose the idea of adding a machine learning algorithm to our nearby friends’ Android application to estimate the validity of a user's claimed location to prevent users from sending a fake location to the LBS application.

Because of its potential applications, mobile localization in wireless networks has attracted much attention recently. It is essential that a mobile user should be able to know its location anytime and anywhere. In practice, however, it is not always possible to obtain an accurate location of the mobile user; the presence of non-line-of-sight (NLOS) radio signal propagation and malicious beacons could cause considerable errors in localization. Therefore, NLOS identification and the detection of malicious beacons are important issues in localization. Existing NLOS identification methods usually assume that localization involving the use of NLOS radio signals cannot be performed in a consistent manner. However, the validity of the foregoing assumption has not been properly investigated. As a result, it is questionable whether these methods can be used to identify NLOS effectively. Existing malicious beacon identification methods require the cooperation of several detecting nodes for the verification of a location claim from a target node. They all suffer from one or both of the drawbacks: (i) not able to cope with a sparse network situation, and (ii) their design being based on a particular distance measurement technique. Moreover, even if NLOS propagation and malicious beacons can be identified, the following problem could arise: if the localization systems do not use the beacons involving NLOS propagation and the malicious beacons, they may not be able to locate a mobile user because of not having enough beacons. / In the first part of this thesis, we present a theoretical analysis of localization using NLOS radio signals, and show that the above-mentioned assumption would no longer be valid when the mobile user is located outside the convex hull of the underlying beacons. As a result, existing NLOS identification methods, as well as many localization approaches, could perform poorly. Extensive experiments on different wireless networks demonstrate that NLOS in localization and the localization error caused by NLOS have been greatly underestimated in previous studies. In the second part, we propose a general location verification scheme to identify malicious beacons. It employs a node-to-node approach for location estimation, and could use different measurement techniques; moreover, it supports secure location verification in sparse networks. The proposed verification scheme has been shown able to achieve satisfactory performance via extensive real world GPS-based wireless sensor network experiments. In the third part, we present a mobility enhanced localization (MEL) scheme. By introducing the user's mobility information into the localization process, the proposed MEL can work in the area where current mobile localization systems cannot locate a mobile user for not having enough beacons. Extensive real world GPS experimental results demonstrate the superiority of the proposed MEL scheme. With the proposed solutions to the above problems, we could obtain improved mobile localization. / Liu, Dawei. / Adviser: Moon-Chuen Lee. / Source: Dissertation Abstracts International, Volume: 73-03, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 90-97). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

Student Number : 9301997W - MSc thesis - School of Electrical and Information Engineering - Faculty of Engineering and the Built Environment / Emergency services are vital for the minimization of damage, injury and loss of life. These services are, by definition, a combination of telecommunications and information services, and are by nature, distributed. However, most current emergency services do not take advantage of emerging technology, and hence, are restricted in the functionality they offer. This project proposes the design a full information structure for an emergency call centre service, which can be offered as a service or application on any core network. As emergency services are distributed, and combine both telecommunications and information services, an appropriate design tool which caters for these issues, is the Reference Model for Open Distributed Processing (RM-ODP), which will be used in the design of the emergency service. In addition, OSA/Parlay Application Programming Interfaces (APIs) will be used for the application to access telecommunication network functionality. The enterprise viewpoint examines the design requirements and considerations for an emergency system, which is the first step in designing a service based on the RMODP guidelines. Secondly, the information viewpoint is defined, which identifies the information flows between the objects and classes defined in the enterprise viewpoint with the aid of robustness diagrams and high level message sequence charts. Next, the computational viewpoint of the emergency service describes the components that the service consists of and the interfaces through which they communicate, enabling distribution of the system to be visualized. In addition, the engineering and technology viewpoints are briefly touched upon. The RM-ODP proves to be a useful tool the design of this application. In addition, the use of OSA/Parlay APIs have also proved beneficial, enabling the application to run on any platform, irrespective of the level of functionality it already provides. The benefits that this design offers over conventional emergency services are allowing callers and emergency response personnel full access to the functionality of the service, despite any limitations on their telecommunications network, finding the location of a caller from a fixed or mobile phone, ease and speed of obtaining relevant emergency information, and the ease and speed of sending relevant information to emergency response personnel. Finally we recommend improvements in the reliability and accuracy of finding the location of mobile phones, as well as creating ways of identifying the location of VoIP users.

This dissertation investigates three topics related to movement and events associated with geospatial barriers. This research makes a unique contribution to geographic information science (GIScience), by examining how boundaries influence the interactions of other geographic features and to location-based services by bringing a GIScience perspective to geofence services. Chapters 2, 3, and 4 can be considered independently as journal articles. Each of these chapters builds on the previous. Chapter 2 serves as the base by examining geospatial barriers and impedance events associated with these barriers. The relationships between barriers, the features they protect and the features that they hinder are formalized in an ontology design pattern (ODP) that also includes events associated with these features. Algorithms are written to demonstrate the ODP can be used to answer queries about the presence or absence of barrier events. Chapter 3 transitions from physical boundaries to digital boundaries by examining geofences, a location-based notification service. Interaction between users and multiple geofences are investigated when the configuration of geofences differs (i.e. disconnected, partially overlapping, and completely overlapping) and when geofences are independent or dependent (a rule states that the activation of geofence Y depends on users having visited geofence X). A geofence system is prototyped in an iOS environment and used to further evaluate user-geofence interactions. Chapter 4 expands on the topic of location- based notification regions by investigating what is required for a geofence system to handle events. How changes in conditions (e.g. the spreading of a flood or movement of a fire) interact with geofences and users and what new categories of interactions are required to handle these changes are discussed. The proposed system is applied to a scenario of flooding on multiple rivers interrupting the transportation network.

Indoor localization systems have a variety of applications such as tracking of assets, indoor robot navigation, and monitoring of people (e.g. patients) in hospitals or at home. Global positioning system (GPS) offers location accuracy of several meters and is mainly used for outdoor location-based applications as its accuracy degrades significantly in indoor scenarios. Wireless local area networks (WLAN) have also been used for indoor localization, but the accuracy is too low and power consumption of WLAN terminals is too high for most applications. Ultra-wideband (UWB) localization is superior in terms of accuracy and power consumption compared with GPS and WLAN localization, and is thus more suitable for most indoor location-based applications [1-4]. The accuracy and precision requirements of localization systems depend on the specific characteristics of the applications. For example, centimeter or even millimeter localization accuracy is required for dynamic part tracking, while decimeter accuracy might be sufficient for tracking patients in hospitals or at home. Note that accuracy is not the only aspect of the overall performance of the system. Factors such as cost, range, and complexity should also be considered in system design. In the first part of this dissertation, a centimeter-accurate UWB localization system is developed. The technical challenges to achieve centimeter localization accuracy are investigated. Since all the receivers are synchronized through wire connection in this system, a wireless localization system with centimeter accuracy is introduced in order to make the system easier for deployment. A two-step synchronization algorithm with picosecond accuracy is presented, and the system is tested in a laboratory environment. The second part of this dissertation focuses on reducing the complexity of UWB localization systems when the localization accuracy requirement is relaxed. An UWB three-dimensional localization scheme with a single cluster of receivers is proposed. This scheme employs the time-of-arrival (TOA) technique and requires no wireless synchronization among the receivers. A hardware and software prototype that works in the 3.1-5.1 GHz range is constructed and tested in a laboratory environment. An average position estimation error of less than 3 decimeter is achieved by the experimental system. This TOA scheme with receivers in a single unit requires synchronization between the transmitter and the receiver unit. In order to further reduce system complexity, a new time-difference-of-arrival localization scheme is proposed. This scheme requires multiple units, each operating on its own clock. It avoids synchronization between the transmitter and receivers, and thus makes the development of the transmitter extremely simple. The performance of this system is simulated and analyzed analytically, and turns out to be satisfactory for most indoor localization applications. / Graduation date: 2013

For many applications of location-based services, such as friend finding, buddy tracking,information sharing and cooperative caching in ad hoc networks, it is often important to be able to identify whether the positions of a given set of moving objects are within close proximity. To compute these kinds of proximity relations among large populations of moving objects, continuously available location position information of these objects must be correlated against each other to identify whether a given set of objects are in the specified proximity relation. In this dissertation, we state this problem, referring to it as the location constraint matching problem, both in the Euclidean space and the road network space. In the Euclidean space, we present an adaptive solution to this problem for various environments. We also study the position uncertainty associated with the constraint matching. For the road network space, where the object can only move along the edges of the road network, we propose an efficient algorithm based on graph partitioning, which dramatically restricts the search space and enhances performance. Our approaches reduce the constraint processing time by 80% for Euclidean space and by 90% for road network space respectively. The logical combination of individual constraints with conjunction, disjunction and negation results in more expressive constraint expressions than are possible based on single constraints. We model constraint expressions with Binary Decision Diagrams (BDD). Furthermore, we exploit the shared execution of constraint combinations based on the BDD modeling. All the algorithms for various aspects of the constraint processing are integrated in the research prototype L-ToPSS (Location-based Toronto Publish/Subscribe System). Through experimental study and the development of an analytical model, we show that the proposed solution scales to large numbers of constraints and large numbers of moving objects.

For many applications of location-based services, such as friend finding, buddy tracking,information sharing and cooperative caching in ad hoc networks, it is often important to be able to identify whether the positions of a given set of moving objects are within close proximity. To compute these kinds of proximity relations among large populations of moving objects, continuously available location position information of these objects must be correlated against each other to identify whether a given set of objects are in the specified proximity relation. In this dissertation, we state this problem, referring to it as the location constraint matching problem, both in the Euclidean space and the road network space. In the Euclidean space, we present an adaptive solution to this problem for various environments. We also study the position uncertainty associated with the constraint matching. For the road network space, where the object can only move along the edges of the road network, we propose an efficient algorithm based on graph partitioning, which dramatically restricts the search space and enhances performance. Our approaches reduce the constraint processing time by 80% for Euclidean space and by 90% for road network space respectively. The logical combination of individual constraints with conjunction, disjunction and negation results in more expressive constraint expressions than are possible based on single constraints. We model constraint expressions with Binary Decision Diagrams (BDD). Furthermore, we exploit the shared execution of constraint combinations based on the BDD modeling. All the algorithms for various aspects of the constraint processing are integrated in the research prototype L-ToPSS (Location-based Toronto Publish/Subscribe System). Through experimental study and the development of an analytical model, we show that the proposed solution scales to large numbers of constraints and large numbers of moving objects.