# Multichannel Broadcast Based on Home Channel for Cognitive Radio Sensor Networks

Authors: Fanzi Zeng; Yuting Tang; Jianjie Pu
Journal: The Scientific World Journal
 (2014)

---

## Abstract

Considering the limited resources and the dynamic spectrum distribution in the cognitive radio sensor networks (CRSN), a half-duplex Multichannel broadcast protocol for CRSN is presented based on the home channel. This protocol maintains the networks topology only through the home channel, so there is no need for the public channel to transmit the control information and no need for the synchronization. After network initialization, node broadcasts data via home channel in half-duplex transmission way. The simulation results show that, compared with complete broadcast, the proposed protocol effectively reduces broadcast delay and overhead.


---

## Body

## 1. Introduction

Wireless sensor network (WSN) is composed of a large number of densely deployed sensor nodes and is widely used in environment monitoring and protection, medical care, and military field [1, 2]. The WSN operates in the crowded ISM frequency band and uses fixed spectrum allocation strategy. The interference from other wireless technologies (e.g., Wifi, Bluetooth, and ZigBee) operating in the same frequency band degrades the transmission reliability and causes the bulk of retransmissions that drains off the battery of the sensor node.Cognitive radio (CR) [3] can dynamically sense the spectrum hole and adaptively adjust the radio parameter, so it can increase dramatically the spectrum utilization efficiency and reduce the interference. It is natural to integrate CR into WSN that brings forward the new network model: cognitive radio sensor networks (CRSN) [4]. With the CR, CRSN can increase working bandwidth, reduce the waiting time, conflict, and energy consumption which are caused by channel competition, and then reduce the delay and overhead.Broadcast as a kind of basic network operation is used to maintain the routing and gather the data in WSN. The existing broadcast protocol in WSN and CR cannot directly apply to CRSN because the broadcast protocol in WSN does not consider the dynamic spectrum allocation, and those in CR do not consider the resource limitation. The next two paragraphs will give an overview of broadcast protocol in WSN and CR, respectively.For the broadcast protocol in WSN, Zhao [5] had proposed Maximum Life-time Broadcast Protocol which reduced the redundancy and energy consumption incurred by rebroadcasting through the method of node self-delay. Chakraborty et al. [6] presented a reliable completely spanning tree method for WSN broadcasting; Hsu et al. [7] proposed two kinds of WSN basic broadcast model. Those traditional WSN broadcasting methods were based on fixed spectrum allocation, without considering the channel change, routing change, and topology change caused by primary cognitive radio users (PU) access. Thus, the additional redundancy and delay will be produced and therefore cannot be directly applied to CRSN network.For the broadcast protocol in CR, Kondareddy and Agrawal [8] proposed a kind of CR selectivity broadcast algorithm to reduce the broadcast delay. This method assumed network topology and the available channel information was known, but this assumption was difficult to set up for CRSN. Song and Xie [9] proposed a multihop CR broadcast algorithm based on the QoS; it used the dividing retransmission method for radio, ensured the QoS, but consumed a lot of energy and was not suitable for node energy limited CRSN. Wu et al. [10] proposed MAC protocols based on the reservation request, but it could not handle the situation where a large number of CRSN nodes try to transmit data in a short time. So and Vaidya [11] proposed a MAC technology based on time division, but it required strict time synchronization for whole network; it was not practical for CRSN. Choi et al. [12] proposed a MAC protocol based on the home channel (HCh) in a kind of multihop CR network; this method set an available channel as one node’s home channel and assumed that each node had multiple signal transceivers; one of the transceivers was fixed in the home channel. When a node wanted to send data to another node, the transceiver without the fixed channel jumped to the destination node home channel to transmit data. However, because the sensor node had simple hardware and requires low energy consumption, a single node using multiple transceivers to carry out the full duplex communication was not practical [4] in CRSN. The above cognitive radio MAC protocols did not consider the limited resource of sensor nodes; if directly applied to CRSN, network lifetime would be shorten. In addition, global public channel is not available in CRSN to transmit control information [13], and local public channel is not easy to achieve. Moreover, the public control channel methods have no way to cope with denial of service attack (DoS, denial of service) [14]. Therefore, an effective CRSN broadcast protocol must be developed to solve the above contradictions.This paper proposes a half-duplex broadcast protocol for CRSN based on home channel, referred to as home channel broadcast. This protocol maintains the networks topology only through the home channel, so there is no need for the public channel to transmit the control information and no need for the synchronization. Moreover, the node has only one transceiver that simplifies the hardware design and reduces the energy consumption. When broadcasting, node selects its neighbor’s home channel one by one from the channel state table.The remainder of this paper is organized as follows. In Section2, a network model is presented. Section 3 discusses the network initialization and network topology generalization. Section 4 proposes half-duplex data transfer model based on the home channel and shows a broadcast example using the transfer model. Section 5 verifies the validity of this protocol through the simulation. In Section 6, we conclude the paper.


