Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Telecommunication Systems
Erschienen in: Telecommunication Systems 1/2019

22.05.2018

Analytical comparisons of query-broadcast repealing schemes in MANETs

verfasst von: Naeem Ahmad, S. Zeeshan Hussain

Erschienen in: Telecommunication Systems | Ausgabe 1/2019

Einloggen

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

search-config
loading …

Abstract

Recent research in mobile ad-hoc networks (MANETs) mostly deals to minimize the broadcast expenses of route discovery by controlling the query-broadcast. In this regard, a variety of broadcast-repealing schemes have been proposed, and employed to improve effectiveness and efficiency in various aspects of route-discovery considering time and energy. These schemes mainly focus on reducing unnecessary propagation of route-query by repealing the query-broadcast. Time-to-live based broadcast is the most common controlled-flooding scheme widely used in routing protocols. Recently some other broadcast-repealing schemes are proposed which work based on chasing-policy. The critical and analytical assessment to evaluate these schemes such aspects is of great importance. In this paper, we investigate their query-diffusion process, and their merits and demerits.
Vorheriger Artikel Low complexity maximum-likelihood detector for DSTTD architecture based on the QRD-M algorithm
Nächster Artikel Two energy and time-efficient data dissemination protocols for large-scale wireless sensor networks

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

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Fußnoten
1
Broadcast repealing is used to control flooding, terms broadcast repealing and controlled flooding are used interchangeably to define query-control techniques.
 
2
One hop away neighbor nodes form first ring, two hop away nodes form second ring and so on.
 
3
Route no longer exists due to frequently changing topology
 
4
The terms participating nodes and intermediate nodes interchangeably are used to define the relay nodes
 
5
To avoid redundancy of query at intermediate nodes.
 
6
Route-node that has destination information
 
Literatur
1.
Abbasi, A. A., & Younis, M. (2007). A survey on clustering algorithms for wireless sensor networks. Computer Communications, 30(14), 2826–2841.CrossRef
2.
Ahmad, N., & Hussain, S. Z. (2015). Broadcast expenses controlling techniques in mobile ad-hoc networks: A survey. Journal of King Saud University-Computer and Information Sciences, 28, 248–261.CrossRef
3.
Ahmad, N., & Hussain, S. Z. (2017). Power saving technique for controlled broadcast of query packet in manets. International Journal of Mobile Network Design and Innovation, 7(3), 281–293.
4.
Al-Rodhaan, M. A., Mackenzie, L., & Ould-Khaoua, M. (2008). Improvement to blocking expanding ring search for manets (pp. 1–13). Glasgow: Dept of Computing Science, University of Glasgow.
5.
Chang, N., & Liu, M. (2004). Revisiting the ttl-based controlled flooding search: Optimality and randomization. In Proceedings of the 10th annual international conference on Mobile computing and networking (pp. 85–99). ACM.
6.
Choi, W., & Woo, M. (2006). A distributed weighted clustering algorithm for mobile ad hoc networks. In Proceeding of advanced international conference on telecommunications/international conference on internet and web applications and services, AICT-ICIW’06 (pp. 73–73). IEEE.
7.
Gui, B., Dai, L., & Cimini, L. J, Jr. (2009). Routing strategies in multihop cooperative networks. IEEE Transactions on Wireless Communications, 8(2), 843–855.CrossRef
8.
9.
Karenos, K., Kalogeraki, V., & Krishnamurthy, S. V. (2008). Cluster-based congestion control for sensor networks. ACM Transactions on Sensor Networks (TOSN), 4(1), 5.CrossRef
10.
Lee, S. J., Su, W., & Gerla, M. (2002). On-demand multicast routing protocol in multihop wireless mobile networks. Mobile Networks and Applications, 7(6), 441–453.CrossRef
11.
Lima, R., Baquero, C., & Miranda, H. (2013). Broadcast cancellation in search mechanisms. In Proceedings of the 28th Annual ACM Symposium on Applied Computing (pp. 548–553). SAC ’13, ACM, New York, NY, USA.
12.
Park, I., Kim, J., & Pu, I., et al. (2006). Blocking expanding ring search algorithm for efficient energy consumption in mobile ad hoc networks. In WONS 2006: Third annual conference on wireless on-demand network systems and services (pp. 191–195).
13.
Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on-demand distance vector routing. In Second IEEE workshop on mobile computing systems and applications, 1999. proceedings. WMCSA’99 (pp. 90–100). IEEE.
14.
Pu, I. M., & Shen, Y. (2009). Enhanced blocking expanding ring search in mobile ad hoc networks. In 2009 3rd international conference on new technologies, mobility and security (NTMS) (pp. 1–5). IEEE.
15.
Pu, I. M., & Shen, Y. (2010). Analytical studies of energytime efficiency of blocking expanding ring search. Mathematics in Computer Science, 3(4), 443–456.CrossRef
16.
Pu, I. M., Stamate, D., & Shen, Y. (2014). Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks. Journal of Discrete Algorithms, 24, 59–67.CrossRef
17.
Pu, I., Kim, J., & Shen, Y. (2010). Energy-time efficiency of two routing strategies with chase packets in expanding ring search. In 2010 IEEE 17th international conference on telecommunications (ICT) (pp. 742–747).
18.
Zeeshan, S. H., & Naeem, A. (2014). Cluster based controlling of route exploring packets in ad-hoc networks. In Proceedings of the 2nd international conference on advanced computing, networking, and informatics, ICACNI’14. vol. 28.
19.
Shamoun, S., & Sarne, D. (2014). Two-sided expanding ring search. In Proceedings of 6th international conference on communication systems and networks, COMSNETS’14 (pp. 1–8). IEEE.
20.
Tonguz, O. K., Wisitpongphan, N., Parikh, J. S., Bai, F., Mudalige, P., & Sadekar, V. K. (2006). On the broadcast storm problem in ad hoc wireless networks. In: 3rd international conference on broadband communications, networks and systems, 2006. BROADNETS 2006 (pp. 1–11). IEEE.
21.
Williams, B., & Camp, T. (2002). Comparison of broadcasting techniques for mobile ad hoc networks. In Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking and computing (pp. 194–205). ACM.
22.
Zhu, Y., & Kunz, T. (2004). Maodv implementation for ns-2.26. Systems and Computing Engineering, Carleton University, Technical Report SCE-04-01.
Metadaten
Titel
Analytical comparisons of query-broadcast repealing schemes in MANETs
verfasst von
Naeem Ahmad
S. Zeeshan Hussain
Publikationsdatum
22.05.2018
Verlag
Springer US
Erschienen in
Telecommunication Systems / Ausgabe 1/2019
Print ISSN: 1018-4864
Elektronische ISSN: 1572-9451
DOI
https://doi.org/10.1007/s11235-018-0469-6

Weitere Artikel der Ausgabe 1/2019

Telecommunication Systems 1/2019 Zur Ausgabe

OriginalPaper

Low complexity maximum-likelihood detector for DSTTD architecture based on the QRD-M algorithm

OriginalPaper

Designing a Hadoop system based on computational resources and network delay for wide area networks

OriginalPaper

Defence against PUE attacks in ad hoc cognitive radio networks: a mean field game approach

OriginalPaper

3D WLS hybrid and non hybrid localization using TOA, TDOA, azimuth and elevation

OriginalPaper

Multiple-high altitude platforms aided system architecture for achieving maximum last mile capacity in satellite communication

OriginalPaper

Two energy and time-efficient data dissemination protocols for large-scale wireless sensor networks

Neuer Inhalt

    Bildnachweise