Skip to main content
Erschienen in: Wireless Personal Communications 3/2021

04.01.2021

Adaptive Resource Management Solution for Ad-Hoc Opportunistic Networks

verfasst von: Ayman Khalil, Nassif Abou Haidar, Georges Bassil, Rabih Chbeir

Erschienen in: Wireless Personal Communications | Ausgabe 3/2021

Einloggen

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Opportunistic network (OppNet) is described as one of the most challenging network models, since contact between nodes is intermittent. In OppNet, an end-to-end path between the source and the destination does not exist because of nodes mobility. Therefore, relay nodes store then transmit the packets whenever a connection is available. Thus, store-carry-forward is the technique that allows OppNet to deliver messages from source to destination. One of the main drawbacks of this technique is the buffer congestion. Due to the unavailability of continuous connection between nodes, the message might stay in buffer’s nodes for a long period without being transmitted, which will lead to buffer overload. Several routing algorithms have been studied in order to manage the buffer’s nodes. In this paper, a novel adaptive buffer management policy that takes into consideration the limited network resources such as energy and bandwidth is proposed. The new solution relying on three policies; blacklisting, scheduling and dropping is capable to adapt with the modification of several network parameters such as message size, node capacity and network density. The simulation results show that the proposed solution improves the performance of OppNet by increasing the delivery rate and decreasing the network resource consumption.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Keranen, A. (2008). Opportunistic network environment simulator. Helsinki: Department of Communications and Networking. Keranen, A. (2008). Opportunistic network environment simulator. Helsinki: Department of Communications and Networking.
2.
Zurück zum Zitat Amirthavalli, R., Dhaya, R., & Chandrasoodan, M. (2016). A survey of routing algorithms in delay tolerant networks. In 2nd International Conference on Applied and Theoretical Computing and Communication Technology, Chennai. Amirthavalli, R., Dhaya, R., & Chandrasoodan, M. (2016). A survey of routing algorithms in delay tolerant networks. In 2nd International Conference on Applied and Theoretical Computing and Communication Technology, Chennai.
3.
Zurück zum Zitat Jain, S., & Chawla, M. (2014). Survey of buffer management policies for delay tolerant networks. The Journal of Engineering, 3, 117–123.CrossRef Jain, S., & Chawla, M. (2014). Survey of buffer management policies for delay tolerant networks. The Journal of Engineering, 3, 117–123.CrossRef
4.
Zurück zum Zitat Prabha, C., Kumar, S., & Khanna, R. (2016). Analysis of routing and forwarding protocols in opportunistic networks. In International Conference on Computational Modeling and Security (CMS 2016), India. Prabha, C., Kumar, S., & Khanna, R. (2016). Analysis of routing and forwarding protocols in opportunistic networks. In International Conference on Computational Modeling and Security (CMS 2016), India.
5.
Zurück zum Zitat Ahmed, K., Omar, M., & Hassan, S. (2016). Survey and comparison of operating concept for routing. Journal of Computer Sciences, 12, 141–152. Ahmed, K., Omar, M., & Hassan, S. (2016). Survey and comparison of operating concept for routing. Journal of Computer Sciences, 12, 141–152.
6.
Zurück zum Zitat Kaur, N., & Mathur, G. (2016). Opportunistic networks: A review. IOSR Journal of Computer Engineering, 18(2), 20–26.CrossRef Kaur, N., & Mathur, G. (2016). Opportunistic networks: A review. IOSR Journal of Computer Engineering, 18(2), 20–26.CrossRef
7.
Zurück zum Zitat Nayyar, A., Batt, R. S., Ha, D. B., & Suseendran, G. (2018). Opportunistic networks: Present scenario—A mirror review. International Journal of Communication Networks and Information Security, 10(1), 223–241. Nayyar, A., Batt, R. S., Ha, D. B., & Suseendran, G. (2018). Opportunistic networks: Present scenario—A mirror review. International Journal of Communication Networks and Information Security, 10(1), 223–241.
8.
Zurück zum Zitat Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks. Durham, NC: Department of Computer Science, Duke University. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks. Durham, NC: Department of Computer Science, Duke University.
9.
Zurück zum Zitat Lindgren, A., Doria, A., & Schelen, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7, 19–20.CrossRef Lindgren, A., Doria, A., & Schelen, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7, 19–20.CrossRef
10.
Zurück zum Zitat Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In ACM SIGCOMM Workshop on Delay-Tolerant Networking (pp. 252–259). Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In ACM SIGCOMM Workshop on Delay-Tolerant Networking (pp. 252–259).
11.
Zurück zum Zitat Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). MaxProp: Routing for vehicle-based disruption-tolerant networks. In Infocom (pp. 1–11). Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). MaxProp: Routing for vehicle-based disruption-tolerant networks. In Infocom (pp. 1–11).
12.
Zurück zum Zitat Ayub, Q., Zahid, S. M., Rashid, S., & Abdullah, A. H. (2012). Adaptive message size routing strategy for delay tolerant network. Scientific Research and Essays, 7, 1798–1808. Ayub, Q., Zahid, S. M., Rashid, S., & Abdullah, A. H. (2012). Adaptive message size routing strategy for delay tolerant network. Scientific Research and Essays, 7, 1798–1808.
13.
Zurück zum Zitat Nafila, S. P., Yovita, L. V., & Perdana, D. (2016). Performance comparison of DTN routing protocol maxprop and spray and wait under varying node speed and volume. E-Proceeding of Engineering, 3(1), 181–186. Nafila, S. P., Yovita, L. V., & Perdana, D. (2016). Performance comparison of DTN routing protocol maxprop and spray and wait under varying node speed and volume. E-Proceeding of Engineering, 3(1), 181–186.
14.
Zurück zum Zitat Rani, A., Rani, S., & Bindr, H. S. (2014). Performance evaluation of MOFO buffer management technique with different routing protocols in DTN under variable message buffer size. International Journal of Research in Engineering and Technology, 3(3), 82–86.CrossRef Rani, A., Rani, S., & Bindr, H. S. (2014). Performance evaluation of MOFO buffer management technique with different routing protocols in DTN under variable message buffer size. International Journal of Research in Engineering and Technology, 3(3), 82–86.CrossRef
15.
Zurück zum Zitat Sobin, C. (2016). An efficient buffer management policy for DTN. Procedia Computer Science, 93, 309–314.CrossRef Sobin, C. (2016). An efficient buffer management policy for DTN. Procedia Computer Science, 93, 309–314.CrossRef
16.
Zurück zum Zitat Zhang, Y., Wang, H., Feng, G., & Lv, H. (2015). A fuzzy ranking based buffer replacement strategy for opportunistic networks. In Eighth International Conference on Internet Computing for Science and Engineering (ICICSE), Harbin. Zhang, Y., Wang, H., Feng, G., & Lv, H. (2015). A fuzzy ranking based buffer replacement strategy for opportunistic networks. In Eighth International Conference on Internet Computing for Science and Engineering (ICICSE), Harbin.
17.
Zurück zum Zitat Ke, M., Nenghai, Y., & Bin, L. (2010). A new packet dropping policy in delay tolerant network. In IEEE 12th International Conference on Communication Technology, Nanjing. Ke, M., Nenghai, Y., & Bin, L. (2010). A new packet dropping policy in delay tolerant network. In IEEE 12th International Conference on Communication Technology, Nanjing.
18.
Zurück zum Zitat Ayub, Q., Ngadi, A., Raghid, S., & Habib, H. A. (2018). Priority queue based reactive buffer management policy for delay tolerant network under city based environments. PLoS One, 14(10), e0224826.CrossRef Ayub, Q., Ngadi, A., Raghid, S., & Habib, H. A. (2018). Priority queue based reactive buffer management policy for delay tolerant network under city based environments. PLoS One, 14(10), e0224826.CrossRef
19.
Zurück zum Zitat Yan, Y., Chen, Z., Wu, J., Wang, L., Liu, K., & Wu, Y. (2019). Effective data transmission strategy based on node socialization in opportunistic social networks. In IEEE Access. Yan, Y., Chen, Z., Wu, J., Wang, L., Liu, K., & Wu, Y. (2019). Effective data transmission strategy based on node socialization in opportunistic social networks. In IEEE Access.
20.
Zurück zum Zitat Yoon, J., Kim, S. K., Lee, J. Y., & Jang, K. Y. (2017). An enhanced friendship-based routing scheme exploiting regularity in an opportunistic network. In Proceedings of the IEEE International Conference on Internet of Things, China. Yoon, J., Kim, S. K., Lee, J. Y., & Jang, K. Y. (2017). An enhanced friendship-based routing scheme exploiting regularity in an opportunistic network. In Proceedings of the IEEE International Conference on Internet of Things, China.
21.
Zurück zum Zitat Sharma, D. K., Dhurandher, S. K., Woungang, I., Bansal, A., & Gupta, A. (2018). A genetic algorithm based dynamic context aware routing protocol for opportunistic networks. In Proceedings of the International Conference on Network-Based Information Systems, Slovakia. Sharma, D. K., Dhurandher, S. K., Woungang, I., Bansal, A., & Gupta, A. (2018). A genetic algorithm based dynamic context aware routing protocol for opportunistic networks. In Proceedings of the International Conference on Network-Based Information Systems, Slovakia.
22.
Zurück zum Zitat Massri, K., Vitaletti, A., Vernata, A., & Chatzigiannakis, I. (2016). Routing protocols for delay tolerant networks: A reference architecture and a thorough quantitative evaluation. Journal of Sensor and Actuator Networks, 5, 1–28.CrossRef Massri, K., Vitaletti, A., Vernata, A., & Chatzigiannakis, I. (2016). Routing protocols for delay tolerant networks: A reference architecture and a thorough quantitative evaluation. Journal of Sensor and Actuator Networks, 5, 1–28.CrossRef
Metadaten
Titel
Adaptive Resource Management Solution for Ad-Hoc Opportunistic Networks
verfasst von
Ayman Khalil
Nassif Abou Haidar
Georges Bassil
Rabih Chbeir
Publikationsdatum
04.01.2021
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 3/2021
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-020-07952-5

Weitere Artikel der Ausgabe 3/2021

Wireless Personal Communications 3/2021 Zur Ausgabe

Neuer Inhalt