## 2. Network Model

Assuming thatNCRSN nodes (SU) and Mprimary users (PU) are randomly distributed in an L
×
L area. Each SU has the same hardware and software settings. In particular, each SU has only one transceiver and two states, one for sending signal (ST) and the other for receiving signal (SR, state receive), and the two states cannot occur at the same time. This means that each CRSN node can only do half-duplex communication.Assume that theK channels can be utilized and the whole network without time synchronization signal and the public channel does not exist.Each SU is equipped with omnidirectional antenna with the propagation radiusr
t, and the other CRSN nodes in the propagation range are the neighbor nodes. Each SU has a radius for r
s circular sense scope to sense the primary user access and noise interference. The probability of each channel occupied by PU is λ
p; the probability of noise or interference beyond threshold of each channel is λ
n. This paper assumes thatr
t
=
r
s.P
(
n
) denotes the probability thatnSUs are randomly distributed in the sensing range with area π
r
s
2 and is described as
(1)
P
(
n
)
=
C
N
n
(
π
r
s
2
L
2
)
n
(
L
2
-
π
r
s
2
L
2
)
N
-
n
.Then the expectation ofn is E
(
n
)
=
∑
n
=
1
N
n
P
(
n
)
=
N
×
π
r
s
2
/
L
2; if E
(
n
)
≥
1, then the expectation of SU’s neighbor number is
(2)
E
nb
=
E
(
n
)
-
1
=
N
×
π
r
s
2
L
2
-
1
.


## 3. Network Initialization

Initially, all nodes are in SR state and sense the usage of channel to maintain the channel state stable. If occupied by PU, the channel is marked asaccess-PU. If the channel is not occupied by PU, but the interference goes beyond the threshold, it is marked asnoisy. The rest of the channels are marked asavailable. The node randomly selects an available channel to mark as its home channel HCh. Table 1 shows nodei’s channel state table.Table 1
Nodei’s channel table.
Channel number
Channel state
Channel 1
Available
Channel 2
Available
Channel 3
Noisy
Channel 4
Access-PU
Channel 5
HCh
i
Channel 6
HCh
i
Channel 7
Available
⋮
⋮After sensing, node randomly selects an available channel as home channel and transfers its state from SR to ST and then broadcasts its channel state stable once. When finishing transmission, this node returns to SR state. The node within the propagation range of this node and happening to be in SR state receives the broadcast and updates its own channel state stable according to the received packets. Next, we take example to illustrate the update steps.Take nodei and nodej as an example.Nodei in state ST sends a packet on anavailable channel and, after completing, returns to SR state.If the nodej has received packet fromi, thenj compares its own channel state table withi’s channel state table and updatesj’s channel state table according to the following steps:(1)
nodej marks channel HChi as the nodei’s home channel; it also means that nodei is nodej’s neighbor node;
(2)
nodej marks nodei’snoisy channel as nodej’snoisy channel;
(3)
nodej marks nodei’saccess-PU channel as nodej’saccess-PUchannel;
(4)
if nodej finds that HChj channel is the same as nodei’snoisy channel, then nodej randomly chooses an available channel as a new HChj and marks the previous HChj asnoisy;
(5)
if nodej finds that HChj is the same as HChi, then nodej randomly chooses an available channel as a new HChj.After nodej completed updating channel state table, nodej turns SR state to ST state, transmits the new channel state table to nodei through HChiimmediately after finishing sending, and returns to SR state. Nodei repeats the above steps to update its channel state table after receiving the reply packet from nodej. This procedure is iterated until the two nodes state table is consistent.Through the network initialization, all the nodes know its neighbors, neighbors’ home channel, and channel state. So the network topology is constructed and the broadcast routing is built. If one node needs to send broadcast packet, it just checks its channel state table to get the neighbors’ home channel and transmits it.


