Research Article
Dynamic Naming Scheme and Lookup Method Based on Trie for Vehicular Named Data Network
Input: Enter prefix | Output: Set the node with parent and child relationship | 1 Initialize hash table; | 2 if matched & not matched then | 3 Keep record ; //at position | 4 Create // with remaining bytes; | 5 ontinue: until node is not set; | 6 else | 7 Node partition failed; |
|