By Topic

Optimal path planning for mobile backbone 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

2 Author(s)
Anand Srinivas ; Massachusetts Institute of Technology, Cambridge, 02139, USA ; Eytan Modiano

Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backbone Nodes (MBNs), whose primary role is to provide a mobile infrastructure in order to facilitate reliable end-to-end communication between nodes in the Network. In this paper, we consider the problem of optimally placing the MBNs over a finite time horizon. Specifically, we consider the path planning of a single MBN and aim to maximize the time-average system throughput. We present a discrete problem formulation, and develop an optimal solution for the single step velocity-constrained MBN placement problem. Using this as a sub-routine, we provide a greedy heuristic algorithm for the overall path planning problem. Next, we develop a dynamic programming based approximation algorithm for the problem. Finally, we compare the developed approaches via simulation.

Published in:

Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on

Date of Conference:

19-21 March 2008