Cognitive Radio Ad-Hoc Networks : Some New Results on Multi-Channel Hidden Terminal Problem

Recently the Cognitive Radio (CR), in particular the CR Ad-Hoc Network (CRAHN) technology appears as a burgeoning area in wireless communication that enables utilization of limited network resources in more efficient and intelligent way; studies indicate that opportunistic utilization of the available radio frequency spectrum, without interfering the licensed primary user (PU) could be made. This paper presents some simulation based performance of the MultiChannel Hidden Terminal (MCHT) problem on CRAHNs; new observations on the effect of the number of channels on certain PU-activity metrics, e.g., delay and throughput, are described.


Introduction
Recent research studies indicate that wireless data traffic would grow @ 90% while having to handle hundreds of petabytes in this decade [1]; with such an enormous mobile data usage, spectrum crunch is inevitable.Currently the CR technology is considered to be the practicable solution to address the situation.Most of the bands allocated to licensed PUs remain unutilized at a given geographic location at certain time slots [2,3].The evolution of self organizing infrastructure less mobile ad-hoc networks [4] may be combined with the CR technology with a view to configuring new CRAHN for intelligent and opportunistic use of unutilized bands for the Secondary User (SU) without interrupting the PU activity.
The CR technology is now going through a phase of active research and development activity with several challenges towards spectrum sensing/allocation and on the MCHT problem [5][6][7][8][9][10].Various MAC protocols were proposed for a solution to the hidden terminal problem in ad-hoc networks.The dynamic nature and the multiple number of channels make the medium access more challenging.The performance of certain metrics e.g., throughput, packet delivery ratio etc. is expected to be better with respect to that of single channel owing to reduction in interference [10]; but here presence of unidentified hidden terminals tries to limit the performance of CRAHNs [11,12].
We observe from the literature [7,8] that exploiting multiple channels, one obtains higher throughput than using one channel since multiple transmission may be obtainable without interference.In [8], the transmission characteristics had been studied for various protocols taking the average throughput and packet delay as the two metrics.This study indicates that the single-channel Distributed Function Protocol (802.11DCF) does not work well in a multi channel environment since it is designed for sharing single channel between hosts.Thus when a host is listening to a particular channel, it is unable to communicate on another channel.This gives rise to the MCHT problem.Under these practical considerations we investigated the MCHT problem with the simulation scenario taking into account another set of metrics.
In this paper, we describe the MCHT in context of CRAHNs and present a simulation based study to provide an insight as to how the different network parameters (number of channels, number of PUs, etc.) affects the network performance under MCHT scenario.The CRAHNs is a more practicable solution than their centralized counterparts, due to the rapid deployability, decentralized and self-organizing nature of such networks.However, it offers more research challenges due to the absence of any central control agent.The paper is organized as follows: in Section 2, aspects of the MCHT problem and how it affects the performance of CRAHNs are described; Section 3 lists a literature survey and Section 4 presents a comprehensive NS-2 based simulation study on the characteristic features of MCHT on CRAHNs.In Section 5 we interpret the findings with some concluding remarks.

MCHT Problem for CRAHNs
Some basic outlines of the MCHT problem for CRAHNs are discussed by using the schematic diagrams in Figures 1 and 2, assuming a multi-channel CR-MAC protocol that does not address this problem.The hidden terminal problem occurs when two terminals say A and C, in Figure 1, are within the range of the station B but out of the range of each other, or separated by some physical obstacles transparent to radio signals.These two terminals are said to be hidden from each other resulting in interference [7] at B. It is improved by the four-way handshaking methodology [13] in which a control signal in form of a short message is sent first and then the data packets are transmitted only when the receiver permits.Therefore the collision only happens during the transmission of the request signal but not in that of the traffic signal.In this way, the hidden terminal problem is alleviated, as in IEEE 802.11MAC.
However, hidden terminal problem and MCHT issue [8] are more complex to CRNs.Hereafter, we postulate a new type of hidden terminal problem pertaining to CRNs and name it as the cognitive radio multi-channel hidden terminal problem (CR-MCHT).The CR-MAC assumed is similar to [14] but it has only one transceiver.Assume N channels are available; one channel is dedicated for exchanging control messages (control channel), and all the others are for data exchange.When a node is neither transmitting nor receiving, it listens to the control chan-nel.The assumed CR-MAC supports the PU activity.If any CR user (SU) is transmitting on a channel and PU wants access to it, the CR-MAC commands the SU to immediately vacate the channel and continue its transmission on an another vacant channel, if available or wait for the PU to complete its transmission/reception.We observe that the CR-MCHT problem can cause two types of interference: interference caused at PU by a hidden CR and interference caused at a CR by another hidden CR.

