Location Service

The large base of Internet-enabled smartphones provides an excellent opportunity for a fine-grained observation of the structure of the Internet and a quantitative evaluation of its characteristics. Smartphones can operate as active mobile monitors and, coordinated by a central entity, they can probe the network on a local scale. Then the results produced by a large number of participants can be merged to obtain a detailed graph of the Internet. Besides the design of the measurement framework, this paper describes the implementation and validation of a traceroute-like tool that is compatible with the Android platform. This confirms that smartphone-based crowdsourcing of network properties can be a viable strategy.

The telecommunications landscape is undergoing a period of dramatic change. A near term next generation network (NGN) is emerging characterized by a rich set of services and a dynamic and competitive marketplace where innovation and time to market will be critical success factors. Changing consumer-provider relationships, competitive pressures and new e-commerce technologies will accelerate the use of real time payment and prepayment techniques. This will increase the demand for real-time processing of charging data. Powerful, new, charging support systems will be needed to enable real time charging of these new services. Policy based management appears to offer potential solutions.

Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Locating mobile objects in a worldwide system requires a scalable location service. An object can be a telephone or a notebook computer, but also a software or data object, such as a file or an electronic document. Our service strictly separates an object's name from the addresses where it can be contacted. This is done by introducing a location-independent object handle. An object's name is bound to its unique object handle, which, in turn, is mapped to the addresses where the object can be contacted. To locate an object, we need only its object handle. We present a scalable location service based on a worldwide distributed search tree that adapts dynamically to an object's migration pattern to optimize lookups and updates.

Wireless positioning determination has received increased attention during the past few years. Several wireless applications have been envisaged when mobile terminal location can be determined with sufficient accuracy at any time. In this paper, we attempt to identify the various indoor and outdoor positioning techniques that can be used for the provision of mobile and wireless applications and services. In order to maximize the benefits of this research in the area of positioning technologies, we propose a novel taxonomy with detailed analysis and evaluation of these techniques based on the accuracy that is needed for various mobile location-based services.

Wireless positioning determination has received increased attention during the past few years. Several wireless applications have been envisaged when mobile terminal location can be determined with sufficient accuracy at any time. In this chapter, we attempt to identify the various indoor and outdoor mobile and wireless positioning techniques that can be used for the provision of location based services. In order to maximize the benefits of this research in the area of positioning technologies, we propose a classification with detailed analysis and evaluation of these techniques based on the accuracy that is needed for various mobile location-based services.

The authors would like to thank all the staff who were involved with developing and running the CRP funded projects, and the many associated agencies, without whose cooperation, time and patience the evaluations could not have been conducted. We are also v e ry grateful to all the women and young people who were in contact with the pro j e c t s , and who gave up their time to be interviewed in what were often inconvenient situations. The overview re p o rt could not have been produced without the input and co-operation f rom the other evaluation teams: Clarrisa Harris and Gillian Hunter from South Bank University (now at the Institute of Criminal Policy Research at Kings College, London); M a rg a ret Melrose from the University of Luton; Lynne Harne, Val Balding and Cat Euler f rom University of Sunderland. We would also like to thank a number of people from the Home Office, in particular Nadia Brookes, Julia Wickson, Liz Kooper and Nicola Douglas for managing and supporting the evaluations at various points in time; Nigel Miller and Mark Ledbury for their advice on the economic aspects of the evaluation; and especially to Alana Diamond for her continued support and for overseeing the evaluations.

We describe R-GMA (Relational Grid Monitoring Architecture) which is being developed within the European DataGrid Project as a Grid Information and Monitoring System for both the grid itself and for use by applications. Is is based on the GMA from GGF, which is a simple Consumer-Producer model. The special strength of this implementation comes from the power of the relational model. We offer a global view of the information as if each VO had one large relational database. We provide a number of different Producer types with different characteristics; for example some support streaming of information. We also provide combined Consumer/Producers, which are able to combine information and republish it. At the heart of the system is the mediator, which for any query is able to find and connect to the best Producers to do the job. In addition to having some of our own sensors able to publish information, we are able to invoke MDS info-provider scripts and publish the resulting information via R-GMA.

