Local Pruning for Information Dissemination in Dynamic Networks for Solving the Idempotent Semiring Algebraic Path Problem

Simple item page
dc.contributor.advisorBaras, John
dc.contributor.authorSomasundaram, Kiran
dc.date.accessioned2010-05-18T19:39:36Z
dc.date.available2010-05-18T19:39:36Z
dc.date.issued2010-05-15
dc.description.abstractWe present a method, inspired from routing in dynamic data networks, to solve the Semiring Algebraic Path Problem (SAPP) for dynamic graphs. The method can be used in dynamic networks such as Mobile Ad Hoc Networks, where the network link states are highly dynamic. The algorithm makes use of broadcasting as primary mechanism to recompute the SAPP solution. The solution suffers from broadcast storm problems, and we propose a selective broadcasting mechanism that reduces the broadcast storm. We call this method local pruning and prove its correctness.en_US
dc.identifier.urihttp://hdl.handle.net/1903/10078
dc.relation.isAvailableAtInstitute for Systems Researchen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.relation.ispartofseriesTR_2010-12;
dc.titleLocal Pruning for Information Dissemination in Dynamic Networks for Solving the Idempotent Semiring Algebraic Path Problemen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LocalSemiringPruning_edited.pdf
Size:
582.51 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.81 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Institute for Systems Research Technical Reports