• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Aukcijski agregacioni algoritmi za izbor izvršioca u bežičnim muti-hop mrežama elektronskih senzora i aktuatora / Auction Agregation Algorithms for Task Assignment in Wireless MultihopElectronic Sensor and Actuator Networks

Mezei Ivan 12 July 2012 (has links)
<p>Polazeći od prostog aukcijskog algoritma (SAP) za izbor izvršioca u<br />bežičnim senzorskim i aktuatorskim mrežama u ovoj disertaciji su<br />uvedena dva poboljšanja tog algoritma (multi-hop komunikacija i<br />lokalizacija). Predloženo je i pet novih aukcijskih agregacionih<br />algoritama koji koriste tehniku agregacije da bi smanjili<br />komunikacione troškove. Treća grupa doprinosa ove disertacije se<br />odnosi na primenu aukcija za poboljšanje postojećeg iMesh algoritma<br />za pronalaženje izvršioca. Eksperimentalni rezultati pokazuju<br />svojstva algoritama i njihove prednosti u odnosu na postojeće.</p> / <p>Two improvements of the simple auction protocol (SAP) for the task<br />assignment in wireless sensor and actuator networks is proposed in this<br />dissertation (multi-hop communications and localization). Five new auction<br />aggregation algorithms for the task assignment are proposed with the goal to<br />minimize the communication costs. One of the auction aggregation algorithms<br />is also used to improve existing iMesh service discovery algorithm.<br />Experimental results show the characteristics of the proposed algorithms and<br />advantages over the existing ones.</p>

Page generated in 0.0307 seconds