AWS, or Amazon Web Services, is a cloud computing platform that is adaptable, affordable, and simple to use.
Relational database management systems, or RDBMS, are frequently used in the Amazon cloud. Derive how to set up Oracle
Database on AW and Oracle Database may be operated on Relational Database Service (Amazon RDS). To show how you
can operate Oracle Database on Amazon RDS, as well as to inform you of the benefits of each strategy and how to deploy and
monitor your Oracle database, as well as how to handle scalability, performance, backup and recovery, high availability, and
security in Amazon RDS. In this paper, proposed the DM-DATA Model to establish an Emergency Recovery solution with an
onsite Oracle system and AWS and to migrate your existing Oracle database to AWS. We provide a strategy for designing an
architecture that protects you against hardware failures, datacenter issues, and disasters by using replication technologies stock market data. In the performance analysis, there are several alternatives are choose to optimize the performance of the propose
infrastructure with Oracle database based on certain metrics like, disk I/O management, sizing, database replicas, etc.

Preventing moving objects location tracking from intruders. In recent years moving
object databases have gained much interest due to the advances in mobile communications and
positioning technologies. To provide security to moving object needs monitoring. Monitoring
moving objects have two fundamental issues like efficiency and privacy. This paper proposes an
efficient algorithm for finding good anonymization group for given moving objects (MOB) with
respect to its quasi-identifier (QID) and dynamic query updation. To address the efficiency and
privacy issues we are using a new technique which updates the query of the MOB in the base
stations automatically. Furthermore, by using the location management method we are solving
the issues of location updating.

The services offers by LBS (Location based service) are characteristically based on a point of interest record. By recover the Points Of Interest (POIs) from the database server, the user can get reply to a variety of location based queries, which comprise but are not incomplete to determine the nearest ATM machine, gas station, hospital, or police station. Amongst numerous demanding blockades to the extensive operation of such submission, solitude declaration is a main question. The Location Server (LS), which proffer some LBS, expend its possessions to accumulate information about a variety of interesting POIs. Consequently, it is normal that the LS would not unveil any information devoid of amount. Therefore the LBS have to make certain that LS's data is not way in by any unofficial consumer. Unfortunately, existing privacy-preserving techniques for LBS have several limitations, such as requiring a fully-trusted third party, offering limited privacy guarantees and incurring h...

Abstract. The paper presents the main results of the IST FP6 INFRAWEBS project. The project has developed an easy and effective way of constructing and using semantic descriptions for existing and new Web services. INFRAWEBS has adopted the WSMO (Web Service Modeling Ontology) and WSML (Web Service Modeling Language) specifications and has imposed no additional requirements to them. Therefore, the advanced software components developed during the project are of interest to the whole WSMO community. INFRAWEBS offers a SOA framework – INFRAWEBS Integrated Framework (IIF), based on the ESB integration paradigm, which can be easily used by different groups of users (application providers, designers of SWS, etc.). The IIF enables integration of components of different technologies. Furthermore, it can be considered as one of the first frameworks for semantic service engineering that covers the whole SWS life-cycle and allows for creation of complex, semantically-enabled applications.

The paper presents the main results of the IST FP6 INFRAWEBS project. The project has developed an easy and effective way of constructing and using semantic descriptions for existing and new Web services. INFRAWEBS has adopted the WSMO (Web Service Modeling Ontology) and WSML (Web Service Modeling Language) specifications and has imposed no additional requirements to them. Therefore, the advanced software components developed during the project are of interest to the whole WSMO community. INFRAWEBS offers a SOA framework-INFRAWEBS Integrated Framework (IIF), based on the ESB integration paradigm, which can be easily used by different groups of users (application providers, designers of SWS, etc.). The IIF enables integration of components of different technologies. Furthermore, it can be considered as one of the first frameworks for semantic service engineering that covers the whole SWS life-cycle and allows for creation of complex, semantically-enabled applications.

