[go: up one dir, main page]

Vijayalakshmi et al., 2016 - Google Patents

A robust energy efficient ant colony optimization routing algorithm for multi-hop ad hoc networks in MANETs

Vijayalakshmi et al., 2016

Document ID
18143006592608258417
Author
Vijayalakshmi P
Francis S
Abraham Dinakaran J
Publication year
Publication venue
Wireless Networks

External Links

Snippet

Abstract The Ant Colony Optimization (ACO) routing technique is an adaptive and reliable approach to find the paths in routing for Mobile Ad hoc Networks (MANETs). In ACO algorithms, the ant as agents traverses across the network to find the shortest path from the …
Continue reading at link.springer.com (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/121—Minimizing delay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H04L67/104—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations contains provisionally no documents
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/46—Cluster building
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks

Similar Documents

Publication Publication Date Title
Vijayalakshmi et al. A robust energy efficient ant colony optimization routing algorithm for multi-hop ad hoc networks in MANETs
Saleem et al. BeeSensor: An energy-efficient and scalable routing protocol for wireless sensor networks
Dhurandher et al. GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks
Singh et al. Ant colony algorithms in MANETs: A review
EP1747658B1 (en) Peer-to-peer networks
Rosati et al. On ant routing algorithms in ad hoc networks with critical connectivity
Palmieri Scalable service discovery in ubiquitous and pervasive computing architectures: A percolation-driven approach
Maivizhi et al. Q-learning based routing for in-network aggregation in wireless sensor networks
Kadono et al. An ant colony optimization routing based on robustness for ad hoc networks with GPSs
Vupputuri et al. Using mobile data collectors to improve network lifetime of wireless sensor networks with reliability constraints
Gnana Prakasi et al. Decision tree based routing protocol (DTRP) for reliable path in MANET
Sharma et al. Ant colony based node disjoint local repair in multipath routing in MANET network
Das et al. Extending lifetime of wireless sensor networks using multi-sensor data fusion
Anandamurugan et al. Antipredator adaptation shuffled frog leap algorithm to improve network life time in wireless sensor network
Palmieri Bayesian resource discovery in infrastructure-less networks
Sathiamoorthy et al. Energy and delay efficient dynamic cluster formation using improved ant colony optimization algorithm in EAACK MANETs
Jeyaraj et al. Developing multi‐path routing protocol in MANET using hybrid SM‐CSBO based on novel multi‐objective function
Sharma et al. A survey on ACO based multipath routing algorithms for ad hoc networks
Palmieri A wave propagation-based adaptive probabilistic broadcast containment strategy for reactive MANET routing protocols
Al-Karaki et al. End-to-end support for statistical quality of service in heterogeneous mobile ad hoc networks
Leão et al. Latency and network lifetime trade-off in geographic multicast routing for multi-sink wireless sensor networks
Alhasanat et al. A probabilistic home-based routing scheme for delay tolerant networks
Hassan et al. Energy-efficient reliable packet delivery in variable-power wireless sensor networks
Ait-Salem et al. A hybrid multiagent routing approach for wireless ad hoc networks
Ayub et al. DF++: An adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network