SCC-LBS: Secure Criss-Cross Location-Based Service in Logistics

  • Udai Pratap RaoEmail author
  • Gargi Baser
  • Ruchika Gupta
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 27)


The study involving the transference and delivery of a variety of goods is popularly known as Logistics. Businesses specialize a variety of vehicles for distribution of the goods at the correct location. The vehicles must be able to communicate with each other despite being at different locations during transits. This leads to consideration of the moving vehicles being able to locate each other in large ad-hoc network. Moreover, delivery services must ensure that the data captured and exchanged by these vehicles specialized for delivery of goods must be secure. The moving vehicles have embedded sensor units that are responsible for the exchange of data. Since these sensor units include low priced resources, low capacity, and a lightweight platform, it is hard to implement the existing cryptographic algorithms on these sensors. In this paper, we present an approach named secure criss-cross location-based service (SCC-LBS) for the vehicles to communicate with each other, while delivering goods at fairly large distance. We describe the taxonomy of our proposed distributed location-based service which shall be used by vehicles to locate each other and also the security of the proposed approach. The proposed scheme secures data exchanged between vehicles and works efficiently for distributed pockets of nodes (or vehicles) in the entire region. Our approach performs well in terms of query success rate and LBS overhead compared to state-of-the-art approach.


  1. 1.
    Anjali, Shikha, M. Sharma, Wireless sensor networks: routing protocols and security issues, in Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT) (2014), pp. 1–5.
  2. 2.
    S. Basagni, I. Chlamtac, V.R. Syrotiuk, B.A. Woodward, A distance routing effect algorithm for mobility (dream), in Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (ACM, New York, 1998), pp. 76–84Google Scholar
  3. 3.
    A. Bogdanov, L.R. Knudsen, G. Leander, C. Paar, A. Poschmann, M.J. Robshaw, Y. Seurin, C. Vikkelsoe, Present: an ultra-lightweight block cipher, in International Workshop on Cryptographic Hardware and Embedded Systems (Springer, Berlin, 2007), pp. 450–466zbMATHGoogle Scholar
  4. 4.
    T. Camp, J. Boleng, L. Wilcox, Location information services in mobile ad hoc networks, in IEEE International Conference on Communications, 2002. ICC 2002, vol. 5 (IEEE, Piscataway, 2002), pp. 3318–3324Google Scholar
  5. 5.
    C.Y. Chow, M.F. Mokbel, X. Liu, A peer-to-peer spatial cloaking algorithm for anonymous location-based service, in Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems (ACM, New York, 2006), pp. 171–178Google Scholar
  6. 6.
    N.T. Courtois, General principles of algebraic attacks and new design criteria for cipher components, in International Conference on Advanced Encryption Standard (Springer, Berlin, 2004), pp. 67–83Google Scholar
  7. 7.
    X. Du, Y. Xiao, M. Guizani, H.H. Chen, An effective key management scheme for heterogeneous sensor networks. Ad Hoc Netw. 5(1), 24–34 (2007)CrossRefGoogle Scholar
  8. 8.
    L. Eschenauer, V.D. Gligor, A key-management scheme for distributed sensor networks, in Proceedings of the 9th ACM Conference on Computer and Communications Security (ACM, New York, 2002), pp. 41–47Google Scholar
  9. 9.
    G.G. Finn, Routing and addressing problems in large metropolitan-scale internetworks. ISI Research Report (1987)Google Scholar
  10. 10.
    Global positioning system. Accessed 15 Oct 2017
  11. 11.
    R. Gupta, U.P. Rao, Achieving location privacy through cast in location based services. J. Commun. Netw. 19(3), 239–249 (2017)CrossRefGoogle Scholar
  12. 12.
    R. Gupta, U.P. Rao, An exploration to location based service and its privacy preserving techniques: a survey. Wirel. Pers. Commun. 96(2), 1973–2007 (2017)CrossRefGoogle Scholar
  13. 13.
    R. Gupta, U.P. Rao, A hybrid location privacy solution for mobile LBS. Mob. Inf. Syst. 2017, 1–11 (2017)Google Scholar
  14. 14.
    Z.J. Haas, B. Liang, Ad hoc mobility management with uniform quorum systems. IEEE/ACM Trans. Netw. (TON) 7(2), 228–240 (1999)Google Scholar
  15. 15.
    V. Hnatyshin, M. Ahmed, R. Cocco, D. Urbano, A comparative study of location aided routing protocols for MANET, in IFIP Wireless Days (WD), 2011 (IEEE, Piscataway, 2011), pp. 1–3CrossRefGoogle Scholar
  16. 16.
    B. Karp, H.T. Kung, Gpsr: Greedy perimeter stateless routing for wireless networks, in Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (ACM, New York, 2000), pp. 243–254Google Scholar
  17. 17.
    D. Liu, P. Ning, Establishing pairwise keys in distributed sensor networks, in Proceedings of the 10th ACM Conference on Computer and Communications Security (ACM, New York, 2003), pp. 52–61Google Scholar
  18. 18.
    Logistics. Accessed 23 Sept 2017
  19. 19.
    Logistics and security. Accessed 20 Nov 2017
  20. 20.
    D.J. Malan, M. Welsh, M.D. Smith, A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography, in First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004 (IEEE, Piscataway, 2004), pp. 71–80Google Scholar
  21. 21.
    A. Perrig, R. Szewczyk, J.D. Tygar, V. Wen, D.E. Culler, Spins: Security protocols for sensor networks. Wirel. Netw. 8(5), 521–534 (2002)CrossRefGoogle Scholar
  22. 22.
    Public key cryptography. Accessed 01 Nov 2017
  23. 23.
    M. Pudovkina, A related-key attack on block ciphers with weak recurrent key schedules, in International Symposium on Foundations and Practice of Security (Springer, Berlin, 2011), pp. 90–101zbMATHGoogle Scholar
  24. 24.
  25. 25.
    E. Takimoto, S. Aketa, Y. Otsuki, S. Saito, K. Mouri, A hybrid loop-free routing protocol for wireless mesh networks, in International Conference on Frontiers of Communications, Networks and Applications (ICFCNA 2014-Malaysia) (2014)Google Scholar
  26. 26.
    P. Traynor, H. Choi, G. Cao, S. Zhu, T. La Porta, Establishing pair-wise keys in heterogeneous sensor networks, in Proceedings of 25th IEEE International Conference on Computer Communications. INFOCOM 2006. Citeseer (2006), pp. 1–12Google Scholar
  27. 27.
    P.F. Tsuchiya, The landmark hierarchy: a new hierarchy for routing in very large networks, in ACM SIGCOMM Computer Communication Review, vol. 18 (ACM, New York, 1988), pp. 35–42Google Scholar
  28. 28.
    P. Vijayakumar, S. Bose, A. Kannan, Centralized key distribution protocol using the greatest common divisor method. Comput. Math. Appl. 65(9), 1360–1368 (2013)MathSciNetCrossRefGoogle Scholar
  29. 29.
    A.S. Wander, N. Gura, H. Eberle, V. Gupta, S.C. Shantz, Energy analysis of public-key cryptography for wireless sensor networks, in Third IEEE International Conference on Pervasive Computing and Communications, 2005. PerCom 2005 (IEEE, Piscataway, 2005), pp. 324–328Google Scholar
  30. 30.
    G.J. Yu, A quorum-based route cache maintenance protocol for mobile ad-hoc networks, in Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (IEEE Computer Society, Washington, 2008), pp. 196–203Google Scholar
  31. 31.
    S. Zhu, S. Setia, S. Jajodia, Leap: efficient security mechanisms for large-scale distributed sensor networks, in Proceedings of the 10th ACM Conference on Computer and Communications Security (ACM, New York, 2003), pp. 62–72Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Computer Engineering DepartmentS V National Institute of TechnologySuratIndia
  2. 2.Computer Science Engineering DepartmentChandigarh UniversityChandigarhIndia

Personalised recommendations