Interaction-Aware Video Community-Based Content Delivery in Wireless Mobile Networks

Algorithm 1

Process of community discovery.

(1) ; = 0; = 0;

(2) /   is node set in ; returns number of nodes in ; returns node’s degree (in-degree and out-degree). /

(3) while( is not NULL &&  )

(4)  if is maximum value of degree of nodes in

(5)    and ’s neighbor nodes form a sub-graph ;

(6)   ;

(7)  end if

(8)  ++;

(9) end while

(10) /   is set of ’s neighbor nodes in other sub-graphs; returns number of items in . /

(11) while(all nodes join into sub-graphs and all nodes stop to search new nodes)

(12)  if ( is not center node)

(13)   for ( = 0; ; ++)

(14)    if ( is not marked by   &&   meets requirement of becoming new member);

(15)      joins sub-graph of ;

(16)    else is marked as unavailable node by ;

(17)    end if

(18)   end for

(19)  end if

(20)  ++;

(21)  if ()

(22)    = 0;

(23)  end if

(24) end while