
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
  <dc:source>Icist, 2015, Srbija,  5th International Conference on Information Society and Technology</dc:source>
  <dc:rights>http://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
  <dc:language>eng</dc:language>
  <dc:identifier>https://phaidrabg.bg.ac.rs/o:33302</dc:identifier>
  <dc:description xml:lang="eng">Abstract: A mobile ad hoc network is a set of mobile nodes that are dynamically located and connected by wireless links. The network is self-configuring and provides end-toend communication. In order to facilitate communication within the network, a routing protocol is used to discover routes between source and destination nodes. Routing in the mobile ad hoc networks is a challenging task and has received a tremendous amount of attention from researches. This has led to development of many different routing protocols. Therefore, it is quite difficult to determine which protocols may perform best under a number of different network scenarios, such as increasing node density and traffic. In this paper, we present concept, characteristics and functionality of a simple routing protocol, based on packet delivery rate and distance from the destination node.</dc:description>
  <dc:type>info:eu-repo/semantics/review</dc:type>
  <dc:title xml:lang="eng">A Routing Algorithm for Mobile Ad Hoc Networks</dc:title>
  <dc:format>application/pdf</dc:format>
  <dc:format>273366 bytes</dc:format>
  <dc:date>2015</dc:date>
  <dc:creator>Đokic, Ivan</dc:creator>
  <dc:creator id="https://orcid.org/0000-0003-4312-3839 https://plus.cobiss.net/cobiss/sr/sr/conor/29219175">Pljasković, Aldina</dc:creator>
  <dc:creator>Pavlović, Aleksandra</dc:creator>
</oai_dc:dc>