Interference at PU
When node A wants to transmit a packet to node B, A and B reserve the channel by exchanging "Request to Send" (RTS) and "Clear to Send" (CTS) messages.When sending an RTS, node A includes a list of channels it is trying to use.On receiving the RTS, B selects a channel and includes the selected channel in the CTS.Subse- quently, node A and B switch their channels to the agreed data channel and exchange the DATA and ACK packets.When this four-way handshake completes, nodes A and B immediately switch to the control channel.In the given scenario when A has a packet for B, A sends a RTS on Channel 1, which is the control channel.B selects Channel 2 for data communication and sends a CTS back to A. The RTS and CTS messages reserve Channel 2 in the transmission ranges of A and B; no collision occurs.During this period the Primary user 1 (PU1) is either not present or not transmitting; at a subsequent time slot , even though the transmission of A and B are not complete, PU1 demands access to Channel 2; note that C and D also are using Channel 3. Thus as no channel is empty, A and B has to withhold their data transmission for some time.
The PU1 starts transmitting data to PU3 on Channel 2; but, during this time C and D were busy exchanging data on Channel 3. Unaware of the fact that PU3 is receiving on Channel 2, node C initiates a communication with Node D, and ends up selecting Channel 2 for communication.This results in interference or collision at PU3.The above problem occurs due to the fact that nodes may listen to different channels, which makes it difficult to use virtual carrier sensing to avoid the hidden terminal problem.If each node listens to only one channel, node C would have heard the CTS and thus deferred its transmission.Thus the normal four-way hand shaking (RTS-CTS-DATA-ACK) cannot address the CR-MCHT problem, where the presence of PUs and multiple SUs makes the problem somewhat complex.

Literature
To enhance the performance of ad-hoc networks the concept of cognitive radio can be infused into it so as to make an Opportunistic Spectrum Access [12].The major challenges faced are the MCHT problem and multi-channel unreachability problems leading to unreliable local broadcast in mobile ad-hoc networks.RTS/CTS handshake technique was suggested for preventing hidden terminal problem and is dependent on the transmission range (Rtx), carrier sensing range (Rcs) and interference range (Ri).In [15], it is studied that the effectiveness of RTS/CTS process reduces when the value of d exceeds 0.56*Rtx, where d is the distance between the transmitter and receiver and Rtx being the transmission range [13].Some cognitive ad-hoc protocols designed to solve these problems [15][16][17][18] suggest consideration for dynamic channel selection without any centralized coordination [19].The analysis of hidden terminal problem has been done in [20][21][22].In [20], it has been found that the hidden node problem will increase the multiple retries by nodes, making wrong declaration of link failures leading to re-routing instability.Due to the hidden nodes vulnerable period occurs leading to collision of packets.This probability of collision during transmission may be due to ACK-ACK collision or DATA-DATA collision.It is seen that the maximum sustain-able throughput is limited by the vulnerable periods which depend on the numbers of hidden nodes and the fraction of airtime in the time horizon when hidden-node collisions may occur [20].Other work related to SNR detection, probabilistic switch policy and application of ANN [23][24][25] have also been recently reported.A comprehensive and current survey on the topic may also be consulted in [5,6,26,27].

