Multiple Prime Expansion Channel Hopping for Blind Rendezvous in a Wireless Sensor Network

Table 1

Multiple prime expansion algorithm.

Multiple prime expansion algorithm
1	Input: M, A, B
	M: the total number of channels
	A and B: two wireless devices waiting to rendezvous
	or ; p: probability of A or B contains common channels
	m: the length of the “fill part”
	2	LA(LB) = the smallest prime number not smaller than A(B)
3	if A and B are prime number
4	LA = A, LB = B
5	else
6	if A is prime number, B is composite number
7	LA = A, LB = [ B, FB]
8	else
9	if A is composite number, B is prime number
10	LA = [ A, FA], LB = B;
11	else
12	LA = [ A, FA], LB = [ B, FB];
13	end