Dynamic Naming Scheme and Lookup Method Based on Trie for Vehicular Named Data Network

Algorithm 1

Lookup and interest contents.

Input: Interest

Output: Get desired data

1 Node=;

2.if= “/” then

3.   Return 0; //contents must start with “/”

4.whiledo

5.   if !()then

6.     return 0; //not matched with hash table

7.    ; //insert new record

8.    if Exact match then

9.      ;

10.      ;

11   whiledo

12     if (node= then

13      ;

14      -;

15      continue;

16     ifthen

17       return 0; //first byte not matched

18     break;

19   if () then

20     ifthen

21       return node; //content found

22   else

23       return 0; //lookup failed due to partially match

24   ifthen

25    =0; continue;

26   else

27    return 0; //invoke Algorithm-2(partition)