Proposed Study
In this section, we describe the simulation scenario using two metrics to ascertain the performance of the CRN under CR-MCHT problem: a) Network Throughput: Use of multiple channels is expected to increase the network throughput.Ideally the improvement factor must be a factor of N for N-channel system.But in practice, this is not possible due to the overhead involved in channel negotiation and frequent disruption caused in communication by the PUs.b) End-to-End Packet Delay in the network: End-to-end packet delay, or simply delay, is the duration between the time when the Link layer of the sender receives a packet to send, and the time the packet reaches the destination.So the delay is the sum of delays for queuing, backoff, channel negotiation and transmission delay.

Description of Scenario
The proposed investigation scenario is shown in Figure 3.The distance from node 1 to node 2 and node 3 to node 4 is fixed at 250 m.Transmission range of the wireless radio is 367 m.The channel bandwidth is variable depending on the channel used.We use three channels bandwidths: 2 Mbps, 5.5 Mbps and 11 Mbps, following the 802.11standard.We vary the vertical distance be-tween nodes 2 and 3 to check the influence of large interference range.Two CBR sessions based on UDP are involved with directions from node 1 to node 2 and node 4 to node 3 correspondingly.Since the CBR is constant rate traffic without re-transmissions, it is possible that the two flows may synchronize to each other rendering the results not general enough.To avoid the synchronization of the two flows, we slightly modified the CBR traffic generator.Given the rate as n packets per second (pps), we divided time into slots as 1/n seconds.In each time slot, a packet is sent to the network.Sending time of the packet is uniformly distributed in the whole slot.We varied three parameters of the scenario: distance, packet rate (pps) and number of PUs.Table 1 shows the common parameters for the three scenarios.
sim This model ena PU and CR arried out in our lab and the ra It may be added here that the IEEE 802.11 standard for wireless LAN [28,29] provides multiple channels for practical simulation work; IEEE 802.11 b physical layer (PHY) has 14 channels with 5 MHz frequency separation, wherein for the bands to be non-overlapping, the separation space is specified at 30 MHz.Channels 1, 6 and 11 are typically used for such communication.
These numerical standards had been followed as per compatibility with [7,8,28].The results obtained in the proposed work, albeit viewing the problem with a different set of metrics, are found to be comparable as those in [8].
The scenario discussed here for the proposed work had been created intuitively after a thorough study of literatures cited in [7,8,13,29] where metrics were selected by these authors of their own choice.We noted that there are relatively fewer references related to the MCHT problem and we selected our studies towards transmission characteristics under the MCHT problem selecting our own metrics (e.g., delay, throughput).Under either approach, interestingly, results were found to be fairly concomitant.The work in [29] had been carefully studied and adopted as the theoretical basis of the present work.

Simulation Model
The cognitive radio model in [11] had been used for the  Simulation time 100 seconds ulation purpose.bles the user activity to be simulated and the radio interfaces are equipped with cognitive radio capabilities.This model uses two policies for switching the channel of CR user when PU activity is detected on the current channel: Probabilistic switch and Always switch.Section 2 describes the CR-MCHT problem using the always switch policy, which causes CR to vacate the channel immediately when PU activity is detected.According to the probabilistic switch policy, the CR vacates the channel when the switching probability increases above a "Switch-threshold".This value depends on the interference level allowed at the PU [23,24] and hence is a system dependent parameter.For the proposed simulation work, we selected the always-switch policy.

