Radio Resource Allocation for Cognitive Radio Based Ad hoc Wireless Networks

  • Hrishikesh Venkataraman
  • Atul Purohit
  • Ritika Pareek
  • Gabriel-Miro Muntean
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 116)


In a cognitive radio (CR)-based multihop ad hoc network, data transmission between source and destination takes place in multiple hops through intermediate relay nodes. However, scheduling and efficient bandwidth resource allocation in distributed network is a very challenging task that hinders the real-world deployment of CR-based systems. In this chapter, the selection of concurrent communication pairs utilizing the same resources is formulated as a non-linear mixed integer programming problem. It is found mathematically that optimum resource allocation in a CR-based ad hoc network is an NP-hard problem. In this chapter, two novel physical-layer heuristic algorithms: proximity to origin and smallest circle first are proposed for efficient resource allocation, targeted towards dense networks. It is observed that both these heuristics significantly outperform the state-of-the-art algorithm in the literature, in terms of both schedule length and computational complexity. Significantly, unlike the algorithm in the literature, both proximity to origin and smallest circle first are scalable with an increase in the number of nodes in the network.


Cognitive radio Heuristics Multihop  Physical layer Resource allocation Time slot  



The authors would like to thank Dr. Sinan Sinanovic and Prof. Harald Haas from the University of Edinburgh for their inputs during the initial stages of the research work. Notably, the authors would like to thank Irish Research Council for Science Engineering and Technology (IRCSET) and Enterprise Ireland for supporting this research.


  1. 1.
    Federal Communications Commission (2002) Spectrum policy task force. Technical report, Docket No. 02-135, Nov 2002Google Scholar
  2. 2.
    Mitola J, Maguire GQ Jr (1999) Cognitive radio: making software radios more personal. IEEE Pers Commun 6(4):13–18CrossRefGoogle Scholar
  3. 3.
    Mitola J (2000) Cognitive radio: an integrated agent architecture for software defined radio. PhD dissertation, Royal Institute of Technology (KTH), Sockholm, May 2000Google Scholar
  4. 4.
    Staple G, Werbach K (2004) The end of spectrum scarcity. IEEE Spectr 41(3):48–52CrossRefGoogle Scholar
  5. 5.
    Hassan K (2005) Cellular system with co-existing and spectrum sharing in single-hop and multihop cells. Master’s thesis, School of Engineering and Science, Jacobs University, Bremen, 2005Google Scholar
  6. 6.
    Vishwanathan H, Mukherjee S (2005) Performance of cellular networks with relays and centralized scheduling. IEEE Trans Wirel Commun 4:2318–2328CrossRefGoogle Scholar
  7. 7.
    Wu H, Qao C, De S, Tonguz O (2001) Integrated cellular and ad hoc relaying systems. IEEE J Sel Areas Commun 19(10):2105–2115Google Scholar
  8. 8.
    Ananthapadmanabha R, Manoj BS, Murthy C, (2001) Multihop cellular networks: the architecture and routing protocol. In: Proceedings of IEEE international symposium on personal indoor mobile radio communications (PIMRC’01), vol 2. San Diego, pp 78–82, 30 Sept–3 OctGoogle Scholar
  9. 9.
    Murthy CSR, Manoj BS (2004) Ad hoc wireless networks: architectures and protocols. Prentice Hall, Upper Saddle RiverGoogle Scholar
  10. 10.
    Venkataraman H, Sinanovic S, Haas H (2008) Cluster-based design for two-hop cellular networks. Int J Commun Netw Syst (IJCNS) 1(4):370–385Google Scholar
  11. 11.
    Venkataraman H, Nainwal S, Shrivastava P (2010) Optimum number of gateways in cluster-based two-hop cellular networks. AEU J Electron Commun (Elsevier Publications) 64(4):310–321CrossRefGoogle Scholar
  12. 12.
    Sobhrinho J, Krishnakumar A (1999) Quality-of-service in ad hoc carrier sense multiple access wireless networks. IEEE J Sel Areas Commun 17(8):1353–1368CrossRefGoogle Scholar
  13. 13.
    Chen WT, Liu JC, Huang TK, Chang YC (2008) TAMMAC: an adaptive multi-channel MAC protocol for MANETs. IEEE Trans Wirel Commun 7(11):4541–4545CrossRefGoogle Scholar
  14. 14.
    Muntean GM, Cranley N (2007) Resource efficient quality-oriented wireless broadcasting of adaptive multimedia content. IEEE Trans Broadcast 53(1):362–368CrossRefGoogle Scholar
  15. 15.
    Chlamtac I, Lerner A (1985) A link allocation protocol for mobile multi-hop radio networks. In: Proceedings of IEEE global communications conference (GLOBECOM), vol 1. Los Angeles, p 238–242, 2–5 Dec 1985Google Scholar
  16. 16.
    Nelson R, Kleinrock L (1985) Spatial TDMA: a collision free multihop channel access protocol. IEEE Trans Commun 33(9):934–944MathSciNetCrossRefGoogle Scholar
  17. 17.
    Funabiki N, Takefuji Y (1993) A parallel algorithm for broadcast scheduling problems in packet radio networks. IEEE Trans Commun 41(6):828–831CrossRefGoogle Scholar
  18. 18.
    Hajek B, Sasaki G (1988) Link scheduling in polynomial time. IEEE Trans Inf Theory 34(5):910–917MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Chlamtac I, Pinter S (1987) Distributed nodes organization algorithm for channel access in a multihop dynamic radio network. IEEE Trans Comput 36(6):728–737CrossRefGoogle Scholar
  20. 20.
    Groenkvist J (2006) Novel assignment strategies for spatial reuse TDMA in wireless ad hoc networks. Wirel Netw 12:255–265CrossRefGoogle Scholar
  21. 21.
    Sinanovic S, Krivoshiev N, Haas H (2007) System spectral efficiency analysis of a 2-link ad hoc network. In: Proceedings of IEEE global communications conference (GLOBECOM), Washington, DC, 26–30 Nov 2007Google Scholar
  22. 22.
    Zander J (1991) Jamming in slotted ALOHA multihop packet radio networks. IEEE Trans Commun 39(10):1525–1531. Google Scholar
  23. 23.
    Gupta P, Kumar P (2000) The capacity of wireless networks. IEEE Trans Inf Theory 46(2):388–404MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Thopian M, Venkatesan S, Prakash R, Chandrasekaran R (2005) Control channel based MAC-layer configuration, routing and situation awareness for cognitive radio networks. In: Proceedings of IEEE international military communications conference, pp 455–460, 17–20 Oct 2005Google Scholar
  25. 25.
    Marathe M, Panconesi A, Risinger L (2004) An experimental study of a distributed edge-coloring algorithm. J Exp Algorithmics 9:1–22, Article No. 1.3Google Scholar
  26. 26.
    Alon N (2003) A simple algorithm for edge-coloring bipartite multigraphs. Inf Process Lett 85:301–302CrossRefMATHGoogle Scholar
  27. 27.
    Perkins C (2001) Ad hoc networking. Pearson Education, LondonGoogle Scholar
  28. 28.
    Wang X, Yu Y, Giannakis GB (2008) Design and analysis of cross-layer tree algorithms for wireless random access. IEEE Trans Wirel Commun 7(3):909–919CrossRefGoogle Scholar
  29. 29.
    Yu W, Cao J, Zhou X, Wang X, Chan KCC, Leong HV (2008) A high throughput MAC protocol for wireless ad hoc networks. IEEE Trans Wirel Commun 7(1):135–145CrossRefGoogle Scholar
  30. 30.
    Chereddi C, Kyasanur P, Vaidya N (2007) A multi-channel multi-interface wireless mesh implementation. In: ACM SIGMOBILE mobile computing and communications, special journal issue, pp 84–95, July 2007Google Scholar
  31. 31.
    Kadayif I, Kandemir M, Vijaykrishnan N, Irwin MJ (2005) An integer linear programming-based tool for wireless sensor networks. J Parallel Distributed Comput 65(3):247–260CrossRefMATHGoogle Scholar
  32. 32.
    Thopian M, Venkatesan S, Prakash R, Chandrasekaran R (2006) MAC-layer scheduling in cognitive radio based multihop wireless networks. In: Proceedings of IEEE international symposium on world of wireless, mobile and multimedia networks (WoWMoM), New York, 26–29 June 2006Google Scholar
  33. 33.
    Venkataraman H, Haas H, Yun S, Lee Y, McLaughlin S (2005) Performance analysis of hybrid wireless networks. In: Proceedings of IEEE international symposium on personal indoor and mobile radio communications (PIMRC), vol 3. Berlin, pp 1742–1746, 11–14 Sept 2005Google Scholar
  34. 34.
    Venkataraman H, Sinanovic S, Haas H (2007) Variation of spatial protection margin in multihop wireless networks. In: Proceedings of IEEE international symposium on personal indoor mobile radio communications (PIMRC), Athens, 3–6 Sept 2007Google Scholar
  35. 35.
    Wang H, Huang W, Zhang Q, Xu D (2002) An improved algorithm for the packing of unequal circles within a larger containing circle. Eur J Oper Res 141:440–453MathSciNetCrossRefMATHGoogle Scholar
  36. 36.
    Lenstra JK, Kan AHG (1980) Complexity of packing, covering and partitioning problems. J Optim Theory Appl 32(2):275–291Google Scholar
  37. 37.
    Venkataraman H, Muntean G-M (2008) Analysis of random data hopping in distributed multihop wireless networks. In: Proceedings of IEEE TENCON (Region TEN) conference, Hyderabad, 18–21 Nov 2008Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2012

Authors and Affiliations

  • Hrishikesh Venkataraman
    • 1
  • Atul Purohit
    • 2
    • 3
  • Ritika Pareek
    • 3
  • Gabriel-Miro Muntean
    • 1
  1. 1.Performance Engineering LaboratoryDublin City UniversityDublinIreland
  2. 2.Department of Computer ScienceStony Brook UniversityNew YorkUSA
  3. 3.Dhirubhai Ambani Institute of Information and Communication Technology (DAIICT)GandhinagarIndia

Personalised recommendations