• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.35-43
• /
• 2011

Cognitive Radio (CR) ad hoc network is highly considered as one of promising future ad hoc networks, which enables opportunistic access to under-utilized licensed spectrum. Similarly to other CR networks, the spectrum sensing is a prerequisite in CR ad hoc network. Collaborative spectrum sensing can help increasing sensing performance. For such an infrastructureless network, however the coordination for the sensing collaboration is really complicated due to the lack of a central controller. In this paper, we propose a novel collaborative spectrum sensing scheme in which the final decision is made by the node with the highest data reliability based on a sequential Dempster Shafer theory. The collaboration of sensing data is also executed by the proposed contention-aware reporting mechanism which utilizes the sensing data reliability order for broadcasting spectrum sensing result. The proposed method reduces the collecting time and the overhead of the control channel due to the efficiency of the ordered sequential combination while keeping the same sensing performance in comparison with the conventional cooperative centralized spectrum sensing scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.37-44
• /
• 2016

It is important that using of efficient radio resource because of deficiency spectrum problem, so that related to this problem many researches are have proceeded. To solve this problem, Cognitive Radio(CR) was suggested. The channels are allocated to the secondary users when the primary users don't use the channels, and unfairness of secondary users can be serious problem and channel quality of multichannel can be different due to the different traffic pattern of primary users. In this paper, we propose MAC prtocol both of the user's fairness and channel quality in CR networks. Simulation results show the comparison with CR MAC protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.296-305
• /
• 2010

Secondary users should sense the licensed spectrum bands in order to protect the primary users from interference. However, periodic and frequent sensing for immediate detection of primary users usually gives rise to much sensing overhead, and thus will quickly drain the battery as well as deteriorate the performance of a secondary user. To overcome such problems, we focus on the method reducing sensing overhead of each secondary user and propose a distributed fair sensing scheme that the multiple users within a certain area, so-called sensing zone, sense the spectrum bands in a fairly distributed manner and share the results among the users within respective sensing zone. The design of the frame structure for the proposal is also demonstrated while considering the sensing requirements for protecting primary users. The performance results by numerical analyses and computer simulations show that our proposed sensing scheme significantly reduces the sensing overhead of each user compared to the conventional sensing scheme and also satisfies the given sensing requirements for primary user protection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.369-379
• /
• 2011

During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.280-288
• /
• 2019

In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.