There is a significant disparity between wayfinding support services available in outdoor and in-building locations. Services such as Google Maps and in-car GPS allow users to examine unknown outdoor locations in advance as well as receive guidance en-route. In contrast, there is relatively little digital technology to support users in complex building architectures, e.g. institution buildings where users are generally limited to using traditional signage or asking for directions at the reception. However, recent advances in pervasive digital display technology are enabling a new range of possibilities and are making this topic increasingly subject to study. In this paper, we describe five formative studies involving 39 participants using situated digital displays, a Person Locator Kiosk, and personal mobile devices. We report our findings by gaining insights and feedback from users in order to develop wayfinding assistance for visitors in an in-building environment.

Micro-blogging services have become indispensable communication tools for online users for disseminating breaking news, eyewitness accounts, individual expression, and protest groups. Recently, Twitter, along with other online social networking services such as Foursquare, Gowalla, Facebook and Yelp, have started supporting location services in their messages, either explicitly, by letting users choose their places, or implicitly, by enabling geo-tagging, which is to associate messages with latitudes and longitudes. This functionality allows researchers to address an exciting set of questions: 1) How is information created and shared across geographical locations, 2) How do spatial and linguistic characteristics of people vary across regions, and 3) How to model human mobility. Although many attempts have been made for tackling these problems, previous methods are either complicated to be implemented or oversimplified that cannot yield reasonable performance. It is a challenge task to discover topics and identify users' interests from these geo-tagged messages due to the sheer amount of data and diversity of language variations used on these location sharing services. In this paper we focus on Twitter and present an algorithm by modeling diversity in tweets based on topical diversity, geographical diversity, and an interest distribution of the user. Furthermore, we take the Markovian nature of a user's location into account. Our model exploits sparse factorial coding of the attributes, thus allowing us to deal with a large and diverse set of covariates efficiently. Our approach is vital for applications such as user profiling, content recommendation and topic tracking. We show high accuracy in location estimation based on our model. Moreover, the algorithm identifies interesting topics based on location and language.

During the last few years the amount of users with mobile devices (laptops, smartphones, tablets, etc.) with wireless connectivity capabilities has grown at an impressive rate. In the meantime, the number of Wi-Fi networks has also increased a lot, and in addition to this, the emergence and fast growth of applications such as social networking, user generated content, location services, collaborative tools and applications, etc. has fueled the user's need for permanent connectivity. This paper introduces Flexible Communication, a secure and trust-based Wi-Fi password sharing service. Our service architecture provides the user with a solution that enables free Wi-Fi network password sharing, which relies on a social-networking oriented trust model approach and which at the same time allows the user to locate and to connect to those Wi-Fi networks at any time. We validate our solution with a qualitative assessment which compares its features against those of the other similar existent solutions and also with a quantitative assessment which measures the performance both of the server and the client.

Location-based Access Control (LBAC) techniques allow the definition of users' access rights based on location predicates that exploit the users' physical location. However, evaluating the physical location of a user is a specialized activity that is unlikely to be performed by the same entity (e.g., organization or system) in charge of the access control decision. For this reason, location evaluation is usually assumed to be provided by specific Location Services (LSs) possibly coexisting in a same area and competing one with the others. In this paper, we address the issues related to the communication and negotiation between an Access Control Engine (ACE) enforcing access rules that include location-based predicates and multiple, functionally equivalent, LSs. We introduce metadata for the exchange of service level agreement attributes between the ACE and the LSs. Based on such metadata we develop different negotiation protocols, from a basic negotiation protocol that shows the core aspects of our proposal to an enhanced protocol that enriches the interaction by taking into account a cost/benefit analysis and some service requirements. Finally, we present an extension to the enhanced protocol to consider possible time validity constraints on access control decisions.

Bridging the semantic gap between business process models and semantic Web services becomes increasingly important in order to help automating business process integration in large organizations. Traditional workflow languages (such as BPEL4WS) support the modeling of business processes as syntax based compositions of Web services. When such processes are exported as Web services they as well expose syntactical interfaces. These syntactical interfaces allow only static composition and hence limit interactions between ...

