Efficient Location Based Services for Groups of Mobile Users

被引:5
作者
Anagnostopoulos, Christos [1 ]
Kolomvatsos, Kostas [2 ]
Hadjiefthymiades, Stathes [2 ]
机构
[1] Ionian Univ, Dept Informat, Corfu 49100, Greece
[2] Natl & Kapodistrian Univ Athens, Dept Informat & Telecommun, Athens 15784, Greece
来源
2013 IEEE 14TH INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT (MDM 2013), VOL 1 | 2013年
关键词
D O I
10.1109/MDM.2013.11
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
We study the performance improvement of Location Based Services through the identification and subsequent use of groups of mobile nodes. In our scheme we exploit the formation of nodes into groups in order to reduce the computation load incurred in back-end systems (e.g., Location Servers) and the associated network overhead. The back-end systems track the position and communicate with the Group Leader (GL). The GL, in turn, passes the received information to the members of the group (e.g., through short-range communications). The formation of mobile groups is validated over time to avoid misinterpreted temporary groupings which could endanger the adoption of the reduced load/overhead scheme. A time scheduling scheme based on the Optimal Stopping Theory assists in the finalization of the group validity. Metrics like group compactness are thoroughly assessed in line with the optimal stopping time scheme to increase confidence on group validity and persistence. Performance assessment reveals significant benefits for the considered location based services system.
引用
收藏
页码:6 / 15
页数:10
相关论文
共 22 条
[1]  
[Anonymous], P 3 IEEE INT C WIR M
[2]   Indoor Mobility Modelling [J].
Aschenbruck, Nils ;
Ernst, Raphael ;
Martini, Peter .
2010 IEEE GLOBECOM WORKSHOPS, 2010, :1264-1269
[3]   Distributed clustering for ad hoc networks [J].
Basagni, S .
FOURTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN'99), PROCEEDINGS, 1999, :310-315
[4]  
Berry MichaelJ., 1996, Data mining techniques for marketing, sales, and customer support
[5]  
Bertsekas D. P., 2005, DYNAMIC PROGRAMMING, VI
[6]  
Chen JD, 2007, LECT NOTES COMPUT SC, V4443, P611
[7]  
Chen Y.C., 2010, Proceedings of the 6th international wireless communications and mobile computing conference, P875, DOI DOI 10.1145/1815396.1815597
[8]   OPTIMAL SEQUENTIAL SELECTION FROM A KNOWN DISTRIBUTION WITH HOLDING COSTS [J].
FERENSTEIN, EZ ;
ENNS, EG .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1988, 83 (402) :382-386
[9]  
Ferguson T. S., Optimal stopping and applications
[10]  
Halkidi M, 2000, LECT NOTES COMPUT<D>, V1910, P265