Analysis of Cognitive Radio Enabled Flooding in Opportunistic Networks

DOI: 10.4236/ijcns.2014.77023   PDF   HTML   XML   2,763 Downloads   3,303 Views  

Abstract

Epidemic routing (Flooding) is considered as a simple routing protocol for opportunistic networks where the participants attempt to transmit whatever information they have to everyone who does not already have that information. However, it is plagued with disadvantages of resource scarcity as it exerts stress on available bandwidth as well as storage capacity of the devices in the network. Cognitive radio (CR) is one of the emerging technologies that can improve the bandwidth utilization by smart allocation of spectrum radio bands. Ideally speaking, a spectrum-aware cognitive radio is able to sense the local spectrum usage and adapt its own radio parameters accordingly. In this study, we have performed experiments to analyze the gains achieved by flooding protocol using cognitive radios of varying capabilities in opportunistic networks. We have performed experiments on three opportunistic networks obtained from real-life traces from different environments and presented results showing variance in delivery efficiency as well as cost incurred on those scenarios. Our results show that performance of flooding can be significantly improved using CRs in bandwidth-scarce environments; however, the improvement is not uniform with the increase in a number of available bands.

Share and Cite:

Islam, M. and Waldvogel, M. (2014) Analysis of Cognitive Radio Enabled Flooding in Opportunistic Networks. International Journal of Communications, Network and System Sciences, 7, 212-222. doi: 10.4236/ijcns.2014.77023.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] Akyildiz, I.F., Akan, O.B., Chen, C., Fang, J. and Su, W. (2003) Interplanetary Internet: State-of-the-Art and Research Challenges. Computer Networks, 43, 75-112. http://dx.doi.org/10.1016/S1389-1286(03)00345-1
[2] Pentland, A.S., Fletcher, R. and Hasson, A. (2004) DakNet: Rethinking Connectivity in Developing Nations. IEEE Computer, 37, 78-83. http://dx.doi.org/10.1109/MC.2004.1260729
[3] Kamruzzaman, S.M. and Jeong, D.G. (2010) Routing Protocols for Cognitive Radio Networks: A Survey. Journal of Information Industrial Engineering, 16, 153-169.
[4] Group, S.E.W. (2002) Report of the Spectrum Efficiency Working Group. Federal Communications Commission, Washington DC.
[5] Cesana, M., Cuomo, F. and Ekici, E. (2011) Routing in Cognitive Radio Networks: Challenges and Solutions. Ad Hoc Network, 9, 228-248. http://dx.doi.org/10.1016/j.adhoc.2010.06.009
[6] Akyildiz, I., Lee, W.-Y., Vuran, M. and Mohanty, S. (2008) A Survey on Spectrum Management in Cognitive Radio Networks. IEEE Communications Magazine, 46, 40-48.
http://dx.doi.org/10.1109/MCOM.2008.4481339
[7] Ding, L., Melodia, T., Batalama, S. and Medley, M.J. (2009) 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, Spain, 19-26 October 2009, 13-20.
[8] Cormio, C. and Chowdhury, K.R. (2009) A Survey on Mac Protocols for Cognitive Radio Networks. Ad Hoc Networks, 7, 1315-1329. http://dx.doi.org/10.1016/j.adhoc.2009.01.002
[9] Haykin, S., Reed, J.H., Li, G.Y. and Shafi, M. (2009) Scanning the Issue. Proceedings of the IEEE, 97, 784-786. http://dx.doi.org/10.1109/JPROC.2009.2015701
[10] Keranen, A. and Ott, J. (2007) Increasing Reality for DTN Protocol Simulations. Helsinki University of Technology, Helsinki.
[11] Burgess, J., Gallagher, B., Jensen, D. and Levine, B. (2006) MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networking. 25th IEEE International Conference on Computer Communications, April 2006, 1-11.
[12] Lilien, L., Kamal, Z.H. and Gupta, A. (2006) Opportunistic Networks: Challenges in Specializing the p2p Paradigm. 17th International Workshop on Database and Expert Systems Applications, 722-726.
[13] Jain, S., Fall, K. and Patra, R. (2004) Routing in a Delay Tolerant Network. Proceedings of SIGCOMM 2004, 145-158.
[14] Vahdat, A. and Becker, D. (2000) Epidemic Routing for Partially Connected Ad Hoc Net-Works. Duke University, Durham.
[15] Islam, A. and Waldvogel, M. (2008) Reality-Check for DTN Routing Algorithms. Proceedings of the 28th International Conference on Distributed Computing Systems Workshops, Washington DC, 17-20 June 2008, 204-209.
[16] Islam, M.A. and Waldvogel, M. (2011) Questioning Flooding as a Routing Benchmark in Opportunistic Networks. 2011 Baltic Congress on Future Internet Communications (BCFIC Riga), Riga, 16-18 February 2011, 128-133.
[17] Pefkianakis, I., Wong, S.H.Y. and Lu, S. (2008) Spectrum Aware Routing in Cognitive Radio Mesh Networks. 3rd IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks, Chicago, 14-17 October 2008, 1-5. http://dx.doi.org/10.1109/DYSPAN.2008.90
[18] Abdelaziza, S. and El Nainay, M. (2012) Survey of Routing Protocols in Cognitive Radio Networks. http://wrc-ejust.org/crn/images/Surveys/RPCRNs.pdf
[19] Urgaonkar, R. and Neely, M.J. (2009) Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks. IEEE Transactions on Mobile Computing, 8, 766-777.
http://dx.doi.org/10.1109/TMC.2009.38
[20] Khalife, H., Ahuja, S., Malouch, N. and Krunz, M. (2008) Probabilistic Path Selection in Opportunistic Cognitive Radio Networks. IEEE Global Telecommunications Conference, New Orleans, 30 November-4 December 2008, 1-5.
[21] Eagle, N. and Pentland, A.S. (2005) CRAWDAD Data Set MIT/Reality (v. 2005-07-01).
http://crawdad.cs.dartmouth.edu/mit/reality
[22] Balazinska, M. and Castro, P. (2003) CRAWDAD Data Set IBM/Watson (v. 2003-02-19).
http://crawdad.cs.dartmouth.edu/ibm/watson
[23] Wang, Y., Jain, S., Martonosi, M. and Fall, K. (2005) Erasure-Coding Based Routing for Opportunistic Networks. ACM Workshop on Delay Tolerant Networking, Philadelphia, 22-26 August 2005.
[24] Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L.-S. and Rubenstein, D. (2002) Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experience with Zebranet. Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems, 37, 96-107.
[25] Harras, K.A., Almeroth, K.C. and Belding-Royer, E.M. (2005) Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks. Lecture Notes in Computer Science, 3462, 1180-1192. http://dx.doi.org/10.1007/11422778_95
[26] Lindgren, A., Doria, A. and Schelen, O. (2003) Probabilistic Routing in Intermittently Connected Networks. SIGMOBILE Mobile Computing and Communications Review, 7, 19-20.
http://dx.doi.org/10.1145/961268.961272
[27] Zhang, X., Neglia, G., Kurose, J. and Towsley, D. (2006) Performance Modeling of Epidemic Routing. Proceedings of IFIP Networking.
[28] Small, T. and Haas, Z.J. (2005) Resource and Performance Tradeoffs in Delay-Tolerant Wireless Networks. Proceeding of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, 260-267. http://dx.doi.org/10.1145/1080139.1080144
[29] Thrasyvoulos, S., Psounis, K. and Raghavendra, C. (2008) Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case. IEEE/ACM Transactions on Networking, 16, 63-76. http://dx.doi.org/10.1109/TNET.2007.897962
[30] Jones, E.P.C., Li, L. and Schmidtke, J.K. (2007) Practical Routing in Delay-Tolerant Networks. IEEE Transactions on Mobile Computing, 6, 943-959. http://dx.doi.org/10.1109/TMC.2007.1016
[31] Islam, M.A. (2012) Routing Issues in Opportunistic Networks: Evolution of Delay Tolerant Networks from Mobile Ad-Hoc Networks to Opportunistic Networks. LAP LAMBERT Academic Publishing.
[32] Islam, M. and Waldvogel, M. (2011) Optimizing Message Delivery in Mobile-Opportunistic Networks. Internet Communications (BCFIC Riga), Latvia, 16-18 February 2011, 134-141.

  
comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.