Login / Signup

Secure Neighbour Discovery: Secure k-Nearest ROUTING AD-HOC Networking Using Diffie-Helman and HIGHEST Connectivity Algorithm.

S. DhanabalPrasanna Venkatesan G. K. DP. Amudhavalli
Published in: J. Commun. (2019)
Keyphrases
  • learning algorithm
  • computational complexity
  • dynamic programming
  • similarity measure
  • k nearest
  • feature space
  • sliding window
  • spatial data
  • routing protocol
  • selection algorithm