Simulation Result
The simulation had been c results are presented in this section.The IEEE 802.11MAC with the cognitive radio model described in Section 4.2 with support for three to eleven channels is being used.The results corresponding to variations in distance (d), packet rate and number of PUs are presented below in Figures 4-9. Varying distance "d": Figures 4 and 5 show the simulation results where it has been assumed that a maximum of ten primary users can be present at any instance in course of the simulation time.
When the distance d is low and within the interference nge of the nodes, the hidden terminal problem is critical and so the network throughput is low while the packet delay is high.As the distance increases, both the metrics show improvement, i.e., network throughput increases and the packet delay falls.When the number of channels is low (three), Figure 4 shows abrupt increase in throughput and abrupt decrease in delays in Figure 5.  ith increasing number of Channels to 7 and 11 the netthat an optimum nu W work shows a nominal improvement.This is because, when the number of channels is less, the CR user has to vacate the channel for PUs and wait for PUs to finish their transmission resulting to throughput improvement.It is noted that when more number of channels are present, the CR users can switch their transmission to an alternative empty channel, which in turn decreases the delay.We observed that too many channels (eleven in our simulation) do not improve the performance.However we obtained some improved result if the number of channel is seven.Albeit the metrics do not show significant improvement for eleven channels, the metric values remain at satisfactory tolerable limits.
Thus, simulation results indicate mber of channels would give the best solution in terms of throughput and delay of the network.The number is found to be seven in the present study for the given sce-nario.In view of obtaining the optimum number of channels for more satisfactory performance, we are now working on a detailed simulation study involving more number of metrics. Varying the packet rate: Here distance (d) had been packets per second, the re arying the number (n) of PUs: We varied the numork perform quency and finite ch With the increase of number of sults indicate that for any number of channels, the throughput increases, but when the packet rate is high (≥500 packet/sec.) in Figure 6, there is no improvement in throughput.This is because for high packet rate the packet drop also becomes high.Moreover, the finite channel switching delay becomes very prominent leading to high packet loss.Thus, in such a situation even large number of channels does not seem to improve the performance.The network delay increases almost linearly with the increase in packet rate as in Figure 7; our observation for the reason is owing to increase in network congestion, control channel bottleneck, finite buffer size, etc.  V ber of PUs keeping the distance (d) fixed at 300 m and packet rate being set at 100 packets/sec.The observations are shown in Figures 8 and 9.

Conclusion
When three channels are used the netw ance shows a marked difference from that when large number of channels are allowed.We observed that if the number of channels is three and number of PUs increases, the throughput increases slightly; the reason being better utilization of channels; but as the number of PUs increases, the throughput falls rapidly.The increasing frequency of channel switching leads to high packet loss, which in turn causes a low throughput.
Similarly high channel switching fre annel switching time, combined with the contention for the common control channel causes a rapid rise in delay with increasing number of PUs.The results however show a different trend for large number of channels.With increase in the number of the PUs, the throughput and delay remains almost same for large number of channels.Availability of channels allows an alternate medium (channel) for transmission.Also, the performance do not show significant improvement when the number of channels is very high (n = 11 in this case).
In this paper, we p on MCHT problem on the performance of CRAHNs.It has been suggested that the MCHT problem may be mitigated by some collaborative context using data from distributed spectrum sensors [20]; here we consider a similar context involving the PUs in terms of switching policies.It is found that the full potential of CRAHNs is yet to be realized in presence of the MCHT problem.We varied three parameters of the proposed simulation scenario: distance, packet rate (pps) and number (n) of PUs.Albeit, we observed some improvements on the CRAHN characteristics within some range of the metric variation, more investigations would be needed through certain extension of the proposed simulation scenario.Our investigations also indicate that satisfactory metric utilization it may be possible to derive an optimum number of channels.The work presented here is being carried out further in this direction in view of developing a protocol to address the problem.

Figure 1 .Figure 2 .
Figure 1.Nodes A and C are hidden with respect to each other.

Figure 2
again one observes that collision at PU3 causes C to defer its transmission by an abrupt period of time, decided by the back-off timer.After normal RTS-CTS exchange (not shown in Figure2), C and D starts communicating on Channel 3. By this time PU1 and PU3 have completed their data-exchange and nodes A and B have resumed their transmission.Node C once again initiates a communication with D and selects Channel 2, not knowing the on-going transmission between A and B on Channel 2. Thus a collision occurs at B.
m and number of PUs is fixed at 10; Figures 6 and 7 show the results.