## 4.  Broadcast Protocol Based on Home Channel

### 4.1. Half-Duplex Data Transfer Mode Based on Home Channel

Through the network initialization, each CRSN node chooses an available channel as its HCh and tunes its transceiver into SR state to receive data on HCh until node needs to send a packet. When node needs to send a packet, state is changed from SR to ST and data packets are transmitted on HCh to target node. After finishing transmission, the node returns to SR state.When source node broadcasts the packet and the target node happens to be in SR state, the broadcast packet can be forwarded successfully. Otherwise, the packet is dropped. To deal with this situation, this paper utilizes the timeout retransmission mechanism: when receiving packets, the target node returns an acknowledgement on the HCh to source node. If source node receives the acknowledgement within the given interval, the packet transmits successfully. Otherwise, the packet fails to broadcast and the source node retransmits the packet. In this paper, we allow the retransmission only once. This packet is sent two times in the failure situation.LetP
1 represent the probability that source node sends successfully data packets to its neighbor node with just one time transmission. Let P
2 denote the probability that source node sends data packets to its neighbor node with two times transmissions. Let P
0 denote the probability that the source node receives the replica of broadcast packet from neighbor node and no transmission is triggered for the source node. The expectation of the times that a node sends a packet to one neighbor node is as follows:
(3)
E
s
=
0
×
P
0
+
1
×
P
1
+
2
×
P
2
,
where P
0
+
P
1
+
P
2
=
1; thus 0
≤
E
s
≤
2 and when P
0
=
0,P
1
=
0, andP
2
=
1,E
s has maximum value 2.


### 4.2. Home Channel Broadcast

When one node has data packets to broadcast, it checks the channel state table, tunes its transceiver into the neighbor’s home channel, and sends the data packet and corresponds to neighbors in turn until the end of the channel state table. Neighbor node follows the update step in Section3 to update its channel state table according to the received channel state table and then sends broadcast packet to its updated neighbor nodes (except for its upstream node) according to the updated channel state table. When receiving multiple broadcast packet replicas, the node no longer forwards this packet. So, according to (2) and (3), if (
n
)
≥
1, then the expectation of times which a node needs to forward a broadcast packet in a broadcast task is E
node
=
E
nb
×
E
s; then the number of broadcast packets across the network can be calculated as follows:
(4)
E
all
=
E
node
×
N
=
N
(
π
r
s
2
L
×
L
×
N
-
1
)
(
0
×
P
0
+
1
×
P
1
+
2
×
P
2
)
≤
2
N
(
π
r
s
2
L
×
L
×
N
-
1
)
.Set(5)
E
max
⁡
=
2
N
(
π
r
s
2
L
×
L
×
N
-
1
)
.E
max
⁡represents the maximum value of times that a broadcast packet transmitted in the whole network; in another word, in the worst situation of home channel broadcast, the times of a broadcast packet transmitted will not exceed E
max
⁡.As shown in Figure1, black dot represents CRSN nodes; solid line represents broadcast path. Nodei as source node sends broadcast packet through neighbor nodea’s home channel (represented as Chnin Figure 1) Ch6, neighbor nodeb’s home channel Ch4, neighbor nodec’s home channel Ch1, and neighbor noded’s home channel Ch3 in sequence in the sensing range r
s. Then nodesa,b,c, andd receive broadcast packets and forward them through HCh of its own neighbor nodes, respectively. Nodes which constitute a connected graph with nodei will receive broadcast packets after a while.Figure 1
Nodes broadcast example.For example, the process of node g receiving broadcast packets from source nodei is as follows.i sends broadcast packets to d through thed’s home channel Ch3, d sends broadcast packets to e through thee’s home channel Ch7,e sends broadcast packets tof through thef’s home channel Ch6, and finallyf sends broadcast packets tog through theg’s home channel Ch3. Because the nodes are set randomly scattered in this paper, no connectivity path between two nodes may occur, as shown in Figure 1; thex,y, andz nodes will never receive broadcast packets from nodei. In addition, two nodes such ask andm are not within the scope of mutual sensing range, so the same channel can be selected as the HCh by them which does not cause the interference.


