Contents & References of Investigating routing algorithms in cognitive radio networks and providing a method to improve network performance
List:
Chapter One: Introduction
1-1- Generalities. 2
1-2- Technology of radiological systems. 4
1-2-1-the ability to be intelligent. 5
1-2-2-ability to reshape. 5
1-3- Physical architecture of radiological networks. 6
1-4 - radiological networks. 7
1-4-1- network components. 7
1-4-2- spectrum heterogeneity. 10
1-4-3- spectrum management framework. 11
1-4-4- spectrum sharing. 12
1-5-The difference of CRN with the common multi-radio and multi-channel networks of the past. 13
1-6- Classification of routing algorithms. 14
1-6-1- Classification of routing methods in contingent radio cognitive networks. 16
Chapter Two: An overview of past activities in response to routing challenges
2-1- The solutions provided in response to the challenges of radiological networks. 18
2-1-1- Methods based on interference and transmitted power. 20
2-1-2- Methods based on delay 21
2-1-3- Methods based on path stability 22
2-1-4- Methods based on maximizing output 23
2-2- Common quantitative criteria of routing in contingency networks. 26
2-2-1- Classification of quantitative routing criteria. 27
2-2-2- selected first group, HOP. 28
2-2-3- Round trip time to hop (RTT) 30
2-2-4- Expected transmission frequency (ETX) 31
2-2-5- Expected transmission time (ETT) 33
2-2-6- Expected exclusive transmission time (EETT) 34
2-2-7- Implementation of four criteria Choice in AODV algorithm. 36
2-2-8- Important points in the design of optimal quantitative criteria. 39
2-3-channel selection strategies in CRN. 40
2-3-1- Classification of channel selection strategies. 41
Chapter three: Deriving an efficient routing algorithm using dual diversity techniques in the NS2-CRAHN simulator. 44
3-1- An introduction to the challenges facing CRAHN. 44
3-2- Assumptions and system model. 46
3-2-1- PUs activity pattern 48
3-2-2- SUs performance basis 49
3-3- CRAHN modeling using NS2 simulator. 51
3-3-1- File related to PU activity 53
3-3-2- File related to channel events. 53
3-3-3-management of spectrum resources. 54
3-3-4- Activities of SUs 57
3-4- Presenting an efficient CRAHN routing algorithm based on the technique of multi-path and multi-channel transmissions 58
3-4-1- AODV protocol. 59 3-5- Presentation of an efficient routing algorithm using the method of double transmissions in contingent radiological networks 67 3-5-1-Algorithm of the RREQ stage. 68
3-5-2-RREP step algorithm. 70
3-5-3- Path maintenance process 71
Chapter four: Virtualization
4-1- Comparison of the efficiency of AODV, D2CARP and the proposed algorithm. 74
4-2- The effect of the performance pattern of PUs on network efficiency. 78
4-2-1- Performance analysis 85
4-3- Spectrum heterogeneity analysis. 89
4-4- Performance comparison of the two proposed methods and D2CARP in terms of spectrum detection time. 91
4-5- Performance comparison of the two proposed methods and D2CARP in terms of node movement speed 93
4-6- Performance comparison of the two proposed methods and D2CARP in terms of RREQ packet rates. 94
Chapter Five: Conclusion and Suggestions
5-1- Conclusion. 97
5-2- Suggestions. 100
List of sources and sources: 101
Source:
[1] J. Mitola III, "Cognitive radio: an integrated agent architecture for software defined radio," Ph.D. thesis, KTH Royal Institute of Technology, Stockholm, Sweden, 2000.
[2] B. Wang, K. J. Ray Liu, "Advances in Cognitive Radio Networks: A Survey", IEEE Journal of selected topics in signal processing, VOL. 1, February 2011. [3] I. F. Lee, M. C. Vuran, and S. Mohantly, "Next generation/dynamic spectrum access/cognitive radio network: a survey,” Elsevier Computer Networks, Vol. 50. 2127-2159, Sept.2006.
[4] Z. Han, “Game theory for Cognitive Radio Networks”, IEEE GLOBECOM'09, Honolulu, Hawaii, USA 4th December, 2009.
[5] Perkins, C., Ad-hoc on-demand distance vector routing. In Proceedings of the Second IEEEIn Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, Washington, DC, USA, 1999, pp. 90, Washington, DC, USA: IEEE Computer Society.
[6] Johnson, D.B. Maltz, D.A. Broch, J. DSR: The Dynamic Source Routing for Multihop Ad Hoc networks. In Ad hoc Networking, Boston, MA, USA, 2001, pp. 139-172, Addison-Wesley Longman Publishing Co., Inc: Boston, MA, USA.
[7] Q. Wang, H. Zheng, Route and spectrum selection in dynamic spectrum networks, in: Proceeding. of IEEE CCNC 2006, Las Vegas, USA, 2006, pp. 625–629. [8] M. Cesana, C. Francesca, and E. Eylem. "Routing in cognitive radio networks: Challenges and solutions." Ad Hoc Networks 9.3 (2011): 228-248.
[9] Y. Shi, Y. Hou, “A distributed optimization algorithm for multi-hop cognitive radio networks”, in: The 27th IEEE Conference on Computer Communications, INFOCOM 2008
[10] M. Xie, Z. Wei, and W. Kai-Kit. "A geometric approach to improve spectrum efficiency for cognitive relay networks." Wireless Communications, IEEE Transactions on 9.1 (2010): 268-281. [11] Chowdhury, Kaushik R., and M. D. Felice. "Search: A routing protocol for mobile cognitive radio ad-hoc networks." Computer Communications 32, no. 18 (2009): 1983-1997.
[12] L. Ding,"Rosa: distributed joint routing and dynamic spectrum allocation in cognitive radio ad hoc networks." Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems. ACM, 2009
[13] A. Sampath, "High throughput spectrum-aware routing for cognitive radio networks." Proc. of IEEE Crowncom (2008).
[14] Pefkianakis, Ioannis, Starsky HY Wong, and Songwu Lu. "SAMER: spectrum aware mesh routing in cognitive radio networks." New Frontiers in Dynamic Spectrum Access Networks, 2008. DySPAN 2008. 3rd IEEE Symposium on. IEEE, 2008.
[15] L. Ding, T. Melodia, S. Batalama, M.J. Medley, Rosa: distributed joint routing and dynamic spectrum allocation in cognitive radio ad hoc networks, in: MSWiM ’09: Proceedings of the 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, 2009. [16] S.L Nxumalo, N. Ntlatlapa, P. Mudali, M.O. Adigun, 2009. Performance Evaluation of Routing Metrics for Wireless Networks. In Proceedings of South African Telecommunication Networks and Applications Conference, Royal Swazi Spa, Swaziland, 30 August – 2 September 2009
[17] De Couto, Douglas SJ, "A high-throughput path metric for multi-hop wireless routing." Wireless Networks 11.4 (2005): 419-434.
[18] Dijkstra, W. Edsger "A note on two problems in connection with graphs." Numerische mathematik 1, no. 1 (1959): 269-271.
[19] A. Adya, "A multi-radio unification protocol for IEEE 802.11 wireless networks." Broadband Networks, 2004. BroadNets 2004. Proceedings. First International Conference on. IEEE, 2004
[21] R. Draves, P. Jitendra, and Z. Brian. "Routing in multi-radio, multi-hop wireless mesh networks." In Proceedings of the 10th annual international conference on Mobile computing and networking, pp. 114-128.ACM, 2004.
[22] Q. Xiao, Y. Li, M. Zhao, S. Zhou, and J. Wang, “Opportunistic channel selection approach under collision probability constraint in cognitive radio systems,” Computer Communications, vol. 32 (18), pp. 1914–1922, 2009.
[23] L. Yang, L. Cao, and H. Zheng, “Proactive channel access in dynamic spectrum networks,” Elsevier Physical Communications Journal, vol (1), pp. 103–111, 2008.
[24] G. D. Nguyen and S. Kompella, “Channel sharing in cognitive radio networks,” in MILCOM, 2010
[25] I.F. Akyildiz, L. Won-Yeol, and K.R. Chowdhury. "CRAHNs: Cognitive radio ad hoc networks." Ad Hoc Networks 7.5 (2009): 810–836.
[26] K.R. Chowdhury, I.F. Akyildiz, OFDM based common control channel design for Cognitive Radio Ad HoC Networks, IEEE Transactions on Mobile Computing (2010) (in press).
[27] A.