Logo
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • English 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Login
View Item 
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Institutional repository
All of DSpace
  • Communities & Collections
  • By Issue Date
  • Authors
  • Titles
  • Subjects

Time-optimized user grouping in Location Based Services

Thumbnail
Author
Anagnostopoulos, C.; Hadjiefthymiades, S.; Kolomvatsos, K.
Date
2015
DOI
10.1016/j.comnet.2015.02.017
Keyword
Group computing
Location-Based Services
Optimal Stopping Theory
AD-HOC NETWORKS
MOVING-OBJECTS
ALGORITHM
MOBILITY
Computer Science, Hardware & Architecture
Computer Science, Information
Systems
Engineering, Electrical & Electronic
Telecommunications
Metadata display
Abstract
We focus on Location Based Services (LBSs) which deliver information to groups of mobile users based on their spatial context. The existence (and non-trivial lifetime) of groups of mobile users can simplify the operation of LBS and reduce network overhead (due to location updates and application content flow). We propose an incremental group formation algorithm and an optimally scheduled, adaptive group validation mechanism which detects and further exploits spontaneous formation of groups of mobile users. The advantages of application simplification and network load reduction are pursued. Through the proposed mechanism the LBS server (back-end system) monitors representatives of formed groups, i.e., group leader, and, in turn, disseminates location-dependent application content to group members. We first introduce an incremental group formation algorithm for group partitioning and identification of group leaders. We elaborate on the mechanism which adopts the Optimal Stopping Theory in order to assess the group persistence through evaluation of compactness and coherency metrics. We compare the performance of the proposed scheme with that of existing mechanisms for moving objects clustering and quantify the benefits stemming for its adoption. (C) 2015 Elsevier B.V. All rights reserved.
URI
http://hdl.handle.net/11615/25514
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [19735]
htmlmap 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister (MyDspace)
Help Contact
DepositionAboutHelpContact Us
Choose LanguageAll of DSpace
EnglishΕλληνικά
htmlmap