## 4.1. Half-Duplex Data Transfer Mode Based on Home Channel

Through the network initialization, each CRSN node chooses an available channel as its HCh and tunes its transceiver into SR state to receive data on HCh until node needs to send a packet. When node needs to send a packet, state is changed from SR to ST and data packets are transmitted on HCh to target node. After finishing transmission, the node returns to SR state.When source node broadcasts the packet and the target node happens to be in SR state, the broadcast packet can be forwarded successfully. Otherwise, the packet is dropped. To deal with this situation, this paper utilizes the timeout retransmission mechanism: when receiving packets, the target node returns an acknowledgement on the HCh to source node. If source node receives the acknowledgement within the given interval, the packet transmits successfully. Otherwise, the packet fails to broadcast and the source node retransmits the packet. In this paper, we allow the retransmission only once. This packet is sent two times in the failure situation.LetP
1 represent the probability that source node sends successfully data packets to its neighbor node with just one time transmission. Let P
2 denote the probability that source node sends data packets to its neighbor node with two times transmissions. Let P
0 denote the probability that the source node receives the replica of broadcast packet from neighbor node and no transmission is triggered for the source node. The expectation of the times that a node sends a packet to one neighbor node is as follows:
(3)
E
s
=
0
×
P
0
+
1
×
P
1
+
2
×
P
2
,
where P
0
+
P
1
+
P
2
=
1; thus 0
≤
E
s
≤
2 and when P
0
=
0,P
1
=
0, andP
2
=
1,E
s has maximum value 2.


## 4.2. Home Channel Broadcast

When one node has data packets to broadcast, it checks the channel state table, tunes its transceiver into the neighbor’s home channel, and sends the data packet and corresponds to neighbors in turn until the end of the channel state table. Neighbor node follows the update step in Section3 to update its channel state table according to the received channel state table and then sends broadcast packet to its updated neighbor nodes (except for its upstream node) according to the updated channel state table. When receiving multiple broadcast packet replicas, the node no longer forwards this packet. So, according to (2) and (3), if (
n
)
≥
1, then the expectation of times which a node needs to forward a broadcast packet in a broadcast task is E
node
=
E
nb
×
E
s; then the number of broadcast packets across the network can be calculated as follows:
(4)
E
all
=
E
node
×
N
=
N
(
π
r
s
2
L
×
L
×
N
-
1
)
(
0
×
P
0
+
1
×
P
1
+
2
×
P
2
)
≤
2
N
(
π
r
s
2
L
×
L
×
N
-
1
)
.Set(5)
E
max
⁡
=
2
N
(
π
r
s
2
L
×
L
×
N
-
1
)
.E
max
⁡represents the maximum value of times that a broadcast packet transmitted in the whole network; in another word, in the worst situation of home channel broadcast, the times of a broadcast packet transmitted will not exceed E
max
⁡.As shown in Figure1, black dot represents CRSN nodes; solid line represents broadcast path. Nodei as source node sends broadcast packet through neighbor nodea’s home channel (represented as Chnin Figure 1) Ch6, neighbor nodeb’s home channel Ch4, neighbor nodec’s home channel Ch1, and neighbor noded’s home channel Ch3 in sequence in the sensing range r
s. Then nodesa,b,c, andd receive broadcast packets and forward them through HCh of its own neighbor nodes, respectively. Nodes which constitute a connected graph with nodei will receive broadcast packets after a while.Figure 1
Nodes broadcast example.For example, the process of node g receiving broadcast packets from source nodei is as follows.i sends broadcast packets to d through thed’s home channel Ch3, d sends broadcast packets to e through thee’s home channel Ch7,e sends broadcast packets tof through thef’s home channel Ch6, and finallyf sends broadcast packets tog through theg’s home channel Ch3. Because the nodes are set randomly scattered in this paper, no connectivity path between two nodes may occur, as shown in Figure 1; thex,y, andz nodes will never receive broadcast packets from nodei. In addition, two nodes such ask andm are not within the scope of mutual sensing range, so the same channel can be selected as the HCh by them which does not cause the interference.


