By Topic

Optimization of mobile backbone networks: Improved algorithms and approximation

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
$31 $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

3 Author(s)
Craparo, E.M. ; Dept. of Aeronaut. & Astronaut., Massachusetts Inst. of Technol., Boston, MA ; How, J.P. ; Modiano, E.

This paper presents new algorithms for throughput optimization in mobile backbone networks. This hierarchical sensing approach combines mobile backbone nodes, which have superior mobility and communication capability, with regular nodes, which are constrained in mobility and communication capability but which can sense the environment. An important quantity of interest in mobile backbone networks is the number of regular nodes that can be successfully assigned to mobile backbone nodes at a given throughput level. This paper develops a novel technique for optimizing this quantity using mixed-integer linear programming (MILP). The MILP- based algorithm provides a significant reduction in computation time compared to existing methods and is computationally tractable for problems of moderate size. An approximation algorithm is also developed that is appropriate for large- scale problems. This approximation algorithm has a theoretical performance guarantee and is demonstrated to perform well in practice.

Published in:

American Control Conference, 2008

Date of Conference:

11-13 June 2008