Towards Energy-Aware Ant Routing in Wireless Multi-Hop Networks : Technical Report

Ein drahtloses Multi-Hop-Netzwerk (engl., wireless multi-hop network, WMHN) zeichnet sich besonders durch zwei Eigenschaften aus: i) vollständig drahtloses Netzwerk und ii) Multi-Hop-Kommunikation. In der Literatur werden verschiedene Varianten von WMHNs behandelt, z.B., drahtlose Maschennetze (engl...

Volltext Mehr ...
Verfasser: Frey, Michael
Güneş, Mesut
Grosse, Friedrich
Dokumenttypen:Verschiedenartige Texte
Medientypen:Text
Erscheinungsdatum:2014
Publikation in MIAMI:16.12.2014
Datum der letzten Änderung:27.07.2015
Angaben zur Ausgabe:[Electronic ed.]
Schlagwörter:Drahtlose Kommunikation; Drahtlose Multi-hop-Netze; Ad-Hoc-Netzwerke; Ant Routing Algorithm; Energy-Aware Ant Routing; Selbstorganisation; Natur-inspirierte Verfahren Energy-Aware Ant Routing; Ant Routing Algorithm; Ad Hoc Networks; Wireless Multi-hop Networks; Wireless Communication; Self-Organization; Bio-Inspired Networking Algorithms
Fachgebiet (DDC):004: Datenverarbeitung; Informatik
Lizenz:CC BY-ND 3.0 DE
Sprache:Englisch
Format:PDF-Dokument
URN:urn:nbn:de:hbz:6-41319656523
Permalink:https://nbn-resolving.de/urn:nbn:de:hbz:6-41319656523
Onlinezugriff:report_frey_guenes_grosse_2014.pdf
Inhaltsverzeichnis:
  • 1 Introduction ..... 2
  • 1.1 Wireless Multi-Hop Networks ..... 2
  • 1.2 Communication in WMHNs ..... 3
  • 1.3 Open Research Problems in WMHNs ..... 3
  • 1.4 Contribution ..... 4
  • 1.5 Structure of the Paper ..... 4
  • 2 Ant Algorithms ..... 5
  • 2.1 Ant Foraging Behavior ..... 5
  • 2.2 A Simple Ant Algorithm ..... 6
  • 2.3 Extensibility of the Approach ..... 7
  • 2.4 Why ant algorithms are suitable for wireless multi-hop networks ..... 7
  • 3 The Ant Routing Algorithm ..... 8
  • 3.1 The Three Phases of Routing ..... 8
  • 3.1.1 Route Discovery ..... 8
  • 3.1.2 Route Maintenance ..... 9
  • 3.1.3 Route Failure Handling ..... 9
  • 3.1.4 Summary and Discussion ..... 10
  • 3.2 Packet Forwarding ..... 11
  • 3.2.1 Routing Table ..... 11
  • 3.2.2 Maximum Pheromone Routing ..... 12
  • 3.2.3 Probabilistic Routing ..... 12
  • 3.3 Pheromone Management ..... 12
  • 3.3.1 Initialization of the Pheromone Values ..... 12
  • 3.3.2 Adaptation of the Pheromone Values ..... 13
  • 3.4 Decreasing the Number of Packets for FANT/BANT ..... 13
  • 3.5 Complexity of ARA ..... 14
  • 3.6 Performance evaluation of ARA ..... 14
  • 4 Energy-Aware Ant Routing Algorithm ..... 15
  • 4.1 Energy Awareness ..... 15
  • 4.2 Energy Model ..... 16
  • 4.3 Energy Consumption ..... 16
  • 4.4 Collection and Distribution of Energy Information ..... 18
  • 4.4.1 Routing Table ..... 18
  • 4.4.2 Updating the Energy Information ..... 18
  • 4.4.3 Integration into the Forwarding Decision ..... 19
  • 4.4.4 Path Energy Fitness ..... 20
  • 4.4.5 Path Energy ..... 20
  • 4.4.6 Integrating the Path Energy Fitness ..... 20
  • 4.5 Estimation of the Path Energy during Communication ..... 21
  • 4.5.1 Energy Consumption of a Node ..... 21
  • 4.5.2 Path Energy Estimation ..... 22
  • 4.6 Performance Evaluation ..... 23
  • 4.6.1 Simulation Setup ..... 23
  • 4.6.2 Packet Delivery Rate and Routing Overhead ..... 23
  • 4.6.3 Energy Dead Series ..... 25
  • 4.6.4 Path Energy ..... 26
  • 4.7 Summary ..... 26
  • 5 Related Work ..... 28
  • 5.1 Introduction ..... 28
  • 5.2 Energy-Aware Ant Routing Algorithms ..... 28
  • 5.3 Constrained-Based Routing ..... 29
  • 5.4 Summary ..... 30
  • 6 Summary ..... 32
  • Bibliography ..... 33.

Ähnliche Einträge