Abstract
In this paper, we investigate the problem of computing a consensus trajectory of a vehicle giving the history of Points of Interest (POIs) visited by the vehicle over certain period of time. The problem originates from building the social connection between two vehicles in a vehicular network. Formally, given a set of m trajectories (sequences \(S_i\)’s over a given alphabet \(\varSigma \), each with length at most O(n), with \(n=|\varSigma |\)), the problem is to compute a target (median) sequence T over \(\varSigma \) such that the sum of similarity measure (i.e., number of adjacencies) between T and all \(S_i\)’s is maximized. For this version, we show that the problem is NP-hard and we present a simple factor-2 approximation. If T has to be a permutation, then we show that the problem is still NP-hard but the approximation factor can be improved to 1.5. We implement the greedy algorithm and a variation of it which is based on a more natural greedy search. Using simulated data over two months (e.g., \(m=60\)) and variants of \(|S_i|\) and \(\varSigma \) (e.g., \(30\le |S_i|\le 100\) and \(30\le |\varSigma | \le 60\)), the empirical results are very promising and with the local adjustment algorithm the actual approximation factor is between 1.5 and 1.6 for all the cases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Angibaud, S., Fertin, G., Rusu, I., Thevenin, A., Vialette, S.: On the approximability of comparing genomes with duplicates. J. Graph Algorithms Appl. 13(1), 19–53 (2009)
Bryant, D.: The complexity of the breakpoint median problem. Technical report CRM-2579. Centre de Recherches en Mathématiques, Université de Montréal (1998)
Doucer, J.: The sybil attack. In: Proceedings of IPTPS 2001 Revised Papers from the First International Workshop on Peer-to-Peer Systems, pp. 251–260 (2002)
Edmonds, J., Johnson, E.: Matching: a well-solved class of integer linear programs. In: Combinatorial Structures and Their Applications, Gordon and Breach, New York, pp. 89–92 (1969)
Hartenstein, H., Kenneth, L.: VANET: Vehicular Applications and Inter-networking Technologies. Wiley, Hoboken (2009)
Jiang, H., Zhong, F., Zhu, B.: Filling scaffolds with gene repetitions: maximizing the number of adjacencies. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 55–64. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21458-5_7
Jiang, H., Zheng, C., Sankoff, D., Zhu, B.: Scaffold filling under the breakpoint and related distances. IEEE/ACM Trans. Comput. Biol. Bioinform. 9(4), 1220–1229 (2012)
Liu, G., Yang, Q., Wang, H., Lin, X., Wittie, M.: Assessment of multi-hop interpersonal trust in social networks by three-valued subjective logic. In: Proceedings of INFOCOM 2014, pp. 1698–1706 (2014)
Liu, G., Chen, Q., Yang, Q., Zhu, B., Wang, H., Wang, W.: OpinionWalk: an efficient solution to massive trust assessment in online social networks. In: Proceedings of INFOCOM 2017, pp. 1–9 (2017)
Li, M., Ma, B., Wang, L.: Finding similar regions in many sequences. J. Comput. Sys. Sci. 65(1), 73–96 (2002)
Papadimitratos, P., et al.: Secure vehicular communication systems: design and architecture. IEEE Commun. Mag. 46(11), 100–109 (2008)
Pe’er, I., Shamir, R.: The median problems for breakpoints are NP-complete. Elec. Colloq. Comput. Complex. TR-98-071 (1998)
Shiloach, Y.: Another look at the degree constrained subgraph problem. Inf. Process. Lett. 12(2), 89–92 (1981)
Shrestha, R., Djuraev, S., Nam, S.Y.: Sybil attack detection in vehicular network based on received signal strength. In: Proceedings of 3rd International Conference on Connected Vehicles and Expo (ICCVE 2014), pp. 745–746 (2014)
Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinform. 10, 120 (2009)
Zhang, J.: A survey on trust management for VANETS. In: Proceedings of 2011 IEEE International Conference on Advanced Information Networking and Applications (AINA 2011), pp. 105–115 (2011)
Acknowledgments
This research was supported by NSF under project CNS-1761641 and by NNSF of China under project 61628207. Peng Zou was also supported by a COE Benjamin PhD Fellowship at Montana State University.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Zou, P., Qingge, L., Yang, Q., Zhu, B. (2019). Trajectory Comparison in a Vehicular Network I: Computing a Consensus Trajectory. In: Biagioni, E., Zheng, Y., Cheng, S. (eds) Wireless Algorithms, Systems, and Applications. WASA 2019. Lecture Notes in Computer Science(), vol 11604. Springer, Cham. https://doi.org/10.1007/978-3-030-23597-0_43
Download citation
DOI: https://doi.org/10.1007/978-3-030-23597-0_43
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-23596-3
Online ISBN: 978-3-030-23597-0
eBook Packages: Computer ScienceComputer Science (R0)