We examined how seabirds might be used to study marine environmental variables, which necessitates knowing location and the value of the variable to be studied. Five systems can potentially be used for determination of location: VHF (Very High Frequency) telemetry, PTT (Platform Terminal Transmitters) telemetry, GLS (Global Location Service) geolocation methods, dead reckoning and GPS (Global Positioning System), each with its own advantages with respect to accuracy, potential number of fixes and size. Temperature and light were used to illustrate potential difficulties in recording environmental variables. Systems currently used on seabirds for measurement of temperature respond slowly to environmental changes; thus, they may not measure sea surface temperature adequately when contact periods with water bodies are too short. Light can be easily measured for light extinction studies, but sensor orientation plays a large role in determining recorded values. Both problems can be corrected. The foraging behaviour of seabirds was also examined in order to identify those features which would be useful for determination of marine environmental variables at a variety of spatial and temporal scales. Area coverage by birds is highly dependent on breeding phase and tends to be concentrated in areas where prey acquisition is particularly enhanced. The identification of these sites may be of particular interest to marine biologists. 'Plungers' and 'divers' are potentially most useful for assessment of variables deeper within the water column, with some divers spending up to 90% of their time sub-surface. Few seabirds exploit the water column deeper than 20 m, although some divers regularly exceed 50 m (primarily penguins and auks), while 2 species dive in excess of 300 m. The wide-ranging behaviour of seabirds coupled, in many instances, with their substantial body size makes them potentially excellent carriers of sophisticated environmental measuring technology; however, the ethical question of how much the well-being of birds can, and should, be compromised by such an approach needs to be carefully considered.

Continuously understanding a user's location context in colloquial terms and the paths that connect the locations unlocks many opportunities for emerging applications. While extensive research effort has been made on efficiently tracking a user's raw coordinates, few attempts have been made to efficiently provide everyday contextual information about these locations as places and paths. We introduce SensLoc, a practical location service to provide such contextual information, abstracting location as place visits and path travels from sensor signals. SensLoc comprises of a robust place detection algorithm, a sensitive movement detector, and an ondemand path tracker. Based on a user's mobility, SensLoc proactively controls active cycle of a GPS receiver, a Wi-Fi scanner, and an accelerometer. Pilot studies show that SensLoc can correctly detect 94% of the place visits, track 95% of the total travel distance, and still only consume 13% of energy than algorithms that periodically collect coordinates to provide the same information.

A promising approach to location privacy is query obfuscation, which involves reporting k − 1 false locations along with the real location. In this paper, we examine the level of privacy protection provided by the current query obfuscation techniques against adversarial location service providers. As a representative and realistic implementation of query obfuscation, we focus on SybilQuery. We present two types of attacks depending upon whether or not a short-term query history is available. When history is available, using machine learning, we were able to identify 93.67% of user trips, with only 2.02% of fake trips misclassified, for the security parameter k = 5. In the absence of history, we used trip correlations to form a smaller set of trips effectively increasing the user query identification probability from 20% to about 40%. Our work demonstrates that the use of aggregate statistical information alone is not sufficient to generate simulated trips. We identify areas for improvement in the existing query obfuscation techniques.

The bird infecting viral strain H5N1, commonly known as the Avian Flu, is a highly infectious and resilient virus that can be fatal if contracted by humans. Authorities and health services have a major responsibility to citizens to respond quickly to minimize the possibility of a localized outbreak becoming a pandemic. The Avian Flu Tracker is a dynamic Location Based

To examine the hypothesis that a demonstration clinic integrating homeless, primary care, and mental health services for homeless veterans with serious mental illness or substance abuse would improve medical health care access and physical health status. A quasi-experimental design comparing a 'usual VA care' group before the demonstration clinic opened (N = 130) and the 'integrated care' group (N = 130). Regression models indicated that the integrated care group was more rapidly enrolled in primary care, received more prevention services and primary care visits, and fewer emergency department visits, and was not different in inpatient utilization or in physical health status over 18 months. The demonstration clinic improved access to primary care services and reduced emergency services but did not improve perceived physical health status over 18 months. Further research is needed to determine generalizability and longer term effects.

