Browse > Article
http://dx.doi.org/10.7840/kics.2013.38B.9.751

An Efficient Routing Algorithm Considering Packet Collisions in Cognitive Radio Ad-hoc Network  

Kim, Jin-Su (인하대학교 정보통신공학과 멀티미디어 통신망 연구실)
Choi, Jun-Ho (인하대학교 정보통신공학과 멀티미디어 통신망 연구실)
Shin, Myeong-Jin (인하대학교 정보통신공학과 멀티미디어 통신망 연구실)
Lee, Ji-Seon (인하대학교 정보통신공학과 멀티미디어 통신망 연구실)
Yoo, Sang-Jo (인하대학교 정보통신공학과 멀티미디어 통신망 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.38B, no.9, 2013 , pp. 751-764 More about this Journal
Abstract
In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.
Keywords
Cognitive Radio(CR); Ad-hoc Network; Packet Collision;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. So and N. Vaidya, "A routing protocol for utilizing multiple channels in multi-hop wireless networks with a single transceiver," Technical Report of Univ. Illinois Urbana-Champaign, Oct. 2004.
2 G. Cheng, W. Liu, Y. Li, and W. Cheng, "Spectrum aware on-demand routing in cognitive radio networks" in Proc. IEEE Consumer Commun. Networking Conf. (CCNC 2006), pp. 571-574, Las Vegas, U.S.A, Jan. 2006.
3 C. Perkins, E. Belding-Royer, and S. Das, Ad hoc On-Demand Distance Vector (AODV) routing, Request for Comments (RFC) 3561, July 2003.
4 S. Mahamuni, V. Mishra, and V. M. Wadhai, "Performance evaluation of AODV routing protocol in cognitive radio Ad-hoc network," Int. J. Wireless Mobile Networks (IJWMN), vol. 3, no. 5, pp. 65-74, Oct. 2011.   DOI
5 I. F. Akyildiz, W. Y. Lee, and K. R. Chowdhury, "CRAHNs: Cognitive Radio Ad HoC Networks," Ad Hoc Networks, vol 7, no. 5, pp. 810-836, July 2009.   DOI   ScienceOn
6 FCC, Spectrum policy task force report, ET Docket No. 02-155, Nov. 2002.
7 FCC, Notice of Rule Making and Order, ET Docket No. 03-322, Dec. 2003.
8 J. Mitola III, "Cognitive radio: an integrated agent architecture for software defined radio," Ph.D. dissertation, Royal Inst. Technol., Sweden, May 2000.
9 Q. Wang and H. Zheng, "Route and spectrum selection in dynamic spectrum networks," in Proc. IEEE Consumer Commun. Networking Conf. (CCNC 2006), pp. 625-629, Las Vegas, U.S.A, Jan. 2006.