Logo des Repositoriums
 

Forking Agents in Sensor Networks

dc.contributor.authorHaenselmann, Thomas
dc.contributor.authorEffelsberg, Wolfgang
dc.contributor.editorCremers, Armin B.
dc.contributor.editorManthey, Rainer
dc.contributor.editorMartini, Peter
dc.contributor.editorSteinhage, Volker
dc.date.accessioned2019-10-11T07:58:06Z
dc.date.available2019-10-11T07:58:06Z
dc.date.issued2005
dc.description.abstractInformation about local events are to be distributed by agents in a sensor network. The agents are sent out traveling hop-by-hop into random directions, leaving a path of information behind them in the nodes visited. An arbitrary node requesting for information also emits an agent traveling into a random direction. Though only a fraction of all nodes will contain the requested information the high probability of a requesting agent intersecting the path of an informing colleague is exploited to find the information. A major problem of this approach called Rumor Routing is that it produces a highly non-uniform distribution of information. We have tackled this problem by introducing Forking Agents.en
dc.identifier.isbn3-88579-397-0
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/28225
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofInformatik 2005 – Informatik Live! Band 2
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-68
dc.titleForking Agents in Sensor Networksen
dc.typeText/Conference Paper
gi.citation.endPage333
gi.citation.publisherPlaceBonn
gi.citation.startPage328
gi.conference.date19. bis 22. September 2005
gi.conference.locationBonn
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
GI-Proceedings.68-68.pdf
Größe:
242.38 KB
Format:
Adobe Portable Document Format