To examine the hypothesis that a demonstration clinic integrating homeless, primary care, and mental health services for homeless veterans with serious mental illness or substance abuse would improve medical health care access and physical health status. A quasi-experimental design comparing a 'usual VA care' group before the demonstration clinic opened (N = 130) and the 'integrated care' group (N = 130). Regression models indicated that the integrated care group was more rapidly enrolled in primary care, received more prevention services and primary care visits, and fewer emergency department visits, and was not different in inpatient utilization or in physical health status over 18 months. The demonstration clinic improved access to primary care services and reduced emergency services but did not improve perceived physical health status over 18 months. Further research is needed to determine generalizability and longer term effects.

The prevailing infrastructure of ubiquitous computing paradigm on the one hand making significant development for integrating technology in the daily life but on the other hand raising concerns for privacy and
confidentiality. As Location based services (LBS) equip users to query information specific to a location with respect to temporal and spatial factors thus LBS put under extreme criticism when it comes to location privacy and user confidentiality. Here in this paper we are addressing the significance of our pro- posed scheme, a query processing architecture for privacy preservation in LBS, by providing flexible and efficient LBS model to ensure accurate and qualitative result set by employing some indexing scheme at location anonymizer as well as by Identifying possible adversary attacks to breach user privacy in the previous work with respect to location privacy and query privacy.
Realizing the need for a unanimous query processing model which can operate in centralize as well as distributed environment, also flexible enough to provide privacy for public queries (snapshot/continuous) as well as private queries (snapshot/continuous) for public and private locations. Finally we will quantify the benefits of our approach using
sampled results through experiments that the proposed cloaking algorithm is scalable, efficient and robust to support anonymity irrespective of scale of user queries in real time scenario.

Grounding is the process in charge of linking requests and responses of web services with the semantic web services execution platform, and it is the key activity to automate their execution in a real business environment. In this paper, the authors introduce a practical solution for data grounding. On the one hand, we need a mapping language to relate data structures from services definition in WSDL documents to concepts, properties and instances of a business domain. On the other hand, two functions that perform the lowering and lifting processes using these mapping specifications are also presented.

Resumo-As telecomunicações vêm experimentando mudanças significativas, que apontam para a integração das redes de dados e voz. Neste artigo, tal tendência é considerada, especificamente para as Redes Inteligentes (RIs) de Telecomunicações. É proposto um primeiro passo em direção à migração das RIs tradicionais, centralizadas, para as RIs distribuídas, e apresentada a implementação de parte de um gateway de comunicação entre a RI tradicional e uma RI distribuída via CORBA, implementação esta baseada em uma especificação apresentada como resposta a uma RFP do OMG. São descritas as implementações realizadas e apresentadas algumas conclusões sobre os resultados obtidos nas mesmas.

This document describes an Extensible Provisioning Protocol (EPP) mapping for getting Internationalized Domain Name (IDN) Table information for the registration of IDNs, using the EPP domain name mapping, and optionally with the IDN mapping extension. An IDN Table defines the valid set of characters (code points) that can be used in a domain name. Code points may overlap across IDN Tables and the IDN Tables supported by the servers are up to server policy. The IDN Table information can be used to validate an IDN prior to registration, can be cached by the client for pre-validation, can be used to select the best IDN Table for the IDN, and can be used to know if and what IDN Table Identifier to pass in a domain create. Status of This Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts.

This document describes an Extensible Provisioning Protocol (EPP) mapping for getting Internationalized Domain Name (IDN) Table information for the registration of IDNs, using the EPP domain name mapping, and optionally with the IDN mapping extension. An IDN Table defines the valid set of characters (code points) that can be used in a domain name. Code points may overlap across IDN Tables and the IDN Tables supported by the servers are up to server policy. The IDN Table information can be used to validate an IDN prior to registration, can be cached by the client for pre-validation, can be used to select the best IDN Table for the IDN, and can be used to know if and what IDN Table Identifier to pass in a domain create.

