Spectrum and Energy Efficient Relay Station Placement in Cognitive Radio Networks

Cognitive radio technology enables secondary users (SUs) to opportunistically use the vacant licensed spectrum and significantly improves the utilization of spectrum resource. Traditional architectures for cognitive radio networks (CRNs), such as cognitive cellular networks and cognitive ad hoc networks, impose energy-consuming cognitive radios to SUs' devices for communication and cannot efficiently utilize the spectrum harvested from the primary users (PUs). To enhance the spectrum and energy efficiencies of CRNs, we have designed a new architecture, which is called the Cognitive Capacity Harvesting network (CCH). In CCH, a collection of relay stations (RSs) with cognitive capability are deployed to facilitate the accessing of SUs. In this way, the architecture not only removes the requirement of cognitive radios from SUs and reduces their energy consumption, but also increases frequency reuse and enhances spectrum efficiency. In view of the importance of the RSs on the improvement of spectrum and energy efficiencies, in this paper, we study the RS placement strategy in CCH. A cost minimization problem is mathematically formulated under the spectrum and energy efficiency constraints. Considering the NP-hardness of the problem, we design a framework of heuristic algorithms to compute the near-optimal solutions. Extensive simulations show that the proposed algorithms outperform the random placement strategy and the number of required RSs obtained by our algorithms is always within 2 times of that in the optimal solution.

[1]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[2]  Alex Zelikovsky,et al.  Tighter Bounds for Graph Steiner Tree Approximation , 2005, SIAM J. Discret. Math..

[3]  Ying-Chang Liang,et al.  Cognitive radio network architecture: part I -- general structure , 2008, ICUIMC '08.

[4]  Miao Pan,et al.  Spectrum clouds: A session based spectrum trading system for multi-hop cognitive radio networks , 2012, 2012 Proceedings IEEE INFOCOM.

[5]  Ian F. Akyildiz,et al.  NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey , 2006, Comput. Networks.

[6]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[7]  Guoliang Xue,et al.  Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Ian F. Akyildiz,et al.  CRAHNs: Cognitive radio ad hoc networks , 2009, Ad Hoc Networks.

[10]  Xue Jun Li,et al.  Multihop cellular networks: Technology and economics , 2008, Comput. Networks.

[11]  Erik D. Demaine,et al.  Deploying sensor networks with guaranteed capacity and fault tolerance , 2005, MobiHoc '05.

[12]  Pin-Han Ho,et al.  Relay Station Placement in IEEE 802.16j Dual-Relay MMR Networks , 2008, 2008 IEEE International Conference on Communications.

[13]  A. Goldsmith,et al.  Cognitive Cellular Systems within the TV Spectrum , 2010, 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN).

[14]  Satyajayant Misra,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[15]  Samir Khuller,et al.  Relay Placement for Higher Order Connectivity in Wireless Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  Errol L. Lloyd,et al.  Relay Node Placement in Wireless Sensor Networks , 2007, IEEE Transactions on Computers.

[17]  Xiang Cao,et al.  Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[18]  Mingyan Liu,et al.  Mining Spectrum Usage Data: A Large-Scale Spectrum Measurement Study , 2009, IEEE Transactions on Mobile Computing.

[19]  Dan McCloskey,et al.  Chicago spectrum occupancy measurements & analysis and a long-term studies proposal , 2006, TAPAS '06.

[20]  Xi Fang,et al.  Relay Station Placement for Cooperative Communications in WiMAX Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[21]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[22]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[23]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[24]  Satyajayant Misra,et al.  Constrained Relay Node Placement in Wireless Sensor Networks: Formulation and Approximations , 2010, IEEE/ACM Transactions on Networking.

[25]  F. Hwang,et al.  The Steiner Tree Problem , 2012 .

[26]  Raghupathy Sivakumar,et al.  Performance comparison of cellular and multi-hop wireless networks: a quantitative study , 2001, SIGMETRICS '01.

[27]  Xi Fang,et al.  Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[28]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[29]  Miao Pan,et al.  Spectrum Harvesting and Sharing in Multi-Hop CRNs Under Uncertain Spectrum Supply , 2012, IEEE Journal on Selected Areas in Communications.

[30]  Hai Liu,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks , 2005, COCOON.

[31]  Nabil H. Mustafa,et al.  PTAS for geometric hitting set problems via local search , 2009, SCG '09.

[32]  Chonggang Wang,et al.  DARP: Distance-aware relay placement in WiMAX mesh networks , 2011, 2011 Proceedings IEEE INFOCOM.