A Secure Data Dissemination in a DHT-Based Routing Paradigm for Wireless Ad Hoc Network

Algorithm 2

Joining operation (LID computation) in 3D-SRP after authentication and verification.

Case 1

Required: information related to neighbor is stored in neighbor table (NT) of , and distance to is measured using RSS at joining node .

1:   then    \\ neighbor count =1 then check neighbor of neighbors

2:        \\ if a neighbor of a neighbor found calculate LID using Equation (22)

3:  else

4:        \\ calculate LID using the first available dimension using Equation (22)

5:  end if

6:      \\ LID computation done

Case 2

Required: information related to neighbors and is stored in neighbor table (NT) of , and distance to and is measured using RSS at joining node .

1:  ifthen      \\adjacent neighbors found

2:      

3:   if then             refers to any common neighbor other than

4:            \\ common neighbor found calculate LID using Equation (22)

5:   else

6:      if then      \\Collinear found

7:              \\ calculate LID using Equation (23)

8:        return

9:      else

10:              \\ calculate the LID using next available octant using Equation (22)

11:        return

12:      end if

13:   endif

14:  endif

Case 3

Required: information related to neighbors and is stored in neighbor table (NT) of , and distance to and is measured using RSS at joining node .

1:  ifthen     \\ adjacent neighbors not found

2:     

3:    ifthen     \\ common neighbor found among neighbors

4:               \\ calculate LID using Equation (24)

5:    else

6:      ifthen     \\Collinear found

7:               \\ calculate LID using Equation (23)

8:        return

9:      else     \\ calculate the LID using next available octant using Equation (22)

10:          switch to Case 1 (Compute using the available dimension of N_i or N_p)

12:

13:      end if

14:    end if

15:  end if

Case 4

Required: information related to neighbors , , and are stored in the neighbor table (NT) of , and distance to , , and is measured using RSS at joining node .

1:  

2:  ifthen

4:        \\ all adjacent neighbors calculate LID using Equation (23)

5:    return

6:  else if

7:    

8:    then

9:    

10:        \\if neighbor is adjacent to others calculate LID using Equation (23)

11:    return

12:  else

13:      \\if neighbor is not adjacent to others calculate LID using Equation (24)

14:  end if