Distributed Topology Control for Stable Path Routing in Mobile Ad Hoc Networks

dc.contributor.authorSomasundaram, Kiran K.
dc.contributor.authorJain, Kaustubh
dc.contributor.authorTabatabaee, Vahid
dc.contributor.authorBaras, John S.
dc.date.accessioned2009-12-10T19:03:42Z
dc.date.available2009-12-10T19:03:42Z
dc.date.issued2009-12-09
dc.description.abstractIn this paper, we introduce the stable path topology control problem for routing in Mobile Ad Hoc Networks (MANETs). We formulate the problem as a constrained multiagent optimization problem with only local neighborhood information. We develop and prove local pruning strategies that solve this problem. We also introduce the notion of distorted pruning, which offers a systematic method to trade path stability off against the hop count metric. Finally, we quantify the performance of our pruning algorithms using several simulation scenarios.en_US
dc.identifier.urihttp://hdl.handle.net/1903/9778
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_2009-20;
dc.subjectlong lived pathsen_US
dc.subjectlexicographic optimalityen_US
dc.subjectdistributed pruningen_US
dc.titleDistributed Topology Control for Stable Path Routing in Mobile Ad Hoc Networksen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
tc_stable_paths_edited.pdf
Size:
473.99 KB
Format:
Adobe Portable Document Format