A Security and Efficient Routing Scheme with Misbehavior Detection in Delay-Tolerant Networks

Algorithm 1

Building and updating TRT.

Input: node maintains the vector table

; The initial

value of trusted routing table contains

only row vectors ;

(1)if  node updated the vector table   then

(2)generate the new row vector

;

(3)update row vector in trusted routing table;

(4);

(5)end

(6)if  node and node meet each other  then

(7)send trusted routing table to node ;

(8)receive trusted routing table from node ;

(9)end

(10)while    do

(11)if    then

(12)verify the validity of the signature ;

(13)if    is valid  then

(14)update row vector in trusted routing

table ;

(15);

(16);

(17);

(18)end

(19)end

(20)end

(21)while   and   do

(22)verify the validity of the signature ;

(23)if   is valid  then

(24)insert into trusted routing

table ;

(25)end

(26)end