A Generic Framework for Location‐Based Services (LBS) Provisioning

In Group Nearest-Neighbor (GNN) queries, the goal is to find one or more points of interest with minimum sum of distance to the current location of mobile users. The classic forms of GNN use Euclidean distance measure which is not sufficient to capture other essential distance perceptions of human and the inherent uncertainty of it. To overcome this problem, an improved distance model can be used which is based on a richer, closer to real-world type-2 fuzzy logic distance model. However, large search spaces as well as the need for higher-order uncertainty management will increase the response times of such GNN queries. In this paper two fuzzy clustering methods combined with spatial tessellation are exploited to reduce the search space. Extensive evaluation of the proposed method shows improved response times compared to naïve method while maintaining a high quality of approximation. The proposed uncertainty management method also provides robustness to movement of mobile users, eliminating the need for full re-computation of candidate clusters when the locations of group members are changed.

Section: Motivating Scenariosmentioning

confidence: 99%

Optimizing the Performance and Robustness of Type-2 Fuzzy Group Nearest-Neighbor Queries

Ghadiri

Baraani-Dastjerdi

Ghasem-Aghaee

et al. 2011

“…In this age of significant telecommunication competition, location based services (LBS) [20] open new horizons for cellular operator for provisioning of innovative lucrative value added services. LBS are a growing technology field that focuses on providing GIS and spatial information via mobile and field units.…”

Section: Location Based Services -Lbsmentioning

confidence: 99%

“…The work in [20] presented an integrated middleware and service provision platform for delivering Location Based Services (LBS). It covers the full life cycle of a LBS and facilitates the creation and provision of service issues like specification, deployment, invocation, and maintenance.…”

Section: Introduction and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Virtual Social Networks Online and Mobile Systems

Safar

Sawwan

Taha

et al. 2009

Location-based applications are one of the most anticipated new segments of the mobile industry. These new applications are enabled by GPS-equipped phones (e.g., emergency applications, buddy finders, games, location-based advertising, etc.). These services are designed to give consumers instant access to personalized, local content of their immediate location. Some applications couple LBS with notification services, automatically alerting users when they are close to a pre-selected destination. With the advances in the Internet and communications/mobile technology, it became vital to analyze the effect of such technologies on human communications. This work studies how humans can construct social networks as a method for group communications using the available technologies. We constructed and analyzed a friends network using different parameters. The parameters that were calculated to analyze the network are the distribution sequence, characteristic path length, clustering coefficient and centrality measures. In addition, we built a PDA application that implements the concept of LBS using two system modules. In the first module, we have developed an application for entertainment purpose; an application program which enables end users to send their birth year and get their horoscope in return. The second part of the project was, to build an application, which helps people to stay in touch with their friends and family members (Find Friend). It helps users to find which of their buddies are within the same area they are in.

“…In paper [24], alternative data storage solution for mobile messaging services is provided. Location Management techniques for mobile systems are given in [11,27]. Christoph Endres [10] provides a survey of software infrastructures and frameworks for ubiquitous computing.…”

Section: Introductionmentioning

confidence: 99%

A Low‐Cost Hybrid Coordinated Checkpointing Protocol for Mobile Distributed Systems

Kumar

2008

Mobile distributed systems raise new issues such as mobility, low bandwidth of wireless channels, disconnections, limited battery power and lack of reliable stable storage on mobile nodes. In minimum-process coordinated checkpointing, some processes may not checkpoint for several checkpoint initiations. In the case of a recovery after a fault, such processes may rollback to far earlier checkpointed state and thus may cause greater loss of computation. In all-process coordinated checkpointing, the recovery line is advanced for all processes but the checkpointing overhead may be exceedingly high. To optimize both matrices, the checkpointing overhead and the loss of computation on recovery, we propose a hybrid checkpointing algorithm, wherein an all-process coordinated checkpoint is taken after the execution of minimum-process coordinated checkpointing algorithm for a fixed number of times. Thus, the Mobile nodes with low activity or in doze mode operation may not be disturbed in the case of minimum-process checkpointing and the recovery line is advanced for each process after an all-process checkpoint. Additionally, we try to minimize the information piggybacked onto each computation message. For minimum-process checkpointing, we design a blocking algorithm, where no useless checkpoints are taken and an effort has been made to optimize the blocking of processes. We propose to delay selective messages at the receiver end. By doing so, processes are allowed to perform their normal computation, send messages and partially receive them during their blocking period. The proposed minimum-process blocking algorithm forces zero useless checkpoints at the cost of very small blocking.