Assisted in creating, debugging, and maintaining several features in Oracle Enterprise Planning and Budgeting (EPB) software suite. Worked on multiple features in the product, including the setup of PL/SQL packages and schemas, as well as the interfaces to the Java-based UI (built using Oracle's OAFramework API).

Large-scale distributed systems are hard to deploy, and distributed hash tables (DHTs) are no exception. To lower the barriers facing DHT-based applications, we have created a public DHT service called OpenDHT. Designing a DHT that can be widely shared, both among mutually untrusting clients and among a variety of applications, poses two distinct challenges. First, there must be adequate control over storage allocation so that greedy or malicious clients do not use more than their fair share. Second, the interface to the DHT should make it easy to write simple clients, yet be sufficiently general to meet a broad spectrum of application requirements. In this paper we describe our solutions to these design challenges. We also report our early deployment experience with OpenDHT and describe the variety of applications already using the system.

Many Distributed Hash Table topologies, such as Pastry, allow flexible choosing of a peer's neighbors while maintaining routing consistency. Traditionally, such flexibility has been used to only optimize the overlay only for latency. In this paper, we create a set of objective functions that allow a peer to select neighbors for its routing table which minimize ping time, maximize bandwidth, or attempt to do both. In conjunction with a novel algorithm for quickly finding peers that maximize a given objective function without settling to a local maximum in the identifier space, we show through simulation that routing tables optimized in a greedy fashion by each node can have significant impact on end-to-end latency and capacity, such as reducing endto-end delay by over 50 percent.

Abstract���In this paper we propose a new technique for peers on a Pastry network to find optimal entries for their routing tables, where a node is optimal if it minimizes ping time, maximizes bandwidth, or attempts to do both. To assist in such neighbor selection, we investigate using Vivaldi in conjunction with CapProbe. A variety of cost functions, or criteria to judge peers, is devised and evaluated through simulation. We find that intelligent peer selection, leading to optimized routing table entries, can have benefits of halving end-to- ...

In this paper, a new Adaptive Centralised Location-Service (ACLS) routing protocol is presented, which tracks mobile node locations and recover the side effects of nodes mobility. In ACLS, some nodes consider themselves as servers serve other nodes according to their location and status in the network. The transmission is achieved by 'anonymous addressing' technique where the receivers decide on their own, whether they are the intended destination. Results indicate very good and impressive performance of the ACLS in terms of scalability with the number of nodes, speed and location update success rate.

Scalable Internet services are based on sets of peer application servers. A decentralized location service is used to resolve human readable application identifiers and return the nearest application server reference. This paper evaluates several services and algorithms from the Internet, grid and peer-to-peer community services. It identifies two potential problems and proposes a new approach for handling them. Existing techniques structure the overlay networks using tree structures. The proposed service enhances the structure with meshed structures at each level, creating dynamically multiple paths to enhance scalability. We present a study and simulation results on one aspect of scalability-sudden load of requests from users. Our service adapts to the load reaching a stable stage and performing resolution requests before a certain time limit.

Integrating voluntary HIV counseling and testing (VCT) with family planning (FP) and other reproductive health (RH) services may be one effective strategy for expanding VCT service delivery in resource poor settings. Using 30,257 VCT client records with linked facility characteristics from Ethiopian non-governmental, non-profit reproductive health clinics, we constructed multi-level logistic regression models to examine associations between family planning (FP) and HIV service integration modality and three outcomes: VCT client composition, client-initiated HIV testing and client HIV status. Associations between facility FP-HIV integration level and the likelihood of VCT clients being atypical FP client-types, versus older (25+ years), ever-married women were assessed. Relative to facilities co-locating services in the same compound, those offering FP and HIV services in the same rooms were 2-13 times more likely to serve atypical FP client-types than older, ever-married women. Facilities where counselors jointly offered FP-HIV services, and served many repeat FP clients, were significantly less likely to serve single clients relative to older, married women. Facilities offering many youth services were even more likely to provide older, married women with VCT services than youth, which may be explained by these facilities' use of highly integrated service delivery. Younger, single men and older, married women were most likely to self-initiate HIV testing (78.2 percent and 80.6 percent, respectively), while the highest HIV prevalence was seen among older, married men and women (20.5 percent and 34.2 percent, respectively). Compared with facilities offering co-located

Ever since the introduction of the service oriented model of computing (SOA), service discovery has been the major research challenge in SOA. Service consumers usually prefer to express their requirements informally. Expressing requirements in such a way leads to difficulties in the matching procedure, and hence results in poor matching results. In this paper, we present the concept of multi-level search as a solution for matching informal expression of user requirements. In the suggested approach, intermediate brokers receive service requests and suggest suitable services that match the given requests. We present a mechanism by which an intelligent broker utilizes a knowledge based system to overcome the drawbacks of syntactic and semantic discovery. The intelligent broker receives informal user requirements and performs multi-level search. The search starts with key word search, then meaning search, and finally expert search. If the keyword search fails to produce a proper matching, then, the search progresses to the following levels: semantic, and then intelligent search. In this paper we argue that multi-level search could revive the dream of automatic service discovery and present a detailed model for implementation.

Position-based routing protocols take advantage of location information to perform a stateless and efficient routing. To enable position-based routing, a node must be able to discover the location of the messages' destination node. This task is typically accomplished by a location service. Recently, several location service protocols have been developed for ad hoc networks. In this paper we propose a novel location service called PHLS: Predictive Hierarchical Location Service. In PHLS, the entire network is partitioned into a hierarchy of smaller and smaller regions. For each node, one node in each-level region of the hierarchy is chosen as its local location server. When the network initializes or when a node attaches the network, nodes contact their local location server with their current location information (ie. position and velocity). Then, they only need to update their location server when they move away from their current region. Finally, nodes query their location servers and get the exact or predicted location of destination nodes.

Localization in Mobile Ad-hoc Networks (MANETs) and Wireless Sensor Networks (WSNs) is an issue of great interest, especially in applications such as the IoT and VANETs. We propose a solution that overcomes two limiting characteristics of these types of networks. The first is the high cost of nodes with a location sensor (such as GPS) which we will refer to as anchor nodes. The second is the low computational capability of nodes in the network. The proposed algorithm addresses two issues; self-localization where each non-anchor node should discover its own position, and global localization where a node establishes knowledge of the position of all the nodes in the network. We address the problem as a graph where vertices are nodes in the network and edges indicate connectivity between nodes. The weights of edges represent the Euclidean distance between the nodes. Given a graph with at least three anchor nodes and knowing the maximum communication range for each node, we are able to localize nodes using fairly simple computations in a moderately dense graph.

Localization in Mobile Ad-hoc Networks (MANETs) and Wireless Sensor Networks (WSNs) is an issue of great interest, especially in applications such as the IoT and VANETs. We propose a solution that overcomes two limiting characteristics of these types of networks. The first is the high cost of nodes with a location sensor (such as GPS) which we will refer to as anchor nodes. The second is the low computational capability of nodes in the network. The proposed algorithm addresses two issues; self-localization where each non-anchor node should discover its own position, and global localization where a node establishes knowledge of the position of all the nodes in the network. We address the problem as a graph where vertices are nodes in the network and edges indicate connectivity between nodes. The weights of edges represent the Euclidean distance between the nodes. Given a graph with at least three anchor nodes and knowing the maximum communication range for each node, we are able to localize nodes using fairly simple computations in a moderately dense graph.

Position-based routing protocols take advantage of location information to perform a stateless and efficient routing. To enable position-based routing, a node must be able to discover the location of the messages' destination node. This task is typically accomplished by a location service. Recently, several location service protocols have been developed for ad hoc networks. In this paper we propose a novel location service called PHLS: Predictive Hierarchical Location Service. In PHLS, the entire network is partitioned into a hierarchy of smaller and smaller regions. For each node, one node in each-level region of the hierarchy is chosen as its local location server. When the network initializes or when a node attaches the network, nodes contact their local location server with their current location information (ie. position and velocity). Then, they only need to update their location server when they move away from their current region. Finally, nodes query their location servers and get the exact or predicted location of destination nodes.

B + trees have proven efficient and effective in the role of indexes for data stored in databases. With the explosion in the number of datasets being stored in a distributed manner, a scalable and efficient index is needed to locate data. In this paper, the issues in designing a distributed B + tree are examined with a specific emphasis on incrementally distributing the tree across a network.

Recent technological advances in wireless communication and the pervasiveness of various wireless communication devices have offered novel and promising solutions to enable vehicles to communicate with each other, establishing a decentralized communication system. An emerging solution in this area is the Vehicular Ad Hoc Networks (VANETs), in which vehicles cooperate in receiving and delivering messages to each other. VANETs can provide a viable alternative in situations where existing infrastructure communication systems become overloaded, fail (due for instance to natural disaster), or inconvenient to use. Nevertheless, the success of VANETs revolves around a number of key elements, an important one of which is the way messages are routed between sources and destinations. Without an effective message routing strategy VANETs' success will continue to be limited. In order for messages to be routed to a destination effectively, the location Contents List of Tables xiii List of Figures xvi Nomenclature xvii

Public displays play an important role in information dissemination-market reports highlight the increasing number of displays deployed. Due to the often prominent placement of public displays in the physical environment, displays can play an important role in the dissemination of trusted content, particularly during emergency situations. In order to leverage displays in emergency situations however, appropriate content creation and dissemination technology is key to allow display and space owners to efficiently distribute important information and target affected user groups. In this paper, we present our lessons learned from designing and developing an emergency alerts system in the context of a large public display testbed. We provide insights into two design probes and feedback captured through focus groups with stakeholders of the display network. Based on the feedback, we provide insights into requirements captured and provide a discussion on lessons and design considerations. CCS CONCEPTS • Human-centered computing → Human computer interaction (HCI); Graphical user interfaces; Web-based interaction.

Massive multiple input and multiple output (MIMO) transmission is a key research area for incoming fifth-generation wireless (5G) communications. This technology uses numerous simultaneously transceiving antennas to utilize radio resources and improve communication quality. Although massive MIMO is suitable for inter-base station wireless backhaul networks, how to adequately assign each BS's antennas remains unsolved. In this paper, a distributed mechanism termed Hierarchical Distributed Adjustment is proposed. On the basis of the links' channel conditions, BSs' available antennas, users' service requirements, and neighbors' allocation decisions, the transceiving antennas of each link are adjusted to both fulfill the quality of service constraints and maximize the total utility of the best-effort traffic. Through analysis, we prove that this problem is nondeterministic polynomial-complete, and the performance gap between the proposed heuristic and the optimal solution is bounded. The simulation results indicate a promising performance and adaptive behavior under various conditions. To the best of our knowledge, this study is the first to focus on this problem and to have achieved effective and flexible allocation. INDEX TERMS Fifth generation (5G) mobile communication, massive multiple input multiple output (MIMO), resource management

The philosophy behind the ID and locator separation is that an identity must be used for denoting a communication entity and must be independent from the topological location of the entity. While the ID and locator separation provides a sound solution to mobility and handling topology changes, which cannot be solved inherently by the current Internet, its benefits are overshadowed by the routing scalability since the IDs cannot be aggregated. Unlike the traditional Internet that deals with the scalability issue at the addresslevel by aggregating IP addresses in the headers of the IP packets, we solve the scalability issues by structuring the network with hierarchically organized domains. In this paper, we present a highly scalable ID-based communication scheme, ID based route computation, and ID based forwarding under the framework of our architecture, ID-based networking Architecture (IDNet).

E-learning takes advantage of the new features offered by Web services: integration of heterogeneous applications, publicity of available services, etc. As the adoption of this new technology increases it will become necessary to offer intermediary platforms that make it easier to find and locate services, and composing new services from the existing ones. Additionally, it will also be necessary to provide value-added services like auditing, security or management. This paper presents a proposal for a standard-based intermediary framework for Web services.