Path Optimization Techniques for Trusted Routing in Mobile Ad-Hoc Networks: An Interplay Between Ordered Semirings

dc.contributor.advisorBaras, John
dc.contributor.authorSomasundaram, Kiran
dc.contributor.authorBaras, John
dc.date.accessioned2010-01-12T23:21:33Z
dc.date.available2010-01-12T23:21:33Z
dc.date.issued2008
dc.description.abstractIn this paper, we formulate the problem of trusted routing as a transaction of services over a complex networked environment. We present definitions from service-oriented environments which unambiguously capture the difference between trust and reputation relations. We show that the trustworthiness measures associated with these relations have a linear order embedded in them. Identifying this order structure permits us to treat the trusted routing problem as a bi-objective path optimization problem. Further, we present polynomial time solutions to obtain the optimal routing paths in various biobjective settings. In developing these algorithms, we identify an interesting semiring decomposition principle that yields a distributed solutionen_US
dc.identifier.urihttp://hdl.handle.net/1903/9785
dc.language.isoen_USen_US
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-2;
dc.subjectPareto Optimalityen_US
dc.subjectLexicographic Optimalityen_US
dc.subjectMax- Order Optimalityen_US
dc.subjectSemiringsen_US
dc.titlePath Optimization Techniques for Trusted Routing in Mobile Ad-Hoc Networks: An Interplay Between Ordered Semiringsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Trusted Single Path Routing Combined.pdf
Size:
527.8 KB
Format:
Adobe Portable Document Format
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: