Load Balancing Opportunistic Routing for Cognitive Radio Ad Hoc Networks

Table 1

Summary of notations.

Symbol	Definition
/	The interference range of PU/SU
/	The transmission range of PU/SU
CH=	Channel set, j=
	The mean time that PU spent in ON/OFF states
	The expectation of
	The expectation of
/	The probability of channel ch to be busy/idle
	The set of common channels between node and
	The Euclidean distance between node and
	The link between node and
	The packet reception ratio of
	The state of
C//	The maximum/used/available capacity of link l
	The available capacity of the link set LS
	The average size of the data flow
	The maximum bits of the data flow
F	The data flow set
	The data flowing through link l
/	The input/output link set of node n
	The relay distance between node and
	The one-hop neighboring set of node
	The forwarding candidate set of node
	The data transfer rate of node
	The priority order of node
	The sum of and
	The state of channels
	The effective forwarding rate
	The probability of the candidate node successfully receiving the packet
	The cognitive transport throughput of the opportunistic module
	The time required for one-hop relay
	The load score