About: Ant-based On-demand Clustering Routing Protocol Ant-based On-demand Clustering Routing Protocol for Mobile Ad-hoc Networks     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • With the advancement of the mobile ad-hoc network (MANET), many researches were proposed to increase the efficiency of networks. The important factor affects the performance in MANET is discovering and maintaining paths since the nodes mobility causes topology change, which needs to be observed for effective communication. One of the popular studies for routing in the networks in recent years is the swarm intelligence which imitates the collective behavior of biological species to solve routing problems in the networks. Another efficient method is clustering scheme which can be auxiliary structure to cluster nodes in the network. In this paper, we use weakly connected dominating sets (WCDS) which clusters network by nodes maximum degree or minimum ID to propose an improved ant-based on-demand clustering routing (AOCR) protocol. AOCR uses ant-like agents inspired by the foraging behavior of ant colonies to explore networks and discover a route which fulfills several QoS requirements including minimal t
  • With the advancement of the mobile ad-hoc network (MANET), many researches were proposed to increase the efficiency of networks. The important factor affects the performance in MANET is discovering and maintaining paths since the nodes mobility causes topology change, which needs to be observed for effective communication. One of the popular studies for routing in the networks in recent years is the swarm intelligence which imitates the collective behavior of biological species to solve routing problems in the networks. Another efficient method is clustering scheme which can be auxiliary structure to cluster nodes in the network. In this paper, we use weakly connected dominating sets (WCDS) which clusters network by nodes maximum degree or minimum ID to propose an improved ant-based on-demand clustering routing (AOCR) protocol. AOCR uses ant-like agents inspired by the foraging behavior of ant colonies to explore networks and discover a route which fulfills several QoS requirements including minimal t (en)
Title
  • Ant-based On-demand Clustering Routing Protocol Ant-based On-demand Clustering Routing Protocol for Mobile Ad-hoc Networks
  • Ant-based On-demand Clustering Routing Protocol Ant-based On-demand Clustering Routing Protocol for Mobile Ad-hoc Networks (en)
skos:prefLabel
  • Ant-based On-demand Clustering Routing Protocol Ant-based On-demand Clustering Routing Protocol for Mobile Ad-hoc Networks
  • Ant-based On-demand Clustering Routing Protocol Ant-based On-demand Clustering Routing Protocol for Mobile Ad-hoc Networks (en)
skos:notation
  • RIV/00216305:26220/13:PU104422!RIV14-MSM-26220___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 61331
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26220/13:PU104422
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Ant Colony Optimization, MANET, On-demand Routing, Weakly Connected Dominating Set (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [14FD2AC8B917]
http://linked.open...v/mistoKonaniAkce
  • Taichung
http://linked.open...i/riv/mistoVydani
  • Taichung, Taiwan
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing - IMIS 2013
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Hošek, Jiří
  • Leu, Jenq-Shiou
  • Li, Kuen Han
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Neuveden
https://schema.org/isbn
  • 978-0-7695-4974-3
http://localhost/t...ganizacniJednotka
  • 26220
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software