## 5. Simulation Results and Analysis

To evaluate the performance of the proposed protocol, some simulations results are presented in this section. Nowadays, no reference is about the broadcast protocol in CRSN, so this protocol is compared to the traditional complete broadcast protocol.Complete broadcast refers to the protocol where the source node is sending a broadcast packet on each available channel one by one; other nodes receive this broadcast packet and forward it on its all available channels one by one, and nodes are in half-duplex communication.Expectation of the number of available channels isE
a
=
K
(
1
-
λ
p
-
λ
n
); then the number of a broadcast packet sent across the network expects to be
(6)
E
c
=
N
×
E
a
=
N
×
K
(
1
-
λ
p
-
λ
n
)
.This paper uses MATLAB to do Monte Carlo simulation. Simulation region is set to1000
m
×
1000
m; node numberNchanges from 1 to 100; all nodes are randomly distributed in the region. Sensing radius of each node r
s and transmitting radius r
t are equal to 200
m, and, within the range, the probability λ
pthat channel is occupied by PU is equal to 0.025 and probability λ
nthat channel is noisy is equal to 0.02. Total channels K
=
20 can be utilized across the region; PU randomly selects one of the K channels and accesses this channel. All simulation results are an average of 10,000 simulations.From the parameters given above and (5) and (6), we have E
c
=
N
×
19
.
1, when N
≥
8, E
max
⁡
=
2
(
0.1257
N
2
-
N
). E
c and E
max
⁡ theoretical value is shown in Figure 2. It can be seen that E
max
⁡ will surpass E
c only when the node is extremely dense. But in practice, due to no forwarding broadcast packets to the node which has sent the packets to it before, P
0
>
0. In addition, node stays in ST state only when it needs to transmit packets. After finishing transmission, node is back to SR state, so the probability P
1
>
0, so it can be estimated that E
all is a lot smaller than E
max
⁡ in reality from (3) and (4).Figure 2
Number of a broadcast package forwarded in simulation region versus total number nodes.In this paper, overhead is defined as the quantity of broadcast packets all nodes send and forward in the simulation region;E
c and E
all represent theoretical overhead value of the complete broadcast and home channel broadcast, respectively. Simulation results in Figures 3 and 4 show broadcast overhead with the number of nodes and the number of channels, respectively. As can be seen, compared with the full broadcast, the home channel broadcasts dramatically reduce overhead, such as when there are 40 and 100 nodes and when overhead is only about one-thirteenth and one-seventh compared with complete broadcast. Thereby, the proposed protocol significantly reduces energy consumption, which is essential for energy limited sensor nodes.Figure 3
Average overhead in simulation region versus total number of nodes.Figure 4
Average overhead versus channels.For home channel broadcast, the packets transmission uses the known and fixed channel, so extra overhead will be less. While in complete broadcast, every packet must be sent and forwarded across all available channels one by one, which produces a lot of extra overhead.This paper tests average broadcast delay under the different number of total channels. As can be seen from Figure5, average delay of the home channel broadcast is far less than complete broadcast’s and has nothing to do with the total number of channels. This is because the home channel broadcast sending and forwarding through a fixed channel at a time is not affected by the total number of channels, and the fixed channel transmission mode avoids the delays caused by blind transmission and retransmission. For complete broadcast, every broadcast packet must be sent and forwarded across all available channels, so the more delay occurs.Figure 5
Average broadcast delay (ms) in simulation total region versus total number of channels.


## 6. Conclusions

This paper proposed multichannel broadcast protocol for CRSN based on home channel. After network initialized, nodes form a topology through the home channel. Node broadcasts data via home channel in half-duplex transmission way. Simulation experiments show that the home channel broadcasts reduce delay and overhead compared with the complete broadcast.



---

*Source: 725210-2014-04-09.xml*