International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

Energy of Bandwidth and Storage Routing Protocol for Opportunistic Networks


Affiliations
1 Misurata University, Libya
2 Department of Electronic Engineering, Libya
 

Opportunistic Networks is communication environment which has no stable path. Therefore, in this environment, the routing algorithms are partitioned into two main classes which are metric-based and contact-based. Essentially, contact based algorithms target for a high routing performance and small delay at the same time. However; these protocols consume high resources in terms of Energy, Bandwidth and Storage. Practically, opportunistic nodes such as smart phones and tablets suffer from the limitation of the energy and physical memory. In addition, the environment connectivity instability leads to low bandwidth links. This work proposes a resource concentrate routing protocol for opportunistic networks, named Energy of Bandwidth and Storage Routing Protocol (EBSRP). The energy is considered as a main factor calculated as a function of bandwidth and storage. The proposed EBSRP has its queuing policy calculated as a function of energy ratio. The Simulation results are used to analyze the performance of EBSRP and it is compared with Epidemic using different replication and dropping policies based on energy, bandwidth, and storage. The results show that the proposed protocol has better performance than Epidemic in terms of delivery ratio, delay, and overhead.

Keywords

Resource Concentrate, Epidemic Routing, Routing Performance, Controlled Replication, Message Information.
User
Notifications
Font Size

  • A. Vahdat and D. Becker, “ Epidemic Routing for Partially-Connected Ad Hoc Networks,” Technique Report, Department of Computer Sci-ence, Duke University, USA, vol. 20, no. 6, 2000.

  • T. Spyropoulos and K. Psounis, “ Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks ,” Proceedings of the ACM SIGCOMM Workshop on Delay-Tolerant

  • Networking, , 2005.

  • J. Xu, X. Feng, W. Yang, R. Wang, and B. Q. Han, “Optimal Joint Expected Delay Forwarding in Delay Tolerant Networks,” International Journal of Distributed Sensor Networks , 2013.

  • T. Matsuda and T. Takine, “(p, q)-epidemic routing for sparsely populated mobile ad hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 5, pp. 783–793, 2008.

  • C. Liu and J.Wu, “ An Optimal Probabilistic Forwarding Protocol in Delay Tolerant Networks,” International Journal of Distributed Sensor Networks , pp. 105–114, 2009.

  • H. Chen and W. Lou, “GAR: group aware cooperative routing protocol for resource-constraint opportunistic networks,” Computer Communications, vol. 48, pp. 20–29, 2014.

  • S. Sati, A. Ippisch, and K. Graffi, “Replication probability-based routing scheme for opportunistic networks,” in 2017 International Conference on Networked Systems, NetSys 2017, Gottingen,¨ Germany, March 13-16, 2017, pp. 1–8. , 2017.

  • A. Balasubramanian, B. N. Levine, and A. Venkataramani, “Replication routing in dtns: a resource allocation approach,” IEEE/ACM Trans. Netw., vol. 18, no. 2, pp. 596–609, 2010.

  • J. Burgess, B. Gallagher, D. D. Jensen, and B. N. Levine, “Maxprop: Routing for vehicle-based disruption-tolerant networks,” in INFOCOM 2006. 25th IEEE International Conference on Computer Communica-tions, Joint Conference of the IEEE Computer and Communications Societies, 23-29 April 2006, Barcelona, Catalunya, Spain, 2006.

  • S. Lo and W. Liou, “Dynamic quota-based routing in delay-tolerant networks,” in Proceedings of the 75th IEEE Vehicular Technology Conference, VTC Spring 2012, Yokohama, Japan, May 6-9, 2012, ,pp1– 5, 2012.

  • S. Sati, A. Ippisch, and K. Graffi, “Dynamic replication control strategy for opportunistic networks,” in 2017 International Conference on Computing, Networking and Communications, ICNC 2017, Silicon Valley, CA, USA, January 26-29, 2017, pp. 1017–1023, 2017.

  • A. Keranen,¨ J. Ott, and T. Karkk¨ainen,¨ “The ONE Simulator for DTN Protocol Evaluation,” in Proceedings of the International Conference on Simulation Tools and Techniques for Communications, Networks and Systems (SimuTools). ICST/ACM, 2009.

  • A. Keranen,¨ T. Karkk¨ainen,¨ and J. Ott, “Simulating Mobility and DTNs with the ONE (Invited Paper),” Journal of Communications, vol. 5, no. 2, Pp 92–105, 2010.


Abstract Views: 236

PDF Views: 0




  • Energy of Bandwidth and Storage Routing Protocol for Opportunistic Networks

Abstract Views: 236  |  PDF Views: 0

Authors

Salem Sati
Misurata University, Libya
Abubaker Alhutaba
Department of Electronic Engineering, Libya
Ibrahim Abutalag
Department of Electronic Engineering, Libya
Mohamed Eshtawie
Department of Electronic Engineering, Libya

Abstract


Opportunistic Networks is communication environment which has no stable path. Therefore, in this environment, the routing algorithms are partitioned into two main classes which are metric-based and contact-based. Essentially, contact based algorithms target for a high routing performance and small delay at the same time. However; these protocols consume high resources in terms of Energy, Bandwidth and Storage. Practically, opportunistic nodes such as smart phones and tablets suffer from the limitation of the energy and physical memory. In addition, the environment connectivity instability leads to low bandwidth links. This work proposes a resource concentrate routing protocol for opportunistic networks, named Energy of Bandwidth and Storage Routing Protocol (EBSRP). The energy is considered as a main factor calculated as a function of bandwidth and storage. The proposed EBSRP has its queuing policy calculated as a function of energy ratio. The Simulation results are used to analyze the performance of EBSRP and it is compared with Epidemic using different replication and dropping policies based on energy, bandwidth, and storage. The results show that the proposed protocol has better performance than Epidemic in terms of delivery ratio, delay, and overhead.

Keywords


Resource Concentrate, Epidemic Routing, Routing Performance, Controlled Replication, Message Information.

References