National Institute of Technology Sikkim

On k-Geodetic Edge Traceable Graph

A graph G is k-geodetic edge traceable if every edge of G lies in at least one geodesic of length k. The maximum geodesic edge-covering number $$\textrm{gec}_{\max }(G)$$ is the minimum number of largest fixed-length geodesics that cover all edges of G. We study some properties o...

BSRP: A Blockchain‐Based Secure Routing Protocol With Zero Knowledge Handover Authentication for Internet of Vehicles

ABSTRACT Objectives The Internet of vehicles development under intelligent transportation systems necessitates secure, decentralized, and privacy‐preserving authentication schemes to counter sophisticated attacks such as sybil attack, replay attack, man‐in‐the‐middle attack, and...