Path Skyline for Moving Objects

Lee, Wookey; Eom, Chris Soo-Hyun; Jo, Tae‐Chang

doi:10.1007/978-3-642-29253-8_56

Cited by 3 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concerning the state (2, Á), the following six states are possible: (2,0), (2,2), (2,1), (2,7), (2,6), and (2,3). Note that eight states are possible concerning state (7, Á ).…”

Section: State Transition By Call Generationmentioning

confidence: 99%

“…1 They receive many location-based services (such as navigation, gas station, hotel, and restaurant) through mobile devices. 2 With some technologies such as Big Data, Cloud Computing, and Internet of Things (IoT) in the mobile environment, tremendous amounts of data have been collected in databases and employed for the users. 3 Continuous mobility management for User Equipment (UE) is the core function of mobile communication.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimal management of distance-based location registration using embedded Markov chain

Seo

Baek

Eom

et al. 2020

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

In this study, we deal with a Distance-Based Registration with Implicit Registration, which is an enhanced scheme of the Distance-Based Registration in mobile-cellular networks. In comparisons with other Location Registration schemes, various studies on the Distance-Based Registration scheme and performance have been performed. However, a real network hierarchy has not been properly reflected in the performance evaluation of the Distance-Based Registration. To accurately evaluate the registration and paging costs of the Distance-Based Registration, a real network hierarchy should reflect that a mobile network is made up of many Visitor Location Register areas. Furthermore, we use an embedded Markov-Chain model in the Visitor Location Register hierarchy, which can reflect not only the Implicit Registration effect of the outgoing calls of user equipment but also cell staying time of the user equipment that may follow a general distribution. Without consideration of the Visitor Location Register, the paging cost decreases due to a small paging area, but the location registration cost rises because of frequent inter Visitor Location Register. The numerical results according to the various conditions show an accurate evaluation of the Distance-Based Registration performance in a real network hierarchy and the general cell staying time. Generally, the total signaling cost will increase when we consider the Visitor Location Register. However, for more appropriate evaluation of the Distance-Based Registration performance, it is necessary to consider the Visitor Location Register hierarchy.

show abstract

“…Concerning the state (2, Á), the following six states are possible: (2,0), (2,2), (2,1), (2,7), (2,6), and (2,3). Note that eight states are possible concerning state (7, Á ).…”

Section: State Transition By Call Generationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Optimal management of distance-based location registration using embedded Markov chain

Seo

Baek

Eom

et al. 2020

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…Top routes are computed iteratively in an efficient way and pruning technique is adopted in order to reduce the search space. The authors in [28] focused on extracting the path skylines and proposed PathSL to generate an optimal skyline for moving objects.…”

Section: Related Workmentioning

confidence: 99%

Continuous Probabilistic Skyline Queries for Uncertain Moving Objects in Road Network

Pan

Dong

Cao

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In moving environment, the positions of moving objects cannot be located accurately. Apart from the measuring instrument errors, movement of the objects is the main factor contributing to this uncertainty. This uncertainty makes dominant relationship of data instable, which will affect skyline operator. In this paper, we mainly study the continuous probabilistic skyline query for uncertain moving objects in road network. The query point is deemed to be stationary while moving objects are treated as targets with uncertainty described by a probability density function. After defining the notion of dominant probability and probabilistic skyline, we put forward a novel algorithm to deal with continuous probabilistic skyline query on road network. Firstly, we compute the dominant probability and skyline probability to get initial permanent p-skyline set. Then we define events to predict the time when dominant relationship between moving objects may change. Furthermore, we track and calculate events to update the probabilistic skyline in an incremental way. Two pruning strategies are proposed to cancel invalid events and objects in a bid to diminish search space. Finally, an extensive experimental evaluation on real datasets shows that probabilistic skyline sets in road network can be updated by the proposed algorithm. It demonstrates both efficiency and effectiveness.

show abstract

MapReduce-based skyline query processing scheme using adaptive two-level grids

Ryu

Jung

2017

Cluster Comput

View full text Add to dashboard Cite

Path Skyline for Moving Objects

Cited by 3 publications

References 18 publications

Optimal management of distance-based location registration using embedded Markov chain

Optimal management of distance-based location registration using embedded Markov chain

Continuous Probabilistic Skyline Queries for Uncertain Moving Objects in Road Network

MapReduce-based skyline query processing scheme using adaptive two-level grids

Contact Info

Product

Resources

About