By Topic

Distributed topology control for Stable Path routing in multi-hop wireless networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kiran K. Somasundaram ; Institute for Systems Research and the Department of Electrical and Computer Engineering, University of Maryland, USA ; John S. Baras ; Kaustubh Jain ; Vahid Tabatabaee

In this paper, we introduce the stable path topology control problem for link-state routing in mobile multi-hop networks. We formulate the topology control problem of selective link-state broadcast as a graph pruning problem with restricted local neighborhood information. We develop a multi-agent optimization framework where the decision policies of each agent are restricted to local policies on incident edges and independent of the policies of other agents. We show that under a condition called the positivity condition, these independent local policies preserve the stable routing paths globally. We then provide an efficient algorithm, which we call the Stable Path Topology Control algorithm, to compute this local policy that yields a pruned graph. Using simulations, we demonstrate that this algorithm, when used with the popular ETX metric, outperforms topology control mechanisms commonly used for Mobile Ad Hoc Networks.

Published in:

49th IEEE Conference on Decision and Control (CDC)

Date of Conference:

15-17 Dec. 2010